Abstract
Most wireless sensor networks (WSN) researches assume that the network is connected and there is always a path connected by wireless links between a source and a destination. In this paper, we argue that network partitioning is not an uncommon phenomenon for practical WSN applications, especially when the sensor nodes are deployed in a hash working environment. We first present a simple distributed method to detect the occurrence of network partitions. Some critical survival nodes would be selected to re-connect to the sink after certain network disruption happens. Two reconnection approaches, Transmission Range Adjustment (TRA) and Message Ferry (MF), are then proposed. We study their performances in terms of power consumption by taking the specifications of the commercial sensor nodes into account. Simulation results show that TRA is more appropriate for the current implementation of WSN. However, MF has the potential to be more energy-efficient if there is a powerful wireless transmitter and a larger amount of buffers at each sensor node.
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
Akyildiz, F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine 40(8), 102–116 (2002)
Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks. In: Proc. of the First ACM Conference on Embedded Networked Sensor Systems (SenSys 2003), Los Angeles, CA (November 2003)
Tian, D., Georganas, N.D.: Connectivity Maintenance and Coverage Preservation in Wireless Sensor Networks. In: Proc. of the 2004 IEEE Canadian Conference on Electrical and Computer Engineering (2004)
Shakkottai, S., Srikant, R., Shroff, N.: Unreliable Sensor Grids: Coverage, Connectivity and Diameter. In: Proc. of the 2003 IEEE Infocom, Hong Kong, China (2003)
Cerf, V., Burleigh, S., Hooke, A., Torgerson, L., Durst, R., Scott, K., Fall, K., Weiss, H.: Delay tolerant network architecture (October 2003), http://www.dtnrg.org/specs/draft-irtf-dtnrg-arch-02.txt
Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity In Wireless Networks. In: McEneany, W.M., Yin, G., Zhang, Q. (eds.) Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, pp. 547–566. Birkhauser, Boston (1998)
Tammara Massey, Message Ferry Architecture and Implementation, http://www.cc.gatech.edu/grads/t/tammy/MF_Master_Proj.pdf
Zhong, L.C., Rabaey, J.M., Wolisz, A.: An integrated data-link energy model for wireless sensor networks. In: ICC 2004, Paris, France, June 20-24 (2004)
CotsBots, http://www-bsac.eecs.berkeley.edu/projects/cotsbots/
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
Ye, Q., Cheng, L. (2005). A Study of Reconnecting the Partitioned Wireless Sensor Networks. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-31956-6_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25339-6
Online ISBN: 978-3-540-31956-6
eBook Packages: Computer ScienceComputer Science (R0)