Line-of-sight networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 968-977

  Frieze, Alan ^a   Kleinberg, Jon ^b   Ravi, R ^c   Debany, Warren ^d  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d AIR FORCE RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

WIRELESS NETWORKS;

FUNDAMENTAL MODELS; INDOOR ENVIRONMENT; LINE-OF-SIGHT ACCESS; NEAR-SHORTEST PATHS; RANDOM GEOMETRIC GRAPHS; RANDOM GRAPH MODELS; THE STANDARD MODEL; WIRELESS NETWORKING;

GRAPH THEORY;

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

References (23)

1. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley, (second edition) 2000.
2. C. Bettstetter. On the minimum node degree and connectivity of a wireless multihop network. Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '02), pages 80-91, June 2002.
3. C. Bettstetter. On the connectivity of ad hoc networks. The Computer Journal, Special Issue on Mobile and Pervasive Computing, vol. 47, no. 4, pp. 432-447, 2004.
4. B. Bollobás. Random Graphs (2nd edition). Cambridge University Press, 2001.
5. B. Bollobás and V. Klee. Diameters of random bipartite graphs. Combinatorica 4 (1984) 7-19
6. M. Chrobak, J. Naor, and M. Novick. Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs. In Proceedings of the Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science Vol 382, pages 147-162.
7. J. Deuschel and A. Pisztora, Surface order large deviations for high-density percolation. Probability Theory and Related Fields 104 (1996) 467-482.
8. A. Efrat, S. Har-Peled. Locating Guards in Art Galleries. 2nd IFIP International Conference on Theoretical Computer Science 2002, 181-192.
9. A. Efrat, S. Har-Peled, J. S. B. Mitchell. Approximation Algorithms for Two Optimal Location Problems in Sensor Networks. Broadnets 2005.
10. A.M. Frieze and M. Molloy, Splitting an expander graph, Journal of Algorithms 33 (1999) 166-172.
11. A. Goel, S. Rai, and B. Krishnamachari. Sharp thresholds for monotone properties in random geometric graphs. ACM Symposium on Theory of Computing, 2004.
12. G. Grimmett. Percolation. Springer-Verlag, 1989.
13. P. Gupta and P. 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. McEneaney, G. Yin, and Q. Zhang, Eds.) Birkhauser, Boston, 1998.
14. P. Gupta and P. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, vol. 46, no. 2, March 2000, pp. 388-404. Also: A correction to the proof of a lemma in 'The capacity of wireless networks.' IEEE Transactions on Information Theory, vol. 49, no. 11, November 2000, p. 3117.
15. G. Kalai and J. Matousek. Guarding galleries where every point sees a large area. Israel Journal of Math., 101:125-139, 1997.
16. Philip N. Klein, R. Ravi: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. J. Algorithms 19(1): 104-115 (1995)
17. M. Mauve, J. Widmer, H. Hartenstein. A Survey on Position-Based Routing in Mobile Ad Hoc Networks. IEEE Network, Nov/Dec 2001.
18. Mobile Ad-hoc Networks (MANET) Charter, http://www.ietf.org/html.charters/manet-charter.html
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. M.D. Penrose. Random Geometric Graphs, vol. 5 of Oxford Studies in Probability. Oxford University Press, 2003.
21. G. Robins and A. Zelikovsky. Improved Steiner Tree Approximation in Graphs. In Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 770-779, 2000.
22. E. Royer and C.-K. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications, 1999.
23. P. Valtr. Guarding galleries where no point sees a small area. Israel Journal of Mathematics, vol. 104, pp. 1-16, 1998.