Assembling regions for efficacious aggregate query processing in wireless sensor networks
Name
70079317-MIT.pdf
Description
Full printable version
Size
6.28 MB
Format
Adobe PDF
Checksum (MD5)
5453c07dbd2628236d154ec6d7b07fde
Author(s)
Fertis, Apostolos
Advisor(s)
Karen Sollins.
Date Issued
2005
Publisher
Massachusetts Institute of Technology
Abstract
The field of sensor networks is rapidly developing enabling us to deploy them to an unpredictable environment and draw diverse and interesting information from it. Their capabilities are improving. They can sense complicated phenomena, they take measurements for several attributes, they make numerous computations and they communicate large amounts of information. Most sensors are battery operated and in most cases they are not easily rechargeable, as the environment in which they are located is not easily accessible. Thus, they have limited energy, which should be used to draw out as much useful information as possible. Moreover, quite often we need to receive data from a sensor network at a high rate. In order to be able to manage energy and time efficiently in sensor networks, we have to develop protocols that synchronize the cooperation among sensors and send information to the targets as quickly as possible and with low energy consumption. In many cases, the whole set of values that are measured is not required by the query which is submitted to the network. The query asks for an aggregate over the measurements. The propagation of all measured values to a central computation point is resource consuming. Tiny AGgregation (TAG) provides an algorithm to compute aggregates by merging and forwarding partial results. The merging is done in the internal nodes of the routing tree that is formed. Sometimes, the aggregation is applied over a subset of the measurements. Furthermore, the wireless links that connect the sensor nodes are not characterized by the same congestion. This fact makes the energy spent for transmission across a link varying.
In addition, the use of links with high congestion in the routing tree delays the propagation of partial records to the root and thus, increases the response time. The protocol SYMPHONY provides an improvement on the TAG algorithm. It forms a Steiner tree that spans the sensors that participate in the aggregate and has cost which does not exceed the double of the optimal Steiner tree cost for the connectivity graph. The Expected Transmission Count (ETX) and the latency metrics are used for the links. The communication and energy cost of forming the SYMPHONY routing tree is proved to be polynomial in the number of nodes. The construction cost can be reduced if the requirements for the cost in the resulting routing tree are relaxed. In any case, the use of SYMPHONY can save much energy, if the aggregate is computed in a frequent rate.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, September 2005.
"June 2005."
Includes bibliographical references (p. 123-125).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
