• P-ISSN 0974-6846 E-ISSN 0974-5645

Indian Journal of Science and Technology


Indian Journal of Science and Technology

Year: 2023, Volume: 16, Issue: 39, Pages: 3394-3406

Original Article

An Approach for Scaling Down the Control Packet Load of AODV Routing by Adopting WRS Model for MANETs

Received Date:07 August 2023, Accepted Date:22 September 2023, Published Date:25 October 2023


Background/Objectives: A MANET is collection of mobile hosts that often change paths. AODV routing is best for establishing route. There are issues with broadcast storm like contention, collision and interference. They deteriorate performance of QoS. For setting a path, it is necessary to broadcast RRPs, which lead to consumption of bandwidth, congestion and contention. The aim of broadcasting is to decrease flooding. MANETs have limited bandwidth hence necessary to decrease the amount of flooding. Methods: AODV transmits RRPs to adjacent nodes for setting up a route and thus enhances the consumption of network bandwidth. Our approach uses weights assigned to nodes depending on the set of rules framed for determining an appropriate path. The proposal is integrated with AODV with information about 2-hop neighbors. This helps in establishing efficient forward path, thus reducing redundancy. Findings: The limited availability of bandwidth in MANETs, it’s necessary to reduce control packets and considered many parameters for simulation. The outcome of proposed approach is compared with RS-AODV considering conditions like collisions, broken links, energy consumption end-to-end delay and RRPs. Ad hoc networks are found to be constant for a specific period of time and this helps in collecting neighbor node information. This determines an efficient path has been established, thus reducing the packets being broadcasted. Novelty: WRS mechanism is discussed in this paper for reducing the packets being transmitted in the prevailing AODV routing. The simulation exhibits that WRS-AODV approach is 3% energy efficient, throughput achieved with 20.4% enhancement and 65% reduction in the packets being transferred. A mathematical approach for addressing uncertainty and ambiguity, which also takes into consideration the importance of object, is WRS theory. NS-2 used shows to be effective for the proposed model in terms of performance for parameters like throughput, broken links, collisions, end-to-end delay, RRPs and energy consumption.

Keywords: Broadcasting, Flooding, MANET, Weighted Rough Set, AODV, Neighbor Coverage


  1. Ishii Y, Iwao K, Kinoshita T. A New Rough Set Classifier for Numerical Data Based on Reflexive and Antisymmetric Relations. Machine Learning and Knowledge Extraction. 2022;4(4):1065–1087. Available from: https://doi.org/10.3390/make4040054
  2. Li W, Huang Z, Jia X, Cai X. Neighborhood based decision-theoretic rough set models. International Journal of Approximate Reasoning. 2016;69:1–17. Available from: https://doi.org/10.106/j.ijar.2015.11.005
  3. Wang C, Huang Y, Shao M, Hu Q, Chen D. Feature Selection Based on Neighborhood Self-Information. IEEE Transactions on Cybernetics. 2020;50(9):4031–4042. Available from: https://doi.org/10.1109/TCYB.2019.2923430
  4. Sudhakar T, Kumar SS, Ravi V, Ramalingam R, Dua S. Neighborhood rough set‐based route selection for mobile ad hoc networks. International Journal of Communication Systems. 2022;35(11). Available from: https://doi.org/10.1002/dac.5178
  5. Wang C, Huang Y, Ding W, Cao Z. Attribute reduction with fuzzy rough self-information measures. Information Sciences. 2021;549:68–86. Available from: https://doi.org/01.1016/j.ins.2020.11.021
  6. Xu J, Shen K, Sun L. Multi-label feature selection based on fuzzy neighborhood rough sets. Complex & Intelligent Systems. 2022;8(3):2105–2129. Available from: https://doi.org/10.1016/j.ijar.2022.01.010
  7. Ji W, Pang Y, Jia X, Wang Z, Hou F, Song B, et al. Fuzzy rough sets and fuzzy rough neural networks for feature selection: A review. WIREs Data Mining and Knowledge Discovery. 2021;11(3):1–15. Available from: https://doi.org/10.1002/widm.1402
  8. Anjum A, Oannahary T, Shahrin D, Ferdous CN. Construction of connected dominating set to reduce contention in wireless ad-hoc network. Proceedings of the 6th International Conference on Networking, Systems and Security. 2019;p. 59–67. Available from: https://doi.org/10.1145/3362966.3362975
  9. Shenbagalakshmi G, Revathi T. RETRACTED ARTICLE: Enhanced route discovery using connected dominating set and 2-hop repair in wireless ad hoc networks. Journal of Ambient Intelligence and Humanized Computing. 2021;12(3):4193–4203. Available from: https://doi.org/10.1007/s12652-020-01799-1
  10. Hoque S, Majumder R, Islam S, Anannya TT. Reducing Redundancy by Optimizing Dominant Pruning Algorithm for Wireless Ad Hoc Networks. Proceedings of the International Conference on Computing Advancements. 2020;11:1–9. Available from: https://doi.org/10.1145/3377049.3377073
  11. Xie J, Hu BQ, Jiang H. A novel method to attribute reduction based on weighted neighborhood probabilistic rough sets. International Journal of Approximate Reasoning. 2022;144(C):1–17. Available from: https://doi.org/10.1016/j.ijar.2022.01.010
  12. Wu CH, Li CW. Node-Stamping Approaches to Efficient Message Broadcasting in Wireless Ad Hoc Networks. Journal of Advances in Computer Networks. 2019;7(2):38–43. Available from: https://doi.org/10.18178/jacn.2019.7.2.269


© 2023 Rao et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Published By Indian Society for Education and Environment (iSee)


Subscribe now for latest articles and news.