Abstract
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, called k-SPR sets. Such a set can serve as a virtual backbone to facilitate shortest path routing, as introduced in [4] and [14]. When employed in a hierarchical fashion, together with a hybrid (partly proactive, partly reactive) strategy, the k-SPR set methods become highly scalable, resulting in guaranteed minimal path routing, with comparatively little overhead.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks 38, 393–422 (2002)
Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. In: Proc. Mobicom, pp. 85–96 (2001)
Chen, Y.P., Liestman, A.L., Liu, J.: Clustering Algorithms for Ad Hoc Wireless Networks. In: Xiao, Y., Pan, Y. (eds.) Ad Hoc and Sensor Networks. Nova Science Publisher, Bombay (2004)
Dhar, S., Rieck, M.Q., Pai, S., Kim, E.J.: Distributed Routing Schemes for Ad Hoc Networks Using d-SPR Sets. Microprocessors and Microsystems, Special Issue on Resource Management in Wireless and Ad Hoc Mobile Networks 28(8), 427–437 (2004)
Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-effcient communication protocol for wireless microsensor networks. In: IEEE Proceedings of the Hawaii International Conference on System Sciences, January 2000, pp. 1–10 (2000)
Jia, L., Rajaraman, R., Suel, T.: An efficient distributed algorithm for constructing small dominating sets. In: Proc. Annual ACM Symposium on Principles of Distributed Computing, pp. 33–42 (2001)
Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: mobile networking for smart dust. In: Proceedings of ACM MobiCom 1999, August 1999, pp. 271–278 (1999)
Liang, B., Haas, Z.J.: Virtual backbone generation and maintenance in ad hoc network mobility management. In: Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. INFOCOM, pp. 1293–1302 (2000)
Lindsey, S., Raghavendra, C.S.: PEGASIS: Power Efficient Gathering in Sensor Information Systems. In: Proceedings of the IEEE Aerospace Conference, Big Sky, Montana (March 2002)
Lindsey, S., Raghavendra, C.S., Sivalingam, K.: Data Gathering in Sensor Networks using the Energy*Delay Metric. In: Proceedings of the IPDPS Workshop on Issues in Wireless Networks and Mobile Computing, San Francisco, CA (April 2001)
PicoRadio, http://bwrc.eecs.berkeley.edu/Research/Pico_Radio.htm
Pottie, G.J., Kaiser, W.J.: Wireless integrated network sensors. Communications of the ACM 5, 51–58 (2000)
Rajagopolan, S., Vazirani, V.V.: Primal-dual RNC approximation of covering integer programs. SIAM J. Computing 28, 525–540 (1998)
Rieck, M.Q., Pai, S., Dhar, S.: Distributed Routing Algorithms for Multi-hop Ad Hoc Networks Using d-hop Connected d-Dominating Sets. Computer Networks 47(6), 785–799 (2005)
Warneke, B., Last, M., Liebowitz, B., Pister, K.S.J.: Smart dust: communicating with a cubic-millimeter computer. Computer Magazine, 44–51 (January 2001)
Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc. 3rd Int. Wksp. Discrete Algorithms and Methods for Computing and Communications, pp. 7–14 (1999)
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
Rieck, M.Q., Dhar, S. (2005). Hierarchical Routing in Sensor Networks Using k-Dominating Sets. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_34
Download citation
DOI: https://doi.org/10.1007/11603771_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30959-8
Online ISBN: 978-3-540-32428-7
eBook Packages: Computer ScienceComputer Science (R0)