The bin-covering technique for thresholding random geometric graph properties

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 989-998

  Muthukrishnan, S ^a   Pandurangan, Gopal ^b  

^a RUTGERS UNIVERSITY   (United States)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; MATHEMATICAL MODELS; RANDOM PROCESSES; ROUTERS; TELECOMMUNICATION NETWORKS;

BIN-COVERING TECHNIQUES; NETWORKING COMMUNITY; PERCOLATION THEORY; RANDOM GRAPHS;

GRAPH THEORY;

EID: 20744446134     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. W. Aiello, F. Chung-Graham and L. Lu. Random evolution of massive graphs, in Handbook on Massive Data Sets, (Eds. James Abello et al.), Kluwer Academic Publishers, (2002), 97-122.
2. Extended abstract appeared in FOGS 2001, 510-519.
3. N. Alon and J. Spencer. The Probabilistic Method, John Wiley, 2000.
4. D. Aldous. http://stat-www.berkeley.edu/users/aldous/Networks/, Spring 2003.
5. d, Statistics and Probability Letters, 60, 351-357.
6. d, Adv. Appl. Prob., 567-581, 1997.
7. d, Adv. Appl. Prob., 582-594, 1997.
8. B. Bollobas. Random Graphs, Cambridge University Press, 2001.
9. J. Dali and M. Christensen. Random Geometric Graphs, Phys. Rev. E, 66(1): 016121, 9, 2002.
10. B. Deb, S. Bhatnagar and B. Nath. A topology discovery algorithm for sensor networks with applications to network management. Tech Report DCS-TR 441, Rutgers Univ., athos.rutgers.edu/dataman/papers.html, 2002.
11. L. Devroye. A Log Log Law for maximal uniform spacings. Ann. Probab., 26, 67-80, 1982.
12. 2, Randomization and Approximation Techniques in Computer Science, 1518, Lecture Notes in Computer Science, 294-306, 1998.
13. J. Diaz, M. Penrose, J. Petit, and M. Serna. Linear ordering of random geometric graphs, Graph Theoretic Concepts in Computer Science, 1665, Lecture Notes in Computer Science, 1999.
14. p metric, to appear in the 12th International Symposium on Graph Drawing, 2004.
15. R. Ellis, X. Jia, and C. Yan. On Random Points in the Unit Disk, http://www.math.tamu.edu/rellis/, 2004.
16. A. Flaxman, A. Frieze, and E. Upfal. Efficient Communication in an Ad-hoc Network. Journal of Algorithms, 52, 1-7, 2004.
17. D. Ganesan, R. Govindan, S. Shenker and D. Estrin. Highly resilient, Energy-efficient Multipath Routing in Wireless Sensor Networks. Mobile Computing and Communication Review, Vol 1, No. 2, 2002.
18. A. Goel, S. Rai, and B. Krishnamachari. Sharp Thresholds for Monotone Properties for Random Geometric Graphs, Proc. of ACM STOC, 2004.
19. P. Gupta and P. Kumar. Critical Power for Asympototic Connectivity in Wireless Networks, in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W. M. McEneaney, G. Yin, and Q. Zhang (Eds.), Birkhuser, Boston, 1998.
20. P. Gupta and P. R. Kumar, The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2), 2000, pp. 388-404.
21. P. Hall. Introduction to the Theory of Coverage Processes, John Wiley, 1988.
22. P. Jaillet. On Properties of Geometric Random Graph Problems in the Plane, Annals of Operations Research, 61, 1-20, 1995.
23. J. Kleinberg. The small-world phenomenon: An algorithmic perspective, in Proc. 32nd ACM Symposium on Theory of Computing, 2000.
24. J. Kleinberg, S.R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins. The Web as a graph: Measurements, models and methods. Invited survey at the 5th Annual International Computing and Combinatorics conference (COCOON), 1999.
25. B. Krishnamachari, S. Wicker, R. Bejar and M. Pearlman. Critical density thresholds in distributed wireless networks, in Proc. of GLOBECOM, 2001.
26. Enlarged version to appear in Communications, Information and Network Security, eds. H. Bhargava, H.V. Poor, V. Tarokh, and S. Yoon, Kluwer Publishers, 2002.
27. S. Meguerdichian, F. Koushanfar, M. Potkonjak and M. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In Proc. of INFOCOM 2001, 1380-1387.
28. R. Meester and R. Roy. Continuum Percolation, Cambridge University Press, 1996.
29. S. Muthukrishnan and G. Pandurangan. The Bincovering Technique for Thresholding Geometric Graph Properties, DIMACS Technical Report 2003-39, Nov. 2003.
30. G. Narasimhan and M. Smid. Approximating the Stretch Factor of Euclidean Graphs, SIAM Journal of Computing, 30, 978-989, 2000.
31. M.D. Penrose. Random Geometric Graphs, Oxford University Press, 2003.
32. M.D. Penrose. The longest edge of the random minimal spanning tree, Annals of Applied Probability, 7, 1997, 340-361.
33. M. Penrose. On k-Connectivity for a Geometric Random Graph. Random Structures and Algorithms, 15, 145-164, 1999.
34. T. Phillips, S. Panwar and A. Tantawi. Connectivity properties of a packet radio network model. IEEE Trans on Information Theory, 35(5), 1044-1047, 1989.
35. P. Piret. On the connectivity of radio networks. IEEE Trans on Information Theory, 37(5), 1490-1492, 1991.
36. P. Santi and D. Blough. The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks, IEEE Transactions on Mobile Computing, 2(1), 2003, pp. 25-39.
37. A. Tsirigos, Z. Haas, S. Tabrizi. Multipath routing in mobile adhoc networks or how to route in the presence of topological changes. IEEE MILCOM, 2001.