scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Efficient Hybrid Scheme for Cluster Head Election in Mobile Ad-hoc Networks

S R Drishya1, V Vaidehi1
01 Sep 2018-
TL;DR: A Stable Trust-based Clustering Algorithm (STCA) in which both trust and weight of the node are considered for CH election, and which reduces computation cost in CH election.
Abstract: Achieving reliable routing is the primary concern in the Mobile Ad-hoc Network (MANET) due to dynamic topology and lack of centralized coordination. Among all protocols, the Cluster Based Routing Protocol (CBRP) is proved as an energy efficient routing protocol. In CBRP, selecting a suitable Cluster Head (CH) leads to enhanced network life time. Electing CH by considering security is one of the challenging tasks in CBRP. If elected node is malicious then attack such as routing disruption leads to data transmission failure. In order to avoid such attacks, a trustable node needs to be elected as CH for reliable routing. Existing CH election algorithms consider either trust or weight of the node as a factor to elect CH. Hence this paper proposes a Stable Trust-based Clustering Algorithm (STCA) in which both trust and weight of the node are considered for CH election. The proposed STCA allows only trustable nodes for weight calculation. This reduces computation cost in CH election. The proposed algorithm is simulated in NS3 and found to give better results in terms of number of clusters formed and lifetime of the CH.
Citations
More filters
Journal ArticleDOI
TL;DR: This paper proposes a stable clustering scheme which provides network stability and energy efficiency, and computes the weight of the node using a combination of node metrics.
Abstract: The main concern in MANET is increasing network lifetime and security. Clustering is one of the approaches that help in maintaining network stability. Electing an efficient and reliable Cluster Head (CH) is a challenging task. Many approaches are proposed for efficient clustering, weight-based clustering is one among them. This paper proposes a stable clustering scheme which provides network stability and energy efficiency. Proposed Stable Clustering Algorithm with Node Prediction (SCA-NP) computes the weight of the node using a combination of node metrics. Among these metrics, Direct Trust (DT) of the node provides a secure choice of CH and Node Prediction metric based on the minimum estimated time that node stay in the cluster provides the stable clustering. Mobility prediction is considered as the probability that a node stays in the network. This metric helps in electing CH which is available in the network for a longer time. Simulation is done in NS3 to evaluate the performance of SCA-NP in terms of clusters formed, network lifetime, efficiency in packet delivery, detecting malicious nodes and avoiding them in communication.
References
More filters
Journal ArticleDOI
TL;DR: This work seeks to combine the notions of "social trust" derived from social networks with "quality-of-service (QoS) trust"derived from information and communication networks to obtain a composite trust metric.
Abstract: Managing trust in a distributed Mobile Ad Hoc Network (MANET) is challenging when collaboration or cooperation is critical to achieving mission and system goals such as reliability, availability, scalability, and reconfigurability. In defining and managing trust in a military MANET, we must consider the interactions between the composite cognitive, social, information and communication networks, and take into account the severe resource constraints (e.g., computing power, energy, bandwidth, time), and dynamics (e.g., topology changes, node mobility, node failure, propagation channel conditions). We seek to combine the notions of "social trust" derived from social networks with "quality-of-service (QoS) trust" derived from information and communication networks to obtain a composite trust metric. We discuss the concepts and properties of trust and derive some unique characteristics of trust in MANETs, drawing upon social notions of trust. We provide a survey of trust management schemes developed for MANETs and discuss generally accepted classifications, potential attacks, performance metrics, and trust metrics in MANETs. Finally, we discuss future research areas on trust management in MANETs based on the concept of social and cognitive networks.

691 citations

Journal ArticleDOI
TL;DR: This paper is a survey of trust based protocols and it proposes some new techniques on trust management in MANETs, a Collection of mobile nodes connected with wireless links.
Abstract: Mobile Ad Hoc Network (MANETs) is a Collection of mobile nodes connected with wireless links. MANET has no fixed topology as the nodes are moving constantly form one place to another place. All the nodes must co-operate with each other in order to route the packets. Cooperating nodes must trust each other. In defining and managing trust in a military MANET, we must consider the interactions between the composite cognitive, social, information and communication networks, and take into account the severe resource constraints (e.g., computing power, energy, bandwidth, time), and dynamics (e.g., topology changes, mobility, node failure, propagation channel conditions). Therefore trust is important word which affects the performance of MANET. There are several protocols proposed based on the trust. This paper is a survey of trust based protocols and it proposes some new techniques on trust management in MANETs.

284 citations


