Download now Free registration required
Leader election process is known as the task of selecting a particular node or a process to be a unique leader of the distributed system. Many algorithms were proposed for leader election in classical, wired distributed systems. However, with the advent of wireless communication technology, the domain of distributed computing becomes much wide, and the concept of leader election in such environments has been changed due to the dynamic topology resulted from nodes' mobility. The existing classical leader election algorithms do not adapt well in mobile ad hoc environments. In this paper, the authors propose a new leader election algorithm that is conscious about nodes' mobility and the dynamic topology of ad hoc networks.
- Format: PDF
- Size: 643.98 KB