Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
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)
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Ad Hoc Networking
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
Efficient multi-hop broadcasting in wireless networks using k-shortest path pruning
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
A new pruning method for efficient broadcasting in ad hoc networks
International Journal of Mobile Network Design and Innovation
Hierarchical routing in sensor networks using k-dominating sets
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
A constant-factor approximation for d-hop connected dominating sets in unit disk graph
International Journal of Sensor Networks
Hi-index | 0.00 |
This paper describes a distributed algorithm (generalized d-CDS) for producing a variety of d-dominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary d-CDS), these sets are also d-hop connected and has a desirable ''shortest path property''. Routing via the backbone created is also discussed. The algorithm has a ''constant time'' complexity in the limited sense that it is unaffected by expanding the size of the network as long as the maximal node degree is not allowed to increase too. The performances of this algorithm for various parameters are compared, and also compared with other algorithms.