Abstract
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum number of relay nodes to forward data packets from sensor nodes to the sink, such that: 1) the network is connected, 2) the network is 2-connected. For case one, we propose a (6+ε)-approximation algorithm for any ε> 0 with polynomial running time when ε is fixed. For case two, we propose two approximation algorithms with (24+ε) and (6/T+12+ε), respectively, where T is the ratio of the number of relay nodes placed in case one to the number of sensors.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gupta, G., Younis, M.: Fault-Tolerant clustering of wireless sensor networks. In: Proceeding of IEEE WCNC 2003, pp. 1579–1584 (2003)
Gupta, G., Younis, M.: Load-Balanced clustering of wireless sensor networks. In: Proceeding of IEEE ICC 2003, pp. 1848–1852 (2003)
Pan, J., Hou, Y.T., Cai, L., Shi, Y., Shen, S.X.: Topology control for wireless sensor networks. In: Proceeding of ACM MOBICOM 2003, pp. 286–299 (2003)
Chong, C.-Y., Kumar, S.P.: Sensor Networks: Evolution, Opportunities, and Challenges. Proc. of the IEEE 91(8) (August 2003)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A Survey on Sensor Networks. IEEE Communications Magazine ( August 2002)
Rentala, P., Musunuri, R., Gandham, S., Saxena, U.: Survey on Sensor Networks, http://citeseer.nj.nec.com/479874.html
Hao, B., Tang, J., Xue, G.: Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation. Accepted by HPSR 2004 (2004)
Biagioni, E., Sasaki, G.: Wireless sensor placement for reliable and efficient data collection. In: Proceeding of the Hawaii International Conference on Systems Sciences (January 2003)
Du, D., Wang, L., Xu, B.: The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, p. 509. Springer, Heidelberg (2001)
Hochbaum, D.S., Maass, W.: Approximation Schemes for Covering and Packing in Image Processing and VLSI. Journal of the ACM (JACM) 32(1), 130–136 (1985)
Kottapalli, V.A., Kiremidjian, A.S., Lynch, J.P., Carryer, E., Kenny, T.W., Law, K.H., Lei, Y.: Two Tiered Wireless Sensor Network Architecture for Structural Health Monitoring. In: 10th Annual International Symposium on Smart Structures and Materials, San Diego, CA, USA, March 2-6 (2003)
Pan, J., Hou, T., Cai, L., Shi, Y., Shen, S.X.: Topology Control for Wireless Sensor Networks. In: MobiCom 2003, San Diego, California, USA, September 14-19 (2003)
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
Liu, H., Wan, PJ., Jia, X. (2005). Fault-Tolerant Relay Node Placement in Wireless Sensor Networks. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_25
Download citation
DOI: https://doi.org/10.1007/11533719_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)