• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.9
• /
• pp.34-41
• /
• 2017

Wireless mesh networks contain multi-hop routing protocols between wireless nodes and are connected to the Internet through a gateway. These networks perform a role as a backbone and are scalable for main applications. We propose the design of QoS supporting mechanisms for wireless mesh networks using software defined networking. Our proposed scheme is cost-effective and features adaptive QoS mechanisms for wireless router's resource constraints. The QoS mechanisms use software defined networking technology with Openflow protocol based on diffserv and intserv models with MPLS mechanism and RSVP respectively. A performance evaluation model is suggested to verify the validity of the proposed scheme using several QoSmetrics of the wireless mesh networks.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.3
• /
• pp.160-167
• /
• 2013

Resource allocation based on quantized feedback plays a critical role in wireless mesh networks with a time division multiple access (TDMA) physical layer. In this study, a resource allocation problem was formulated based on quantized feedback for TDMA wireless mesh networks that minimize the total transmission power. Three steps were taken to solve the optimization problem. In the first step, the codebook of the power, rate and equivalent channel quantization threshold was designed. In the second step, the timeslot allocation criterion was deduced using the primal-dual method. In the third step, a resource allocation scheme was developed based on quantized feedback using the stochastic optimization tool. The simulation results show that the proposed scheme not only reduces the total transmission power, but also has the advantage of quantized feedback.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.101-107
• /
• 2009

In existing wireless ad-hoc networks, how to distribute network resources fairly between many users to optimize data transmission is an important research subject. However, in wireless mesh networks (WMNs), it is one of the research areas to avoid gateway bottleneck more than the fair network resource sharing. It is because WMN traffic are concentrated on the gateway connected to backhaul. To solve this problem, the paper proposes Weighted Fairness Time-sharing Access (WFTA). The proposed WFTA is a priority time scheduling scheme based on Weighted Fair Queuing (WFQ).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1679-1686
• /
• 2007

Clustering is a topology control approach often used in wireless ad hoc networks to improve scalability and prolong network lifetime. Furthermore, it is also employed to provide semi-management functionalities and capacity enhancement. The usage of clustering topology control technique can also be applied to multi-radio wireless mesh network. This would utilize the advantages of the multi-radio implementation in the network. The aggregation would result to a more stable, connected, scalable and energy-efficient network. On this paper, we design a clustering algorithm for multi-radio wireless mesh network that would use these advantages and would take into consideration both mobility and heterogeneity of the network entities. We also show that the algorithm terminates at a definite time t and the message control overhead complexity is of constant order of O(1) per node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.795-801
• /
• 2008

Wireless Mesh Networks (WMNs) are popular due to their low cost and rapid deployment. Currently, many WMN researchers often considers the use of ad-hoc routing protocols because WMNs are similar to the ad-hoc networks. Some of currently deployed WMNs consider to use on-demand routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). But, AODV are not appropriate for Wireless Mesh Networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose a directional AODV (D-AODV) routing protocol based on hop count to a gateway. We implement the D-AODV routing protocol and evaluate the performance of the D-AODV on the testbed. The measurement results show that the D-AODV can enhance the network throughput by reducing the routing overhead.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.30-45
• /
• 2014

Recently, multimedia application users who demand for ubiquitous computing environment are rapidly increasing, and wireless mesh network is receiving attention as a cost-effective key technology for next generation wireless networking. When multiple flows are transmitting data at the same time in the network, routing for path selection of each flow and link resource allocation for data transmission of each flow are one of the key factors that influence to the effectiveness of the network directly. In this paper, we consider problems for path discovery and resource allocation of links at the same time and we propose an algorithm based on mathematical modeling using a technique for cross-layer optimization design in STDMA-based wireless mesh networks that can enhance transfer performance for each flow. We show by performance analysis that the proposed algorithm can enhance the throughput performance by maximally utilizing given bandwidth resources when the number of flows increase in multi-hop wireless mesh networks.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.49-58
• /
• 2010

The wireless sensor network technology becomes one of core technologies to make it possible to implement various e-business applications. Energy efficiency is an important issue in wireless sensor networks. IEEE 802.15.4, a representative international standard for wireless sensor networks, provides the beacon enabled mode for energy-efficient communication. However, the beacons may conflict each other when the network is of multi-hop topology such as mesh or cluster-tree topology with beacon-enabled mode. The beacon conflict causes the failure of synchronization between sensor nodes, and affects other nodes in the network in that unsynchronized nodes cannot participate in communication. In this paper, we suggest an energy-efficient beacon scheduling for the wireless sensor networks. Nodes can save their energy duringperiod and prevent beacon conflict using beacon scheduling. We implement the scheduling using QualNet, and evaluate the performance under mesh topology networks. It turns out that the proposed scheduling may improve the energy efficiency in the networks.

• Journal of Convergence Society for SMB
• /
• v.2 no.1
• /
• pp.25-31
• /
• 2012

Recently Wireless Communication technologies are widely used in Small And Medium Business fields. Wireless mesh networks have been studied as the next generation technology to solve problem of conventional wireless networks. Wireless mesh network uses a 802.11 when make up of network. mesh clients occurs Hard handover moving between ones. This increases the handover latency of the network mobility is a very great issues. Consequently, this paper propose a channel information previously methods to reduce the handover latency selective channels. Proposed scheme accounts for more than 90% of the probe delay to minimize the client had to move the mesh based on the old channel to retrieve information. Through simulation, the proposed scheme had shorter handover delay time than transitional full scan and selective scan. Through results of evaluation, the suggest PCISS scheme more fast 6.5% than transitional scheme.

• ETRI Journal
• /
• v.32 no.5
• /
• pp.819-822
• /
• 2010

Supporting QoS over multihop wireless mesh networks is difficult because end-to-end delay increases quickly with the increasing number of hops. This paper introduces a novel multichannel time-division multiple-access media access control (McTMAC) protocol that can help to efficiently reduce delay over multihop networks. Performance evaluation results demonstrate that McTMAC outperforms existing alternative protocols. The max-delay can be reduced by as much as 60% by using McTMAC.