Skip to main content

Multipath Traffic Allocation Based on Ant Optimization Algorithm with Reusing Abilities in MANET

  • Conference paper
Grid and Cooperative Computing - GCC 2005 (GCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3795))

Included in the following conference series:

  • 476 Accesses

Abstract

It is important that how to distribute traffic into multiple paths with reason and timing in Mobile Ad Hoc networks. Otherwise, it will cause the performance of these routing schemes to degrade drastically. Most of the traffic distributing schemes proposed in MANET so far don’t take limited resource and frequent topology change into account. In these schemes, it doesn’t reuse the distribution result, and the same size load is distributed into the various paths regardless of their qualities. It will lead to increased computing overhead. In order to circumvent these problems, a novel multipath traffic distribution method that is based on Ant Optimization Algorithm with Reusing Abilities is proposed. Experimental results indicate that, our method improves distribution efficiency about 20%, and improves the quality of multipath routing.

This research was supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2003CB314802, the National Natural Science Foundation of China under Grant No. 90104001 and Higher Education and Research Program of Hunan Province.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ephremides, J.E.: A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. IEEE 75(1), 56–73 (1987)

    Article  Google Scholar 

  2. Krishnan, R., Silvester, J.A.: Choice of Allocation Granularity in Multi-path Source Routing Schemes. In: IEEE INFOCOM 1993, vol. 1, pp. 322–329 (1993)

    Google Scholar 

  3. Cidon, I., Rom, R., Shavitt, Y.: Analysis of Multi-path Routing. IEEE/ACM Transactions on Networking 7(6), 885–896 (1999)

    Article  Google Scholar 

  4. Valera, A., Seah, W.K.G., Rao, S.V.: Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad hoc Networks. In: IEEE INFOCOM 2003 (2003)

    Google Scholar 

  5. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernetics, Part-B 26(1), 29–41 (1996)

    Article  Google Scholar 

  6. Stutzle, T., Hoos, H.H.: Max-Min Ant System. Future Generation Computer System 16(8), 889–914 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

An, HY., Lu, XC., Peng, W. (2005). Multipath Traffic Allocation Based on Ant Optimization Algorithm with Reusing Abilities in MANET. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_118

Download citation

  • DOI: https://doi.org/10.1007/11590354_118

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30510-1

  • Online ISBN: 978-3-540-32277-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics