Efficiency of Algorithms for Neighbouring Node Discovery in Ad- hoc Wireless Networks
Manu Srivastava, Namrata Dhanda · 2015
We describe a protocol for learning about neighbouring nodes in such an environment. The protocol is used for establishing and tearing down communication links with neighboring nodes as they move from one region of the network to another. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. The work also aims at combine and finding a more efficient routing protocol for node discovery in adhoc network. This however as stated earlier is a challenging task as the nodes are mobile and maybe constantly moving. So it’s tricky to find the best possible route from source to destination packet delivery.