IJTEEE
International Journal of Technology Enhancements and Emerging Engineering Research (ISSN 2347-4289)
PREVIOUS PUBLICATIONS



IJTEEE >> Volume 2 - Issue 6, June 2014 Edition



International Journal of Technology Enhancements and Emerging Engineering Research  
International Journal of Technology Enhancements and Emerging Engineering Research

Website: http://www.ijteee.org

ISSN 2347-4289



Enabling Efficient Rebroadcast For Reducing Routing Overhead In Manets

[Full Text]

 

AUTHOR(S)

S. Sindhuja S. Vidhya

 

KEYWORDS

Index terms: Mobile Ad Hoc Networks, Route Request, Connectivity factor.

 

ABSTRACT

Abstract: Mobile Ad Hoc NETwork is a wireless network formed by wireless nodes without any help of infrastructure. In this network, nodes are mobile and can communicate dynamically in an arbitrary manner. The network is characterized by the absence of central administration devices like base stations and access points. One of the fundamental challenges in Mobile Ad Hoc NETwork is to discover the route with good performance and less overhead. The overhead of a route discovery cannot be neglected. Limiting the number of rebroadcasts can optimize the broadcasting. Enabling efficient rebroadcast for reducing routing overhead in Mobile Ad Hoc NETwork is used to reduce the number of retransmissions and routing overhead. The probabilistic rebroadcast algorithm is used to calculate the Covered Neighbor set and UnCovered Neighbor set for broadcasting. Broadcasting based on probabilistic rebroadcast algorithm can effectively discover the route by using the additional coverage ratio and connectivity factor. Simulation results are demonstrated using NS-2 Simulator. From these results, the proposed system significantly decreases the number of retransmissions, routing overhead and increases the routing performance.

 

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 Optimising Route Discovery in Absence of Previous Route Information in MANETs,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 1-5, 2009.

[4]. 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.

[5]. 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.

[6]. B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 194- 205, 2002.

[7]. 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.

[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. 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.

[10]. 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.

[11]. 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.

[12]. F. Stann, J. Heidemann, R. Shroff, and M.Z. Murtaza, “RBP: Robust Broadcast Propagation in Wireless Networks,” Proc. Int’ Conf. Embedded Networked Sensor Systems (SenSys ’06), pp. 85-98, 2006.

[13]. 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.

[14]. Z. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE INFOCOM, vol. 21, pp. 1707-1716, 2002.

[15]. Jing Jing Xia and Xin Ming Zhang , “A Neighbor coverage based probabilistic rebroadcast for reducing routing overhead in Mobile Ad Hoc Networks”, IEEE Transactions on Mobile Computing, Vol.12, No.3, 2013.

[16]. Mohammed . A and Jabaka. M.L , “On the Performance of Counterbased broadcast scheme for Mobile Ad Hoc Networks”, Nigerian Journal of Basic and Applied Science, Vol.17, no.2, pp. 166-176, 2009.