Delay-constrained optimal data aggregation in hierarchical wireless sensor networks

Kui Wu; Chong Liu; Yang Xiao; Jiangchuan Liu

doi:10.1007/s11036-008-0119-4

Delay-constrained optimal data aggregation in hierarchical wireless sensor networks

Kui Wu, Chong Liu, Yang Xiao, Jiangchuan Liu

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

11 Citations (Scopus)

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. © 2008 Springer Science+Business Media, LLC.

Original language	English
Pages (from-to)	571-589
Journal	Mobile Networks and Applications
Volume	14
Issue number	5
DOIs	https://doi.org/10.1007/s11036-008-0119-4
Publication status	Published - Oct 2009
Externally published	Yes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected]</a

Research Keywords

Architecture
Performance evaluation
Wireless sensor networks

Access Output

10.1007/s11036-008-0119-4

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{c00e17d82b29438fb0d0794eca25793e,

title = "Delay-constrained optimal data aggregation in hierarchical wireless sensor networks",

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. {\textcopyright} 2008 Springer Science+Business Media, LLC.",

keywords = "Architecture, Performance evaluation, Wireless sensor networks",

author = "Kui Wu and Chong Liu and Yang Xiao and Jiangchuan Liu",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected]</a",

year = "2009",

month = oct,

doi = "10.1007/s11036-008-0119-4",

language = "English",

volume = "14",

pages = "571--589",

journal = "Mobile Networks and Applications",

issn = "1383-469X",

publisher = "Springer Netherlands",

number = "5",

}

TY - JOUR

T1 - Delay-constrained optimal data aggregation in hierarchical wireless sensor networks

AU - Wu, Kui

AU - Liu, Chong

AU - Xiao, Yang

AU - Liu, Jiangchuan

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected]</a

PY - 2009/10

Y1 - 2009/10

N2 - 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. © 2008 Springer Science+Business Media, LLC.

AB - 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. © 2008 Springer Science+Business Media, LLC.

KW - Architecture

KW - Performance evaluation

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=69949161666&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-69949161666&origin=recordpage

U2 - 10.1007/s11036-008-0119-4

DO - 10.1007/s11036-008-0119-4

M3 - RGC 21 - Publication in refereed journal

SN - 1383-469X

VL - 14

SP - 571

EP - 589

JO - Mobile Networks and Applications

JF - Mobile Networks and Applications

IS - 5

ER -

Delay-constrained optimal data aggregation in hierarchical wireless sensor networks

Abstract

Bibliographical note

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this