Abstract

In this paper, we shall propose three algorithms for leader node election for an adaptive network of movable nodes\nin a mobile ad-hoc network (MANET) with an effort to minimize overhead costs during election process. A MANET or\nmobile ad-hoc network is a collection of wireless devices/nodes which needs to communicate with each other in the absence\nof any well-defined infrastructure and these devices are constantly moving autonomously. A source node will communicate\nwith a destination node with the help of other intermediate nodes, thus it is of utmost importance to prevent the individual\nnodes from breaking away from the network. Our simulation model follows hybrid routing.\nA leader node will be elected from among the participating nodes, based on current network topology, movement trends and\nother parameters, which will be responsible for maintaining the network membership by directing the velocity of movement\nof the other nodes. It is the responsibility of the Leader Node to prevent the network from breaking apart and allow routing to\ncontinue. Once a leader fails some predefined criteria, it ceases to remain leader and it will behave like any non-leader node,\nand there will be a leadership handover. The change of leader is done without any re-election so as to preserve node battery\nlife.