Font Size: a A A

Research On Energy-efficient Clustering Routing Algorithms In Wireless Sensor Networks

Posted on:2015-05-26Degree:MasterType:Thesis
Country:ChinaCandidate:Y YinFull Text:PDF
GTID:2298330467983271Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
The wireless sensor network (WSN) consists of large numbers of self-organized sensor nodes, which cooperatively implement perception, acquisition, processing and transmission of information. It is widely used in military defense, environmental monitoring, health care and other areas. Sensor nodes typically suffer from limited battery energy, and deployment in remote regions often makes it difficult to charge. Problems occur when nodes run out of energy and become invalid. Therefore, how to balance energy, reduce energy consumption, prolong network lifetime, namely achieve energy-efficient data transmission is the key issue of research on the wireless sensor network routing algorithm.This paper introduces many existing clustering routing algorithms in wireless sensor networks, and especially discusses hot research issues in recent years:1) Considering of the mobility of the Sink node, to solve the energy hole problem occurred in networks with a stationary Sink, we propose a Mobile-Sink based Energy-efficient Clustering Algorithm (MECA). Design the clustering and routing mechanisms, and further analyze the impact of the number, speed and trace of the Sink on network performance via simulation;2) Considering of the network structure, to solve the problem of uneven distribution of cluster heads possibly occurs in various traditional algorithms, we propose a Density-based Energy-efficient Clustering Heterogeneous Algorithm (DECHA). Analyze the optimal number of cluster heads, define the density of a node and properly select cluster heads with factors including relative density, relative initial energy and relative residual energy, set up a threshold to balance energy and establish a multi-hop routing;3) Considering of the selfishness of nodes, to solve the interest conflicts between any node as an individual and the network as a whole, we propose a Density-based Energy-efficient Game-theoretic Routing Algorithm (DEGRA). Build a game-theoretic model, analyze Nash Equilibrium conditions, design a utility function for the cluster head selection, propose an incentive mechanism with limited punishment, and describe clustering and routing ideas. All proposed routing algorithms take priority of energy efficiency through the entire design, including the cluster head selection, optimal number of clusters, intra-cluster and inter-cluster communication method, etc. Algorithms aim to balance energy among nodes, reduce energy cost and prolong network lifetime. Simulation results show that, compared to other existing algorithms like LEACH, proposed algorithms have better performance in aspects such as distribution of cluster heads, total energy consumption, network lifetime, etc.
Keywords/Search Tags:wireless sensor network, clustering routing, mobile Sink, heterogeneous, game theory
PDF Full Text Request
Related items