Skip to main content

Asymmetric Link Dynamic Routing Algorithm for Ubiquitous Multimedia Services

  • Conference paper
Advances in Multimedia Modeling (MMM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4352))

Included in the following conference series:

Abstract

In this paper, we propose an asymmetric link dynamic routing algorithm for ubiquitous multimedia services named DRAMA (Dynamic Routing Algorithm for asymmetric link in Mobile Ad hoc networks). The proposed algorithm allows a first sink node of the unidirectional link to detect the unidirectional link and its reverse route and provide information regarding the reverse route to other sink nodes, thereby minimizing unnecessary flows and effectively using the unidirectional link. DRAMA also incooperates redirection process that actively supports a unidirectional link generated during data transmission to deal with a topology change due to the movement of node. Further, we shows the superiority of DRAMA to the existing algorithms in terms of a delay in data transmission, throughput, and transmission overhead through simulation study.

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. Perkins, C., Belding-Royer, E., Das, S.: Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561 (July 2003)

    Google Scholar 

  2. Prakash, R.: Unidirectional Links Prove Costly in Wireless Ad Hoc Networks. In: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, August 1999, pp. 15–22 (1999)

    Google Scholar 

  3. Nesargi, S., Prakash, R.: A Tunneling Approach to Routing with Unidirectional Links in Mobile Ad-Hoc Networks. In: Proceedings of the Ninth International Conference on Computer Communications and Networks, pp. 522–527 (2000)

    Google Scholar 

  4. Agarwal, S.: Handling Unidirectional Links in Ad Hoc Wireless Networks. In: DARPA (2000)

    Google Scholar 

  5. Kim, D., Toh, C.-K., Choi, Y.: On Supporting Link Asymmetry in Mobile Ad Hoc Networks. IEEE GLOBECOM 5, 2798–2803 (2001)

    Google Scholar 

  6. Ramasubramanian, V., Chandra, R., Mosse, D.: Providing a Bidirectional Abstraction for Unidirectional Ad Hoc Networks. IEEE INFOCOM 3, 1258–1267 (2002)

    Google Scholar 

  7. QualNet Network Simulator, http://www.scalable-networks.com/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suh, JJ., Quan, S.G., Park, J.D., Park, J.H., Kim, Y.Y. (2006). Asymmetric Link Dynamic Routing Algorithm for Ubiquitous Multimedia Services. In: Cham, TJ., Cai, J., Dorai, C., Rajan, D., Chua, TS., Chia, LT. (eds) Advances in Multimedia Modeling. MMM 2007. Lecture Notes in Computer Science, vol 4352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69429-8_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69429-8_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69428-1

  • Online ISBN: 978-3-540-69429-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics