Font Size: a A A

2-connected2-dominating Set Constructionalgorithm Of WSN

Posted on:2015-06-07Degree:MasterType:Thesis
Country:ChinaCandidate:F MiFull Text:PDF
GTID:2298330422479688Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
On the condition that a great amount of tiny sensor nodes of multi-function, low cost,low power consumption are set into monitoring area, and these micro sensors link eachother by wireless and build up a multiple hops self-organizing network system. Thisnetwork system is the well-known Wireless Sensor Network (WSN). WSN can beuniversally used in military affairs, national defense, environmental monitoring, healthcare, smart home, and space exploration and so on. To effectively boost the efficiency ofbroadcast information between the sensor nodes and avoid flooding broadcast stormcaused by flooding, the connected dominating sets in graph theory usually will work asbackbone hierarchical routing.Since first nodes may fail to work if the energy is running out by using connecteddominating set routing, second is nodes and link failure often happens due to theinstability of WSNS, another is topological structure of connected dominating setrouting may change. Therefore, the fault tolerance of WSN must be considered. How toconstruct such a fault-tolerant connected dominating set that it can still work normallyand extend the network lifetime when some dominating node and link fail to work. Thisissue is an very important research subject.In this paper, we researched construction for connected dominating set algorithm ofwireless sensor network with the idea of virtual backbone network theory. And weconverted the research issues to the study of connected dominating set problem in thesimple graph. How to structure a minimum connected dominating set (MCDS)has beenaccepted is a np-complete problem, we normally solve the approximate value. Byconsidering the factors of the degree of nodes, the residual energy and the energythreshold comprehensively based on the influence of fault-tolerant connecteddominating set, this paper proposes a Distributed Algorithm for Energy-BalanceMinimum2-Connected2-Dominating Set (DA-EBM). Firstly, we mainly analyzed therelationship between the degree of nodes and the ideal control degree of nodes, and therelationship between the node residual energy and the energy threshold by studying thevarious factors of influencing the network lifetime and considering the residual energyand the degree of nodes as the best strategy of dominant point selection. Secondly, DA-EBM is mainly divided into two parts, one is construction phase of fault-tolerant connected dominating set, and another is redundancy optimization. First, try to choosesuch nodes, whose degree is close to the ideal one as possible as we can, or whoseenergy is higher than the threshold value, as dominant points. Then there is a furtheroptimization of redundant and an energy well-balanced minimum2-connected2-dominating set will be worked out.Through considering the factors of residual energy and node degree, we used theformula of weights to construct a fault-tolerant connected dominating set. Theexperiment results and performance analysis show that the DA-EBM not only can savethe energy consumption of nodes effectively, but also balance the entire network in aperfect way, reduce communication overhead of the whole network, and finally itachieves the purpose of effectively prolonging the network lifetime.
Keywords/Search Tags:Wireless sensor network, Energy balance, Distributed algorithm, 2-Connected2-Dominating set
PDF Full Text Request
Related items