, Volume 14, Issue 5, pp 571-589

Delay-Constrained Optimal Data Aggregation in Hierarchical Wireless Sensor Networks

Purchase on Springer.com

$39.95 / €34.95 / £29.95*

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

A lot of realistic applications with wireless sensor networks adopt hierarchical architecture in which sensor nodes are grouped into clusters, with each cluster relying on a gateway node for local data aggregation and long-distance radio transmission. Compared to normal sensor nodes, the gateway nodes, also called application nodes (ANs), are equipped with relatively powerful transceivers and have more energy. Nevertheless, since an AN is the main gateway for sensor nodes within its clusters, its energy may be depleted more quickly than normal sensor nodes. As such, it is important to find methods to save energy for ANs. This paper presents a Delay-Constrained Optimal Data Aggregation (DeCODA) framework that considers the unique feature of traffic patterns and information processing at ANs for energy saving. Mathematical models and analytical results are provided, and simulation studies are performed to verify the effectiveness of the DeCODA framework.

This is a much extended version of our conference paper in IEEE WCNC 07 [28]. This research was partially supported by Natural Sciences and Engineering Research Council of Canada, Canada Foundation for Innovation, and the British Columbia Knowledge Development Fund, as well as US National Science Foundation (NSF) under the grants CCF-0829827 and CNS-0716211.