Optimal density estimation for exposure-path prevention in wireless sensor networks using percolation theory

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 2601-2605

  Liu, Liang ^a   Zhang, Xi ^b   Ma, Huadong ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b Texas AandM University   (United States)

Author keywords

Coverage; exposure path; percolation theory; percolation threshold; wireless sensor networks

Indexed keywords

ANALYTICAL EXPRESSIONS; BOND PERCOLATION; COVERAGE; COVERAGE MODELS; CRITICAL DENSITY; DENSITY ESTIMATION; EXPOSURE PATH; MOVING OBJECTS; PARTIAL COVERAGE; PERCOLATION THEORY; PERCOLATION THRESHOLDS; SENSOR COVERAGE; SENSOR DEPLOYMENT;

SENSORS; WIRELESS SENSOR NETWORKS;

PERCOLATION (SOLID STATE);

EID: 84861627255     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195661     Document Type: Conference Paper

References (15)

1. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: a survey," Computer Networks, vol.38(4), 2002, pp.393-422.
2. J. Yick, B. Mukherjee, D. Ghosal, "Wireless sensor network survey," Computer Networks, vol. 52(12), 2008, pp. 2292-2330.
3. S. Megerian, F. Koushanfar, G. Qu and M. Potkonjak, "Exposure in Wireless Sensor Networks." in Proc. of MobiCom, 2001.
4. G. Veltri, Q. Huang, G. Qu and M. Potkonjak, "Minimal and maximal exposure path algorithms for wireless embedded sensor networks," in Proc. of SenSys'03, November 5-7, 2003, Los Angeles, California, USA.
5. L. Liu, X. Zhang, and H. Ma, "Minimal Exposure Path Algorithms for Directional Sensor Networks," in Proc. of GLOBECOM, 2009.
6. C. Huang and Y. Tseng, "The coverage problem in a wireless sensor network," in Proc. of WSNA, San Diego, CA, 2003.
7. S. Kumar, T. H. Lai, and J. Balogh. "On k-coverage in a mostly sleeping sensor network," in Proc. of ACM MobiCom, Philadelphia, PA, 2004.
8. P. Wan and C. Yi, "Coverage by randomly deployed wireless sensor networks," IEEE Transactions on Information Theory, vol 52, 2006, pp. 2658-2669.
9. S. R. Broadbent and J. M. Hammersley, "Percolation processes, I and II," in Proc. of Cambridge Philos. Soc., 53 (1957), pp. 629-645.
10. G. Grimmett, Percolation, 2nd ed. Berlin: Springer-Verlag, 1999.
11. P. Hall, "On continnum percolation," The Annals of Probability, Vol. 13, No. 4, 1985, pp. 1250-1266.
12. R. Meester and R.Roy, Continnum Percolation. Cambridge: Cambridge University Press, 1996.
13. H. Kesten, "The Critical Probability of Bond Percolation on the Square Lattice Equals 1/2," Comm. Math. Phys., 74(1980), pp.41-69.
14. M. D. Penrose, "The longest edge of the random minimal spanning tree," Ann. Prob., vol. 7, no. 2, 1997, pp. 340-361.
15. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," in Stochastic Analysis, Control, Optimization and Applications. Boston, MA: Birkhauser, 1998, pp. 657-566.