Energy Efficient Cluster Based Optimizing Broadcast Mechanism for Adhoc Networks

	International Journal of P2P Network Trends and Technology (IJPTT)
	© 2016 by IJPTT Journal
	Volume - 6 Issue - 5
	Year of Publication : 2016
	Authors : M.Preethi, S.Vibu

Citation

M.Preethi, S.Vibu "Energy Efficient Cluster Based Optimizing Broadcast Mechanism for Adhoc Networks". International Journal of P2P Network Trends and Technology (IJPTT), V6(5):11-15 Sep - Oct 2016, ISSN:2249-2615, www.ijpttjournal.org, Published by Seventh Sense Research Group.

Abstract

A mobile ad hoc network (MANET) is a collection of mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received Route Request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. These create the overhead in the routing protocol during the route discovery. Here Rebroadcast Probability algorithm is used for reducing the routing overhead in route discovery. After finding the path the data packet is send to the destination. Another technique proposed here to provide the data security in MANET using node authentication and digital signature. This security mechanism called SMDNA (Securing MANET Data using Node Authentication) improves the performance of the routing protocol AODV.

References

[1] C. Perkins, E. Belding-Royer, and S. Das, Ad Hoc On-Demand Distance Vector (AODV) Routing, IETF RFC 3561, 2003.
[2] 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
[3] H. AlAamri, M. Abolhasan, and T. Wysocki, “On Optimizing Route Discovery in Absence of Previous Route Information in MANETs,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 1-5, 2009.
[4] 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 MobiCom, pp. 151-162, 1999.
[5] J. Kim, Q. Zhang, and D.P. Agrawal, “Probabilistic Broadcasting Based on Coverage Area and Neighbor Confirmation in Mobile Ad Hoc Networks,” Proc. IEEE GlobeCom, 2004.
[6] J.D. Abdulai, M. Ould-Khaoua, and L.M. Mackenzie, “Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks,” Proc. IEEE Conf. Local Computer Networks, pp. 739- 746, 2007.
[7] Z. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE INFOCOM, vol. 21, pp. 1707-1716, 2002.
[8] W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 129-130, 2000.
[9] J.D. Abdulai, M. Ould-Khaoua, L.M. Mackenzie, and A. Mo- hammed, “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.
[10] 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.

Keywords
collision, contention, digital signature, routing overhead, authentication.