MOBILITY BASED SECURE LEADER ELECTION ALGORITHM FOR DYNAMIC MOBILE AD HOC NETWORKS

Author (s) : S.Sangeetha and M.Brindha

---

Abstract :
Mobile Ad hoc Networks (MANETs) consist of a large number of relatively low-powered mobile nodes communicating in a network using radio signals. Clustering is one of the techniques used to manage data exchange amongst interacting nodes. Each group of nodes has one or more elected Cluster head(s), where all Cluster heads are interconnected for forming a communication backbone to transmit data. Moreover, Cluster heads should be capable of sustaining communication with limited energy sources for longer period of time. Misbehaving nodes and cluster heads can drain energy rapidly and reduce the total life span of the network. In this context, selection of best cluster heads with trusted information becomes critical for the overall performance. In this paper, we propose Cluster head(s) selection algorithm based on an efficient trust and mobility model. This algorithm aims to elect trustworthy stable cluster head(s) that can provide secure communication via cooperative nodes. Simulations were conducted to evaluate trusted Cluster head(s) in terms of clusters stability, longevity and throughput.

Keywords : Mobility, MANET, Ad hoc, Stability

Conference Date : 30/08/2019

Pages : 10

Paper ID : 19010