scholarly journals A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model

2015 ◽  
Vol 569 ◽  
pp. 70-73 ◽  
Author(s):  
Nhat X. Lam ◽  
Tien Tran ◽  
Min Kyung An ◽  
Dung T. Huynh
Keyword(s):  
Data Aggregation ◽  
Interference Model ◽  
Latency Data ◽  
Physical Interference ◽  
Minimum Latency ◽  
Physical Interference Model ◽  
Data Aggregation Scheduling

Minimum latency data aggregation in the physical interference model

2012 ◽  
Vol 35 (18) ◽  
pp. 2175-2186 ◽  
Author(s):  
Min Kyung An ◽  
Nhat X. Lam ◽  
Dung T. Huynh ◽  
Trac N. Nguyen
Keyword(s):  
Data Aggregation ◽  
Interference Model ◽  
Latency Data ◽  
Physical Interference ◽  
Minimum Latency ◽  
Physical Interference Model

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

2018 ◽  
Vol 14 (5) ◽  
pp. 155014771877447
Author(s):  
Wenbin Liu ◽  
Bo Yang ◽  
Zhili Chen
Keyword(s):  
Data Aggregation ◽  
Scheduling Algorithm ◽  
Path Loss ◽  
Aggregate Data ◽  
Interference Model ◽  
Physical Interference ◽  
Minimum Latency ◽  
Physical Interference Model ◽  
Square Cells ◽  
Data Aggregation Scheduling

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; [Formula: see text] represents the maximal number of nodes in a cell; and [Formula: see text] 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.

Energy-collision-aware Minimum Latency Aggregation Scheduling for Energy-harvesting Sensor Networks

2021 ◽  
Vol 17 (4) ◽  
pp. 1-34
Author(s):  
Quan Chen ◽  
Zhipeng Cai ◽  
Lianglun Cheng ◽  
Hong Gao ◽  
Jianzhong Li
Keyword(s):  
Sensor Networks ◽  
Energy Harvesting ◽  
Data Aggregation ◽  
High Performance ◽  
Renewable Energy Sources ◽  
Residual Energy ◽  
Interference Model ◽  
Energy Collision ◽  
Minimum Latency ◽  
Physical Interference Model

The emerging energy-harvesting technology enables charging sensor batteries with renewable energy sources, which has been effectively integrated into Wireless Sensor Networks (EH-WSNs). Due to the limited energy-harvesting capacities of tiny sensors, the captured energy remains scarce and differs greatly among nodes, which makes the data aggregation scheduling problem more challenging than that in energy-abundant WSNs. In this article, we investigate the Minimum Latency Aggregation Scheduling (MLAS) problem in EH-WSNs. First, we identify a new kind of collision in EH-WSNs, named as energy-collision, and design several special structures to avoid it during data aggregation. To reduce the latency, we try to choose the parent adaptively according to nodes’ transmission tasks and energy-harvesting ability, under the consideration of collisions avoidance. By considering transmitting time, residual energy, and energy-collision, three scheduling algorithms are proposed under protocol interference model. Under physical interference model, several approximate algorithms are also designed by taking account of the interference from the nodes several hops away. Finally, the theoretical analysis and simulation results verify that the proposed algorithms have high performance in terms of latency.

Sign in / Sign up

Export Citation Format

Share Document