NCPR Reducing Path-Discovery Overload in Mobile Adhoc Networks (MANET’s)

Authors

  • Ajit R. Patil Department of Computer Engineering, Bharati Vidyapeeth’s College of Engineering Lavale, Pune, Maharashtra, India
  • Avinash M. Ingole Department of Computer Engineering, Bharati Vidyapeeth’s College of Engineering Lavale, Pune, Maharashtra, India

DOI:

https://doi.org/10.51983/ajcst-2022.11.1.3300

Keywords:

Mobile Adhoc-Networks, AODV, MANET’s, Routing Overhead, Neighour Coverage

Abstract

In this research manuscript we propose in improved NCPR protocol with security mechanism against attack. less broadcast traffic than flood broadcast method minimizing congestion and collision with maximum data packet delivery the scheme stands in with high density network which is main performance parameter. Due to soaring mobility of nodes in MANETs there exist recurrent connection breakages which direct to recurrent path crash and route Findings. The overhead of a path discovery cannot be deserted. In a route discovery, broadcasting is an original and successful data distribution method, where a movable node blindly rebroadcasts the first established route appeal packets unless it has a route to the target, and thus it causes the broadcast tempest difficulty. In this Manuscript we propose a neighbor coverage- based probabilistic rebroadcast protocol (NCPR0 for reducing routing overhead in MANETs. In arrange to successfully exploit the neighbor coverage knowledge, we recommend a novel rebroadcast delay to resolve the rebroadcast categorize, and then we can gain the more exact supplementary coverage ratio by sensing neighbor coverage knowledge. We also classify a connectivity factor to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. Our approach combines the advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can appreciably diminish the number of retransmissions so as to reduce the routing overhead and can also progress the routing performance.

References

Xin Ming Zhang, En Bo Wang, Jing Jing Xia and Dan Keun Sung, “A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks,” IEEE Transactions on Mobile Computing, Vol. 12, No. 3, March 2013.

C. Perkins, E. Belding-Royer and S. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing,” IETF RFC 3561, 2003.

D. Johnson, Y. Hu, and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR) for IPv4,” IETF RFC 4728, Vol. 15, pp. 153-181, 2007.

H. AlAamri, M. Abolhasan and T. Wysocki, “On Optimising Route Discovery in Absence of Previous Route Information in MANETs,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 1-5, 2009.

X. Wu, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, “Routing Overhead as a Function of Node Mobility: Modeling Framework and Implications on Proactive Routing,” Proc. IEEE Int’l Conf. Mobile Ad Hoc and Sensor Systems (MASS ’07), pp. 1-9, 2007.

S. Y. Ni, Y. C. Tseng, Y. S. Chen and J. P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM/IEEE Mobi Com, pp. 151-162, 1999.

J. Kim, Q. Zhang, and D. P. Agrawal, “Probabilistic Broadcasting Based on Coverage Area and Neighbor Confirmation in Mobile Ad Hoc Networks,” Proc. IEEE Globe Com, 2004.

A. Keshavarz-Haddady, V. Ribeirox and R. Riedi, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks,” Proc. IEEE Comm. Soc. Conf. Sensor, Mesh, and Ad Hoc Comm. and Networks (SECON ’07), pp. 253-262, 2007.

J. D. Abdulai, M. Ould-Khaoua, L. M. Mackenzie and A. Mohammed, “Neighbour Coverage: A Dynamic Probabilistic Route Discovery for Mobile Ad Hoc Networks,” Proc. Int’l Symp. Performance Evaluation of Computer and Telecomm. Systems (SPECTS ’08), pp. 165-172, 2008.

H. AlAamri, M. Abolhasan and T. Wysocki, “On Optimising Route Discovery in Absence of Previous Route Information in MANETs,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 1-5, 2009.

X. M. Zhang, E. B. Wang, J. J. Xia and D. K. Sung, “An Estimated Distance Based Routing Protocol for Mobile Ad Hoc Networks,” IEEE Trans. Vehicular Technology, Vol. 60, No. 7, pp. 3473-3484, Sept. 2011.

W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM Mobi Hoc, pp. 129-130, 2000.

J. Chen, Y. Z. Lee, H. Zhou, M. Gerla, and Y. Shu, “Robust Ad Hoc Routing for Lossy Wireless Environment,” Proc. IEEE Conf. Military Comm. (MILCOM 06), 2006.

Downloads

Published

10-06-2022

How to Cite

Patil, A. R., & Ingole, A. M. (2022). NCPR Reducing Path-Discovery Overload in Mobile Adhoc Networks (MANET’s). Asian Journal of Computer Science and Technology, 11(1), 48–54. https://doi.org/10.51983/ajcst-2022.11.1.3300