Abstract
In this paper, we have done thorough mathematical analysis and extensive simulations on the distributed, lightweight and location-free node scheduling scheme proposed in [11]. The basic idea of this scheduling scheme is to organize sensor nodes into disjoint node sets, which work alternately to extend network lifetime effectively. Distinguished from the work in [11], we reevaluate the performance of this scheduling scheme under different assumption that sensor nodes are deployed randomly in the target region according to a Poisson point process, which is a more realistic deployment model in large scale randomly deployed sensor networks. We also analyze the performance in terms of average event detection latency, which is another straightforward coverage quality measure. Our analysis results reveal the relationship among coverage quality, expected network lifetime and node deployment intensity. Impact of normally distributed time asynchrony on network coverage quality is also investigated.
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.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks, 393–422 (2004)
Elson, J., Estrin, D.: Sensor Networks: A Bridge to the Physical World. Wireless Sensor Networks. Kluwer, Dordrecht (2004)
Slijepcevic, S., Potkonjak, M.: Power Efficient Organization of Wireless Sensor Networks. In: Proc. of IEEE ICC 2001, Helsinki, Finland (2001)
Abrams, Z., Goel, A., Plotkin, S.: Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks. In: Proc. of IPSN 2004, Berkeley, California, USA (2004)
Tian, D., Georganas, N.D.: A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networt. In: Proc. of WSNA 2002, Atlanta, Geogia, USA (2002)
Chen, H., Wu, H., Tzeng, N.: Grid-Based Approach for Working Node Selection in Wireless Sensor Networks. In: Proc. of IEEE ICC 2004, Paris, France (2004)
Carbunar, B., Grama, A., Vitek, J., Carbunar, O.: Coverage Preserving Redundancy Elimination in Sensor Networks. In: Proc. of SECON 2004, Santa Clara, CA, USA (2004)
Yan, T., He, T., Stankovic, J.: Differentiated Surveillance Service for Sensor Networks. In: Proc. of SenSys 2003, Los Angels, CA, USA (2003)
Wang, X., Xing, G., et al.: Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks. In: Proc. of SenSys 2003, Los Angeles, CA (2003)
Gupta, H., Das, S.R., Gu, Q.: Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution. In: Proc. of MobiHoc 2003, Annapolis, Maryland, USA (2003)
Liu, C., Wu, K., King, V.: Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks. In: Proc. of IFIP Networking 2005, Waterloo Ontario, Canada (2005)
Cao, Q., Abdelzaher, T., He, T., Stankovic, J.: Towards Optimal Sleep Scheduling in Sensor Networks for Rare Event Detection. In: Proc. of IPSN 2005, Los Angeles (2005)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagram. John Wiley & Sons, New York (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
Jiang, J., Liu, C., Wu, G., Dou, W. (2005). On Location-Free Node Scheduling Scheme for Random Wireless Sensor Networks. In: Yang, L.T., Zhou, X., Zhao, W., Wu, Z., Zhu, Y., Lin, M. (eds) Embedded Software and Systems. ICESS 2005. Lecture Notes in Computer Science, vol 3820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599555_46
Download citation
DOI: https://doi.org/10.1007/11599555_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30881-2
Online ISBN: 978-3-540-32297-9
eBook Packages: Computer ScienceComputer Science (R0)