NCPR and Node- NCPR Protocol in Mobile Ad- Hoc Networks
The increase in availability and popularity of mobile wireless devices has lead researchers to develop a wide variety of Mobile Ad-hoc NETworking (MANET) protocols to exploit the unique communication opportunities presented by these devices. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. This paper proposes a neighbor coverage-based probabilistic rebroadcast (NCPR) protocol for reducing routing overhead in MANETs. And also compare the performance of two prominent on demand reactive routing protocols for MANETs: Ad hoc On Demand Distance Vector (AODV), Dynamic Probabilistic Routing (DPR) protocols with NCPR protocol. DPR and AODV are reactive gateway discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. The new protocol combines the advantages of the neighbour coverage knowledge and the probabilistic mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. Keywords— Mobile Ad-hoc Network: AODV; DPR; NCPR; Probabilistic Rebroadcast; Routing Overhead