• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.365-378
• /
• 2013

In Wireless Mesh Networks (WMNs), we usually deploy multiple Internet Gateways (IGWs) to improve the capacity of WMNs. As most of the traffic is oriented towards the Internet and may not be distributed evenly among different IGWs, some IGWs may suffer from bottleneck problem. To solve the IGW bottleneck problem, we propose an efficient scheme to balance the load among different IGWs within a WMN. Our proposed load-balancing scheme consists of two parts: a traffic load calculation module and a traffic load migration algorithm. The IGW can judge whether the congestion has occurred or will occur by using a linear smoothing forecasting method. When the IGW detects that the congestion has occurred or will occur, it will firstly select another available IGW that has the lightest traffic load as the secondary IGW and then inform some mesh routers (MPs) which have been selected by using the Knapsack Algorithm to change to the secondary IGW. The MPs can return to their primary IGW by using a regression algorithm. Our Qualnet 5.0 experiment results show that our proposed scheme gives up to 18% end-to-end delay improvement compared with the existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.269-286
• /
• 2011

In this paper, we study a problem that is concerning how to construct a delay-constrained multicast tree on a wireless mesh network (WMN) such that the number of serviced clients is maximized. In order to support high-quality and concurrent interference-free transmission streams, multiple radios are implemented in each mesh node in the WMNs. Instead of only orthogonal channels used for the multicast in the previous works, both orthogonal and partially overlapping channels are considered in this study. As a result, the number of links successfully allocated channels can be expected to be much larger than that of the approaches in which only orthogonal channels are considered. The number of serviced subscribers is then increased dramatically. Hence, the goal of this study is to find interference-free and delay-constrained multicast trees that can lead to the maximal number of serviced subscribers. This problem is referred as the MRDCM problem. Two heuristics, load-based greedy algorithm and load-based MCM algorithm, are developed for constructing multicast trees. Furthermore, two load-based channel assignment procedures are provided to allocate interference-free channels to the multicast trees. A set of experiments is designed to do performance, delay and efficiency comparisons for the multicast trees generated by all the approximation algorithms proposed in this study.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1044-1047
• /
• 2013

Wireless Mesh Network (WMN) provides effective Internet Service accesses to users by utilizing multi-rate and multi-channel. In multi-rate networks, the Rate Anomaly (RA) problem occurs, the problem that low-rate link degrades the performance of high-rate link. In this paper we propose Rate Gap Minimum Channel Assignment (RGM-CA) protocol that select the minimal rate gap parent node and assign the channel in order to mitigates the rate anomaly problem. RDM-CA protocol is efficient because it consider rate anomaly, channel diversity and node connectivity.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.462-465
• /
• 2012

This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.1-6
• /
• 2007

In wireless mesh networks (WMNs), the end-to-end throughput of a flow decreases drastically according to the traversed number of hops due to interference among different hops of the same flow in addition to interference between hops of different flows with different paths. This paper proposes a distributed multi-channel assignment scheme based on hops (DMASH) to improve the performance of a static WMN. The proposed DMASH is a novel distributed multi-channel assignment scheme based on hops to enhance the end-to-end throughput by reducing interference between channels when transmitting packets in the IEEE 802.11 based multi-interface environments. The DMASH assigns a channel group to each hop, which has no interference between adjacent hops from a gateway in channel assignment phase, then each node selects its channel randomly among the channel group. Since the DMASH is a distributed scheme with unmanaged and auto-configuration of channel assignment, it has a less overhead and implementation complexity in algorithm than centralized multi-channel assignment schemes. Simulation results using the NS-2 showed that the DMASH could improve remarkably the total network throughput in multi-hop environments, comparing with a random channel assignment scheme.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.103-109
• /
• 2010

