• DocumentCode
    2002594
  • Title

    Maximizing the lifetime of wireless ad hoc networks using Minimizing the Maximum used Power Routing

  • Author

    Kim, Kwang-Ryoul ; Min, Sung-Gi ; Yu, Nam-Kyu

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Korea Univ., Seoul
  • fYear
    2008
  • fDate
    7-9 May 2008
  • Firstpage
    557
  • Lastpage
    561
  • Abstract
    In this paper, we present minimizing the maximum used power routing algorithm (MIVIPR) in mobile ad hoc network (MANET). Most previous energy aware routing protocols usually optimize just one optimization criterion, which minimizes the total used energy or evenly distributes power consumption in each node to prevent node from being over exhausted. MMPR achieves two optimization objectives using a single route cost equation, which is based on the similar optimization, minimizing the maximum link utilization in LPF-Based-Re-Routing (LPF-RR), of traffic engineering (TE). MMPR can be implemented by modifying a route selection procedure in well-known routing protocol of MANET. We validate MMPR by performing a simulation based on a modification of DSR, and the simulation results showed improved performance in the maximum used energy and the number of dead nodes by time than the conditional max-min battery routing (CMMBCR).
  • Keywords
    ad hoc networks; minimax techniques; mobile radio; telecommunication network routing; MANET; energy aware routing protocol; maximum link utilization; maximum used power routing algorithm; mobile ad hoc network; wireless ad hoc network; Ad hoc networks; Batteries; Cost function; Energy consumption; Energy efficiency; Equations; Mobile ad hoc networks; Optimization methods; Power engineering and energy; Routing protocols; MANET; ad hoc routing; energy aware routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Pervasive Computing, 2008. ISWPC 2008. 3rd International Symposium on
  • Conference_Location
    Santorini
  • Print_ISBN
    978-1-4244-1652-3
  • Electronic_ISBN
    978-1-4244-1653-0
  • Type

    conf

  • DOI
    10.1109/ISWPC.2008.4556270
  • Filename
    4556270