An Energy Efficient and Lifetime Aware Routing Protocol in Ad Hoc Networks

  • Wuyungerile Li
  • Bing JiaEmail author
  • Qinan Li
  • Junxiu Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11335)


In recent years, with the rapid development of Internet technology and wireless communication technology, wireless Ad hoc network has been received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-saving transmission path in Ad hoc networks. In this paper we proposed an energy efficient routing algorithm EAODV. The algorithm is based on the AODV routing protocol mainly in the following two aspects of improvement: (1) In the route discovery process, when a node selects a routing node, it dynamically selects one of the minimum power consumption routes and the energy balanced route designed in this paper based on a marker bit representing the remaining energy, then establishes a transmission path; (2) Based on (1), a route interruption update strategy was proposed to make the RERR message to restart the route discovery process to find new routes when node energy was used excessively. Simulation results show that compared with AODV and other existing routing protocols, EAODV can reduce network energy consumption and improve network performances.


Ad hoc network Energy efficient AODV TrueTime 



Thanks to the National Natural Science Foundation of China (Grants No. 61761035, 41761086, 61461037, 61661041) and “Scientific and Technological Innovation Project of Inner Mongolia Autonomous Region System Development and Product Application of Urban Flood Disaster Monitoring and Early-warning Management”.


  1. 1.
    Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: 1999 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 1999), New Orleans, pp. 90–100. IEEE Press (1999)Google Scholar
  2. 2.
    Utkarsh, M.M., Chinara, S.: ESAR: an energy saving ad hoc routing algorithm for MANET. In: IEEE Fourth International Conference on Advanced Computing, pp. 13–15 (2012)Google Scholar
  3. 3.
    Shivashankar, G.V., Narayanagowda, S.H.: Implementing a new power aware routing algorithm based on existing dynamic source routing protocol for mobile ad hoc networks. IET Netw. 3, 137–142 (2014)CrossRefGoogle Scholar
  4. 4.
    Cao, L., Sharif, K., Wang, Y., et al.: Adaptive multiple metrics routing protocols for heterogeneous multi-hop wireless networks. In: Consumer Communications and NETWORKING Conference, CCNC 2008, pp. 13–17. IEEE (2008)Google Scholar
  5. 5.
    Tai, H.T., Tan, C.E., Lau, S.P.: Alternate link maximum energy level ad hoc distance vector scheme for energy efficient ad hoc networks routing. In: International Conference on Computer and Communication Engineering, pp. 423–428. IEEE (2010)Google Scholar
  6. 6.
    Khanna, N., Krishna Naik, K.: Design and implementation of an energy efficient routing approach based on existing AODV protocol in mobile adhoc networks for military. In: International Conference on Emerging Trends in Electrical Electronics & Sustainable Energy Systems (ICETEESES). IEEE (2016). 7581388Google Scholar
  7. 7.
    Chen, J., Chen, J., Li, Z.: Energy-efficient AODV for low mobility ad hoc networks. In: International Conference on Wireless Communications, NETWORKING and Mobile Computing, pp. 1512–1515. IEEE (2007)Google Scholar
  8. 8.
    Das, C.R., Dhara, S., Jeng, Y.R., et al.: An efficient routing protocol for wireless networks. Mob. Netw. Appl. 1(2), 183–197 (1996)CrossRefGoogle Scholar
  9. 9.
    Roth, U.: Highly dynamic destination-sequenced distance-vector routing. In: Proceedings of ACM SIGCOMM 1994, pp. 234–244, August 1994Google Scholar
  10. 10.
    Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: The Workshop on Mobile Computing Systems & Applications, pp. 94–95. IEEE (2002)Google Scholar
  11. 11.
    Liu, Z., Luo, D., Li, J., Chen, X., Jia, C.: N-Mobishare: new privacy-preserving location-sharing system for mobile online social networks. Int. J. Comput. Math. 93(2), 384–400 (2016)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Liu, Z., Li, T., Li, P., Jia, C., Li, J.: Verifiable searchable encryption with aggregate keys for data sharing system. Future Gener. Comput. Syst. 78, 778–788 (2018)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Wuyungerile Li
    • 1
  • Bing Jia
    • 1
    Email author
  • Qinan Li
    • 1
  • Junxiu Wang
    • 1
  1. 1.Inner Mongolia UniversityHohhotChina

Personalised recommendations