Journal Title : International Journal of Modern Trends in Engineering and Science

Author’s Name : P.Thirumoorthi , Dr.K.Venkatachalam

Volume 01 Issue o5  Year 2014  

ISSN no:  2348-3121

Page no: 97-102

Abstract—In Mobile Adhoc Networks (MANETs) due to high mobility of nodes there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In this paper, A Neighbor Coverage based Probabilistic Rebroadcast (NCPR) protocol for reducing routing overhead in MANETs is proposed and analysed. In order to effectively exploit the neighbor coverage knowledge, a novel rebroadcast delay, technique to determine the rebroadcast order, and for accurate additional coverage ratio by sensing neighbor coverage knowledge is considered. NCPR protocol also defines  the connectivity factor to provide the node density adaptation. This approach can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. Good Node Detection Algorithm(GNDA) is also considered to reduce the routing overhead with NCPR protocol in MANETs.

Keywords— Mobile Ad-hoc Networks (MANETs), Neighbor Coverage based Probabilistic Rebroadcast (NCPR), Good Node Detection Algorithm(GNDA),Routing Overhead.


[1] Adrian Perrig and Yih-chun hu (2005), “A Secure On-Demand Routing Protocol for Ad Hoc Networks”, Wireless Networks Springer Science and Business Media, Vol. 11, pp.21-38.
[2] Belding-Royer.E, Das.S and Perkins.C (2003), “Ad Hoc On-Demand Distance Vector (AODV) Routing”, Internet Engineering Task Force Requests for Comments:3561.
[3] Boleng Vanessa Davies and Tracy Camp Jeff (2002),“A Survey of Mobility Models for Ad Hoc Network Research”, Wireless Communication and Mobile Computing, Special issue on Mobile Ad Hoc Networking: Research,Trends and Applications, Vol. 2, No. 5, pp.483-502.
[4] Chao-Chin Chou, et.al., (2007), “An Efficient Anonymous Communication Protocol for Peer-to-Peer Applications over Mobile Ad-hoc Networks”, IEEE Journal on Selected Areas in Communications, Vol. 25.
[5] Elisa Bertino, Jun Liu Xiaoyan Hong and Xiaoxin Wu (2008), “Anonymous Geo-Forwarding in MANETs through Location Cloaking”, IEEE Transactions on Parallel and Distributed Systems, Vol. 19, No.10.
[6] En Bo Wang et.al.,(2013), “A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks”,IEEE Transactions on Mobile Computing, Vol.12, No.3.
[7] Johnson Adrian Perrig and Yih-Chun Hu David (2002),”SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks”, Proceedings of IEEE Workshop on Mobile Computing Systems and Applications.
[8] Zhi Zhou et.al., (2005) “Anonymizing Geographic Ad Hoc Routing for Preserving Location Privacy” International Journal of Network Security, Vol.2, No.3.
[9] S. Weber, X. Yang, J. Andrews, and G. Veciana, “Transmission Capacity of Wireless Ad Hoc Networks with Outage Constraints,” IEEE Trans. Information Theory, Vol. 51, No. 12, pp. 4091-4102, Dec.(2005).
[10] S. Shakkottai, X. Liu, and R. Srikant, “The Multicast Capacity of Large Multihop Wireless Networks,” Proc. ACM MobiHoc, pp. 247-255, (2007).
[11] J. Jun and M.L. Sichitiu, “The Nominal Capacity of Wireless Mesh Networks,” IEEE Wireless Comm., Vol. 10, No. 5, pp. 8-14, Oct. (2003).
[12] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM, pp. 205-217, Aug. (2002).

Full Pdf Paper-Click Here