A Scalable-Adaptive Snack Routing Strategy (SRS) for Semi-Administrated Mobile Ad Hoc Networks (SAMANETs)

Article

Abstract

Recently, Mobile Ad Hoc networks (MANETs) are growing in popularity and importance. They present a possible communication among a set of mobile nodes with no need for either a pre-established infrastructure or a central administration. However, in order to guarantee an efficient communication among network nodes, efficient routing algorithms should be established. Routing plays the central role in providing ubiquitous network communications services in such dynamic networks. The problem is further aggravated through the node mobility as any node may move at any time without notice. Several routing protocols had been proposed; however, most of them suffer from control packet flooding, which results in a scalability problem. In this paper, a new routing strategy for MANETs is proposed which is called Snack Routing Strategy (SRS). The basic idea of SRS is to continuously inform the network mobile nodes with any changes in the network topology without overloading the network by a huge amount of control messages. SRS is a hybrid routing strategy that relies on Learning by accumulation, hence, new routes can be discovered by learning the accumulative data stored in the nodes routing tables by several foraging artificial snacks. SRS uses no periodic routing advertisement messages but uses artificial snacks instead, thereby reducing the network bandwidth overhead and minimizing end-to-end transmission delay. SRS has been compared against two well known protocols AODV and DSR. Experimental results have shown that SRS outperforms both AODV and DSR as it introduces the minimal routing overheads.

Keywords

MANETs Routing AODV DSR 

