Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model

Minimum-Latency Aggregation Scheduling is a significant problem in wireless sensor networks. The key challenge is to find an effective solution to aggregate data from all sensors to the sink with minimum aggregation latency. In this article, we propose a novel data aggregation scheduling algorithm u...

Full description

Bibliographic Details
Main Authors: Wenbin Liu, Bo Yang, Zhili Chen
Format: Article
Language:English
Published: Hindawi - SAGE Publishing 2018-05-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1177/1550147718774471
_version_ 1797764167231340544
author Wenbin Liu
Bo Yang
Zhili Chen
author_facet Wenbin Liu
Bo Yang
Zhili Chen
author_sort Wenbin Liu
collection DOAJ
description Minimum-Latency Aggregation Scheduling is a significant problem in wireless sensor networks. The key challenge is to find an effective solution to aggregate data from all sensors to the sink with minimum aggregation latency. In this article, we propose a novel data aggregation scheduling algorithm under the physical interference model. First, the algorithm partitions the network into square cells according to the communication range of a sensor. Second, a node is selected randomly as the aggregated node to receive the data from the other nodes in the same cell. Finally, a data aggregation tree, which consists of multiple disjoint paths, is constructed to aggregate data from all aggregated nodes to the sink. We empirically proved that the delay of the aggregation schedule generated by our algorithm is ( K +1) 2 Δ− K −1+2λ time-slots at most, where K is a constant depending on the sensors transmitting power, the signal-to-interference-plus-noise-ratio threshold, and the path-loss exponent; Δ represents the maximal number of nodes in a cell; and λ denotes the number of cells at a row/column in a square network area. Simulation results also show that our algorithm achieves lower average latency than the previous works.
first_indexed 2024-03-12T19:51:46Z
format Article
id doaj.art-2753f3044dc74fa5ac3642b5f760ca1e
institution Directory Open Access Journal
issn 1550-1477
language English
last_indexed 2024-03-12T19:51:46Z
publishDate 2018-05-01
publisher Hindawi - SAGE Publishing
record_format Article
series International Journal of Distributed Sensor Networks
spelling doaj.art-2753f3044dc74fa5ac3642b5f760ca1e2023-08-02T03:06:19ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772018-05-011410.1177/1550147718774471Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference modelWenbin LiuBo YangZhili ChenMinimum-Latency Aggregation Scheduling is a significant problem in wireless sensor networks. The key challenge is to find an effective solution to aggregate data from all sensors to the sink with minimum aggregation latency. In this article, we propose a novel data aggregation scheduling algorithm under the physical interference model. First, the algorithm partitions the network into square cells according to the communication range of a sensor. Second, a node is selected randomly as the aggregated node to receive the data from the other nodes in the same cell. Finally, a data aggregation tree, which consists of multiple disjoint paths, is constructed to aggregate data from all aggregated nodes to the sink. We empirically proved that the delay of the aggregation schedule generated by our algorithm is ( K +1) 2 Δ− K −1+2λ time-slots at most, where K is a constant depending on the sensors transmitting power, the signal-to-interference-plus-noise-ratio threshold, and the path-loss exponent; Δ represents the maximal number of nodes in a cell; and λ denotes the number of cells at a row/column in a square network area. Simulation results also show that our algorithm achieves lower average latency than the previous works.https://doi.org/10.1177/1550147718774471
spellingShingle Wenbin Liu
Bo Yang
Zhili Chen
Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model
International Journal of Distributed Sensor Networks
title Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model
title_full Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model
title_fullStr Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model
title_full_unstemmed Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model
title_short Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model
title_sort minimum latency data aggregation scheduling based on multi path routing structures under physical interference model
url https://doi.org/10.1177/1550147718774471
work_keys_str_mv AT wenbinliu minimumlatencydataaggregationschedulingbasedonmultipathroutingstructuresunderphysicalinterferencemodel
AT boyang minimumlatencydataaggregationschedulingbasedonmultipathroutingstructuresunderphysicalinterferencemodel
AT zhilichen minimumlatencydataaggregationschedulingbasedonmultipathroutingstructuresunderphysicalinterferencemodel