Energy-preserving maintenance of k-centers on large wireless sensor networks

Author: 
Date created: 
2007
Keywords: 
Wireless sensor network
Wireless sensor node
Clustering
K-centers
Abstract: 

Recently, large wireless sensor networks have been used in many applications. Analyzing data detected by numerous sensors is one of the prominent issues in these applications. However, the power consumption of sensors is the major bottleneck of wireless sensor network lifetime. Energy-preserving data collection on large sensor networks becomes an important problem. In this thesis, we focus on continuously maintaining k-centers of sensor readings in a large sensor network. The goal is to preserve energy in sensors while the quality of k-centers is retained. We also want to distribute the clustering task into sensors, so that raw data and many intermediate results do not need to be transmitted to the server. We propose the reading reporting tree as the data collection and analysis framework in large sensor networks. We also introduced a uniform sampling method, a reporting threshold method and a lazy approach to achieve good quality approximation of k-centers.

Description: 
The author has placed restrictions on the PDF copy of this thesis. The PDF is not printable nor copyable. If you would like the SFU Library to attempt to contact the author to get permission to print a copy, please email your request to summit-permissions@sfu.ca.
Language: 
English
Document type: 
Thesis
Rights: 
Copyright remains with the author
File(s): 
Senior supervisor: 
J
Department: 
School of Computing Science - Simon Fraser University
Thesis type: 
(Computing Science) Thesis (M.Sc.)
Statistics: