Topological properties of random wireless networks

Sadhana - Academy Proceedings in Engineering Sciences

Volumn 31, Issue 2, 2006, Pages 117-139

  Iyer, Srikanth K ^a   Manjunath, D ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Geometric random graphs; Topology properties; Wireless networks

Indexed keywords

GEOMETRIC RANDOM GRAPHS; TOPOLOGY PROPERTIES; WIRELESS NETWORKS;

ASYMPTOTIC STABILITY; BIBLIOGRAPHIES; RANDOM PROCESSES; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

TELECOMMUNICATION NETWORKS;

EID: 33646800137     PISSN: 02562499     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02719777     Document Type: Article

References (33)

1. d. Adv. Appl. Probab. 29: 567-581
2. d. Adv. Appl. Prob. 29: 582-594
3. Bettstetter C, Hartmann C 2005 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
4. Bollobas B 1985 Random graphs (Academic Press)
5. Borkar V S, Manjunath D 2005 A distributed control law for incremental power adaptation based topology control of ad hoc wireless networks. In Proceedings of WiOpt-05, Trentino, Italy
6. Cheng Y C, Robertazzi T 1989 Critical connectivity phenomena in multihop radio models. IEEE Trans. Commun. 37: 770-777
7. Desai M P, Manjunath D 2002 On the connectivity in finite ad-hoc networks. IEEE Commun. Lett. 6: 237-239
8. Desai M P, Manjunath D 2005 On range matrices and wirelesss networks in d-dimensions. In Proceedings of WiOpt-05, Trentino, Italy
9. 2. In Randomization and approximation techniques in computer science, Proc. Second Int. Workshop, RANDOM'98 (eds) M Luby, J D P Rolim, M J Serna (Lecture Notes in Computer Science 1518) (Berlin: Springer-Verlag)
10. Friedgut E, Kalai G 1996 Every monotone graph property has a sharp threshold. Proc. Am. Math. Soc. 124: 2993-3002
11. Giridhar A, Kumar P R 2005 Computing and communicating functions over sensor networks. IEEE J. Selected Areas Commun, (to appear)
12. Glaz J, Naus J, Wallenstein S 2001 Scan statistics (Springer)
13. Godehardt E, Jaworski J 1996 On the connectivity of a random interval graph. Random Struct. Algorithms 9: 137-161
14. Goel A, Rai S, Krishnamachari B 2004 Sharp thresholds for monotone properties in random geometric graphs. In ACM Symp. on Theory of Computing (STOC)
15. Grossglauser M, Tse D 2001 Mobility increases the capacity of wireless ad hoc networks. In Proc. of IEEE Infocom, Anchorage, Alaska
16. Gupta P, Kumar P R 1998 Critical power for asymptotic connectivity in wireless networks. In Stochastic analysis, control, optimization and applications: A volume in honor of W. H. Fleming (eds) W M McEneany, G Yin, Q Zhang (Boston: Birkhauser) pp 547-566
17. Gupta P, Kumar P R 2000 The capacity of wireless networks. IEEE Trans. Inf. Theor. 46: 388-404
18. Gupta P, Kumar P R 2003 Towards an information theory of large networks: An achievable rate region. IEEE Trans. Inf. Theor. 49: 1877-1894
19. lyer S K, Manjunath D, Gupta B 2005 On the topological properties of one dimensional exponential random geometric graph, (submitted)
20. oM), Taormina, Italy
21. Khude N, Kumar A, Karnik A 2005 Time and energy complexity of distributed computation in wirelss sensor networks. In Proc. IEEE Infocom
22. Kleinrock E, Silvester J A 1978 Optimum transmission radii in packet radio networks or why six is a magic number. In Proc. Natl. Telecommunications Conference, Birmingham, pp 04.3.1-5
23. Kumar A, Manjunath D, Kuri J 2004 Communication networking: An analytical approach (Morgan Kaufman)
24. Eeese R, Hurley S 2002 Methods and algorithms for radio channel assignment (Oxford: University Press)
25. McColm G L 2004 Threshold functions for random graphs on a line segment, Combinatorics, Probab. Comput. 13: 373-387
26. Panchapakesan P, Manjunath D 2001 On the transmission range in dense ad hoc radio networks. In Proc. SPCOMM 2001
27. Penrose M D 1997 The longest edge of the random minimal spanning tree. Ann. Appl. Probab. 7: 340361
28. Penrose M D 1999 On k-connectivity for a geometric random graph. Random Struct. Algorithms 15: 145-164
29. Penrose M D 2003 Random geometric graphs (Oxford: University Press)
30. Santi P, Blough D M 2003 The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Trans. Mobile Comput. 2: 25-39
31. Xie L L, Kumar P R 2004 A network information theory for wireless communication: Scaling laws and optimal operation. IEEE Trans. Inf. Theor. 50: 748-767
32. Xue F, Kumar P R 2004 The number of neighbours needed for connectivity of wireless networks. Wireless Networks 10: 169-181
33. Zuniga M, Krishnamachari B 2006 Optimal transmission radius for flooding in large scale sensor networks. J. Cluster Comput. (to appear)