Abstract
In this paper we study the limiting achievable coverage problems of sensor networks. For the sensor networks with uniform distributions we obtain a complete characterization of the coverage probability. For the sensor networks with non-uniform distributions, we derive two different necessary and sufficient conditions respectively in the situations that the density function achieves its minimum value on a set with positive Lebesgue measure or at finitely many points. We propose also an economical scheme for the coverage of sensor networks with empirical distributions.
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
Aldous, D.: Probability Approximations via the Poisson Clumping Heuristic. Spring-Verlag, New York (1989)
Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity in Wireless Networks. In: McEneaney, W.M., Yin, G.G., Zhang, Q. (eds.) Stochastic Analysis, Control, Optimization and Applications. Systems Control Found. Appl, pp. 547–566. Birkhäuser Boston, Boston (1998)
Hall, P.: Introduction to the Theory of Coverage Processes. John Wiley & Sons, New York (1988)
Huang, C.-F., Tseng, Y.-C.: The Coverage Problem in a Wireless Sensor Network. In: ACM Intl. Workshop on Wireless Sensor Networks and Applications, pp. 115–121 (2003)
Kar, K., Banerjee, S.: Node Placement for Connected Coverage in Sensor Networks. In: Proceedings of WiOpt : Modeling and Optimization in Mobile. Sophia Antipolis, France (2003)
Koskinen, H.: On the Coverage of a Random Sensor Network in a Bounded Domain. In: Proceedings of 16th ITC Specialist Seminar, pp. 11–18 (2004)
Liu, B., Brass, P., Dousse, O., Nain, P., Towsley, D.: Mobility Improves Coverage of Sensor Networks. Submitted to the ACM MobiHoc 2005 Symposium (2004)
Liu, B., Towsley, D.: A Study of the Coverage of Large-Scale Sensor Networks. In: IEEE International Conference on Mobile Ad-hoc and Sensor Systems (2004)
Li, X.Y., Wan, P.J., Frieder, O.: Coverage in Wireless Ad Hoc Sensor Networks. IEEE Trans. on Computers 52, 753–763 (2003)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage Problems in Wireless Ad-hoc Sensor Networks. In: Proc. IEEE Infocom, pp. 1380–C1387 (2001)
Miorandi, D., Altman, E.: Coverage and Connectivity of Ad-Hoc Networks in Presence of Channel Randomness. In: Proc. of IEEE INFOCOM 2005. Miami, USA (2005)
Philips, T.K., Panwar, S.S., Tantawi, A.N.: Connectivity Properties of a Packet Radio Network Model. IEEE Transactions on Information Theory 35(5), 1044–1047 (1989)
Poduri, S., Sukhatme, G.S.: Constrained Coverage for Mobile Sensor Networks. IEEE International Conference on Robotics and Automation. LA, USA, pp. 165–172 (2004)
Shakkottai, S., Srikant, R., Shroff, N.: Unreliable Sensor grids: Coverage, Connectivity and Diameter. In: Proc. IEEE Infocom (2003)
Tian, D., Georganas, N.D.: A coverage-preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: First ACM International Workshop on Wireless Sensor Networks and Applications, pp. 32–41 (2002)
Zhang, H.h., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Ad. Hoc. & Sensor Wireless Networks 1, 89–124 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Lan, G.L., Ma, Z.M., Sun, S.S. (2007). Coverage Problem of Wireless Sensor Networks. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds) Discrete Geometry, Combinatorics and Graph Theory. CJCDGCGT 2005. Lecture Notes in Computer Science, vol 4381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70666-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-70666-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70665-6
Online ISBN: 978-3-540-70666-3
eBook Packages: Computer ScienceComputer Science (R0)