skip to main content
10.1145/313239.313263acmconferencesArticle/Chapter ViewAbstractPublication PagesdialmConference Proceedingsconference-collections
Article
Free Access

Unidirectional links prove costly in wireless ad hoc networks

Authors Info & Claims
Published:01 August 1999Publication History
First page image

References

  1. 1.D. J. Baker and A. Ephremides. The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm. IEEE Transactions on Communications, CO M-29(11): 1694- 170 i, November 1981.Google ScholarGoogle ScholarCross RefCross Ref
  2. 2.D.J. Baker, A. Ephremides, and J. A. Flynn. The Design and Simulation of a Mobile Radio Network with Distributed Control. {EEE Journal on Selected Areas in Communications, pages 226-237, 1984.Google ScholarGoogle Scholar
  3. 3.K. Chandran, S. Raghunathan, S. Venkatesan, and R. Prakash. A Feedback Based Scheme for Improving TCP Performance in Ad-Hoc Wireless Networks. In Proceedings of the 18ta International Conference on Distributed Computing Systems (ICDCS'98), pages 472-479. IEEE, May 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.K. M. Chandy and J. Misra. The Drinking Philosophers Problem. A CM Transactions on Programming Languages and Systems, 6(4):632-646, October 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.B. Das and V. Bharghavan. Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets. In Proceedings of ICC, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.B. Das, R. Sivakumar, and V. Bharghavan. Routing in Ad-Hoc Networks Using a Spine. In Proceedings of IEEE IC3N, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.E. Gafni and D. Bertsekas. Distributed AI- gorithms for Generating Loop-free Routes in Networks with Frequently Changing Topology. IEEE Transactions on Communications, pages 11-18, January 1981.Google ScholarGoogle Scholar
  8. 8.I EEE. P8(}2.1 l. IEEE Draft Standard for W.ireles.s LA N Medium A cce.ss' Control (MA C) and Physical Layer (PHI/) Specification, D2.0, July 1995. .Google ScholarGoogle Scholar
  9. 9.D. B. Johnson and D. A. Maltz. Dynamic Source Routing in Ad-Hoc Wireless Networks. In T. Imielinski and H. Korth, editors, Mobile Computing. Kluwer Academic Publishers, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  10. 10.T.V. Lakshman, U. Madhow, and B. Surer. Window-based error recovery and flow control with a slow acknowledgment channel: a study of TCP/IP performance. In Proceedings of IN- FOCOM. iEEE, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.S. Nesargi and R. Prakash. Distributed Wireless Channel Allocation in Networks with Mobile Base Stations. {n Proceedings of IEEE IN- FOCOM'99, New York, N.Y., March 1999.Google ScholarGoogle Scholar
  12. 12.V. D. Park and M. S. Corson. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In Proceedings of IEEE IN- FOCOM, April 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.V. Paxson. End-to-End Routing Behavior in the Internet. IEEE/A CM Transactions on Networking, 5(5):601-615, October 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.C. Perkins. Ad Hoc On Demand Distance Vect. or (AODV) Routing. lnternet-Draft., draftietf-manet-aodv-02.txt, November 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.C.E. Perkins and P. Bhagwat. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In Proceedings of A CM SIGCOMM Conference on Communication Architectures, Protocols and Applications, pages 234-244, August 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.M. Singhal. A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems. IEEE Transactions on Parallel and Distributed Systems, 3(1):121-125, January 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.A. Tanenbaum. Computer Networks(3ra Edition). Prentice Hall, Upper Saddle River, N.J., 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.J. Walter, J.L. Welch, and N. Vaidya. A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks. In Proceedings of the 2'~ International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M for Mobility), Dallas, October 1998.Google ScholarGoogle Scholar

Index Terms

  1. Unidirectional links prove costly in wireless ad hoc networks

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              DIALM '99: Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
              August 1999
              92 pages
              ISBN:1581131747
              DOI:10.1145/313239

              Copyright © 1999 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 August 1999

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate21of68submissions,31%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader