International Journal of Computer Networks and Applications (IJCNA)

Published By EverScience Publications

ISSN : 2395-0455

MENU
International Journal of Computer Networks and Applications (IJCNA)

International Journal of Computer Networks and Applications (IJCNA)

Published By EverScience Publications

ISSN : 2395-0455

An Efficient Restricted Flooding Based Route Discovery (RFBRD) Scheme for AODV Routing

Author NameAuthor Details

Poonam T. Agarkar, Manish D. Chawhan, Rahul N. Nawkhare, Daljeet Singh,Narendra P. Giradkar, Prashant R. Patil

Poonam T. Agarkar[1]

Manish D. Chawhan[2]

Rahul N. Nawkhare[3]

Daljeet Singh[4]

Narendra P. Giradkar[5]

Prashant R. Patil[6]

[1]Department of Electronics Engineering, Yeshwantrao Chavan College of Engineering, Nagpur, (M.S), India

[2]Department of Electronics and Telecommunication Engineering, Yeshwantrao Chavan College of Engineering, Nagpur, (M.S), India

[3]School of Electronics and Electrical Engineering, Lovely Professional University, Phagwara, Punjab, India

[4]Center for Space Research, Division of Research and Development, Lovely Professional University, Phagwara, Punjab, India

[5]Department of Electronics and Telecommunication Engineering, Smt. Radhikatai Pandav College of Engineering, Nagpur, (M.S), India

[6]Department of Management Studies, Smt. Radhikatai Pandav College of Engineering, Nagpur, (M.S), India

Cite this Article

DOI: 10.22247/ijcna/2023/223424

Pages : 792-805

 Download PDF

1042

Views

Abstract

AODV is one of the widely used routing schemes in WSN and MANET due to its on-demand characteristics and low overhead. The excessive flooding at the time of route discovery consumes lots of node energy. The network performance deteriorates due to the unconstrained and blind flooding of route request (RREQ) packets. The excessive flooding mechanism accounts for multiple reception of RREQ packets at nodes. It causes unwanted path loops, and packet collisions thus exhausting the node batteries. The restricted flooding-based route discovery (RFBRD) mechanism introduced in this paper adopts two different strategies for receiving first and subsequent RREQ packets before they are forwarded. On reception of the first RREQ at an intermediate node, the RREQ is forwarded/restricted based on node densities evaluated for the neighbourhood as well as the network. Four regions and five probabilities are considered based on node densities in the neighbourhood and the network. The mobile nodes lying in the low-density region are allowed to transmit the RREQ packets with higher probability as compared to other nodes present in high-density regions when the RREQ is received for the first time. For subsequent RREQ packets at an intermediate node, the RREQ is forwarded/restricted based on energy ratios and is allowed to forward the RREQ packets, if the node has sufficient residual energy concerning neighbourhood and network energies. Simulation analysis showed enhanced and improved performance in terms of end-to-end delay, and network residual energy concerning traditional AODV.

Index Terms

RREQ

Restricted Flooding Mechanism

RFBRD

Residual Energy

Average Energy

Energy Ratios

AODV

Reference

  1. 1.
    S. Choudhary and S. Jain, “A survey of energy-efficient fair routing in MANET,” International Journal of Scientific Research in Science, Engineering, and Technology, vol. 1, 2015, pp. 416–421.
  2. 2.
    P. Siripongwutikorn and B. Thipakorn, “Mobility-aware topology control in mobile ad hoc networks,” Computer Communications, vol. 31, no. 14, 2008, pp. 3521–3532.
  3. 3.
    L. M. Feeney and M. Nilsson, “Investigating the energy consumption of a wireless network interface in an ad hoc networking environment,” in Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), vol. 3, 2001, pp. 1548–1557, Anchorage, AK, USA.
  4. 4.
    A. J. Goldsmith and S. B. Wicker, “Design challenges for energy-constrained ad hoc wireless networks,” IEEE Wireless Communications, vol. 9, no. 4, 2002, pp. 8–27.
  5. 5.
    C. Yu, B. Lee, and H. Y. Youn, “Energy efficient routing protocols for mobile ad hoc networks,” Wireless Communications and Mobile Computing, vol. 3, no. 8, 2003, pp. 959–973.
  6. 6.
    D. Minoli, K. Sohraby, and B. Occhiogrosso, “IoT considerations, requirements, and architectures for smart buildings energy optimization and next-generation building management systems,” IEEE Internet of Things Journal, vol. 4, no. 1, 2017, pp. 269–283.
  7. 7.
    A. Batra, A. Shukla, S. Thakur, and R. Majumdar, “Survey of routing protocols for mobile ad hoc networks,” IOSR Journal of Computer Engineering, vol. 8, no. 1, 2012, pp. 34–40.
  8. 8.
    S. Prakash, J. Saini, and S. Gupta, “A review of energy efficient routing protocols for mobile ad hoc wireless networks,” International Journal of Computer Information Systems, vol. 1, no. 4, 2010, pp. 36–46.
  9. 9.
    I. Demirkol, C. Ersoy, and F. Alagöz, “MAC protocols for wireless sensor networks: a survey,” IEEE Communications Magazine, vol. 44, no. 4, 2006, pp. 115–121.
  10. 10.
    V. KumarSachan, S. A. Imam, and M. T. Beg, “Energy-efficient communication methods in wireless sensor networks: a critical review,” International Journal of Computer Applications, vol. 39, no. 17, 2012, pp. 35–48.
  11. 11.
    Z. Ul, A. Jaffri, and S. Rauf, “A survey on “energy efficient routing techniques in wireless sensor networks focusing on hierarchical network routing protocols”,” International Journal of Scientific and Research Publications, vol. 4, no. 1, 2014, pp. 2250–3153.
  12. 12.
    Ni S-Y, Tseng Y-C, Chen Y-S, and Sheu J-P, “The broadcast storm problem in a mobile ad hoc networks,” In Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking, August 1999, p. 152–62.
  13. 13.
    Williams B and Camp T, “Comparison of broadcasting techniques for mobile ad hoc networks,” In Proceedings of the 3rd ACM international symposium on mobile ad hoc networking and computing, MOBIHOC, June 2002, pp. 194–205.
  14. 14.
    Aminu M, Ould-Khaoua M, Mackenzie LM, and Abdulai J, ”An adjusted counter-based broadcast scheme for mobile ad hoc networks,” In Proceedings of the 10th international conference on computer modeling and simulation (EUROSIM/UKSIM 2008), 2008, pp. 441–446.
  15. 15.
    Cartigny J and Simplot D, “Border node retransmission based probabilistic broadcast protocols in ad-hoc networks,” Telecommunication System, vol. 22, 2003, pp. 189–204.
  16. 16.
    Samar P, Pearlman MR, and Haas ZJ, “Independent zone routing: an adaptive hybrid routing framework for ad hoc wireless networks,” IEEE/ACM TransNetwork, vol. 12, August 2004, pp. 595–608.
  17. 17.
    Murthy CSR and Manoj BS, “Ad-hoc wireless networks: architectures and protocols,” New Jersey: Prentice Hall PTR, 2004.
  18. 18.
    Ni S-Y, Tseng Y-C, Chen Y-S, and Sheu J-P, “The broadcast storm problem in a mobile ad hoc networks,” In Proceedings of the 5th annual ACM/IEEE International Conference on Mobile Computing and Networking, August 1999, pp. 152–62.
  19. 19.
    Williams B and Camp T, “Comparison of broadcasting techniques for mobile ad hoc networks,” In Proceedings of the 3rd ACM international symposium on mobile ad hoc networking and computing, MOBIHOC, June 2002, pp. 194–205.
  20. 20.
    S. Das, C. Perkins, E. Royer, “Ad hoc on-demand distance vector (AODV) routing,” 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, USA, 2002.
  21. 21.
    Jamel-Deen Abdulai, Mohamed Ould-Khaoua, and Lewis M. Mackenzie, “Adjusted probabilistic route discovery in mobile ad-hoc networks,” Computer and Electrical Engineering, vol. 35, 2009, pp. 168-182.
  22. 22.
    Poonam Agarkar, Manish Chawan, Kishor Kulat, and Pratik Hajare, “Zone-based selective neighbors to mitigate flooding & reliable routing for WSN,” International Conference on Connected Systems & Intelligence (CSI), Trivandrum, IEEE, 2022.
  23. 23.
    Bani-Yassein M, Ould-Khaoua M, Mackenzie LM, and Papanastasiou S, “Performance analysis of adjusted probabilistic broadcasting in mobile ad hoc networks,” International Journal on Wireless Information Networks 2006, 13(April), 127–40.
  24. 24.
    Sasson Y, Cavin D, and Schiper A, “Probabilistic broadcast for flooding in wireless mobile ad hoc networks,” In Proceedings of IEEE Wireless Communication and Networking Conference (WCNC), March 2003.
  25. 25.
    Zhang Q and Agrawal DP, “Dynamic probabilistic broadcasting in MANETs,” Journal on Parallel Distributed Computing, vol. 65, 2005, pp. 220–233.
  26. 26.
    Zhang Q and Agrawal DP, “Performance evaluation of leveled probabilistic broadcasting in MANETs and wireless sensor networks,” Transaction of the Society for Modelling & Simulation International, vol. 81(8): 14 –August 1, 2005, pp. 533–546.
  27. 27.
    Perkins C, Belding-Royer E, Das S. Ad hoc on-demand distance vector (AODV) routing. In: IETF mobile ad hoc networking Working Group INTERNET DRAFT, RFC 3561, July 2003.
  28. 28.
    Castañeda R and Das SR, “Query localization techniques for on-demand routing protocols in ad hoc networks,” In Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking, August 1999, pp. 186–94.
  29. 29.
    Broch J, Maltz DA, Johnson DB, Hu Y, and Jetcheva J, “A performance comparison of multi-hop wireless ad-hoc network routing protocols,” In Proceedings of ACM/IEEE international conference on mobile computing and networking (MOBICOM’98), October 1998, pp. 85–97.
  30. 30.
    Haas ZJ and Pearlman MR, “The performance of query control schemes for the zone routing protocol,” IEEE/ACM Trans Network 2001, 9 (August), pp. 427–38.
  31. 31.
    Sinha P, Sivakumar R, and Bharghvan V, “Enhancing ad hoc routing with dynamic virtual infrastructures,” In Proceedings of IEEE INFOCOM 2001, vol. 3, April 2001, pp. 1763–72.
  32. 32.
    Ju H, Rubin I, Ni K and Wu C, “A distributed mobile backbone formation algorithm for wireless ad hoc networks,” In Proceedings of 1st international conference on broadband networks (BroadNets’04), 2004, pp. 661–670.
  33. 33.
    Gao B, Yang Y, and Ma H, “An effective distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks,” In Proceedings of the 4th International Conference on Computer and Information Technology (CIT’04) September 2004, pp. 658–663.
  34. 34.
    Alzoubi P-JWK and Frieder O, “New distributed algorithm for connected dominating set in wireless ad hoc networks,” In Proceedings of 35th annual Hawaii International Conference on System Sciences (HICSS’02), vol. 9, 2002, pp. 297.
  35. 35.
    Kim J-S, Zhang Q, and Agrawal DP, “Probabilistic broadcasting based on coverage area and neighbor confirmation in mobile ad hoc networks,” In Proceedings of IEEE global telecommunications conference workshops (GlobeCom’2004), 29 November–3 December 2004, pp. 96–101.
  36. 36.
    Haas Z, Halpern JY and Li L, “Gossip-based ad hoc routing,” In Proceedings of IEEE INFOCOM’02, vol. 21, July 2002, pp. 1707–1716.
  37. 37.
    Gorre Narsimhulu and D. Srinivasa Rao, “On the reduction of flooding overhead with adaptive location aided routing in MANETs,” Turkish Journal of Computer and Mathematics Education, vol. 12, no. 11, 2021, pp. 6110-6121.
  38. 38.
    Bai Yuan, An Jie, and Zhang Huibing, “Location aided probabilistic broadcast algorithm for mobile Ad-hoc network routing,” The Journal of China Universities of Posts and Telecommunications, vol. 24(2), April 2017, pp. 66–71.
  39. 39.
    Satoshi Yamazaki, Yu Abiko and Hideki Mizuno, “A simple and Energy-Efficient Flooding Scheme for Wireless Routing,” Wireless Communications and Mobile Computing, vol. 2020.
  40. 40.
    P. Guruswamy, “Research article A novel efficient rebroadcast protocol for minimizing routing overhead in mobile ad-hoc networks,” International Journal of Computer Networks and Applications (IJCNA), vol. 3, no. 2, pp. 38–43, 2016.
  41. 41.
    Shaik Shafi, S Monika, and Velliangiri S, “Machine Learning and Trust Based AODV Routing Protocol to Mitigate Flooding and Blackhole Attacks in MANET,” In Procedia, International Conference on Machine Learning and Data Engineering, Computer Science, vol. 218, 2023, pp. 2309-2318.
  42. 42.
    Shaik, S., “An Efficient Secured AODV Routing Protocol to Mitigate Flooding and Block Hole Attack in VANETs for Improved Infotainment Services,” SEAS Transactions, vol. 2(1), 2023.
  43. 43.
    Hailu Gizachew Yirga, Gizzatie Desalegn Taye and Henock Mulugeta Melaku, “An Optimized and Energy-Efficient Ad-hoc-On-Demand Distance Vector Routing Protocol Based on Dynamic Forwarding Probability (AODVI),” Journal of Computer Networks and Communications, vol. 2022, Article ID 5750767, pp. 1-13.
  44. 44.
    Li J., Wang M., Zhu P., Wang D. and You X, “Highly Reliable Fuzzy-Logic-Assisted AODV Routing Algorithm for Mobile Ad Hoc Networks,” Sensors vol. 21, 2021, 5965.
  45. 45.
    Poonam T. Agarkar, Manish D. Chawan, Pradeep T. Karule, and Pratik R. Hajare, “A Comprehensive Survey on Routing Schemes and Challenges in Wireless Sensor Networks (WSN),” International Journal of Computer Networks and Applications (IJCNA), Volume 7, Issue 6, November – December (2020).
SCOPUS
SCImago Journal & Country Rank

Announcements

Archives

Downloads

Contact Us

Dr.M. Milton Joe
EverScience Publications,
Nagercoil, Tamilnadu,India

Talk to Us

+91 9442777224

Email Us

editor@ijcna.org

info@ijcna.org

info@everscience.org

Quick Links

Follow Us

Copyright © 2023; EverScience Publications

Designed & Maintained By Shiro Software Solutions