Efficient communication strategies for ad hoc wireless networks

Theory of Computing Systems

Volumn 33, Issue 5-6, 2000, Pages 337-391

  Adler, M ^a   Scheideler, C ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; MOBILE AD HOC NETWORKS; NETWORK ROUTING; OPTIMIZATION; POWER CONTROL; WIRELESS NETWORKS;

AD HOC WIRELESS NETWORKS; ARBITRARY PERMUTATIONS; ASYMPTOTICALLY OPTIMAL; CENTRALIZED ADMINISTRATION; EFFICIENT COMMUNICATIONS; NODE-TO-NODE COMMUNICATION; RELIABLE COMMUNICATION; SCHEDULING STRATEGIES;

WIRELESS AD HOC NETWORKS;

EID: 0034560193     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240010006     Document Type: Article

References (42)

1. N. Alon, A. Bar-Noy, N. Linial, D. Peleg. A lower bound for radio broadcast. J. Comput. System Sci. 43(2), 290-298, 1991.
2. N. Alon, F.R.K. Chung, R.L. Graham. Routing permutations on graphs via matchings. SIAM J. Discrete Math. 7(3), 513-530, 1994.
3. R. Bar-Yehuda, O. Goldreich, A. Itai. On the time complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. System Sci. 45, 104-126, 1992.
4. R. Bar-Yehuda, A. Israeli, A. Itai. Multiple communication in multihop radio networks. SIAM J. Comput. 22(4), 875-887, 1993.
5. S. Boztas. A robust multi-priority topology-independent transmission schedule for packet radio networks. Inform. Process. Lett. 55, 291-295, 1995.
6. D. Brushi, M. Del Pinto. Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10, 129-135, 1997.
7. K.-C. Chen. Medium access control of wireless LANs for mobile computing. IEEE Network 8(5), 50-63, 1994.
8. I. Chlamtac, A. Farago. Making transmission schedules immune to topology changes in multi-hop packet radio networks. IEEE/ACM Trans. Networking 2, 23-29, 1994.
9. I. Chlamtac, S. Kutten. On broadcasting in radio networks - problem analysis and protocol design. IEEE Trans. Comm. 33(12), 1240-1246, 1985.
10. I. Chlamtac, S. Pinter. A distributed nodes organization algorithm for channel access in a multi-hop dynamic radio network. IEEE Trans. Comput. 36, 728-737, 1987.
11. I. Chlamtac, O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Comm. 39(3), 426-433, 1991.
12. I. Cidon, M. Sidi. Distributed assignment algorithms for multihop packet radio networks. IEEE Trans. Comput. 38(10), 1353-1361, 1989.
13. R. Cole, B. Maggs, R. Sitaraman. Reconfiguring arrays with random faults. SIAM J. Comput. 26(6), 1581-1611, 1997.
14. R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking. Universal algorithms for store-and-forward and wormhole routing. In Proc. of the 28th Ann. ACM Symp. on Theory of Computing, pp. 356-365, 1996.
15. B. Das, R. Sivakumar, V. Bharghavan. Routing in ad-hoc networks using a virtual backbone. To appear in IEEE IC3N 97.
16. S. Dolev, E. Kranakis, D. Krizanc, D. Peleg. Bubbles: adaptive routing scheme for high-speed dynamic networks. In Proc. of the 27th Ann. ACM Symp. on Theory of Computing, pp. 528-537, 1995.
17. U. Feige, J. Kilian. Zero knowledge and the chromatic number. In Proc. of the Eleventh Ann. IEEE Conf. on Computational Complexity, pp. 278-287, 1996
18. I. Gaber, Y. Mansour. Broadcast in radio networks. In SODA '95, pp. 577-582, 1995.
19. R. Gallager. A perspective on multiaccess channels. IEEE Trans. Inform. Theory, Special Issue on Random Access Communications, 31, 124-142, 1985.
20. J.D. Gibson (Ed.). The Mobile Communications Handbook. CRC Press, Boca Raton, FL, 1996.
21. F.K. Hwang. The time complexity of deterministic broadcast radio networks. Discrete Appl. Math. 60, 219-222, 1995.
22. T. Imielinski, H. Korth (Eds.). Mobile Computing. Kluwer Academic, Dordrecht, 1996.
23. J.M. Jacobsmeyer. Congestion relief on power-controlled CDMA networks. IEEE J. Sel. Areas Commun. 18(9), 1758-1761, 1996.
24. D.B. Johnson, D.A. Maltz. Protocols for adaptive wireless and mobile networking. IEEE Personal Comm. 3(1), 34-42, 1996.
25. C. Kaklamanis, A.R. Karlin, F.T. Leighton, V. Milenkovic, P. Raghavan, S.B. Rao, C. Thomborson, A. Trantilas. Asymptotically tight bounds for computing with faulty arrays of processors. In Proc. of the 31st Ann. IEEE Symp. on Foundations of Computer Science, pp. 285-296, 1990.
26. L.M. Kirousis, E. Kranakis, D. Krizanc, A. Pelc. Power consumption in packet radio networks. In STACS '97, pp. 363-374, 1997.
27. E. Kushilevitz, Y. Mansour. An Ω(D log(N/D)) lower bound for broadcast in radio networks. In PODC '93, pp. 65-74, 1993.
28. F.T. Leighton, B.M. Maggs, S.B. Rao. Universal packet routing algorithms. In Proc. of the 29th Ann. Symp. on Foundations of Computer Science, pp. 256-271, 1988.
29. F. Meyer auf der Heide, C. Scheideler. Deterministic routing with bounded buffers: turning offline into online protocols. In Proc. of the 31th Ann. IEEE Symp. on Foundations of Computer Science, pp. 370-379, 1996.
30. R. Motwani, P. Rahgavan (Eds.). Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
31. A. Myles, D.B. Johnson, C.E. Perkins. A mobile host protocol supporting route optimization and authentication. IEEE J. Sel. Areas Commun., Special Issue on Mobile and Wireless Computing Networks, 13(5), 839-349, 1995.
32. P. Piret. On the connectivity of radio networks. IEEE Trans. Inform. Theory 37(5), 1490-1492, 1991.
33. M.J. Post, P.E. Sarachik, A.S. Kershenbaum. A distributed evolutionary algorithm for reorganizing network communications. In Proc. IEEE MILCOM, 1985.
34. Y. Rabani, É. Tardos. Distributed packet switching in arbitrary networks. In Proc. of the 28th Ann. ACM Symp. on Theory of Computing, pp. 366-375, 1996.
35. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. System Sci. 37, 130-143, 1988.
36. P. Raghavan. Robust algorithms for packet routing in a mesh. In Proc. of the 1st Ann. Symp. on Parallel Algorithms and Architectures, pp. 344-350, 1989.
37. K. Ravishankar, S. Singh. Asymptotically optimal gossiping in radio networks. Discrete Appl. Math. 61, 61-82, 1995.
38. L.G. Roberts. Aloha Packet System with and without Slots and Capture, ASS Notes 8, Advanced Research Projects Agency, Network Information Center, Stanford Research Institute, Stanford, CA, 1972.
39. A. Sen, M. Huson. A new model for scheduling packet radio networks. In Proc. of the 15th Ann. Joint Conf. of the IEEE Computer and Communication Societies INFOCOM, pp. 1116-1124, 1996.
40. S. Ulukus, R.D. Yates. Stochastic power control for cellular radio systems. IEEE Trans. Commun. 46(6), 784-798, 1998.
41. L.G. Valiant. A scheme for fast parallel communication. SIAM J. Comput. 11(2), 350-361, 1982.
42. O. Weinstein. The Wave Expansion Approach to Broadcasting in Multihop Networks. M.Sc. Thesis, Computer Science Department, Technion, Haifa, 1987.