Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets

Authors:
Michael Q. Rieck;Sukesh Pai;Subhankar Dhar
Affiliations:
Drake University, Des Moines, IA;Microsoft Corporation, Mountain View, CA;Management Information Systems, San Jośe State University, San Jośe, CA
Venue:
Computer Networks and ISDN Systems
Year:
2005

Citing 7
Cited 3

Hierarchically-organized, multihop mobile wireless networks for quality-of-service support

Mobile Networks and Applications - Special issue: mobile multimedia communications
Ad hoc networking: an introduction

Ad hoc networking
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
Approximation Algorithms for Connected Dominating Sets

Algorithmica
CEDAR: a core-extraction distributed ad hoc routing algorithm

IEEE Journal on Selected Areas in Communications

Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas

IEEE Transactions on Parallel and Distributed Systems
Hierarchical routing in ad hoc networks using k-dominating sets

ACM SIGMOBILE Mobile Computing and Communications Review
Constructing special k-dominating sets using variations on the greedy algorithm

Pervasive and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.