Optimized priority based energy efficient routing algorithm for mobile ad hoc networks

Abstract Recently more and more research interest focuses on the energy efficient routing in mobile ad hoc networks and many related routing algorithms are reported. In this paper, a new optimized priority based energy efficient routing algorithm is presented and priority is added to the existing routing algorithm according to the residual energy proportion of the nodes. Lower residual energy means lower priority and the nodes with lower priority are less likely to forward packets to other nodes. The algorithm needs no global information of the networks and only a little modification is needed to the existing algorithm, so it is practical to be implemented. The algorithm can improve the performance of routing discovery, routing maintenance and cache management at the same time. Some optimization strategy is taken to reduce the network overhead and the lifetime of the network is much longer and the network with our algorithm can transfer much more effective data. Simulation with NS-2 is done and satisfying results are obtained with this algorithm. The results show that the algorithm is efficient.

[1]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Tomasz Imielinski,et al.  Mobile Computing , 1996 .

[3]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[4]  Erol Gelenbe,et al.  Self-awareness and adaptivity for quality of service , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[5]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[6]  Chai-Keong Toh.  Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks , 2001 .

[7]  J. Redi,et al.  A brief overview of ad hoc networks: challenges and directions , 2002, IEEE Communications Magazine.

[8]  Karthik Dantu,et al.  Power-aware source routing protocol for mobile ad hoc networks , 2002, ISLPED '02.

[9]  Leandros Tassiulas,et al.  Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks , 2000, NETWORKING.

[10]  Hee Yong Youn,et al.  Non-blocking, localized routing algorithm for balanced energy consumption in mobile ad hoc networks , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[11]  Erol Gelenbe,et al.  Self-aware networks and QoS , 2004, Proceedings of the IEEE.

[12]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[13]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[14]  E. Gelenbe,et al.  Genetic Algorithms for Route Discovery , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[15]  Qi Zhang,et al.  Maximum flow-life curve for a wireless ad hoc network , 2001, MobiHoc '01.

[16]  Archan Misra,et al.  MRPC: maximizing network lifetime for reliable routing in wireless environments , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[17]  Qun Li,et al.  Online power-aware routing in wireless Ad-hoc networks , 2001, MobiCom '01.