Skip to main content
SpringerLink
Log in

An optimized prioritized load balancing approach to scalable routing (OPLBA)

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Mobile Ad hoc networks (MANETs) are self organized multi-hop networks, without any infrastructure such as base stations or access points. Due to the mobility and absence of any central administration, the resources of MANETs are limited. If there is any congestion in the network, it puts a great strain on the already scarce resources and severely affects the performance of such networks. Multi path routing is considered as advantageous over single path routing, due to the many benefits it offers. However, these benefits do not come without their associated costs. In this paper, we propose a general metric to define scalability of a routing method. We further propose and implement a new load-balancing routing protocol, which retains the benefits of multiple paths, while at the same time keeping the overheads of routing, as close to single path routing, as possible. The proposed scheme dynamically distributes traffic through different available paths, so that no single path is flooded. Priority is assigned to available paths and paths with higher priority (better routes) are used more often than those with lower priorities. To keep our method light-weight and scalable, we control the Degree of Distribution (DoD) value (number of alternate paths used), to reap maximum benefits at minimum cost. To further reduce the overheads and decrease access time, optimized insertion and path selection are provided. An index to the RouteList table has been added, which reduces the access and insertion time to O(m + n d ) and O(m) respectively, which is within a constant difference of Single path routing methods. Simulation results demonstrate that the proposed solution shows significant improvements in network metrics such as packet loss ratio, end to end delay, throughput and packet delivery, without any increase in routing overheads. Results also verify that this model is very efficient and scalable.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Royer, E., & Toh, C. (1999). A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, 6(2), 46–55.

    Article  Google Scholar 

  2. Murthy, S., & Manoj, B. (2004). Ad hoc wireless networks: Architectures and protocols. Englewood Cliff: Prentice Hall.

    Google Scholar 

  3. Marks, R. B. (2003). IEEE Standard 802.16 for global broadband wireless access. In Proceedings of ITU Telecom World 2003 Forum, pp. 1–8.

  4. Arpacioglu, O., Small, T., & Haas, Z. (2003). Notes on scalability of wireless ad hoc networks. IETF Internet Draft.

  5. Asher, Y., Feldman, S., Feldman, F., & Gurfil, P. (2010). Scalability issues in ad-hoc networks: Metrical routing versus table driven routing. Wireless Personal Communications, 52(3), 423–447.

    Article  Google Scholar 

  6. Barr, R., Haas, Z. & Renesse, R. Scalable wireless ad hoc network simulation. Cornell Research Foundation. pp. 297–311 http://jist.ece.cornell.edu/docs/050416-bookch-camera.pdf

  7. Yao, H., Zhong, L, Lu, X., & Peng W. (2005). A cluster-based multipath dynamic source routing in MANET. In Proceedings of the IEEE WiMob 2005, pp. 369–376.

  8. Carbunar, B., Loannidis, L., & Rotaru, N. (2009). JANUS: A framework for scalable and secure routing in hybrid wireless networks. IEEE Transactions on Dependable and Secure Computing, 6(4), 295–308.

    Article  Google Scholar 

  9. Chen, Y., Liestman, A., & Liu, J. (2004). Clustering algorithms for ad hoc wireless networks. Ad Hoc and Sensor Networks, 1–16.

  10. Xiang, X., Wang, X., & Yang, Y. (2011). Supporting efficient and scalable multicasting over mobile ad hoc networks. IEEE Transactions on Mobile Computing, 10(4), 544–559.

    Article  Google Scholar 

  11. Spyropoulos, T., Rais, R., Turletti, T., Obraczka, K., & Vasilakos, A. V. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349–2370.

    Article  Google Scholar 

  12. Khan, M. A., Tembine, H., & Vasilakos, A. V. (2012). Game dynamics and cost of learning in heterogeneous 4G networks. IEEE Journal on Selected Areas in Communications, 30(1), 198–213.

    Article  Google Scholar 

  13. Yen, Y., Chao, H., Chang, R., & Vasilakos, A. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53(11–12), 2238–2250.

    Article  Google Scholar 

  14. Li, P., Guo, S., Yu, S., & Vasilakos, A. (2014). Reliable multicast with pipelined network coding using opportunistic feeding and routing. IEEE Transactions on Parallel and Distributed Systems, 25(12), 3264–3273.

    Article  Google Scholar 

  15. Li, P, Guo S., Yu, S. & Vasilakos, A. (2014). CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In Proceedings of the IEEE INFOCOM 2012, pp. 100–108.

  16. Leighton, T., Maggs, B., & Richa, A. (1999). Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica, 19(3), 375–401.

    Article  MATH  MathSciNet  Google Scholar 

  17. Cheng, H., Xiong, N., Vasilakos, A. V., & Yang, L. (2012). Nodes organization for channel assignment with topology preservation in multi-radio wireless mesh networks. Ad Hoc Networks, 10(5), 760–773.

    Article  Google Scholar 

  18. Yao, Y., Cao, Q., & Vasilakos, A. V. (2014). EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for heterogeneous wireless sensor networks. IEEE/ACM Transactions on Networking, 99, 1–9.

    Google Scholar 

  19. Yao, Y, Cao, Q., & Vasilakos, A.V. (2013). EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for wireless sensor networks, In Proc. IEEE MASS, pp. 182–190.

  20. Xiang, L., Luo, J., & Rosenberg, C. (2013). Compressed data aggregation: Energy-efficient and high-fidelity data collection. IEEE/ACM Transactions on Networking, 21(6), 1722–1735.

    Article  Google Scholar 

  21. Song, Y., Liu, L., Ma, H., & Vasilakos, A. (2014). A biology-based algorithm to minimal exposure problem of wireless sensor networks. IEEE Transactions on Network and Service Management, 11(3), 417–430.

    Article  Google Scholar 

  22. Liu, L., Song, Y., Zhang, H., Ma, H., & Vasilakos, A. (2015). Physarum optimization: A biology-inspired algorithm for the steiner tree problem in networks. IEEE Transactions on Computers, 64(3), 819–832.

    MathSciNet  Google Scholar 

  23. Choi, Kae Won, Jeon, Wha Sook, & Jeong, Dong Geun. (2010). Efficient load-aware routing scheme for wireless mesh networks. IEEE Transactions on Mobile Computing, 9(9), 1293–1307.

    Article  Google Scholar 

  24. Lee, S. & Gerla, M. (2001). Dynamic load-aware routing in ad hoc networks. In Proceeding of IEEE ICC (vol. 10).

  25. Lee, Y. & Riley, F. (2005). A workload-based adaptive load balancing technique for mobile ad hoc networks. In Proceedings of IEEE. WCNC.

  26. Souihli, O., Frikha, M., & Hamouda, M. (2009). Load-balancing in MANET shortest-path routing protocols. Journal of Ad Hoc Networks, 7(2), 431–442.

    Article  Google Scholar 

  27. Youssef, M., Ibrahim, M., Abdelatif, M., Chen, L., & Vasilakos, A. V. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys & Tutorials, 16(1), 92–109.

    Article  Google Scholar 

  28. Meng, T., Wu, F., Yang, Z., & Chen, G. (2015). Spatial reusability-aware routing in multi-hop wireless networks. In IEEE Transactions on Computers, 99, 1.

  29. Zeng, Y., Xiang, K., Li, D., & Vasilakos, A. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161–173.

    Article  Google Scholar 

  30. Rothvoss, T. (2013). A simpler proof for O(congestion+dilation) packet routing. Springer Lecture Notes in Computer Science, 7801, 336–348.

  31. Busch, C. (2002). Õ(congestion + dilation) hot-potato routing on leveled networks. In Proceedings of the ACM symposium on parallel algorithms and architectures, pp. 20–29.

  32. Busch, C., Kannan, R., & Vasilakos, A. (2012). Approximating congestion + dilation in networks via “quality of routing” games. IEEE Transactions on Computers, 61(9), 1270–1283.

    Article  MathSciNet  Google Scholar 

  33. He, Y., Chen, Z, Liu, Y., & Xiong, Z. (2008). A dynamic congestion control based multipath routing protocol for video transmission over ad hoc networks. In Proceedings of the international conference on networking, architecture, and storage, pp. 62–69.

  34. Tonguz, O., & Yanmaz, E. (2008). The mathematical theory of dynamic load balancing in cellular networks. IEEE Transactions on Mobile Computing, 7(12), 1504–1518.

    Article  Google Scholar 

  35. Vasilakos, A., Ricudis, C., Anagnostakis, K., Pedrycz, W., & Pitsillides, A. (1998). Evolutionary-fuzzy prediction for strategic QoS routing in broadband networks. In Proceedings of the IEEE world congress on computational intelligence, pp. 1488–1493.

  36. Yang, C., & Chen, B. (2010). Mobile Location estimation using fuzzy-based IMM and data fusion. IEEE Transactions on Mobile Computing, 9(10), 1424–1436.

    Article  Google Scholar 

  37. Hassanein, H. & Zhou, A. (2001). Routing with load balancing in wireless ad hoc networks. In Proceedings of fourth MSWiM, pp. 89–96.

  38. Wu, K., & Harms, J. (2001). Load-sensitive routing for mobile ad hoc networks. In Proceedings of IEEE 10th ICCCN, pp. 540–546.

  39. Wang, L, Zhang, L., Shu, Y. & Dong, M. (2000). Multipath source routing in wireless ad hoc networks. In Proceedings of IEEE Canadian conference on electrical and computer engineering.

  40. Singh, J., & Rai, C. S. (2014). Measuring the effectiveness of Multi Path Routing as a function of increased path availability. Proceedings of IEEE ICRITO, 2014, 229–234.

    Google Scholar 

  41. Nasipuri, A., & Das, S. (1999). On-demand multipath routing for mobile ad hoc networks. In Proceedings of IEEE computer communications and networks, pp. 64–70.

  42. Johnson, D, Maltz, D., & Hu, Y. (2004). The dynamic source routing protocol for mobile ad hoc networks. RFC 4728, IETF.

  43. Perkins, C., Royer, E. & Das, S. (2003). Ad hoc on-demand distance vector (AODV) routing. Experimental RFC 3561, IETF.

  44. Nuevo, J. (2004). A comprehensible GloMoSim tutorial. http://www.ccs.neu.edu/course/csg250/Glomosim/glomoman.pdf

Download references

Author information

Authors and Affiliations

  1. Guru Gobind Singh Indraprastha University, New Delhi, India

    Jaspreet Singh

  2. University School of Information and Communication Technology, Guru Gobind Singh Indraprastha University, New Delhi, India

    Chandra Shekhar Rai

Authors
  1. Jaspreet Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chandra Shekhar Rai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaspreet Singh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, J., Rai, C.S. An optimized prioritized load balancing approach to scalable routing (OPLBA). Wireless Netw 22, 319–334 (2016). https://doi.org/10.1007/s11276-015-0963-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-015-0963-7

Keywords

Search

Navigation