References

  1. 1.
    A. Ambhaikar and L. Kumar, Exploring the Behavior of Mobile Ad Hoc Network Routing Protocols with Reference to Speed and Terrain Range, International multi-conference of Engineers and Computer Scientists, Vol. 2, 2010.Google Scholar
  2. 2.
    S. Nenad, B. Marija, S. Irini and D. Branimir, New algorithm for packet routing in mobile ad-hoc networks, Journal of Automatic Control, University of Belgrade, Vol. 20, pp. 9–16, 2010.Google Scholar
  3. 3.
    M. Lakshmi and P. Sankaranarayanan, Performance analysis of three routing protocols in wireless mobile ad hoc networks, Information Technology Journal, Vol. 5, No. 1, 114–120.Google Scholar
  4. 4.
    R. Bindhu, Mobile agent based routing protocol with security for MANET, International Journal of Applied Engineering Research, Vol. 1, No. 1, 2010.Google Scholar
  5. 5.
    H. Shekhar, and K. Ramanatha, Mobile Agents Aided Congestion Aware Multipath Routing in Mobile Ad Hoc Networks, 9th IEEE Int. Conference on Telecom, Zagreb, pp. 65–72, 2007.Google Scholar
  6. 6.
    A. Boukerche, A. Bamis, I. Chatzigiannakis and S. Nikoletseas, A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks, The International Journal of Computer and Telecommunications Networking, Vol. 52, No. 1, pp. 130–154, 2008.MATHGoogle Scholar
  7. 7.
    M. Abolhasan, T. Wysocki and E. Dutkiewicz, A review of routing protocols for mobile ad hoc networks, Ad Hoc Networks, Vol. 2, pp. 1–22, 2004.CrossRefGoogle Scholar
  8. 8.
    B. Liang and J. Zygmunt, Hybrid routing in ad hoc networks with a dynamic backbone, IEEE Transactions on Wireless Communications, Vol. 5, No. 6, pp. 1–14, 2006.CrossRefGoogle Scholar
  9. 9.
    N. Mhala and N. Choudhari, An Implementation Possibilities For AODV Routing Protocol in Real World, International Journal of Distributed and Parallel Systems (IJDPS), Vol. 1, No. 2, pp. 118–127, 2010.CrossRefGoogle Scholar
  10. 10.
    S. Harminder, K. Sunil and A. Sangal, Performance Evaluation of Two Reactive Routing Protocols of MANET using Group Mobility Model, IJCSI International Journal of Computer Science, Vol. 7, No. 10, pp. 38–43, 2010.Google Scholar
  11. 11.
    P. Khatri, M. Rajput, A. Shastri and K. Solanki, Performance study of ad-hoc reactive routing protocols, Journal of Computer Science, Vol. 6, No. 10, pp. 1130–1134, 2010.CrossRefGoogle Scholar
  12. 12.
    K. Tripathi, M. Pandey, and S. Verma, Comparison of reactive and proactive routing protocols for different mobility conditions in WSN, Proceedings of the 2011 International Conference on Communication, Computing & Security, 2011.Google Scholar
  13. 13.
    U. Lee, S. Midkiff, and J. Park, A Proactive Routing Protocol for Multi-Channel Wireless Ad-hoc Networks (DSDV-MC), Proceedings of the International Conference on Information Technology Coding and Computing, Vol. 2, pp. 710–715, April 2005.Google Scholar
  14. 14.
    R. Singh, D. Singh and L. Kumar, Performance Evaluation of DSR and DSDV Routing Protocols for Wireless Ad Hoc Networks, Int. J. Advanced Networking and Applications, Vol. 2, No. 4, pp. 732–737, 2011.Google Scholar
  15. 15.
    N. Surayati, A. Abdullah and A. Faisal, Performance Evaluation of AODV, DSDV & DSR Routing Protocol in Grid Environment, IJCSNS, Vol. 9, No. 7, pp. 261–268, 2009.Google Scholar
  16. 16.
    P. Sarala, D. Kalaiselvi, Multipath Dynamic Source Routing with Cost and Ant Colony Optimization for MANETS, International Journal of Applied Engineering Research, Vol. 1, No. 1, 2010.Google Scholar
  17. 17.
    Ben Liang, and Zygmunt J. Haas, Hybrid Routing in Ad Hoc Networks with a Dynamic Virtual Backbone, IEEE Transactions On Wireless Communications, Vol. 5, No. 6, JUNE 2006, 1–14.Google Scholar
  18. 18.
    Nikaein Navid, Wu Shiyi, and Christian Bonnet. HARP: Hybrid Ad hoc Routing Protocol, International Symposium on Telecommunications, IST 2001, 2001.Google Scholar
  19. 19.
    Z. Haas, A new routing protocol for reconfigurable wireless networks, Proceedings of IEEE International Conference on Universal Personal CommunicationAtlanta, GA, 1997. pp. 1–11.Google Scholar
  20. 20.
    M. Peralman and Z. Haas, Determining the optimal configuration for the zone routing protocol, IEEE Journal on Selected Areas in Communications, Special Issue on Wireless Ad hoc Networks, Vol. 17, No. 8, pp. 1395–1414, 1999.Google Scholar
  21. 21.
    T. Clausen, P. Jacquet, C. Adjih, A. Laouiti, P. Minet, P. Muhlethaler and A. Qayyum, and L.Viennot, “Optimized link state routing protocol (OLSR)”. Technical report, Network Working GroupOctober, 2003.Google Scholar
  22. 22.
    R. Ogier, F. Templin, M. Lewis, Topology Dissemination Based on Reverse Path Forwarding (TBRPF), Technical report, Internet Experimental RFC 3684, February 2004.Google Scholar
  23. 23.
    G. Gerla, T. Chen, Fish eye state routing in mobile ad hoc networks, Proceedings of the 20th IEEE International Conference on Distributed Computing Systems (ICDCS) workshop on wireless networks and mobile Computing, Taipei, Taiwan, pp. 71–78, April 2000.Google Scholar
  24. 24.
    M. Spohn, J. Garcia-luna, Source-tree routing in wireless networks, Proceedings of the 7th International Conference on Network Protocols, Toronto, Canada, pp. 273–282, October 1999.Google Scholar
  25. 25.
    C. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers”, ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications, Vol. 24, New York, USA, 1994. pp. 234–244.Google Scholar
  26. 26.
    S. Murthy and J. Garcia-Luna-Aceves, An efficient routing protocol for wireless networks, Mobile Networks and Applications, Vol. 1, No. 2, pp. 183–197, 1996.CrossRefGoogle Scholar
  27. 27.
    C. Perkins, E. Royer, Ad-hoc on-demand distance vector routing, Proceedings of 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, pp. 90–100, February 1999.Google Scholar
  28. 28.
    D. Johnson and D. Maltz, Dynamic source routing in ad hoc wireless networks. In Tomasz Imielinski and Hank Korth, editors. Mobile Computing353 ed., Kluwer Academic Publishers, Boston, 1996. pp. 153–181.CrossRefGoogle Scholar
  29. 29.
    V. Park, M. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, Proceedings of the IEEE INFOCOM—The Conference on Computer Communications, Kobe, Japan, pp. 7–11, April 1997.Google Scholar
  30. 30.
    C. Toh, Associativity-based routing for ad-hoc mobile networks, Wireless Personal Communications, Vol. 4, No. 2, pp. 103–139, 1997.CrossRefGoogle Scholar
  31. 31.
    P. Samar, M. Perlman, Z. Hass, Independent zone routing: an adaptive hybrid routing framework for ad hoc wireless networks, IEEE/ACM Transactions on Networking, Vol. 12, No. 4, 2004.Google Scholar
  32. 32.
    L. Wang, S. Olariu, A two zone hybrid routing protocol for mobile ad hoc networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 15, No. 12, 2004.Google Scholar
  33. 33.
    V. Ramasubramanian, Z. Hass, E. Sirer, SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks, MobiHoc, Annapolis, Maryland, pp. 303–314, June 2003.Google Scholar
  34. 34.
    S. Park, B. Voorst, Dynamic hybrid routing (DHR) in mobile ad hoc networks, Proceedings of the International Conference on Parallel Processing, Vancouver, BC, pp. 1–8, August 2002.Google Scholar
  35. 35.
    R. Singh, D. Singh, and L. Kumar, Swarm intelligence based approach for routing in mobile Ad Hoc networks, International Journal of Science and Technology Education Research Vol. 1, No. 7, pp. 147–153, December 2010.Google Scholar
  36. 36.
    G. Caro and M. Dorigo, AntNet: distributed stigmergetic control for communication networks, Journal of Artificial Intelligence Research, Vol. 9, pp. 317–365, 1998.MATHGoogle Scholar
  37. 37.
    H. Wedde, M. Farooq, T. Pannenbaecker, B. Vogel, C. Mueller, J. Meth, Rene, BeeAdHOC: an energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior, Proceedings of Genetic and Evolutionary Computation Conference, Washington, DC, pp. 153–160, June 2005.Google Scholar
  38. 38.
    R. Singh, D. Singh and L. Kumar, Ants pheromone for quality of service provisioning in mobile adhoc networks, International Journal of Electronics Engineering Research, Vol. 2, No. 1, pp. 101–109, 2010.Google Scholar
  39. 39.
    [41] B. Baran, r. Sosa, AntNet: Routing algorithm for data networks based on mobile agents, Argentine Symposium on Artificial Intelligence, Vol. 3, No. 12, pp. 75–84, 2001.Google Scholar
  40. 40.
    R. Schoonderwoerd, O. Holland, J. Bruten and L. Rothkrantz, Ant based load balancing in telecommunications networks, Journal of Adaptive Behavior, Vol. 5, No. 2, pp. 169–207, 1996.CrossRefGoogle Scholar
  41. 41.
    O. Hossein, T. Saadawi, Ant routing algorithm for mobile ad hoc networks, Proceedings of the 22nd IEEE International Performance, Computing, and Communications Conference, Phoenix, Arizona, USA, pp. 281–290, April 2003.Google Scholar
  42. 42.
    M. Islam, P. Thulasiraman and R. Thulasiram, Implementation of ant colony optimization algorithm for mobile ad hoc network applications, Parallel and Distributed Computing Practices, Vol. 2, No. 5, pp. 177–191, 2004.Google Scholar
  43. 43.
    Shuchita Upadhyaya, Richa Setiya, Identifying multiple optimal paths in Antnet Routing Algorithm with negligible Overhead, IJCSNS International Journal of Computer Science and Network Security, Vol. 9 No. 2, February 2009, 314–319.Google Scholar
  44. 44.
    M. Günes, U. Sorges, I. Bouazizi, ARA—the ant-colony based routing algorithm for MANETs, international workshop on ad hoc networking (IWAHN 2002), Vancouver, August 18–21, 2002.Google Scholar
  45. 45.
    J. Wang, E. Osagie, P. Thulasiraman and K. Ruppa, HOPNET: a hybrid ant colony optimization routing algorithm for mobile ad hoc network, International Journal of Ad Hoc Networks, Vol. 7, pp. 690–705, 2009.CrossRefGoogle Scholar
  46. 46.
    S. Lee, E. Royer, and C. Perkins, Scalability study of the ad hoc on-demand distance vector routing, ACM/Wiley International Journal of Network Management, pp. 97–114, 2003.Google Scholar
  47. 47.
    Implementations, P.A., Available at http://moment.cs.ucsb.edu/AODV/aodv.html#Implementations. 2002.
  48. 48.
    M. Sanchez. Mobility models http://www.disca.upv.es/misan/mobmodel.htm.
  49. 49.
    D. Johnson, D. Maltz, Y. Hu, and J. Jetcheva. The dynamic source routing protocol for mobile ad hoc networks, Internet Draft, Internet Engineering Task Force, Mar. 2001. http://www.ietf.org/internetdrafts/draft-ietf
  50. 50.
    S. Das, Performance Comparison of Two On-demand routing Protocols for Ad hoc Networks, IEEE Personal Communications Magazine special issue on Ad hoc Networking, pp. 16–28, 2001.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Computer Engineering & Systems, Faculty of EngineeringMansoura UniversityMansouraEgypt

Personalised recommendations