Heuristic algorithms for real-time data aggregation in wireless sensor networks

Cheng Hongju; Liu Qin; Jia Xiaohua

doi:10.1145/1143549.1143774

Heuristic algorithms for real-time data aggregation in wireless sensor networks

Cheng Hongju
, Liu Qin
, Jia Xiaohua

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

24 Citations (Scopus)

Abstract

In sensor networks, energy efficiency is crucial to achieving satisfactory network life. Using the strategy of data aggregation and the technology of smart radio with adjustable transmission power, energy can be saved significantly. In this work we model the real-time requirement in sensor networks as two constraints with the data aggregation tree: node degree bounded and tree height bounded. We state with energy model as the FIRST ORDER RADIO MODEL [4], the maximum node degree of the MST for any graph in a plane is six, and it can be transformed into a MST with maximum node degree as five. Then, we propose three heuristic algorithms to build a MST with hop and degree constraints, namely Node-First Heuristic (NFH), Tree-First Heuristic (TFH), and Hop-Bounded Heuristic (HBH). Simulation results reveal that they are all suitable to solve the real-time data aggregation problem and the performance of NFH is the best. Copyright 2006 ACM.

Original language	English
Title of host publication	IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference
Pages	1123-1128
Volume	2006
DOIs	https://doi.org/10.1145/1143549.1143774
Publication status	Published - 2006
Externally published	Yes
Event	IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference - Vancouver, BC, Canada Duration: 3 Jul 2006 → 6 Jul 2006

Publication series

Name
Volume	2006

Conference

Conference	IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference
Place	Canada
City	Vancouver, BC
Period	3/07/06 → 6/07/06

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Research Keywords

Data aggregation
Degree and hop constrained MST
Real-time
Sensor networks

Access Output

10.1145/1143549.1143774

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{52f3a0ce763a46b381a6ef151103b0ff,

title = "Heuristic algorithms for real-time data aggregation in wireless sensor networks",

abstract = "In sensor networks, energy efficiency is crucial to achieving satisfactory network life. Using the strategy of data aggregation and the technology of smart radio with adjustable transmission power, energy can be saved significantly. In this work we model the real-time requirement in sensor networks as two constraints with the data aggregation tree: node degree bounded and tree height bounded. We state with energy model as the FIRST ORDER RADIO MODEL [4], the maximum node degree of the MST for any graph in a plane is six, and it can be transformed into a MST with maximum node degree as five. Then, we propose three heuristic algorithms to build a MST with hop and degree constraints, namely Node-First Heuristic (NFH), Tree-First Heuristic (TFH), and Hop-Bounded Heuristic (HBH). Simulation results reveal that they are all suitable to solve the real-time data aggregation problem and the performance of NFH is the best. Copyright 2006 ACM.",

keywords = "Data aggregation, Degree and hop constrained MST, Real-time, Sensor networks",

author = "Cheng Hongju and Liu Qin and Jia Xiaohua",

year = "2006",

doi = "10.1145/1143549.1143774",

language = "English",

isbn = "1595933069",

volume = "2006",

pages = "1123--1128",

booktitle = "IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference",

note = "IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference ; Conference date: 03-07-2006 Through 06-07-2006",

}

Hongju, C, Qin, L & Xiaohua, J 2006, Heuristic algorithms for real-time data aggregation in wireless sensor networks. in IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference. vol. 2006, pp. 1123-1128, IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference, Vancouver, BC, Canada, 3/07/06. https://doi.org/10.1145/1143549.1143774

Heuristic algorithms for real-time data aggregation in wireless sensor networks. / Hongju, Cheng; Qin, Liu; Xiaohua, Jia.
IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference. Vol. 2006 2006. p. 1123-1128.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Heuristic algorithms for real-time data aggregation in wireless sensor networks

AU - Hongju, Cheng

AU - Qin, Liu

AU - Xiaohua, Jia

PY - 2006

Y1 - 2006

N2 - In sensor networks, energy efficiency is crucial to achieving satisfactory network life. Using the strategy of data aggregation and the technology of smart radio with adjustable transmission power, energy can be saved significantly. In this work we model the real-time requirement in sensor networks as two constraints with the data aggregation tree: node degree bounded and tree height bounded. We state with energy model as the FIRST ORDER RADIO MODEL [4], the maximum node degree of the MST for any graph in a plane is six, and it can be transformed into a MST with maximum node degree as five. Then, we propose three heuristic algorithms to build a MST with hop and degree constraints, namely Node-First Heuristic (NFH), Tree-First Heuristic (TFH), and Hop-Bounded Heuristic (HBH). Simulation results reveal that they are all suitable to solve the real-time data aggregation problem and the performance of NFH is the best. Copyright 2006 ACM.

AB - In sensor networks, energy efficiency is crucial to achieving satisfactory network life. Using the strategy of data aggregation and the technology of smart radio with adjustable transmission power, energy can be saved significantly. In this work we model the real-time requirement in sensor networks as two constraints with the data aggregation tree: node degree bounded and tree height bounded. We state with energy model as the FIRST ORDER RADIO MODEL [4], the maximum node degree of the MST for any graph in a plane is six, and it can be transformed into a MST with maximum node degree as five. Then, we propose three heuristic algorithms to build a MST with hop and degree constraints, namely Node-First Heuristic (NFH), Tree-First Heuristic (TFH), and Hop-Bounded Heuristic (HBH). Simulation results reveal that they are all suitable to solve the real-time data aggregation problem and the performance of NFH is the best. Copyright 2006 ACM.

KW - Data aggregation

KW - Degree and hop constrained MST

KW - Real-time

KW - Sensor networks

UR - https://www.scopus.com/pages/publications/34247337330

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

U2 - 10.1145/1143549.1143774

DO - 10.1145/1143549.1143774

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 1595933069

SN - 9781595933065

VL - 2006

SP - 1123

EP - 1128

BT - IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference

T2 - IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference

Y2 - 3 July 2006 through 6 July 2006

ER -

Heuristic algorithms for real-time data aggregation in wireless sensor networks

Abstract

Publication series

Conference

UN SDGs

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this