View article

In this work we propose simple and efficient protocols for counting and leader election in mobile networks. For mobile networks with fixed base stations we provide a new and very efficient protocol for counting the number of mobile hosts. The main part of the work concentrates on ad-hoc networks (no fixed subnetwork). We provide a model for these networks and leader election (and a special form of counting) protocols for both named and anonymous mobile hosts. In this work we define two protocol classes, the Non-Compulsoryprotocols, which do not affect the motion of the hosts and the Compulsory, which determine the motion of some or all the hosts. By assuming that the mobile hosts move as if each one is doing a continuous random walk on their allowable space S of motions, and by assuming a universal time, we show that our leader election protocol terminates (with high probability and also on the average …