Skip to main content
SpringerLink
Log in

A Novel Energetic Ant Optimization Algorithm for Routing Network Analysis

  • Conference paper
  • First Online:
Book cover Intelligent Computing Theories and Application (ICIC 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10955))

Included in the following conference series:

  • 2150 Accesses

Abstract

The latest biological research results show that it is natural to see that ants at different age group play roles and responsibilities differently. As inspired by the same, the concept of age and intra-groups is thus introduced into traditional Ant Colony Optimization (ACO) algorithm. A new intelligent parallel algorithm, Energetic Ant Optimization model (EAO), is put forward and applied for energy-aware routing network analysis. The proposed algorithm is designed to calculate the routing probability and phenomenon increment by taking the remaining energy of node as a heuristic factor. By EAO, the age of ant corresponds to the energy of the Ad Hoc network. Not only was mathematical model built for the EAO theoretically, but also its application was described detailedly. Finally, the proposed algorithm is simulated and analyzed in different scenarios, and the experimental results are compared with the results of Ad hoc on-demand distance vector routing (AODV). The simulation results show that EAO routing algorithm (EAORA) performs much better in packet delivery ratio, the average end-to-end delay and lifetime of network. Besides, the EAORA has better performance in balancing the energy consuming between nodes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

References

  1. Cavalcanti, E.R., Spohn, M.A.: On improving temporal and spatial mobility metrics for wireless ad hoc networks. Inf. Sci. 188(4), 182–197 (2012)

    Article  Google Scholar 

  2. de Moraes, R.M., Kim, H., Sadjadpour, H.R., Garcia-Luna-Aceves, J.J.: A new distributed cooperative MIMO scheme for mobile ad hoc networks. Inf. Sci. 232(5), 88–103 (2013)

    Article  MathSciNet  Google Scholar 

  3. Wang, W., Wang, H., Wang, B., Wang, Y., Wang, J.: Energy-aware and self-adaptive anomaly detection scheme based on network tomography in mobile ad hoc networks. Inf. Sci. 220(1), 580–602 (2013)

    Article  Google Scholar 

  4. Sun, Y., Jiang, Q., Singhal, M.: An edge-constrained localized delaunay graph for geographic routing in mobile ad hoc and sensor networks. IEEE Trans. Mob. Comput. 9(4), 479–490 (2010)

    Article  Google Scholar 

  5. Xiang, X., Wang, X., Zhou, Z.: Self-adaptive on-demand geographic routing for mobile Ad Hoc networks. IEEE Trans. Mob. Computing 11(9), 1572–1586 (2012)

    Article  Google Scholar 

  6. Zhang, X., Wang, E., Xia, J., et al.: A neighbor coverage based probabilistic rebroadcast for reducing routing overhead in mobile Ad hoc networks. IEEE Trans. Mob. Comput. 12(3), 424–433 (2013)

    Article  Google Scholar 

  7. Zhu, J., Wang, X.: Model and protocol for energy-efficient routing over mobile ad hoc networks. IEEE Trans. Mob. Comput. 10(11), 1546–1557 (2011)

    Article  Google Scholar 

  8. Mersch, D.P., Crespi, A., Keller, L.: Tracking individuals shows spatial fidelity is a key regulator of ant social organization. Science 340(6136), 1090–1093 (2013)

    Article  Google Scholar 

  9. Ren, F., Zhang, J., Wu, Y., et al.: Attribute-aware data aggregation using potential-based dynamic routing in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 24(5), 881–892 (2013)

    Article  Google Scholar 

  10. Tan, G., Kermarrec, A.M.: Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach. IEEE/ACM Trans. Netw. (TON) 20(3), 864–877 (2012)

    Article  Google Scholar 

  11. Lorenzo, B., Glisic, S.: Optimal routing and traffic scheduling for multihop cellular networks using genetic algorithm. IEEE Trans. Mob. Comput. 12(11), 2274–2288 (2013)

    Article  Google Scholar 

  12. Qaed, A.S.M., Devi, T.: Ant colony optimization based delay and energy conscious routing protocol for mobile Adhoc networks. Int. J. Comput. Appl. 41, 1–5 (2012)

    Google Scholar 

  13. Hernández, H., Blum, C., Francès, G.: Ant colony optimization for energy-efficient broadcasting in ad-hoc networks. In: Dorigo, M., et al. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 25–36. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87527-7_3

    Chapter  Google Scholar 

  14. Ho, S.L., Yang, S., Wong, H.C., et al.: An improved ant colony optimization algorithm and its application to electromagnetic devices designs. IEEE Trans. Magn. 41(5), 1764–1767 (2005)

    Article  Google Scholar 

  15. Sim, K.M., Sun, W.H.: Ant colony optimization for routing and load-balancing: survey and new directions. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 33(5), 560–572 (2003)

    Article  Google Scholar 

  16. Mersch, D.P., Crespi, A., Keller, L.: Tracking individuals shows spatial fidelity is a key regulator of ant social organization. Science 340(6136), 1090–1093 (2013)

    Article  Google Scholar 

Download references

Acknowledgement

This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61472139 and 61462073, the Information Development Special Funds of Shanghai Economic and Information Commission under Grant No. 201602008, the Open Funds of Shanghai Smart City Collaborative Innovation Center.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai, China

    Xiang Feng & Hanyu Xu

  2. Smart City Collaborative Innovation Center, Shanghai Jiao Tong University, Shanghai, China

    Xiang Feng

Authors
  1. Xiang Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanyu Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiang Feng .

Editor information

Editors and Affiliations

  1. Tongji University, Shanghai, China

    De-Shuang Huang

  2. University of Ulsan, Ulsan, Korea (Republic of)

    Kang-Hyun Jo

  3. Wuhan University of Science and Technology, Wuhan City, China

    Xiao-Long Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Feng, X., Xu, H. (2018). A Novel Energetic Ant Optimization Algorithm for Routing Network Analysis. In: Huang, DS., Jo, KH., Zhang, XL. (eds) Intelligent Computing Theories and Application. ICIC 2018. Lecture Notes in Computer Science(), vol 10955. Springer, Cham. https://doi.org/10.1007/978-3-319-95933-7_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-95933-7_79

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-95932-0

  • Online ISBN: 978-3-319-95933-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation