On local algorithms for topology control and routing in ad hoc networks

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 220-229

  Jia, Lujun ^a   Rajaraman, Rajmohan ^a   Scheideler, Christian ^b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b Johns Hopkins University   (United States)

Author keywords

Ad hoc wireless networks; Adversarial model; Competitive analysis; Distributed algorithms; Mobile computing and communication; Routing; Spanners

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; NETWORK PROTOCOLS; ROUTERS; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

DISTRIBUTED ALGORITHMS;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 0038041044     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777412.777447     Document Type: Conference Paper

References (44)

1. M. Adler and C. Scheideler. Efficient communication strategies for ad-hoc wireless networks. Theory of Computing Systems, 33:337-391, 2000.
2. Y. Afek and E. Gafni. End-to-end communication in unreliable networks. In Proc. of the 7th IEEE Symp. on Principles of Distributed Computing (PODC), pages 131-148, 1988.
3. W. Aiello, B. Awerbuch, B. Maggs, and S. Rao. Approximate load balancing on dynamic and synchronous networks. In Proc. of the 25th ACM Symp. on Theory of Computing (STOC), pages 632-641, 1993.
4. W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Rosén. Adaptive packet routing for bursty adversarial traffic. In Proc. of the 30th ACM Symp. on Theory of Computing (STOC), pages 359-368, 1998.
5. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu. Universal stability results for greedy contention-resolution protocols. In Proc. of the 37th IEEE Symp. on Foundations of Computer Science (FOCS), pages 380-389, 1996.
6. M. Andrews, A. Fernández, A. Goel, and L. Zhang. Source routing and scheduling in packet networks. In Proc. of 42nd IEEE Symp. on Foundations of Computer Science (FOCS), October 2001.
7. S. Arya and M. Smid. Efficient construction of a bounded degree spanner with low weight. In Proceedings of 2nd European Symposium on Algorithms, pages 48-59, 1994.
8. F. M. auf der Heide, C. Schindelhauer, K. Volbert, and M. Grunewald. Energy, congestion and dilation in radio networks. In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 230-237, August 2002.
9. B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS), pages 158-167, 2001.
10. B. Awerbuch, A. Brinkmann, and C. Scheideler. Anycasting in adversarial systems:routing and admission control. In 30th International Colloquium on Automata, Languages,and Programming (ICALP), 2003.
11. B. Awerbuch and F. Leighton. A simple local-control approximation algorithm for multicommodity flow. In Proc. of the 34th IEEE Symp. on Foundations of Computer Science (FOCS), pages 459-468, 1993.
12. B. Awerbuch and F. Leighton. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. In Proc. of the 26th ACM Symp. on Theory of Computing (STOC), pages 487-496, 1994.
13. B. Awerbuch, Y. Mansour, and N. Shavit. End-to-end communication with polynomial overhead. In Proc. of the 30th IEEE Symp. on Foundations of Computer Science (FOCS), pages 358-363, 1989.
14. V. Bharghavan, A. Demers, S. Shenker, and L. Zhang. MACAW: A media access protocol for wireless LANs. In Proc. of the 1994 SIGCOMM Conference, pages 212-225, 1994.
15. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson. Adversarial queueing theory. In Proc. of the 28th ACM Symp. on Theory of Computing (STOC), pages 376-385, 1996.
16. A. Colvin. CSMA with collision avoidance. Computer Communications, 6(5):227-235, 1983.
17. D. Eppstein. Spanning trees and spanners. In J. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier, Amsterdam, 2000.
18. J. Freebersyser and B. Leiner. A DoD perspective on mobile ad hoc networks. In C. Perkins, editor, Ad Hoc Networking, pages 29-51. Addison-Wesley, 2001.
19. D. Gamarnik. Stability of adversarial queues via fluid models. In Proc. of the 29th IEEE Symp. on Foundations of Computer Science (FOCS), pages 60-70, 1998.
20. D. Gamarnik. Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks. In Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pages 206-214, 1999.
21. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Geometric spanner for routing in mobile networks. In Proceedings of the ACM Symposium on Mobile Ad Hoc Networking & Computing, October 2001.
22. A. Goel. Stability of networks and protocols in the adversarial queueing model for packet routing. In Proc. of the 10th ACM Symp. on Discrete Algorithms (SODA), pages 911-912, 1999.
23. M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert. Distributed maintenance of resource efficient wireless network topologies. In 8th International Euro-Par Conference, August 2002.
24. P. Gupta and P. Kumar. Capacity of wireless networks. IEEE Transactions on Information Theory, IT-46:388-404, 2000.
25. Y. Hassin and D. Peleg. Sparse communication networks and efficient routing in the plane. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 41-59, July 2000.
26. IEEE. Medium access control (mac) and physical specifications. IEEE P802.11/D10, January 1999.
27. H. H. III, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. S. tearns. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Journal of Algorithms, 26:238-274, 1999.
28. L. Jia, R. Rajaraman, and C. Scheideler. On local algorithms for topology control and routing in ad hoc networks. Technical report NU-CCS-02-07, Northeastern University, September 2002. An electronic copy is available from http://www.ccs.neu.edu/home/lujunjia/toporouting.ps.
29. P. Karn. MACA - A new channel access method for packet radio. In ARRL/CRRL Amateur Radio 9th Computer Networking Conference, pages 134-140, 1990.
30. B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Proceedings of ACM Symposium on Mobile Computing and Networking, pages 243-254, August 2000.
31. L. Li, J. Halpern, V. Bahl, Y.-M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In Proceedings of ACM Symposium on Principles of Distributed Computing, pages 264-273, August 2001.
32. X. Li, P. Wan, Y. Wang, and O. Frieder. Sparse power efficient topology for wireless networks. Journal of Parallel and Distributed Computing, 2002.
33. C. Perkins. Ad hoc networking: An introduction. In C. Perkins, editor, Ad Hoc Networking, pages 1-28. Addison-Wesley, 2001.
34. R. Ramanathan and R. Rosales-Hain. Topology control of multihop wireless networks using transmit power adjustment. In Proceedings of IEEE Infocom 2000, March 2000.
35. T. Rappaport. Wireless Communications: Principles and Practices. Prentice Hall, 1996.
36. J. Salowe. Euclidean spanner graphs with degree four. Discrete Applied Mathematics, 54:55-66, 1994.
37. C. Scheideler and B. Vöcking. From static to dynamic routing: Efficient transformations of store-and-forward protocols. In Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pages 215-224, 1999.
38. M. Steenstrup. Cluster-based networks. In C. Perkins, editor, Ad Hoc Networking, pages 75-138. Addison-Wesley, 2001.
39. G. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12:261-268, 1980.
40. P. Tsaparas. Stability in adversarial queueing theory. Master's thesis, Dept. of Computer Science, University of Toronto, 1997.
41. P. Varaiya and J. Walrand. High-Performance Communication Networks. Morgan Kaufmann, 2000. Chapter 7.
42. Y. Wang and X. Li. Distributed spanner with bounded degree for wireless ad hoc networks. In Parallel and Distributed Computing Issues in Wireless networks and Mobile Computing, April 2002.
43. R. Wattenhofer, L. Li, P. Bahl, and Y. Wang. Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In Proceedings of IEEE Infocom, 2001.
44. A. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721-736, 1982.