Skip to main content

A Link-Disjoint Interference-Aware Multi-Path Routing Protocol for Mobile Ad Hoc Network

  • Conference paper
Digital Information and Communication Technology and Its Applications (DICTAP 2011)

Abstract

A mobile ad hoc network (MANET) is the network without any pre-existing communication infrastructure. Wireless mobile nodes can freely and dynamically self-organize into arbitrary and temporary network topologies. In MANET, the influence of interference is very significant for the network performance such as data loss, conflict, retransmission and so on. Therefore, interference is one of the factors that has the greatest impact to network performance. Reducing interference on the paths is a critical problem in order to increase performance of the network. In this paper, we propose a formula of interference and a novel Link-disjoint Interference-Aware Multi-Path routing protocol (LIA-MPOLSR) that was based on the Optimized Link State Routing protocol (OLSR) for MANET to increase the stability and reliability of the network. The more difference between LIA-MPOLSR and the other multi-path routing protocols is that LIA-MPOLSR calculates interference by taking into account of the geographic distance between nodes instead of hop-by-hop. We also use a mechanism to check theĀ  status of the received node before the data is transmitted through this node to increase transmission effects. From our simulation results, we show that the LIA-MPOLSR outperforms IA-OLSR, the original OLSR and OLSR-Feedback, measured by comparing packet delivery fraction, routing overhead and normalized routing load.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Marina, M.K., Das, S.R.: On-demand Multipath Distance Vector Routing for Ad Hoc Networks. In: Proc. of 9th IEEE Int. Conf. On Network Protocols, pp. 14ā€“23 (2001)

    Google ScholarĀ 

  2. Zhou, X., Lu, Y., Xi, B.: A novel routing protocol for ad hoc sensor networks using multiple disjoint paths. In: 2nd International Conference on Broadband Networks, Boston, MA, USA (2005)

    Google ScholarĀ 

  3. Jiazi, Y., Eddy, C., Salima, H., BenoƮt, P., Pascal, L.: Implementation of Multipath and Multiple Description Coding in OLSR. In: 4th Introp/Workshop, Ottawa, Canada

    Google ScholarĀ 

  4. Clausen, T., Jacquet, P.: IETF Request for Comments: 3626, Optimized Link State Routing Protocol OLSR (October 2003)

    Google ScholarĀ 

  5. UM-OLSR, http://masimum.dif.um.es/?Software:UM-OLSR

  6. Xinming, Z., Qiong, L., Dong, S., Yongzhen, L., Xiang, Y.: An Average Link Interference-aware Routing Protocol for Mobile Ad hoc Networks. In: Conference on Wireless and Mobile Communications, ICWMC 2007 (2007)

    Google ScholarĀ 

  7. Xu, K., Gerla, M., Bae, S.: Effectiveness of RTS/CTS handshake in IEEE 802.11 based ad hoc networks. Journal of Ad Hoc NetworksĀ 1(1), 107ā€“123 (2003)

    ArticleĀ  Google ScholarĀ 

  8. Perkins, C.E., Royer, E.M.: Ad-Hoc on demand distance vector routing. In: IEEE Work-Shop on Mobile Computing Systems and Applications (WMCSA) New Orleans, pp. 90ā€“100 (1999)

    Google ScholarĀ 

  9. Perkins, C.E., Royer, E.M.: Ad Hoc On Demand Distance Vector (AODV) Routing. Draft-ietf-manet- aodv-02.txt (November 1998) (work in progress)

    Google ScholarĀ 

  10. David, B.J., David, A.M., Josh, B.: DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. In: Ad Hoc Networking, pp. 139ā€“172. Addison-Wesley, Reading (2001)

    Google ScholarĀ 

  11. Olsrd, an adhoc wireless mesh routing daemon, http://www.olsr.org/

  12. Perkins, C.E., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: Proceedings of ACM Sigcomm (1994)

    Google ScholarĀ 

  13. Burkhart, M., Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: Proc. of ACM MobiHoc (2004)

    Google ScholarĀ 

  14. Johansson, T., Carr-Motyckova, L.: Reducing interference in ad hoc networks through topology control. In: Proc. of the ACM/SIGMOBILE Workshop on Foundations of Mobile Computing (2005)

    Google ScholarĀ 

  15. Haas, Pearlman: Zone Routing Protocol (1997)

    Google ScholarĀ 

  16. Moaveni-Nejad, K., Li, X.: Low-interference topology control for wireless ad hoc networks. Ad Hoc& Sensor Wireless Networks: an International Journal (2004)

    Google ScholarĀ 

  17. Lee, S.J., Gerla, M.: Split Multi-Path Routing with Maximally Disjoint Paths in Ad Hoc Networks. In: IEEE ICC 2001, pp. 3201ā€“3205 (2001)

    Google ScholarĀ 

  18. Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proceedings of IEEE Infocom (1997)

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Le, P.H., Pujolle, G. (2011). A Link-Disjoint Interference-Aware Multi-Path Routing Protocol for Mobile Ad Hoc Network. In: Cherifi, H., Zain, J.M., El-Qawasmeh, E. (eds) Digital Information and Communication Technology and Its Applications. DICTAP 2011. Communications in Computer and Information Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21984-9_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21984-9_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21983-2

  • Online ISBN: 978-3-642-21984-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics