On range matrices and wireless networks in d dimensions

Proceedings - WiOpt 2005: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

Volumn 2005, Issue , 2005, Pages 190-196

  Desai, Madhav ^a   Manjunath, D ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Ad Hoc Networks; Geometric Random Graphs; Range Matrices

Indexed keywords

GEOMETRY; GRAPH THEORY; NUMBER THEORY; PROBABILITY; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS;

AD HOC NETWORKS; GEOMETRIC RANDOM GRAPHS; RANGE MATRICES; WIRELESS NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33744457907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIOPT.2005.33     Document Type: Conference Paper

References (20)

1. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, W. M. McEneany, G. Yin, and Q. Zhang, Eds. Birkhauser, Boston, 1998, pp. 547-566.
2. _, "The capacity of wireless networks," IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, March 2000.
3. _, "Towards an information theory of large networks: An achievable rate region," IEEE Transactions on Information Theory, vol. 49, no. 8, pp. 1877-1894, 2003.
4. L. L. Xie and P. R. Kumar, "A network information theory for wireless communication: Scaling laws and optimal operation," IEEE Transactions on Information Theory, vol. 50, no. 5, pp. 748-767, May 2004.
5. P. Santi and D. M.Blough, "The critical transmitting range for connectivity in sparse wireless ad hoc networks," IEEE Transactions on Mobile Computing, vol. 2, no. 1, pp. 25-39, March 2003.
6. C. Bettstetter, H. Hartenstein, and X. Perez-Costa, "Stochastic properties of the random waypoint mobility model," ACM/Kluwer Wireless Networks, Special Issue on Modeling and Analysis of Mobile Networks, vol. 10, no. 5, pp. 555-567, September 2004.
7. C. Bettstetter and C. Hartmann, "Connectivity of wireless multihop networks in a shadow fading environment," ACM/Kluwer Wireless Networks, Special Issue on Modeling and Analysis of Mobile Networks, vol. 11, no. 4, July 2005.
8. d," Advances in Applied Probability, vol. 29, no. 3, pp. 582-594, 1997.
9. M. D. Penrose, "On k-connectivity for a geometric random graph," Random Structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999.
10. M. Desai and D. Manjunath, "On the connectivity in finite ad-hoc networks," IEEE Communication Letters, vol. 6, no. 10, pp. 237-239, 2002.
11. M. D. Penrose, "The longest edge of the random minimal spanning tree," Annals of Applied Probability, vol. 7, pp. 340-361, 1997.
12. J. Diaz, M. D. Penrose, M. Serna, and J. Petit, "Approximating layout problems on random graphs," Journal of Algorithms, vol. 39, pp. 78-117, 2001.
13. P. Jaillet, "On properties of geometric random graphs in the plane," Annals of Operations Research, vol. 1995, pp. 1-20, 61.
14. J. Diaz, J. Petit, and M. Serna, "Random geometric graph in [0,1]2," in Randomization and Approximation Techniques in Computer Science, Proceedings of the Second International Workshop, RANDOM'98, Barcelona, Spain, M. Luby, J. D. P. Rolim, and M. J. Serna, Eds. Lecture Notes in Computer Science 1518, Springer-Verlag (1998), 1998.
15. M. D. Penrose, Random. Geometric Graphs. Oxford University Press, 2003.
16. E. Godehardt and J. Jaworski, "On the connectivity of a random interval graph," Random Structures and Algorithms, vol. 9, pp. 137-161, 1996.
17. M. V. Moorthy, "Numerical inversion of two-dimensional laplace transforms-fourier series representation," Applied Numerical Mathematics, vol. 17, pp. 119-127, 1995.
18. W. T. Weeks, "Numerical inversion of laplace transforms using laguerre functions," Journal of the ACM, vol. 13, pp. 419-426, 1966.
19. D. B. West, Graph Theory. Prentice-Hall India, New Delhi, 1998.
20. S. K. Iyer, D. Manjunath, and B. Gupta, "On the topological properties of the one dimensional exponential random geometric graph," Submitted, 2005.