基于分簇的无线传感器网络拓扑维护算法研究

AbstractAbstractWireless sensor networks (WSN)is composed of numerous energy-limitedwireless sensor nodes by node-aware and acquisition monitoring within the relevanttarget information..Topology control is an important technique used in WSN to achieve energyconservation and extend network lifetime without affecting important networkperformance such as connectivity and throughput.The main purpose of topologycontrol is to optimize network performance,reduce energy consumption of nodes,todelay network life cycle,and ensure network connectivity and coverage reducecommunications interference between the nodes.The idea of topology control is togrant sensor nodes a sense of control over certain parameters such that theseparameters can be manipulated in a way that benefit the network.In particular,sensornodes have the capacity to adjust the transmission range of their radio,switch to thevarious modes of operation or even decide on the eligibility of the nodes joining thenetwork backbone.These features are the parameters that are exploited in enforcing areduced topology to achieve energy saving and prolong network lifetime.Firstly,we proposed a topology maintenance algorithm based on space whichdivided by concentric circles and quadrant.The idea of the algorithm from the GAFalgorithm.Assume that the initial network topology had built,then all nodes couldfind its sector id and circle id in the network by concentric circles and quadrant.when a cluster head node have failure,the nodes in this cluster would joined the othercluster head in accordance with the algorithm that its sector id and circle id isnearest from the failure node,and in this way ,the network avoid the bad influencebrought by the node death.The algorithm maintained the original properties of thenetwork,ensured the connectivity between cluster head node and sink node,extendedthe survival time of the network.According to the energy consumption model,we try to find a energyconsumption minimum path between the clusterheads and sink node which take intoaccount the data relay forwarding hops.So we proposed an algorithm to realize the