Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Proceedings of the 10th annual international conference on Mobile computing and networking
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
Proceedings of the 11th annual international conference on Mobile computing and networking
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A channel assignment algorithm for multi-radio wireless mesh networks
Computer Communications
Gateway placement for throughput optimization in wireless mesh networks
Mobile Networks and Applications
Joint Throughput Optimization for Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Practical, distributed channel assignment and routing in dual-radio mesh networks
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Channel assignment in multi-radio wireless mesh networks: a graph-theoretic approach
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
A distributed channel assignment protocol for rate separation in wireless mesh networks
Computer Communications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
DMesh: Incorporating Practical Directional Antennas in Multichannel Wireless Mesh Networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Use of multiple orthogonal channels can significantly improve network throughput of multi-hop wireless mesh networks (WMNs). In these WMNs where multiple channels are available, channel assignment is done either in a centralized manner, which unfortunately shows a poor scalability with respect to the increase of network size, or in a distributed manner, where at least one channel has to be dedicated for exchanging necessary control messages or time synchronization has to be utilized for managing the duration of data packet transmission, causing excessive system overhead and waste of bandwidth resource. In this paper, we first formulate multi-channel assignment as a NP-hard optimization problem. Then a distributed, heuristic temporal-spatial multi-channel assignment and routing scheme is proposed, assuming every wireless node in the network is equipped with a single-radio interface. Here the gateway node is set to use all the channels sequentially in a round-robin fashion. This temporal scheme ensures all the nodes that need to directly communicate with the gateway node shall have a fair access to it. For those non-gateway nodes, a spatial scheme where channels are assigned based on their neighbors' channel usage is adopted to exploit parallel communications and avoid channel interference among nodes. Furthermore, since the routing factors, including channel usage of neighbor nodes, node hop count, node memory size, and node communication history, are all considered along with the channel assignment, network performance, measured by packet delivery latency, channel usage ratio, and memory usage ratio, tends to be considerably enhanced. The simulation results have confirmed that, compared with a couple of well-known multi-channel assignment schemes, such as LCM [21] and ROMA [15], the proposed scheme shows substantial improvement in network throughput with a very modest collision level. In addition, the proposed scheme is highly scalable as the algorithm complexity is only linearly dependent on the total number of channels that are available in the network and the number of neighbors that a network node directly connects to.