Font Size: a A A

Study On Coverage Model And Control Algorithm In Wireless Sensor Networks

Posted on:2011-05-13Degree:MasterType:Thesis
Country:ChinaCandidate:S DuFull Text:PDF
GTID:2178360302494564Subject:Detection Technology and Automation
Abstract/Summary:PDF Full Text Request
Wireless sensor networks (WSNs) are constituted by self-organizing sensor nodes which have the ability of sensing, data processing, memory and wireless communication. The wide application prospects of WSN have drew high attentions of the entire world. Coverage control is a key problem on the process of studying in WSN. It decides directly the integrality and accuracy of the information which is gathered by WSN, and it also affects the lifetime of the net. Coverage control faces a huge challenge because of mass deployment and the limit in energy and connectivity of nodes. In this paper, the problem of coverage control in deterministic and stochastic coverage is studied. Specific research works are as follows:At first, study on the deterministic coverage model based on the regular polygon, analyze the relationship of the number of the regular polygon side, the distance between two neighbor nodes, and K which is the coverage grade. The aim is to draw a conclusion which regular polygon taken is better according to achieving the different coverage grade. It can give instruction to the work of node deployment in actual environment.Then, a distributed stochastic coverage control algorithm based on the remaining energy has been proposed. This algorithm is based on probabilistic coverage model and computes the area coverage probability of nodes to judge the redundancy according to the sequences which are arranged by the remaining energy of nodes and changes the redundant nodes into sleeping state. The algorithm can effectively reduce the redundancy of nodes and prolong the network lifetime.Finally, an energy balanced algorithm of connected cover set was proposed. Aims at keeping the connection and coverage of the network and extending the network lifetime efficiently, the algorithm uses the Voronoi diagram to tessellate the area in order to discover the redundant nodes and selects the connected nodes from the redundant nodes based on energy weight function, then, designs an optimization connected cover set.
Keywords/Search Tags:Wireless sensor networks, Coverage control, K-coverage, Probabilistic coverage model, Remaining energy, Connected coverage set
PDF Full Text Request
Related items