Abstract
The network coverage for wireless sensor networks is an important issue because the information may not be considered useful when the total coverage drops below a certain required level. One way to maintain good coverage and extend the network lifetime is to schedule some sensor nodes to sleep between active cycles, as well as dynamically adjust the sensing ranges of active sensors. In this paper, we propose an algorithm to determine if a sensor node should sleep based on its residual energy and the size of the overlap area between the sensor and its neighbors. For those sensors that remain active, we use our algorithm to compute the sensing range of each active sensor such that the total coverage is maintained above a user-specified requirement for as long as possible. Simulation results show that our proposed scheme achieves a better performance in providing the user-required coverage and extending the system lifetime than the Coverage-Aware and Random-Sleep 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
Akyildiz, I., et al.: A Survey on Sensor Networks. IEEE Communications Magazine 40(8) (2002)
Tian, D., Georganas, N.D.: A Coverage-preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: ADM International Workshop on Wireless Sensor Networks & Applications (2002)
Brooks, R.R., Ramanathan, P., Sayeed, A.M.: Distributed Target Classification and Tracking in Sensor Networks. Proceedings of IEEEÂ 91(8) (August 2003)
Li, X., et al.: Coverage in Wireless Ad-hoc Sensor Networks. IEEE Transactions on Computers 52(6) (2003)
Huang, C.F., Tseng, Y.C.: The Coverage Problem in a Wireless Sensor Network. In: 2nd ACM International Conference on Wireless Sensor Networks and Applications, San Diego, CA, USA (2003)
Ye, F., Zhong, G., Cheng, J., Lu, S., Zhang, L.: PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks. In: 23rd International Conference on Distributed Computing Systems. IEEE Computer Society, Los Alamitos (2003)
Jiang, J., Dou, W.: A Coverage-preserving Density Control Algorithm for Wireless Sensor Networks. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2004. LNCS, vol. 3158, pp. 42–55. Springer, Heidelberg (2004)
Li, L., Sun, L., Ma, J., Chen, C.: A Receiver-based Opportunistic Forwarding Protocol for Mobile Sensor Networks. In: 28th International Conference on Distributed Computing Systems Workshops (June 2008)
Zabin, F., Misra, S., Woungang, I., Rashvand, H.F., Ma, N.W., Ahsan, A.: REEP: Data-Centric Energy-Efficient and Reliable Routing Protocol for Wireless Sensor Networks. IET Communications 2(8) (September 2008)
Wang, Y.H., Yu, C.Y., Chen, W.T., Wang, C.X.: An Average Energy Based Routing Protocol for Mobile Sink in Wireless Sensor Networks. In: First IEEE International Conference on Ubi-Media Computing (August 2008)
IEEE Standards, http://www.ieee.org
Zou, Y., Chakrabarty, K.: Sensor Deployment and Target Localization Based on Virtual Forces. In: IEEE INFOCOM (April 2003)
Younghwan, Y., Agrawal, D.P.: Mobile Sensor Relocation to Prolong the Lifetime of Wireless Sensor Networks. In: IEEE Vehicular Technology Conference (May 2008)
Li, S., Xu, C., Pan, W., Pan, Y.: Sensor Deployment Optimization for Detecting Maneuvering Targets. In: 8th International Conference on Information Fusion (July 2005)
Lin, C.H., Lu, C.H.: Efficient Relocation and Range Adjustment to Maintain Coverage in Wireless Sensor Networks. In: 5th Workshop on Wireless, Ad Hoc and Sensor Networks, Taiwan (2009)
Wang, G., Cao, G., Porta, T.L., Zhang, W.: Sensor Relocation in Mobile Sensor Networks. In: IEEE INFOCOM (2005)
Lam, M.L., Liu, Y.H.: ISOGRID: an Efficient Algorithm for Coverage Enhancement in Mobile Sensor Networks. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (October 2006)
Wang, P.C., Hou, T.W., Yan, R.H.: Maintaining Coverage by Progressive Crystal-Lattice Permutation in Mobile Wireless Sensor Networks. In: International Conference on Systems and Networks Communications (October 2006)
Deng, J., Han, Y.S., Heinzelman, W.B., Varshney, P.K.: Scheduling Sleeping Nodes in High Density Cluster-based Sensor Networks. MONET Special Issue on Energy Constraints and Lifetime Performance in Wireless Sensor Networks (2004)
Deng, J., Han, Y.S., Heinzelman, W.B., Varshney, P.K.: Balanced-energy Sleep Scheduling Scheme for High Density Cluster-based Sensor Networks. In: 4th Workshop on ASWN (2004)
Shen, F., Liu, C., Zhang, J.: A Distributed Coverage-aware Sleep Scheduling Algorithm for Wireless Sensor Networks. In: 6th International Conference on Information Technology (2009)
Lu, G., Sadagopan, N., Krishnamachari, B., Goel, A.: Delay Efficient Sleep Scheduling in Wireless Sensor Networks. In: IEEE INFOCOM, Miami, FL (2005)
Balakrishnan, M., Johnson, E., Huang, H.: TEAN-Sleep for Distributed Sensor Networks: Introduction and α-Metrics Analysis. In: IEEE Military Communications Conference (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tung, KC., Lu, J.CH., Lin, HH. (2010). A Distributed Sleep Scheduling Algorithm with Range Adjustment for Wireless Sensor Networks. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2010. Lecture Notes in Computer Science(), vol 6423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16696-9_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-16696-9_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16695-2
Online ISBN: 978-3-642-16696-9
eBook Packages: Computer ScienceComputer Science (R0)