Skip to main content
SpringerLink
Log in

A Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Most of the routing algorithms for ad hoc networks assume that all wireless links are bidirectional. In reality, some links may be unidirectional. In this paper we show that the presence of such links can jeopardize the performance of the existing distance vector routing algorithms. We also present modifications to distance vector based routing algorithms to make them work in ad hoc networks with unidirectional links. For a network of n nodes, neighbors exchange n×n matrices to propagate routing information. This results in loop-free routes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D.J. Baker and A. Ephremides, The architectural organization of a mobile radio network via a distributed algorithm, IEEE Transactions on Communications COM-29(11) (November 1981) 1694–1701.

    Google Scholar 

  2. D.J. Baker, A. Ephremides and J.A. Flynn, The design and simulation of a mobile radio network with distributed control, IEEE Journal on Selected Areas in Communications (1984) 226–237.

  3. B. Das and V. Bharghavan, Routing in ad–hoc networks using minimum connected dominating sets, Proceedings of ICC (1997).

  4. B. Das, R. Sivakumar and V. Bharghavan, Routing in ad-hoc networks using a spine, in: Proceedings of IEEE IC3N (1997).

  5. E. Gafni and D. Bertsekas, Distributed algorithms for generating loopfree routes in networks with frequently changing topology, IEEE Transactions on Communications (January 1984) 11–18.

  6. IEEE, P802.11, IEEE Draft Standard for Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specification, D2.0 (July 1995).

  7. Internet Engineering Task Force, www.ietf.org/htmlcharters/udlr-charter.html (1999).

  8. D.B. Johnson and D.A. Maltz, Dynamic source routing in ad-hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic, 1996).

  9. V.D. Park and M.S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proceedings of IEEE INFOCOM (April 1997).

  10. C. Perkins and E.M. Royer, Ad hoc on demand distance vector (AODV) routing, Internet Draft, draft-ietf-manet-aodv-02.txt (November 1998).

  11. C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, in: Proceedings of ACM SIGCOMM Conference on Communication Architectures, Protocols and Applications (August 1994) pp. 234–244.

  12. F. Tobagi and L. Kleinrock, Packet switching in radio channels: Part II — The hidden terminal problem in carrier sense multiple access and the busy tone solution, IEEE Transactions on Communications (December 1975) 1417–1433.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083-0688, USA

    Ravi Prakash

Authors
  1. Ravi Prakash
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prakash, R. A Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links. Wireless Networks 7, 617–625 (2001). https://doi.org/10.1023/A:1012371402221

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012371402221

Search

Navigation