Honeycomb-Based Data Aggregation for Range Query in WSNs

Sensor networks are composed of a great number of sensor nodes. Sensor nodes are typically energy restricted and hard to recharge, so reducing energy consumption has recently been a hot focus on wireless sensor network researches. One common approach is to make use of a logical structure, such as a...

Full description

Saved in:
Bibliographic Details
Published in2010 International Conference on Communications and Mobile Computing Vol. 3; pp. 177 - 181
Main Authors Wei Su, Gihwan Cho
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2010
Subjects
Computer networks
data aggregation
Delay
diffusing event
Energy consumption
Event detection
honeycomb cell
Honeycomb structures
Mobile communication
Mobile computing
Protocols
Routing
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:Sensor networks are composed of a great number of sensor nodes. Sensor nodes are typically energy restricted and hard to recharge, so reducing energy consumption has recently been a hot focus on wireless sensor network researches. One common approach is to make use of a logical structure, such as a grid, to construct an efficient routing topology for shorten the routing paths. This paper proposed a new approach to improve previous works. By using the honeycomb cell structure, a novel data aggregation method is designed for range query in wireless sensor networks. Due to the intrinsic characteristics, honeycomb structure enables shorter the data transmission path length and reduces the in-transit packet collision than that of the traditional rectangular grid. Also, by suggesting an aggregation tree, we show that the spreading events can be effectively overseen in the data aggregation scenario.
ISBN:9781424463275
1424463270
DOI:10.1109/CMC.2010.156