"Efficient Hybrid Scheme for Cluster..." refers background in this paper

  • ...Trust of the same node is different when it is evaluated by different nodes [9]....

    [...]

Journal ArticleDOI
TL;DR: An evolutionary self-cooperative trust (ESCT) scheme that imitates human cognitive process and relies on trust-level information to prevent various routing disruption attacks is proposed and evaluated.
Abstract: How to achieve reliable routing has always been a major issue in the design of communication networks, among which mobile ad hoc networks (MANETs) possess the most adversarial networking environment due to the absence of fixed infrastructure, the nature of open transmission media and the dynamic network topology. These characteristics also make the design of routing protocols in MANETs become even more challenging. In this paper, we propose an evolutionary self-cooperative trust (ESCT) scheme that imitates human cognitive process and relies on trust-level information to prevent various routing disruption attacks. In this scheme, mobile nodes will exchange trust information and analyze received trust information based on their own cognitive judgment. Eventually, each node dynamically evolves its cognition to exclude malicious entities. The most attractive feature of ESCT is that they cannot compromise the system even if the internal attackers know how the security mechanism works. In this paper, we evaluate the performance of ESCT scheme under various routing disruption attack situations. Simulation results affirm that ESCT scheme promotes network scalability and ensures the routing effectiveness in the presence of routing disruption attackers in MANETs.

80 citations


"Efficient Hybrid Scheme for Cluster..." refers background in this paper

  • ...Both direct and indirect trust is combined to get total trust value [8]....

    [...]

Journal ArticleDOI
TL;DR: The preparatory outcomes acquired through simulation exhibit the adequacy of the proposed secure CH selection algorithm as far as average rate of avoiding malicious node as a CH, energy efficiency, and some other performance parameters are concerned.
Abstract: The main benefit of selecting a suitable node as cluster head (CH) in clustering for wireless mobile sensor networks (MWSNs) is to prolong the network lifetime. But the safe selection of CH is a challenging task by taking security into account. Mostly CH selection algorithms in MWSN do not consider security when selecting CH. We have proposed secure CH selection algorithm by calculating weight of each node to deal with secure selection using minimum energy consumption. The weight of node is a combination of different metrics including trust metric (behaviors of sensor node) which promotes a secure decision of a CH selection; in terms of this, the node will never be a malicious one. The trust metric is definitive and permits the proposed clustering algorithm to keep away from any malignant node in the area to select a CH, even if the rest of the parameters are in its favor. Other metrics of node include waiting time, connectivity degree, and distance among nodes. The selection of CHs is completed utilizing weights of member nodes. The preparatory outcomes acquired through simulation exhibit the adequacy of our proposed scheme as far as average rate of avoiding malicious node as a CH, energy efficiency, and some other performance parameters are concerned.

49 citations


"Efficient Hybrid Scheme for Cluster..." refers background in this paper

  • ...Eid Rehaman proposes an energy efficient secure trust based clustering algorithm [7] in which various parameters like degree of selfishness, rate of availability and etc are considered for trust calculation....

    [...]

  • ...If the change in TPF rate is high then the node is selfish node [7]....

    [...]

  • ...This factor helps to find data forward attack at neighbor node [7]....

    [...]

Proceedings ArticleDOI
04 Mar 2007
TL;DR: A weighted clustering algorithm optimized to avoid needless clusterhead re- elections for stable clusters in mobile ad-hoc networks is presented and the proposed localized algorithm deals with mobility, but does not require geographical, speed or distances information.
Abstract: Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. In a dynamic environment-in terms of node mobility as well as in terms of steadily changing device parameters-the clusterhead election process has to be re-invoked according to a suitable update policy. Cluster re-organization causes additional message exchanges and computational complexity and it execution has to be optimized. Our investigations focus on the problem of minimizing clusterhead re-elections by considering stability criteria. These criteria are based on topological characteristics as well as on device parameters. This paper presents a weighted clustering algorithm optimized to avoid needless clusterhead re- elections for stable clusters in mobile ad-hoc networks. The proposed localized algorithm deals with mobility, but does not require geographical, speed or distances information.

35 citations


"Efficient Hybrid Scheme for Cluster..." refers background or methods in this paper

  • ...5, it is found that the number of clusters formed is lesser in proposed algorithm than the existing one [3]....

    [...]

  • ..., proposed Weight Application aware Clustering Algorithm (WACA) [3], A Hierarchical Weighted Clustering Algorithm....

    [...]

  • ...Matthias R. Brust et al., proposed Weight Application aware Clustering Algorithm (WACA) [3], A Hierarchical Weighted Clustering Algorithm....

    [...]