Announcement for Downloading full text filePlease respect the Copyright Act.
All digital full text dissertation and theses from this website are authorized the copyright owners. These copyrighted full-text dissertation and theses can be only used for academic, research and non-commercial purposes. Users of this website can search, read, and print for personal usage. In respect of the Copyright Act of the Republic of China, please do not reproduce, distribute, change, or edit the content of these dissertations and theses without any permission. Please do not create any work based upon a pre-existing work by reproduction, Adaptation, Distribution or other means.
URN etd-0812110-203026 Statistics This thesis had been viewed 1917 times. Download 758 times. Author Chong-hao Huang Author's Email Address No Public. Department Information Management Year 2009 Semester 2 Degree Master Type of Document Master's Thesis Language Chinese&English Page Count 59 Title An Efficient Data Storage Scheme for Top-k Query in Wireless Sensor Networks Keyword top-k data storage wireless sensor networks wireless sensor networks data storage top-k Abstract Wireless sensor network has many important and useful applications like military, environment monitoring and object tracking. There is an application that already proposed call top-k query. In top-k query we are mainly focus on the top-k highest value in the specified sense area. Since sensor nodes have limed capability in energy. In network management wireless sensor networks energy efficient is a very important factor. In this paper, we propose an efficient data storage method for top-k query. With the method this paper use, we normalize the sense readings and change them to fall [0, 1]. The sensor network can be divided into many grids base on the number of dimension d. Dimension can be determinate dependent on number of sensor nodes and data generation frequency. Each grid has a grid head at the center of each grid. Grid head are the storage nodes and sensor nodes will transmit data to store in them. The grid number is placed like snake in the sensor network. Each storage node owns a data sub-range. If the number of grids are n, we divide data range [0, 1] into n sub-range equally. Each grid head own its sub-range and data will store to the grid head which data fall in the sub-range. We can query top k value from the highest sub-range of the grid head node. By this way we can query top-k value efficient and reduce the query cost and prolong network lifetime. We simulate the performance with the existing top-k query processing algorithms FILA. Our experimental results show that the network lifetime of our method is prolonged over the existing method. Advisor Committee Wen-hwa Liao - advisor
Files Date of Defense 2010-07-30 Date of Submission 2010-08-14