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...
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 |
Similar Items
-
Interference Aware Routing for Minimum Frame Length Schedules in Wireless Mesh Networks
by: Katerina Papadaki, et al.
Published: (2008-10-01) -
Distributed Broadcast with Minimum Latency in Asynchronous Wireless Sensor Networks under SINR-Based Interference
by: Shiliang Xiao, et al.
Published: (2013-11-01) -
Joint routing and scheduling for data collection with compressive sensing to achieve order-optimal latency
by: Xiaohan Yu, et al.
Published: (2017-10-01) -
An efficient algorithm for scheduling sensor data collection through multi-path routing structures
by: Luu, Hai Van, et al.
Published: (2013) -
Multi-Path Minimum Spanning Tree and Superpixel Based Cost Aggregation for Stereo Matching
by: Longhao Sun
Published: (2023-01-01)