DocumentCode
3230045
Title
Data aggregation in sensor networks: No more a slave to routing
Author
Prakash, Ravi ; Nourbakhsh, Ehsan ; Sahu, Kunal
Author_Institution
Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
fYear
2009
fDate
Sept. 30 2009-Oct. 2 2009
Firstpage
1452
Lastpage
1459
Abstract
Application-specific data aggregation can play a significant role in energy-efficient operation of wireless sensor networks. Existing aggregation techniques rely heavily on the routing protocol to build shortest paths to route node measurements to the base station and are limited in the types of supported queries. We propose an aggregation scheme that utilizes the inherent information gradients present in the network. The query is directed to the source of information, resulting in better load sharing in the network. We support a variety of queries ranging from simple maximum, minimum or average of the readings of sensor nodes to more complex quantile queries such as k highest values or kth highest value through a generic query algorithm. The query algorithm shifts the computation to the querying agent, thus eliminating any in-network aggregation.
Keywords
query processing; routing protocols; wireless sensor networks; data aggregation; generic query algorithm; information gradients; load sharing; querying agent; root reversal; routing protocol; wireless sensor networks; Base stations; Computer science; Data structures; Energy efficiency; Information resources; Network topology; Routing protocols; Sensor phenomena and characterization; Wireless application protocol; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Conference_Location
Monticello, IL
Print_ISBN
978-1-4244-5870-7
Type
conf
DOI
10.1109/ALLERTON.2009.5394505
Filename
5394505
Link To Document