Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad-hoc Mobile Networks
|
Full Text |
Pdf |
|
Author |
K Ranganath, L.Naveen Kumar, Y.V.Sreevani
|
|
ISSN |
2079-8407 |
|
On Pages
|
187-191
|
|
Volume No. |
2
|
|
Issue No. |
4
|
|
Issue Date |
April 01, 2011 |
|
Publishing Date |
April 01, 2011 |
|
Keywords |
Self-stabilizing, Leader node, Ad hoc networks, Bandwidth, MANET.
|
Abstract
We propose a self-stabilizing leader election algorithm that can tolerate multiple concurrent topological changes. By introducing the time interval based computation concept, the algorithm ensures that a network partition within a finite time converge to a legitimate state even if topological changes occur during the convergence time. An ad hoc network is a collection of mobile nodes forming a temporary network without any form of centralized administration or predefined infrastructure. In such a network, each node participating in the network acts as both a host and a router. Two nodes can communicate if they are within the transmission range of each other. Due to node mobility, link breakages and link formations might occur frequently. The failure of some links considered as critical and can split up the network into several disjoint network components. In addition, multiple components can also merge into a single connected component. In this paper we have investigated the functional system with the proposed algorithm and how it monitors the mobile non static hosts and the transmission process between them.
Back