High Anonymity Protection Routing Protocol in MANETs Using Neighbor Coverage Based Probabilistic Rebroadcast
V. Deepalakshmi,  M. Rajeswari,  V. Krishnaveni
With the wide use of mobile devices in mobile ad hoc networks, maintaining anonymity is becoming an increasingly important issue. Existing routing algorithms either rely on hop-by-hop encryption or local broadcasting for anonymous routing, which lead to high overhead. An Anonymous Location-based Efficient Routing protocol (ALERT) was used to offer high anonymity protection at a low cost. Like other anonymity routing algorithms, ALERT is not completely bulletproof to all attacks and it will identify the attackers only. To prevent the occurrence of stronger and active attackers, we propose a new technique for reducing routing overhead in Mantes’ using NCPR routing Protocol. The above protocol are on-demand routing protocols, and they could improve the scalability of MANETs by limiting the routing overhead when a new route is requested. A NCPR procedure must be deterministic—meaning that for a given input value it must always generate the same Address value. In other words, it must be a function of the data to be addressed, in the mathematical sense of the term.
Keywords- Anonymity, ALERT, NCPR Routing protocol, Zone Partition.
Cite this Article
V. Deepalakshmi,  M. Rajeswari,  V. Krishnaveni,   "High Anonymity Protection Routing Protocol in MANETs Using Neighbor Coverage Based Probabilistic Rebroadcast"
, International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.2, Issue 2, pp.1810-1813, June 2014, Available at :http://www.ijedr.org/papers/IJEDR1402084.pdf