Impact of region-based faults on the connectivity of wireless networks

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 1430-1437

  Sen, Arunabha ^a   Banerjee, Sujogya ^a   Ghosh, Pavel ^a   Shirazipourazad, Shahrzad ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS AND SIMULATION; ANALYTICAL EXPRESSIONS; COMBAT ENVIRONMENTS; FAULT SCENARIOS; FAULTY NODE; GRAPH G; NETWORK FORMATION; NODE DEGREE; REGION-BASED; RESEARCH COMMUNITIES; TRANSMISSION RANGES; TWO DIMENSIONAL PLANE; WIRELESS NETWORKING;

AD HOC NETWORKS; COMPUTER SIMULATION; PROBABILITY; TELECOMMUNICATION NETWORKS; WIRELESS AD HOC NETWORKS;

PROBABILITY DENSITY FUNCTION;

EID: 77949646009     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394506     Document Type: Conference Paper

References (16)

1. M. D. Penrose, "the longest edge of the random minimal spanning tree," The Annals of Applied Probability, vol. 7, no. 2, pp. 340-361, 1997.
2. -, "On k-connectivity for a geometric random graph," Random Structures and Algorithms, Wiley, vol. 15, no. 2, pp. 145-164, 1999.
3. J. Diaz, M. D. Penrose, J. Petit, and M. Serna, "Convergence theorems for some layout measures on random lattice and random geometric graphs," Combinatorics, Probability and Computing, vol. 9, pp. 489-511, 2000.
4. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," in Stochastic Analysis, Control, Optimization and Applications, 1998, pp. 547-566.
5. F. Xue and P. R. Kumar, "The number of neighbors for connectivity of wireless networks," Wireless Networks, vol. 10, no. 2, pp. 169-181, March 2004.
6. C. Bettstetter, "On the minimum node degree and connectivity of a wireless multihop network," in MOBIHOC, 2002.
7. -, "On the connectivity of wireless multihop networks with homogeneous and inhomogeneous range assignment," in Proceedings of Vehicular Technology Conference, vol. 13, Vancouver, Canada, September 2002, pp. 1706-1710.
8. C. Bettstetter and J. Zangl, "How to achieve a connected ad hoc network with homogeneous range assignment: An analytical study with consideration of border effects," in Proceedings of MWCN, 2002, pp. 125-129.
9. C. Bettstetter, "On the connectivity of ad hoc networks," The Computer Journal, vol. 47, no. 4, pp. 432-447, 2004.
10. A. Sen, B. H. Shen, L. Zhou, and B. Hao, "Fault-tolerance in sensor networks: A new evaluation metric," in Proceedings of Infocom, 2006.
11. A. Sen, S. Murthy, and S. Banerjee, "Region-based connectivity - a new paradigm for design of fault-tolerant networks," in Proceedings of High Performance Switching and Routing, 2009.
12. C. Bettstetter and C. Hartmann, "Connectivity of wireless multihop networks in a shadow fading environment," in MSWiM, September 2003, pp. 28-32.
13. d," Statistics & Probability Letters, vol. 60, pp. 351-357, 2002.
14. A. Sen and M. Huson, "A new model for scheduling packet radio networks," in Proceedings of IEEE Infocom, 1996, pp. 1116-1124.
15. J. Wang, "A fast integrated mobility spectrometer with wide dynamic size range: Theoretical analysis and numerical simulation," Journal of Aerosol Science, vol. 40, no. 10, pp. 890 - 906, 2009. [Online]. Available: http://www.sciencedirect.com/science/article/B6V6B-4WNB560-1/2/ 1563fe80718c60bb6e6a0e04fd4e0f0b
16. E. W. Weisstein, "Circle-circle intersection," from Math-world - A Wolfram Web Resource. [Online]. Available: http://mathworld.wolfram.com/ Circle-CircleIntersection.html