Limit theorems for degree of coverage and lifetime in large sensor networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 106-110

  Paillard, Gabriel ^a   Ravelomananana, Vlady ^b  

^a FEDERAL UNIVERSITY OF CEARÁ   (Brazil)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; COMPUTER NETWORKS; RANDOM VARIABLES; TELECOMMUNICATION EQUIPMENT; WIRELESS SENSOR NETWORKS;

COMPUTER COMMUNICATIONS; INFOCOM; POISSON POINT PROCESSES;

SENSOR NETWORKS;

EID: 51349136335     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.266     Document Type: Conference Paper

References (36)

1. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y. and Cayirci, E. Wireless sensor networks: a survey. Computer Networks 38: 393-422, 2002.
2. Akyildiz, I. F., Pompili, D. and Melodia. T. Underwater Acoustic Sensor Networks: Research Challenges Ad Hoc Networks, vol. 3, no. 3. pp. 257-279, 2005.
3. Berkeley Wireless Research Center: http://bwrc.eecs.berkeley.edu.
4. Bettstetter, C. On the Minimum Node Degree and Connectivity of a Wireless Multihop Network. Proc. of ACM Mobihoc'02, pp 80-91, 2002.
5. Bhardwaj, M. and Chandrakasan., A. R Bounding the lifetime of sensor network via optimal role assignments In Proc. of IEEE lnfocom 2002.
6. Billingsey, R Convergence of Probability Measures John Wiley & Sons, New-York, 1968
7. De Bruijn, N. G. Asymptotic Methods in Analysis. Dover. New-York, 1981.
8. Blough, D. M. and Santi, R Investigating upper bounds on network life-time extension for cell-based energy conservation techniques in stationary ad hoc networks. Proc. of ACM Mobicom, 2002.
9. Chatzigiannakis, L., Nikoletseas. S. and Spirakis, R Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Protocols. ACM/Kluwer Mobile Networks and Applications, Vol 10(1-2). pages 133-149 (2005).
10. Cheng, Y.-C. and Robertazzi T. G. Critical connectivity phenomena in multihop radio models. IEEE Trans. on Communications, 36: 770-777, 1989.
11. Chung. K. L. A Course in Probability Theory. Academic Press, NY, 1974
12. Corless, R. M., Gonnet G. H., Hare D. E. G., Jeffrey D. J. and Knuth D. E. On the Lambert W Function. Advances in Computational Mathematics, 5: 329-359, 1996.
13. Estrin, D., Govindan, R., Heidemann, J. and Kumar S. Next century challenges: Scalable coordination in sensor networks. Proceedings of IEEE/ACM International Conference on Mobile Computing and Networking, pp 263-270, 1999.
14. Gautschi, W. The Incomplete Gamma Functions Since Tricomi. In Tricomi's Ideas and Contemporary Applied Mathematics. Atti dei Convegni Lincei, Accademia Nationale dei Lincei, Roma, 147:203-237, 1998.
15. Gilbert, E. N. Random Plane Networks. Journal of the Society for Industrial and Applied Math, 9: 533-543, 1961.
16. Gupta, P. and Kumar P. R. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications: a volume in honor of W. H. Fleming, W. M. McEneaney, G. Yin and Q. Zhang, Birkhäuser, Boston, 1998.
17. Gupta. P. and Kumar P. R. Internet in the Sky: The Capacity of Three Dimensional Wireless Networks. Communications in Information and Systems, 1:33-49, 2001.
18. Gut, A. An intermediate course in probability. Springer, New-York, 1995.
19. Hall, P. Introduction to the Theory of Coverage. Pmcesses. Birkhäuser, Boston, 1988.
20. Hong, X., Gerla, M. and Wang H. Load-Balance, Energy-Aware Communication for Mars Sensor Network, in Proceedings of IEEE Aerospace Conference, 2002.
21. H. Honghai and J. Hou On deriving the upper bound of α-lifetime for large sensor networks, in Proceedings of ACM Mobysis'04.
22. H. Honghai and J. Hou On deriving the upper bound of α-lifetime for large sensor networks, ACM Trans. on Sensor Networks, Vol. 1(2) pages 272-300, Nov. 2005.
23. Janson, S., Luczak, T. and Ruciński A. Random Graphs. John Wiley, New York (2000).
24. Krishnamachari, B., Wicker S. B., Bejar R. and Pearlman M. Critical Density Thresholds in Distributed Wireless Networks. Book chapter in Communications, Information and Network Security, eds. H. Bhargava, H.V. Poor, V. Tarokh, and S. Yoon, Kluwer Publishers, 2002.
25. Meester, R. and Roy, R. Continuum Percolation. Cambridge University Press, Cambridge, 1996.
26. Penrose, M. D. Random Geometric Graphs. Oxford Studies in Probability, 2003.
27. Penrose, M. D. The longest edge of the random minimal spanning tree. The Annals of Applied Probability, 7:340361, 1997.
28. Perkins, C. E. Ad Hoc Networking. Addison-Wesley, 2001.
29. Philips, T. K., Panwar, S. S. and Tantawi, A. N. Connectivity properties of a packet radio network model. IEEE Trans. on Inf. Theory, 35: 1044-1047, 1989.
30. Proakis, J. G., Sozer, E. M., Rice, J. A. and Stojanovic, M. Shallow Water Acoustic Networks. IEEE Communications Magazine. 39: 114-119, 2001.
31. Ravelomanana, V. Extremal Properties of Three Dimensional Sensor Networks with Applications. IEEE Trans. Mob. Comp.. 3: 246-257, 2004.
32. Santi, P. and Blough D. M. The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks. IEEE Trans. Mob. Comp., 2: 1-15, 2003.
33. Temme, N. Uniform asymptotic expansions of the incomplete gamma functions and the incomplete beta functions. Math. Comput., 29: 1109-1114, 1975.
34. Temme, N. The asymptotic expansion of the incomplete gamma function. SIAM J. Math. Anal., 10: 757-766, 1979.
35. F. Ye, G. Zhong, S. Lu, L. Zhang. Energy efficient robust sensing coverage in large sensor networks Technical Report - UCLA, 2002.
36. Ye, F., Zhong, G., Lu, S. and Zhang, L. Peas: A robust energy conserving protocol for long-lived sensor networks. In The 23nd International Conference on Distributed Computing Systems (ICDCS), 2003.