Abstract
Ad hoc wireless network is featured by a dynamic topology. There is no fixed infrastructure as compared with wired network. Every host can move to any direction at any speed. This characteristic puts special challenges in routing protocol design. Most existing well-known routing protocols use flooding for route construction. But, flooding suffers from the notorious broadcast storm problem which causes excessive redundancy, contention and collision in the network. One solution to overcome this problem is to compute a virtual backbone based on the physical topology, and run any existing routing protocol over the virtual backbone. In our study, the virtual backbone is approximated by a minimum connected dominating set (MCDS). We propose a distributed algorithm which computes a small CDS. The performance of our algorithm is witnessed by simulation results and theoretical analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Reference
K.M. Alzoubi, P.-J. Wan and O. Frieder, “Message-efficient distributed algorithms for connected dominating set in wireless ad hoc networks”, manuscript, 2001.
A.D. Amis and R. Prakash, “Load-balancing clusters in wireless ad hoc networks”, Proc. of Conf. on Application-Specific Systems and Software Engineering Technology (ASSET 2000), Richardson, Texas, pp. 25–32,
H. Attiya and J. Welch, Distributed computing: fundamentals, simulations and advanced topics, McGraw-Hill Publishing Company, 1998.
B. Awerbuch, “Optimal distributed algorithm for minimum weight spanning tree, counting, leader election and related problems”, Proceedings of the 19th ACM Symposium on Theory of Computing, ACM, pp. 230–240, 1987.
V. Bharghavan and B. Das, “Routing in ad hoc networks using minimum connected dominating sets”, Proc. ICC 1997, Montreal, Canada, June 1997.
I. Cidon and O. Mokryn, “Propagation and leader election in multihop broadcast environment”, 12th International Symposium on Distributed Computing (DISC98), Greece, pp. 104–119, September 1998.
B. N. Clark, C. J. Colbourn and D. S. Johnson, “Unit disk graphs”, Discrete Mathematics, 86: 165–177, 1990.
B. Das and V. Bharghavan, “Routing in ad-hoc networks using minimum connected dominating sets”, Proc. ICC 1997, 1: 376–380, 1997.
S. Guha and S. Khuller, “Approximation algorithms for connected dominating sets”, Algorithmica, 20: 374–387, April 1998.
M. Joa-Ng and I.-T. Lu, “A Peer-to-Peer zone-based two-level link state routing for mobile Ad Hoc Networks”, IEEE Journal on Selected Areas in Communications, 17: 1415–1425, 1999.
P. Johansson, T. Larsson, N. Hedman, B. Mielczarek and M. Degermark, “Scenario-based performance analysis of routing protocols for mobile ad hoc networks”, Proc. IEEE MOBICOM, Seattle, pp. 195–206, Aug. 1999.
D.B. Johnson, D. A. Maltz, Y.-C. Hu and J. G. Jetcheva, “The dynamic source routing protocol for mobile ad hoc networks”, Internet Draft http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-07.txt, March 2001.
S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen and J.-P. Sheu, “The broadcast storm problem in a mobile ad hoc network”, Proc. MOBICOM, Seattle, pp. 151–162, Aug. 1999.
G. Pei, M. Gerla and T.-W. Chen, “Fisheye state routing: a routing scheme for ad hoc wireless networks”, ICC 2000, 1: 70–74, 2000.
C. E. Perkins, E. M. Royer and S. R. Das, “Ad hoc On-demand Distance Vector (AODV) Routing”, Internet Draft http://www.ietf.org/internet-drafts/draft-ietf-manet-aodv-08.txt, March 2001.
P. Sinha, R. Sivakumar and V. Bharghavan, “Enhancing ad hoc routing with dynamic virtual infrastructures”, Proc. INFOCOM 2001, 3: 1763–1772, 2001.
J. Wu and H. Li, “On calculating connected dominating set for efficient routing in ad hoc wireless networks”, Proc. 3rd International Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications, Seattle, WA USA, pp.7–14, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Butenko, S., Cheng, X., Du, DZ., Pardalos, P.M. (2003). On the Construction of Virtual Backbone for Ad Hoc Wireless Network. In: Butenko, S., Murphey, R., Pardalos, P.M. (eds) Cooperative Control: Models, Applications and Algorithms. Cooperative Systems, vol 1. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3758-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3758-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5241-7
Online ISBN: 978-1-4757-3758-5
eBook Packages: Springer Book Archive