Abstract
A minimum connected dominating set is an efficient approach to form a virtual backbone for ad-hoc networks. We propose a tree based distributed time/message efficient approximation algorithm to compute a small connected dominating set without using geographic positions. The algorithm has O(n) time, O(n log n) message complexity, and has an approximation factor of eight. The algorithm is implemented using dominating set simulation program, which shows that our method gives smaller connected dominating set than the existing methods.
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.
References
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86, 165–177 (1990)
Gerla, M., Tsai, J.T.C.: Multicuster, mobile, multimedia radio network. ACM-Baltzer Journal of wireless networks 1, 255–265 (1995)
Chen, G., Stojmenovic, I.: Clustering and routing in mobile wireless networks. Technical report, University of Ottawa, Computer Science (1999)
Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1998)
Bharghavan, V., Das, B.: Routing in adhoc networks using minimum connected dominating sets. In: IEEE International Conference on Communications (ICC 1997), Montreal, Canada, vol. 1, pp. 376–380 (1997)
Wu, J., Li, H.: On calculating connected dominating sets for efficient routing in adhoc wireless networks. In: Proc. of the 3rd Int’l Workshop on discrete algorithms and methods for mobile computing and communications, pp. 7–14 (1999)
Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless adhoc networks. In: Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1597–1604 (2002)
Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 14–25 (2002)
Alzoubi, K.M., Wan, P.J., Frieder, O.: Distributed heuristics for connected dominating set in wireless adhoc networks. IEEE ComSoc / KICS Journal of communications and networks 4, 22–29 (2002)
Alzoubi, K.M., Wan, P.J., Frieder, O.: Message-optimal connected dominating sets in mobile adhoc networks. In: The Third ACM Int’l Symposium on mobile adhoc networking and computing, pp. 157–164 (2002)
Alzoubi, K.M., Wan, P.J., Frieder, O.: New distributed algorithm for connected dominating set in wireless adhoc networks. In: Proceedings of the 35th Annual Hawaii International Conference on System Sciences, pp. 3849–3855 (2002)
Dai, F., Wu, J.: An extended localised algorithm for connected dominating set formation in ad-hoc wireless networks. IEEE Transactions on Parallel and distributed systems 15 (2004)
Das, B., Sivakumar, R., Bharghavan, V.: Routing in adhoc network using a spine. In: Int’l Conference on computers and communications networks 1997, Las Vegas, NV, pp. 34–39 (1997)
Sivakumar, R., Das, B., Bharghaban, V.: An improved spine-based infrustructure for routing in adhoc networks. In: IEEE Symposium on Computers and Communications 1998, Athens, Greece (1998)
Cidon, I., Mokryn, O.: Propagation and leader election in multihop broadcast environment. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 104–119. Springer, Heidelberg (1998)
Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25, 59–68 (1995)
Dai, F.: Dominating set simulation program (2001), http://www.cse.fau.edu/~fdai/adhoc
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paul, B., Rao, S.V., Nandi, S. (2005). An Efficient Distributed Algorithm for Finding Virtual Backbones in Wireless Ad-Hoc Networks. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds) High Performance Computing – HiPC 2005. HiPC 2005. Lecture Notes in Computer Science, vol 3769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602569_33
Download citation
DOI: https://doi.org/10.1007/11602569_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30936-9
Online ISBN: 978-3-540-32427-0
eBook Packages: Computer ScienceComputer Science (R0)