Abstract

The low energy adaptive clustering hierarchy (LEACH) is the classical hierarchical topology control algorithm and still widely used today in wireless sensor networks. There are some problems in LEACH such us an unreasonable selection and uneven distribution of cluster heads, not considering the residual energy of nodes, the cluster head is overloaded and there is a high energy consumption of data transmission. In this paper, a topology control algorithm with double cluster heads and multi-hop based on affinity propagation clustering (APDC-M) was proposed. In APDC-M, firstly, a cluster head election algorithm with double choices based on the affinity propagation clustering algorithm (AP) and reference node strategy (APDC) was proposed. APDC is responsible to elect the fusion cluster head for node clustering. Secondly, a forwarding cluster head is elected within each cluster. The forwarding cluster head is responsible for the data transmission in order to reduce the energy consumption of a single cluster head. Lastly, the forwarding cluster heads complete the data transmission from a cluster to the base station by the shortest path inter-cluster multi-hop mode. The comparison simulation results show that APDC-M can make the cluster head election more reasonable and the cluster head distribution more uniform, and effectively reduce the energy consumption of the cluster head nodes when transmitting data, thus prolonging the network life.

Highlights

  • Wireless sensor network (WSN) is a large-scale network composed of a large number of sensor nodes in the form of self-organization

  • A hierarchical topology control algorithm with double cluster heads and multi-hop based on affinity propagation clustering (APDC-M) is proposed in this paper

  • The main contributions of this paper are: (1) Because the cluster head election of WSN is similar to the cluster center election of the clustering algorithm, this paper proposes a WSN topology control algorithm based on affinity propagation clustering (AP) to solve some problems existing in classical low energy adaptive clustering hierarchy (LEACH) and some improved algorithm of LEACH, in which, the residual energy of the node is introduced

Read more

Summary

Introduction

Wireless sensor network (WSN) is a large-scale network composed of a large number of sensor nodes in the form of self-organization. Since LEACH does not consider the residual energy of the node in the election of the cluster head, the low energy node may act as the cluster head, which will lead to the uneven energy consumption of the nodes in the network, resulting in the premature death of some nodes, which will affect the overall network performance It is precisely because the classical LEACH has many advantages and needs to be improved at the same time that it becomes the research basis of many later studies and scholars put forward some improvements to it. The rest of the paper is organized as follows: The Section 2 is the related work about LEACH; in the Section 3, the LEACH and AP algorithms are introduced; the Section 4 describes the design of the APDC-M algorithm in detail; the Section 5 gives the experimental results and analysis based on the NS2 simulation platform; and the Section 6 is the summary of this paper

Related Work
LEACH Algorithm
AP Clustering Algorithm
Basic Idea
Election of Double Cluster Heads
Election of Forwarding Cluster Heads
Multi-Hop Transmission Based on the Shortest Path
Network
The Overall Process of APDC-M
Time Complexity of APDC-M
The Time Complexity of the Fusion Cluster Head Election
The Time Complexity of SPFA
The Time Complexity of the Overall Algorithm
Simulation Experiment and Result Analysis
Network Model Setting
Network Energy Consumption Model
Analysis of Cluster Head Node Distribution
Analysis of the Survival of the Nodes
Analysis of Energy Consumption
Comparison
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call