无线传感器网络报告.pptVIP

Liu Hai（liuhai2046@） Yunnan Key Laboratory of Computer Technology Application Aug. 30 ,2015 Constructing a Load-Balanced Reliable Backbone in Probabilistic Wireless Sensor Networks 1. Introduction 2. Related Works 3. Problem Definition 4. LBRB-PNM Algorithm 1. Introduction Sensor nodes usually use battery power, the energy scarcity of sensor nodes significantly limits the lifetime and performance of wireless sensor networks. In a virtual backbone, nodes being in active state are dominators and mainly responsible for delivering data between dominators; nodes being in sleeping state are dominatees and mainly responsible for delivering their own monitoring data to dominators. 1. Introduction Nowadays, most existing algorithms for constructing virtual backbone are based on the ideal deterministic network model (DNM). 1. Introduction Beyond the ‘always connected’ region, there is a transitional region where a pair of nodes is probabilistically connected. Such pairs of nodes are not fully connected but reachable via the so called lossy links. In PNM, the strength of the received signal varies exponentially with the distance from the destination. MCDS {s4, s7} The set of neighboring dominatees of the dominator is denoted by 1、s4 must deplete its energy much faster than dominator s7. 2、s6 chooses s4 or s7. 1. Introduction LBCDS{S3，S6，S7} 1. solid lines represent that the dominatees are allocated to the connected dominators. 2. dashed lines represent the communication links in the original graph. A(si) = {sj|sj is a dominatee and sj forward its data to si}A(s3) = {s1, s2}, A(s6) = {s4, s5} , and A(s7) = {s8}. 1. Introduction If p is close to 1, the information routes resemble the geometric shortest paths from the sources to the sinks. For p = 2, the information flow shows an analogy（类似） to electrostatics（静电学）field, which can be used to measure the load-balance among xi . 1. Introduction In PNM, In order to guarantee the reliability of the virtual backbone,