A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Multicluster, mobile, multimedia radio network
Wireless Networks
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Proceedings of the 7th annual international conference on Mobile computing and networking
A new approach to channel access scheduling for Ad Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Transmission scheduling in ad hoc networks with directional antennas
Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Load-Balancing Clusters in Wireless Ad Hoc Networks
ASSET '00 Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00)
Energy-aware topology control for wireless sensor networks using memetic algorithms
Computer Communications
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
International Journal of Interdisciplinary Telecommunications and Networking
Efficient topology control scheme for wireless ad-hoc networks
International Journal of Computational Intelligence Studies
Hi-index | 0.00 |
The efficiency of a communication network depends not only on its control protocols, but also on the underlying network topology. We propose a distributed topology management algorithm that constructs and maintains a backbone topology based on a minimal dominating set (MDS) of the network. According to this algorithm, each node determines the membership in the MDS for itself and its one-hop neighbors based on two-hop neighbor information that is disseminated among neighboring nodes. The algorithm then ensures that the members of the MDS are connected into a connected dominating set (CDS), which can be used to form the backbone infrastructure of the communication network for such purposes as routing. The correctness of the algorithm is proven, and the efficiency is compared with other topology management heuristics using simulations. Our algorithm shows better behavior and higher stability in ad hoc networks than prior algorithms.