On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Cooperative Control: Models, Applications, and Algorithms
Cooperative Control: Models, Applications, and Algorithms
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Proceedings of the 10th annual international conference on Mobile computing and networking
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
Journal of Global Optimization
Analysis of greedy approximations with nonsubmodular potential functions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
IEEE Transactions on Mobile Computing
A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
The capacity of wireless networks
IEEE Transactions on Information Theory
Studying the stochastic capturing of moving intruders by mobile sensors
Computers & Mathematics with Applications
Error analysis of range-based localisation algorithms in wireless sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
Multi-hop wireless networks have no fixed physical backbone infrastructure, so Connected Dominating Set (CDS) is frequently selected as virtual backbone to improve network efficiency. Interference is a big problem which prevents wireless networks from reaching efficiency; however, previous works construct CDS as virtual backbone without consideration of interference. In this paper, we consider the problem of how to construct Minimum Interference Connected Dominating Set (MICDS) in multi-channel multi-radio multi-hop wireless networks. Multi-channel communication helps to reduce interference and improve network performance. A two-phase algorithm named MIS-colouring is presented for MICDS problem, and theoretical analysis is also given. However, due to the characteristics of the problem itself, it is quite difficult to compute the approximation ratio for MIS-colouring. Simulation results show that through proper CDS structure selection and channel assignment, MIS-colouring algorithm can minimise the total interference of CDS as a virtual backbone for multi-channel multi-radio multi-hop wireless networks.