Font Size: a A A

Research On Deployment And Scheduling Based On Wireless Sensor Netork Coverage

Posted on:2011-05-29Degree:MasterType:Thesis
Country:ChinaCandidate:J ChenFull Text:PDF
GTID:2248330338496160Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
The coverage is a very important problem of the wireless sensor network. The situations which require stronger environmental monitoring capability and scenarios which impose more stringent fault-tolerant capability require high coverage quality of the wireless sensor network.This paper focused on the problem of improving the coverage quality and prolonging the lifetime of network. The sensors deployment and the nodes schedule problem are both studied deeply in this paper.After initial random deployment, the nodes in the networks are not uniform distributed enough to complete the task of sensor and data collecting perfectly. Thus, the deployment of nodes needs to be optimized to meet the requirement of high monitoring capability, fault-tolerant capability, locating capability and data reliability and the lifetime of network.This paper first design an energy efficient nodes deployment of heterogeneous sensor networks which named EX-VFA.It adopted improved probability sensor model and combined the static deployment with the dynamic deployment strategy. The high energy sensors adopted static deployment strategy to meet the needs of key monitoring area. The low energy sensors adopted dynamic deployment strategy to coverage the rest area. It proposed a novel sensor“relay move way”during the movement of sensors.Simulation results show that EX-VFA is able to deploy the heterogeneous sensors in the aimed region suitably and it can balance the dissipative energy efficiently which benefits for prolonging the lifetime of network.Secondly, this paper proposed an energy efficient nodes scheduling Algorithm which could meet the k-coverage of the interest region which named EK-CNSA. It could make better use of sensors by minimize the active sensors. EK-CNSA included three sub algorithms: 1.K-cover decision algorithm which improved the k-coverage decision; 2.Nodes eligibility decision algorithm based on the result of k-coverage decision algorithm and proposed a nodes eligibility decision method which based on the prior of sensors; 3. Nodes scheduling algorithm based on the result of the nodes eligibility decision algorithm to schedule the nodes. EK-CNSA adopted the sensors prior way to resolute the problem of many nodes changed into sleeping state synchronously. Simulation results show that EK-CNSA is not only able to meet the requirement of coverage quality of the interested area, but also prolongs the lifetime of network because of balancing the sensors dissipative energy.
Keywords/Search Tags:heterogeneous wireless sensor networks, probability model, virtual force, sensors deployment, k-cover, nodes scheduling
PDF Full Text Request
Related items