Total performance is improved by minimizing the channel interference between links in wireless mesh networks (WMNs). The paper refines on the CB-CA [1] to be suitable for multi-radio multi-channel (MRMC) WMNs. The CB-CA is the cluster-based channel assignment algorithm for one radio three channel WMN based on IEEE 802.11b/g. The CB-CA does not perform the channel scanning and the channel switching between the cluster heads (CHs) and the edge gateway nodes (EGs). However, the use of co-channel for links between CHs and EGs brings the problem of channel interference among many nodes. We propose and evaluate an improved CB-CA algorithm to solve this problem in MRMC WMNs. The proposed algorithm discriminates between transmission channel and receive channel and assigns channels to each interface randomly and advertises this information to neighbor clusters in order to be assigned no-interference channel between clusters. Therefore, the proposed algorithm can minimize the interference between clusters and also improve QoS, since it can use multiple interfaces and multiple channels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.608-627
• /
• 2016

Wireless mesh networks (WMNs) based on IEEE 802.11s have emerged as one of the prominent technologies in multi-hop communications. However, the deployment of WMNs suffers from serious interference problem which severely limits the system capacity. Using multiple radios for each mesh router over multiple channels, the interference can be reduced and improve system capacity. Nevertheless, interference cannot be completely eliminated due to the limited number of available channels. An effective approach to mitigate interference is to apply dynamic channel switching (DCS) in WMNs. Conventional DCS schemes trigger channel switching if interference is detected or exceeds a predefined threshold which might cause unnecessary channel switching and long protocol overheads. In this paper, a P-learning based dynamic switching algorithm known as learning automaton (LA)-based DCS algorithm is proposed. Initially, an optimal channel for communicating node pairs is determined through the learning process. Then, a novel switching metric is introduced in our LA-based DCS algorithm to avoid unnecessary initialization of channel switching. Hence, the proposed LA-based DCS algorithm enables each pair of communicating mesh nodes to communicate over the least loaded channels and consequently improve network performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5B
• /
• pp.385-394
• /
• 2012

The tactical mobile communication network, which comprises a part of the next-generation Tactical Information and Communication Network (TICN), provides means of communication and control for Tactical Multi-Functional Terminals (TMFT) belonging to a Mobile Subscriber Access Point (MSAP). The next-generation of MSAP is capable of constructing a backbone network via LCTR and HCTR directional antennas. At the same time, WMN modules are used to create and manage a wireless mesh backbone. When directional antennas are used in mobile environments, seamless services cannot be efficiently supported as the movement of the node prevents the angle of the antenna to constantly match. Therefore, data communication through the wireless mesh networks is required to provide direct communication between mobile MSAPs. Accordingly, mutual authentication and data encryption mechanisms are required to provide reliable data transmission in this environment. To provide efficient mutual authentication between MSAP devices, the process of verifying a certificate of the other MSAP device through its own authentication server is required. This paper proposes mutual authentication mechanisms where the MSAP requiring authentication and the MSAP that permits it initiates low-cost and efficient authentication in a distributed way. More specifically, we propose a method of applying EAP-ELS (Extensible Authentication Protocol-Transport Layer Security) in the next-generation TICN.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.85-94
• /
• 2015

In this paper, an enhanced QoS multicast routing scheduling scheme is proposed to adapt to a dynamic mobile traffic condition for wireless mesh networks (WMNs). It handles the network QoS by controlling the delay constraints for multimedia applications. The group size will be controlled according to both the current network state and QoS requirements. The dynamic reconstruction of QoS multicast tree can be obtained from preprocessing with both the partial multicast routing scheme and the traffic estimation. Performance evaluation of the proposed scheme is carried out on randomly generated graph derived from the wireless mesh network, by choosing the optimal value related to the appropriate delay bounds. Simulation results show that the proposed scheme can improve the performance of QoS multicast routing for WMNs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.1
• /
• pp.77-88
• /
• 2010

Wireless Mesh Networks are consist of mobility mesh clients and mesh routers. WMNs can communicate with heterogeneous networks such as IEEE 802.11, IEEE 802.15, IEEE 802.16 and sensor networks. WMNs which is based on ad hoc network are on research and developing to enhance WLANs, WPANs, or WMANs. WMNs can offer environment to serve human, service to person area, campus, and metro. But WMNs has many problems to solve about enhancing performance and generalization. Among them, Existing protocol layers has many problems enhancing to optimize WMNs. This document issues problems about WMNs in protocol layer and suggest the solutions. Also, suggests the requirements and the methods of QoS supporting issue.