International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 5 | Number 1 | Year 2013 | Article Id. IJCTT-V5N1P109 | DOI : https://doi.org/10.14445/22312803/IJCTT-V5N1P109

A Selfishness Aware Neighbor Coverage Based Probabilistic Rebroadcast Protocol for Manets

Deepthi Sivaraj

Citation :

Deepthi Sivaraj, "A Selfishness Aware Neighbor Coverage Based Probabilistic Rebroadcast Protocol for Manets," International Journal of Computer Trends and Technology (IJCTT), vol. 5, no. 1, pp. 44-48, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V5N1P109

Abstract

Broadcasting is a fundamental and effective data dissemination mechanism for route discovery, address resolution and many other network services in ad hoc networks. While data broadcasting has many advantages, it also causes some problems such as the broadcast storm problem, which is characterized by redundant retransmission, collision, and contention. To discover the route better than broadcasting methodology, rebroadcast can be done with the help of neighbor knowledge methods. In order to effectively exploit the neighbor coverage knowledge, we propose a novel rebroadcast delay and a connectivity factor to provide the node density adaptation. This paper proposes new reputation based neighbor coverage based probabilistic rebroadcast protocol based on AODV (Ah hoc On demand Distance Vector). This approach can significantly decrease the number of retransmissions so as to reduce the routing overhead and also improve the routing performance.

Keywords

Mobile ad hoc networks, neighbor coverage, network connectivity, probabilistic rebroadcast, routing overhead, reputation.

References

[1] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc OnDemand Distance Vector (AODV) Routing,” RFC 3561, 2003.
[2] D. Johnson, Y. Hu, and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad hoc Networks (DSR) for IPv4,” RFC 4728, 2007.
[3] S. Y. Ni, Y. C. Tseng, Y. S. Chen, and J. P. Sheu. “The Broadcast Storm Problem in a Mobile Ad hoc Network,” Proc. of ACM/IEEE MobiCom’99, pp. 151-162, 1999.
[4] J. Kim, Q, Zhang, and D. P. Agrawal, “Probabilistic Broadcasting Based on Coverage Area and Neighbor Confirmation in Mobile Ad hoc Networks,” Proc. of IEEE GLOBECOM’04, 2004.
[5] J. D. Abdulai, M. Ould-Khaoua, and L. M.  Mackenzie, “Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks,” Proc. Of IEEE Conference on Local Computer Networks, pp. 739-746, 2007.
[6] Z. Haas, J. Y. Halpern, and L. Li, “Gossip-based Ad hoc Routing,” Proc. IEEE INFOCOM’02, vol. 21, pp. 1707-1716, 2002. 
[7] M. Tamer Refaei, VivekSrivastava, LuizDaSilva, Mohamed Eltoweissy, " A Reputation-based Mechanism for Isolating Selfish Nodes in AdHoc Networks", Proceedings of the Second Annual International Conference on Mobile and Ubiquitous Systems: (MobiQuitous'05) , 2005  Networking and Services
[8] Animesh Kr Trivedi1, Rishi Kapoor1, Rajan Arora1, Sudip Sanyal1 and SugataSanyal , " RISM – Reputation Based Intrusion Detection System for Mobile Adhoc Networks" Available profile.iiita.ac.in/aktrivedi_b03/rism.pdf. from
[9]F. Xue and P.R. Kumar, “The Number of  Neighbors Needed for Connectivity of Wireless Networks,” Wireless Networks, vol. 10, no. 2, pp. 169-181, 2004.
[10]. Ns-2. http:// www.isi.edu/nsnam /ns.