Skip to main content

A Swarm Inspired Probabilistic Path Selection with Congestion Control in MANETs

  • Conference paper
Advances in Computer Science, Engineering & Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AINSC,volume 167))

Abstract

Congestion is a major problem in mobile ad-hoc networks. In mobile ad hoc networks congestion creates delay in transmission and also loss of the packet that causes wastage of time and energy on recovery. The Wireless Networks have to play an important role to adopt and execute a large no of innovative application. New challenges have come considering the major limitations of the ad hoc network like node’s limited processing power, balance the load of network (to maintain the computation of the node). To overcome the above problem some algorithm is invoked and there may be huge amount of packet loss and this leads to decrease the lifetime of the network. The objective of our proposed algorithm is to identify the congestion areas between source and its neighboring nodes to the destination and thus it will help to avoid the congestion of the network in the intermediate links and also minimize the packet loss in the network. Using a new mathematical model considering the swarm-based ant intelligence concept, we found an efficient congestion control mechanism (Ant’s probabilistic transition rule).

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Leung, R., Jilei, L., Poon, E., Chan, A.C., Baochun, L.: MPDSR: a QoS-aware multi-path dynamic source routing protocol for wireless ad-hoc networks. In: Proc. of 26th Annual IEEE Conference on Local Computer Networks, pp. 132–141 (2001)

    Google Scholar 

  2. Sung, J.L., Gerla, M.: Split Multi-path Routing with Maximally Disjoint Paths in Ad Hoc Networks. In: Proc. Int. IEEE Conf. on Comm., pp. 3201–3205 (2001)

    Google Scholar 

  3. Tran, D., Raghavendra, H.: Congestion Adaptive Routing in Mobile Ad Hoc Networks. IEEE Transactions on Parallel and Distributed Systems 17, 1294–1305 (2006)

    Article  Google Scholar 

  4. Zheng, X., Guo, W., Liu, R., Tian, Y.: A New Dynamic Load-aware Based Load-balanced Routing for Ad Hoc Networks, pp. 407–411. IEEE (2004)

    Google Scholar 

  5. Chen, X., Haley, M.J., Jayalath, A.D.S.: Congestion-Aware Routing Protocol for Mobile Ad Hoc Networks. In: Proceedings of IEEE Conference on Vehicular Technology, pp. 21–25 (2007), doi: 10.1109/VETECF.2007.21

    Google Scholar 

  6. Asokan, R., Natarajan, A.M., Venkatesh, C.: Ant Based Dynamic Source Routing Protocol to Support Multiple Quality of Service (QoS) Metrics in Mobile Ad Hoc Networks. International Journal of Computer Science and Security 2(3), 48–56 (2008)

    Google Scholar 

  7. Chen, L., Heinzelman, W.B.: QoS-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks. IEEE on Selected Areas in Communications 23(3) (2005)

    Google Scholar 

  8. Zhenyu, L., Kwiatkowska, M.Z., Constantinou, C.: A Biologically Inspired Congestion Control Routing Algorithm For MANETs. In: IEEE PerCom 2005 (2005)

    Google Scholar 

  9. Beckers, R., Deneubourg, J.L., Goss, S.: Trails and u turns in the selection of the shortest path by the ant lasius niger. Journal of Theoretical Biology 159, 397–415 (1992)

    Article  Google Scholar 

  10. Günther, A., Hoene, C.: Measuring round trip times to determine the distance between WLAN nodes. In: Boutaba, R., Almeroth, K.C., Puigjaner, R., Shen, S., Black, J.P. (eds.) NETWORKING 2005. LNCS, vol. 3462, pp. 768–779. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Jawahar, A.C.S.: Ant Colony Optimization for Mobile Ad-Hoc Networks, ajaychak@eden.rutgers.edu

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Subhankar Joardar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Joardar, S., Bhattacherjee, V., Giri, D. (2012). A Swarm Inspired Probabilistic Path Selection with Congestion Control in MANETs. In: Wyld, D., Zizka, J., Nagamalai, D. (eds) Advances in Computer Science, Engineering & Applications. Advances in Intelligent Systems and Computing, vol 167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30111-7_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30111-7_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30110-0

  • Online ISBN: 978-3-642-30111-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics