Computing subgraph probability of random geometric graphs with applications in quantitative analysis of ad hoc networks

IEEE Journal on Selected Areas in Communications

Volumn 27, Issue 7, 2009, Pages 1056-1065

  Yu, Chang Wu ^a  

^a CHUNG HUA UNIVERSITY   (Taiwan)

Author keywords

Ad hoc networks; Quantitative analysis; Random geometric graphs; Subgraph counting; Subgraph probability

Indexed keywords

ASYMPTOTIC BOUNDS; CLOSED FORM; INDUCED SUBGRAPHS; POSITIVE VALUE; RANDOM GEOMETRIC GRAPHS; SUBGRAPHS;

AD HOC NETWORKS; CHEMICAL ANALYSIS; GEOMETRY; MOBILE AD HOC NETWORKS; MOBILE DEVICES; PROBABILITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 80054713790     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2009.090904     Document Type: Article

References (34)

1. Christian Bettstetter, "On the minimum node degree and connectivity of a wireless multi-hop network," MobiHoc, 2002, pp. 80-91.
2. B. Bollobas, Random Graphs, London: Academic Press, 1985.
3. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan Press, 1976.
4. Bevan Das and Vaduvur Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," IEEE International Conference on Communications, 1997, pp. 376-380.
5. J. Díaz, 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, no. 6, pp. 489-511, 2000.
6. J. Díaz, M. D. Penrose, J. Petit, and M. Serna, "Approximating layout problems on random geometric graphs," J. Algorithms, vol. 39, pp. 78-116, 2001. (Pubitemid 33666059)
7. J. Díaz, J. Petit, and M. Serna, "Random geometric problems on [0, 1]2," Lecture Notes in Computer Science, vol. 1518, Springer-Verlag, New York/Berlin, 1998.
8. O. Dousse, P. Thiran, and M. Hasler, "Connectivity in ad-hoc and hybrid networks," Infocom, 2002.
9. P. Erdös and A. Rénye, "On random graphs I," Publ. Math. Debrecen, vol. 6, pp. 290-297, 1959.
10. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," Stochastic Analysis, Control, Optimization and Applications, pp. 547-566, 1998.
11. Peter Hall, Introduction to the Theory of Coverage Process, John Wiley and Sons, New York, 1988.
12. S. Khurana, A. Kahol, S. K. S. Gupta, and P. K. Srimani, "Performance evaluation of distributed co-ordination function for IEEE 802.11 wireless LAN protocol in presence of mobile and hidden terminals," International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1999, pp. 40-47. (Pubitemid 30538006)
13. S. Khurana, A. Kahol, and A. Jayasumana, "Effect of hidden terminals on the performance of the IEEE 802.11 MAC protocol," Local Computer Networks Conference, 1998.
14. S.-J. Lee and M. Gerla, "AODV-BR: Backup routing in Ad hoc Networks," IEEE Wireless Communications and Networking Conference, 2000, vol. 3, pp. 1311-1316.
15. Edgar M. Palmer, Graphical Evolution: An Introduction to the Theory of Random Graphs, New York: John Wiley and Sons, 1985.
16. Mathew D. Penrose, Random Geometric Graphs, Oxford University Press, 2003.
17. M. D. Penrose, "A strong law for the longest edge of the minimal spanning tree," The Annals of Probability, vol. 27, no. 1, pp. 246-260, 1999.
18. 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.
19. M. D. Penrose, "On k-connectivity for a geometric random graph," Random structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999.
20. Paolo Santi and Douglas M. Blough, "The critical transmitting range for connectivity in sparse wireless ad hoc networks," IEEE Trans. Mobile Comput., vol. 2, no. 1, pp. 25-39, 2003.
21. D. Shukla, L. Chandran-Wadia, and S. Iyer, "Mitigating the exposed node problem in IEEE 802.11 ad hoc networks," International Conference on Computer Communications and Networks, 2003, pp. 157-162.
22. F. Tobagi and L. Kleinrock, "Packet switching in radio channels, Part II-The hidden terminal problem in carrier sense multiple access and the busy tone solution," IEEE Trans. Commun., vol. COM-23, no. 12, pp. 1417-1433, 1975.
23. J. Wu and H. Li, "Domination and its application in ad hoc wireless networks with unidirectional links," International Conference on Parallel Processing, 2000, pp. 189-197.
24. F. Xue and P. R. Kumar, "The number of neighbors needed for connectivity of wireless networks," Wireless Networks, vol. 10, pp. 169-181, 2004.
25. K. J. Yang, On the Number of Subgraphs of a Random Graph in [0, 1]d, Unpublished D. Phil. thesis, Department of Statistics and Actuarial Science, University of Iowa, 1995.
26. L.-H. Yen and Chang Wu Yu, "Link probability, network coverage, and related properties of wireless ad hoc networks," The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2004, pp. 525-527. (Pubitemid 40789384)
27. L.-H. Yen, Chang Wu Yu, and Yang-Min Cheng, "Expected k-coverage in wireless sensor networks," Ad Hoc Networks, vol. 5, no. 4, pp. 636-650, 2006.
28. Chang Wu Yu, "Quantitative analysis of multi-hop wireless networks using a novel paradigm," International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007).
29. Chang Wu Yu, Tung-Kuang Wu, and Rei Heng Cheng, "A low overhead dynamic route repairing mechanism for mobile ad hoc networks," Computer Communications, vol. 30, pp. 1152-1163, 2007. (Pubitemid 46273643)
30. Chang Wu Yu and Li-Hsing Yen, "Computing subgraph probability of random geometric graphs: Quantitative analyses of wireless ad hoc networks," 25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems, 2005.
31. Chang Wu Yu, L.-H. Yen, and Yang-Min Cheng, "Computing subgraph probability of random geometric graphs with applications in wireless ad hoc networks," Tech. Rep., CHU-CSIE-TR-2004-005, Chung Hua University, R.O.C.
32. Chang Wu Yu, Li-Hsing Yen, Kun-Ming Yu, and Zhi Pin Lee, "An ad hoc routing protocol providing short backup routes," The Eighth IEEE International Conference on Communication Systems, 2002, Singapore, pp. 1052-1056.
33. Kun-Ming V. Yu, Shi-Feng Yand, and Chang Wu Yu, "An ad hoc routing protocol with multiple backup routes," Proc. IASTED International Conference Networks, Parallel and Distributed Processing, and Applications, 2002, pp. 75-80.
34. http://mathworld.wolfram.com/.