IDEAS home Printed from https://ideas.repec.org/a/igg/jitn00/v11y2019i4p48-62.html
   My bibliography  Save this article

A New AOMDV Lifetime Prolonging Routing Algorithm for Ad-Hoc Networks

Author

Listed:
  • Ibtihel Baddari

    (Limose Laboratory, Department of Computer Science M'hamed, Bouguerra University, Algeria)

  • Mohamed Amine Riahla

    (Limose Laboratory, Department of Computer Science M'hamed, Bouguerra University, Algeria)

  • Mohamed Mezghiche

    (Limose Laboratory, Department of Computer Science M'hamed, Bouguerra University, Algeria)

Abstract

Network lifetime is a key design metric in MANETs, it is considered as one of the most important parameters algorithms to be used in ad hoc networks. Each network node works completely independently and acts as a router for relaying communications. If some nodes die prematurely because of battery depletion, the network lifetime will be adversely affected, and the network will get disconnected. This article presents AOMDV-LP, a new AOMDV lifetime-prolonging routing algorithm for MANETs. This new algorithm helps to maximize the network lifetime by managing nodes energy, link cost and controlling the networks congestion. Simulations quantify the performance gains of the authors algorithm.

Suggested Citation

  • Ibtihel Baddari & Mohamed Amine Riahla & Mohamed Mezghiche, 2019. "A New AOMDV Lifetime Prolonging Routing Algorithm for Ad-Hoc Networks," International Journal of Interdisciplinary Telecommunications and Networking (IJITN), IGI Global, vol. 11(4), pages 48-62, October.
  • Handle: RePEc:igg:jitn00:v:11:y:2019:i:4:p:48-62
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJITN.2019100104
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jitn00:v:11:y:2019:i:4:p:48-62. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.