Best Neighbour Node Selection Algorithm for Mobile Ad hoc Networks

摘要

Ad hoc network is a collection of wireless, mobile, dynamic, and arbitrarily located nodes. The nodes cooperate with each other to create an infrastructureless temporary low cost network. The high mobility of nodes result in rapid changes in the routes, thus requiring some mechanism for determining new routes with minimum overheads and bandwidth consumption. Such infrastructureless networks use multicast routing protocols to manage random and uncertain events like rescue missions, disaster recovery, crowd control etc. The existing multicast routing protocols suffer from many drawbacks. This paper presents an algorithm called best neighbor node selection algorithm (BNNSA) which has been designed for choosing the next best mobile node in such a manner that number of packets transmitted on network are drastically reduced.