Coverage properties of the target area in wireless sensor networks

IEEE Transactions on Information Theory

Volumn 58, Issue 1, 2012, Pages 430-437

  Li, Xiaoyun ^a   Hunter, David K ^b   Zuyev, Sergei ^c  

^a University Town of Shenzhen   (China)

^b UNIVERSITY OF ESSEX   (United Kingdom)

^c CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Coverage; dimensioning; geometric graph; networks; Poisson process; sensor

Indexed keywords

ANALYTICAL APPROXIMATION; COVERAGE; DIMENSIONING; GEOMETRIC GRAPHS; NODE DENSITY; PER UNIT; PLANNING AND DESIGN; POISSON PROCESS; PROBABILISTIC ANALYSIS; SENSING AREAS; SENSING COVERAGE; SENSING NODES;

COMPUTATIONAL GEOMETRY; GRAPH THEORY; NETWORKS (CIRCUITS); POISSON DISTRIBUTION; PROBABILITY; SENSORS;

SENSOR NODES;

EID: 84862945902     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2169300     Document Type: Article

References (16)

1. B. N. Clark and C. J. Colbourn, "Unit disk graphs," Discr. Math., vol. 86, no. 1-3, 1990.
2. J. Dall and M. Christensen, "Random geometric graphs," Phys. Rev. E, vol. 66, no. 1, 2002.
3. M. Penrose, "ser. Oxford Studies in Probability," in RandomGeometric Graphs. Oxford, U.K.: Oxford Univ. Press, 2003.
4. P. K. Biswas and S. Phoha, , S. Phoha, T. LaPorta, and C. Griffin, Eds., "Sensor network operations," in Hybrid Sensor Network Test Bed for Reinforced Target Tracking. New York: Wiley, 2007, ch. 13, pp. 689-704.
5. N. Ahmed, S. S. Kanhere, and S. Jha, "The holes problem in wireless sensor networks: A survey," ACM SIGMOBILE Rev., vol. 9, no. 2, 2005.
6. G. Kesidis, T. Konstantopoulos, and S. Phoha, "Surveillance coverage of sensor networks under a random mobility strategy," in IEEE Sens. Conf., Toronto, Oct. 2003.
7. S. Kumar, T. H. Lai, and J. Balogh, "On -coverage in a mostly sleeping sensor network," in Proc. 10th Int. Conf. Mobile Comput. Netw., 2004, pp. 144-158. (Pubitemid 40061937)
8. S. Janson, "Random coverings in several dimensions," Acta. Math., vol. 156, pp. 83-118, 1986.
9. P. Hall, Introduction to the Theory of Coverage Processes. New York: Wiley, 1988.
10. H. Zhang and J. Hou, "On deriving the upper bound of -lifetime for large sensor networks," in Proc. 5th ACM Int. Symp. Mobile Ad-hoc Netw. Comput., 2004.
11. X. Li and D. K. Hunter, "Distributed coordinate-free algorithm for full sensing coverage," Int. J. Sens. Netw., 2009.
12. Y. Bejerano, "Efficient k-coverage verification without location information," IEEE INFOCOM, 2008.
13. S. Zuyev, "Stopping sets: Gamma-type results and hitting properties," Adv. in Appl. Probab., vol. 31, no. 2, pp. 355-366, 1999. (Pubitemid 30531826)
14. R. Cowan, M. Quine, and S. Zuyev, "Decomposition of Gamma-distributed domains constructed from Poisson point processes.," Adv. in Appl. Probab., vol. 35, no. 1, pp. 56-69, 2003.
15. R Development Core Team, R: A Language and Environment for Statistical Computing R Foundation for Statistical Computing, Vienna, Austria, 2008[Online]. Available: ISBN 3-900051-07-0.
16. D. J. Daley and D. Vere-Jones, An Introduction to the Theory of Point Processes. Volume I: Elementary Theory and Methods. NewYork: Springer, 2003.