Top K-leader election in mobile ad hoc networks

In our proposed algorithm, initially few coordinator nodes are selected locally which collect the weights of other nodes using the diffusing computation approach. The coordinator nodes then collaborate together, so that, finally the highest weight coordinator collects weights of all the nodes in the network. Besides simulation we have also implemented our algorithm on a testbed and conducted experiments. The results prove that our proposed algorithm is scalable, reliable, message-efficient, and can handle dynamic topological changes in an efficient manner.