Author : Parth Patel, Ninad Bhavsar and Neha Soni

Neighbor discovery (ND) is an important pre-requisite for initializing wireless ad hoc networks through the fast and efficient ND protocol for achieving self-organization and multi-hop communications which subsequently affect routing, MAC and topology control protocols. Most important performance parameters such as reliability, resource efficiency and responsiveness are necessary for a typical neighbor discovery protocols. Existing protocol have no multiple packet reception is used that is, a collision occurs when two or more nodes simultaneously transmit packets to it in a slot. FRIEND protocol conducts the neighbor discovery process and it significantly reduces the probability of generating idle slot and collisions. By introducing some enhancement, we further decrease the processing time needed in existing protocol. Analysis proves that proposed algorithm can decrease the duration of ND in comparison to the existing protocol. Simulation results show that new algorithm can significantly decrease the iterations for ND.

Keywords: Wireless Ad Hoc Networks, Neighbor Discovery, Randomized Algorithms.

Article published in International Journal of Current  Engineering  and Technology, Vol.4,No.3 (June- 2014)