• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.651-669
• /
• 2013

In this paper, we study a novel routing algorithm based on load balancing for multi-channel wireless mesh networks. In order to increase the network capacity and reduce the interference of transmission streams and the communication delay, on the basis of weighted cumulative expected transmission time (WCETT) routing metric this paper proposes an improved routing metric based on load balancing and channel interference (LBI_WCETT), which considers the channel interference, channel diversity, link load and the latency brought by channel switching. Meanwhile, in order to utilize the multi-channel strategy efficiently in wireless mesh networks, a new channel allocation algorithm is proposed. This channel allocation algorithm utilizes the conflict graph model and considers the initial link load estimation and the potential interference of the link to assign a channel for each link in the wireless mesh network. It also utilizes the channel utilization percentage of the virtual link in its interference range as the channel selection standard. Simulation results show that the LBI_WCETT routing metric can help increase the network capacity effectively, reduce the average end to end delay, and improve the network performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.418-420
• /
• 2013

Issues on design of routing scheme and routing metric for multicast in multi-channel multi-radio (MCMR) wireless mesh networks (WMNs) are discussed. Emphasis is placed on channel-diversity oriented routing metrics. From case study the conclusion to be drawn is that the key for design of channel-diversity oriented routing metrics is how to construct an optimization function to quantify interdependence between channel assignment and multicast routing throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2362-2378
• /
• 2017

To mitigate the performance degradation caused by performance anomaly, a number of channel assignment algorithms have been proposed for multi-rate wireless mesh networks. However, network conditions have not been fully considered for routing process in these algorithms. In this paper, a joint scheme called Multi-rate Dijkstra's Shortest path - Rate Separated (MDSRS) is proposed, combining routing metrics and channel assignment algorithm. In MDSRS, the routing metric are determined through the synthesized deliberations of link costs and rate matches; then the rate separated channel assignment is operated based on the determined routing metric. In this way, the competitions between high and low rate links are avoided, and performance anomaly problem is settled, and the network capacity is efficiently improved. Theoretical analysis and NS-3 simulation results indicate that, the proposed MDSRS can significantly improve the network throughput, and decrease the average end-to-end delay as well as packet loss probability. Performance improvements could be achieved even in the heavy load network conditions.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.824-832
• /
• 2009

Multi-radio multi-channel Wireless Mesh Network requires an effective management policy to control the assignment of channels to each radio. We concentrated our investigation on modeling method and solution to find a dynamic channel assignment scheme that is adapted to change of network traffic. Multi-path routing scheme was chosen to overwhelm the unreliability of wireless link. For a particular traffic state, our optimization model found a specific traffic distribution over multi-path and a channel assignment scheme that maximizes the overall network throughput. We developed a simple heuristic method for channel assignment by gradually removing clique load to obtain higher throughput. We also presented numerical examples and discussion of our models in comparison with existing research.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.35-41
• /
• 2017

To solve the shortage of radio spectrum and utilize spectrum resource more efficiently, cognitive radio technologies are proposed, and many studies on cognitive radio have been conducted. Multi-hop routing is one of the important technologies to enable the nodes to transmit data further with lower power in ad-hoc cognitive radio networks. In a multi-channel cognitive radio networks, each channel should be allocated to minimize interference to primary users. In the multi-hop routing, channel allocation should consider the inter-channel interference to maximize network throughput. In this paper, we propose multi-channel scheduling scheme which minimizes inter-channel interferences and avoids collision with primary users for the multi-hop multi-channel cognitive radio networks. The proposed scheduling is designed to determine both of routing path and channel selection. The performance of proposed channel allocation scheme is evaluated by the computer simulation in the aspect of capacity and collision rate.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5149-5173
• /
• 2016

Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless network. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it requires to jointly address multiple issues. These include radio-channel assignment, routing metric computation, candidate relay set selection, candidate relay prioritization, data broadcasting over multi-radio multi-channel, and best relay selection using a coordination scheme. In this paper, we propose a simple and efficient cluster-based cooperative data forwarding (CCDF) which jointly addresses all these issues. We study the performance impact when the same candidate relay set is being used for multiple cross traffic flows in the network. The network simulation shows that the CCDF with MRMC not only retains the advantage of receiver diversity in cooperative forwarding but also minimizes the interference, which therefore further enhances the system throughput for the network with multiple cross traffic flows.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.110-118
• /
• 2007

In multi-hop wireless network, multi-channel makes it possible to enhance network performance because it reduces channel interferences md contentions. Recently several schemes have been proposed in the literatures to use multi-channel. Especially, MCR(Multi channel routing protocol), which utilize hybrid interface assignment, is a prominent routing protocol. MCR uses simple way to change channel but efficiently reduce channel interferences. In this paper, we propose a load-aware channel selection algorithm called LCS that enhances the channel switching algerian used in MCR protocol. In LCS, channel of a node is assigned based on collected information about queue length of neighbors. Moreover this paper evaluates the performance of in by using simulation test and testbed demonstration. Test results show that the MCR with LCS outperforms the naive MCR.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.374-385
• /
• 2010

Wireless mesh networks can be deployed for various networks from home networking to last-mile broadband Internet access. Wireless mesh networks are composed of mesh routers and mesh clients. In these networks, static nodes form a multi-hop backbone of a large wireless access network that provides connectivity to end-users' mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. In order to increase connectivity and better performance, researchers are getting interested in multi-channel and multi-interface wireless mesh networks. In these networks, non-overlapping multiple frequency channels are used simultaneously to increase the aggregate bandwidth available to end-users. Recently, researches have focused on finding suitable channel assignments for wireless network interfaces, equiped in a mesh node, together with efficient routing to improve overall system throughput in wireless mesh networks. This goal can be achieved by minimize channel interference. Less interference among using channels in a network guarantees more aggregated channel capacity and better connectivity of the networks. In this thesis, we propose interference aware channel assignment and routing algorithms for multi-channel multi-hop wireless mesh networks. We propose Channel Assignment and Routing algorithms using Traffic Profiles(CARTP) and Routing algorithms allowing detour routing(CARTP+2). Finally, we evaluate the performance of proposed algorithms in comparison to results from previous methods using ns-2 simulations. The simulation results show that our proposed algorithms can enhance the overall network performance in wireless mesh networks.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.105-108
• /
• 2012

Wireless mesh networks are considered a promising solution to last mile broadband. The unique characteristics of WMN impose unique requirements on designing routing protocols and metrics for WMN. However, existing routing schemes that are designed for single-channel multi-hop wireless networks may lead to inefficient routing paths in multichannel. This paper focuses on the routing problem for multi-radio multichannel WMNs. We list the challenges in designing routing algorithms for multi-radio multichannel WMNs. Then we examine the requirements and considerations for designing routing metrics according to the characteristics of multi-radio multichannel WMNs. Finally we survey and investigate the existing routing metrics in terms of their ability to satisfy these requirements.