Font Size: a A A

A Clustering Protocol Based On Coverage-connectivity In Wireless Sensor Networks

Posted on:2011-11-12Degree:MasterType:Thesis
Country:ChinaCandidate:X F MaFull Text:PDF
GTID:2178360305977113Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Wireless sensor network is composed by a large number of low-cost tiny sensor nodes deployed in the detection region, which is a self-organized multi-hop network formed by the wireless communication. Due to its significance for research as well as practice, now it has been already widely used in many areas such as military, environmental monitoring, modern agriculture etc. Energy-efficiency is the primary goal of this network which aims to extend its lifetime. As the focus of network topology control, coverage and connectivity have a great effect on the energy consumption of the network.This thesis firstly introduces the basic knowledge of wireless sensor network and the significance of the research, expounding the various parameters in the topology control which influence the energy assumption of wireless sensor network. Then, after a comprehensive study from the following three aspects: the cluster-based topology, connectivity and coverage, the thesis proposed a new clustering protocol, which is of significance when compared with the traditional ones. The main work is as follows:First, it proposes a coverage-connectivity clustering protocol for wireless sensor networks, which is based on the"divide and rule"principle. The protocol makes use of maximum entropy principle to do the primary clustering under the premise of coverage-connectivity. When the temporary cluster heads are chosen, in each cluster, CDS will be operated, the cluster will be optimized and updated, and the substitutive head will be selected. Finally, in the adoption of the lowest-cost path algorithm derived from the shortest path algorithm, the protocol realizes the communication within and among clusters. Simulation experiments show that compared with the former classical clustering protocol, our protocol can improve the coverage-connectivity of the network: it not only balancing the energy assumption and lengthens the lifetime of the network, but also possesses strong salability and robust.Second, regarding the security of wireless sensor networks, this thesis combines the VCG auction model in Game Theory and proposes an Incentive mechanism design to ensure that each node can report its trueful residual energy in the head selection. Besides, the thesis also conducts the Performance Verification, whose result shows that the Incentive mechanism design achieves great progress in Packet Delivery Ratio, End-to-End Delay and Link Load Balancing.
Keywords/Search Tags:wireless sensor networks, the lowest-cost path, connectivity-coverage, selfish nodes
PDF Full Text Request
Related items