.png){kind=icon}
.png){kind=icon}
Return
Latency optimization through routing-aware time scheduling protocols for wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2016.06.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Communications in wireless sensor networks are mainly controlled by the temporal decisions of the data link layer and the spatial decisions of the network layer. When taken independently, these decisions may not be correlated which affects the latency metric. To tackle this problem, we propose cross-layer algorithms to define TDMA (Time Division Multiple Access) schedules based on routing information. Two main strategies are applied, based on routing tree traversals or on adapted ones using information from the network's graph. We also present the Optimal scheduling algorithm which finds the scheduling with the minimal latency; the latter is used to compute the efficiency of our heuristics. Extensive simulations have been performed and show improvement in latency up to 29% compared with existing works. The effect of the heuristics on the duty-cycle is studied in the perspective of energy consumption. The duty-cycle is improved up to 11.54%. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Wireless sensor networks
Cross-layer protocol
TDMA scheduling
Routing tree
Communication latency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W