Skip to main content

A New Routing Protocol in Ad Hoc Networks with Unidirectional Links

  • Conference paper
Distributed Computing – IWDC 2005 (IWDC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3741))

Included in the following conference series:

Abstract

Most of the proposed algorithms in ad hoc networks assume homogeneous nodes with similar transmission range and capabilities. However, in heterogeneous ad hoc networks, it is not necessary that all nodes have bidirectional link with each other and hence, those algorithms may not perform well while deployed in real situations. In this paper, we propose a scheme for an ad hoc on-demand routing protocol which utilizes the unidirectional links during the data transmission. Simulation shows that it is not only possible to use unidirectional links but it is also better in terms of performance metrics we defined in different situations.

This work was supported by the Korea Research Foundation Grant funded by the Korean Government (R05-2003-000-10607-02004) and and also supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC support program.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ko, Y.-B., Lee, S.-J., Lee, J.-B.: Ad Hoc Routing with Early Unidirectionality Detection and Avoidance. In: Niemegeers, I.G.M.M., de Groot, S.H. (eds.) PWC 2004. LNCS, vol. 3260, pp. 132–146. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Perkins, C., Royer, E., Das, S.: Ad-hoc on-demand distance vector (AODV) routing. IETF, RFC 3561 (July 2003)

    Google Scholar 

  3. Marina, M.K., Das, S.R.: Routing performance in the Presence of Unidirectional Links in Multihop Wireless Networks. In: Proc. of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC) (June 2002)

    Google Scholar 

  4. Prakash, R.: A routing algorithm for wirelss ad hoc networks with unidirectional links. ACM/Kluwer Wireless Networks 7(6), 617–625

    Google Scholar 

  5. Johanson, P., Maltz, D.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, Ch.5, pp. 153–181. Kluwer Publishing Company, Dordrecht (1996)

    Chapter  Google Scholar 

  6. Ramasubramanian, V., Chandra, R., Mosse, D.: Providing Bidirectional Abstraction for Unidirectional Ad Hoc Networks. In: Proc. of the 21st IEEE INFOCOM (June 2002)

    Google Scholar 

  7. Bao, L., Garcia-Luna-Aceves, J.J.: Link state routing in networks with unidirectional links. In: Proc of IEEE ICCCN, October 1999 (June 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shrestha, D.M., Ko, YB. (2005). A New Routing Protocol in Ad Hoc Networks with Unidirectional Links. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_32

Download citation

  • DOI: https://doi.org/10.1007/11603771_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30959-8

  • Online ISBN: 978-3-540-32428-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics