.png){kind=icon}
.png){kind=icon}
Return
A Distributed Routing Algorithm for Data Collection in Low-Duty-Cycle Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/JIOT.2017.2734280.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In order to prolong the lifetime of wireless sensor networks (WSNs), a low-duty-cycle mode is widely used to save the energy for sensor nodes. Under this mode, sensor nodes switch between active and dormant states, which incurs a high latency for traditional routing algorithms. To mitigate this, in this paper, the data collection problem in low-duty-cycle WSNs is formulated as a delay optimization problem of traffic flow with consideration of both congestion and collision, which is solved by a distributed algorithm based on network utility maximization. Our proposed distributed routing algorithm achieves a better tradeoff between latency and energy conservation than existing schemes, and our schemes can find a nearly global-optimal-path to achieve almost minimum average end-to-end (E2E) delay with less energy consumption. The computation complexity and energy consumption of the distributed algorithm are analyzed and evaluated in detail. The simulation results show that the proposed algorithm can achieve almost the same average E2E delay performance as the global optimal algorithm with less energy, and reduce the average E2E delay by about 30% than the shortest path algorithm when the data generation rate is high.
Keywords:
Data collection
distributed routing algorithm
low-duty-cycle
wireless sensor networks (WSNs)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
1.4W
Citations:
7.8W