Skip to Main content Skip to Navigation
Conference papers

Routing-Aware Time Slot Allocation Heuristics in Contention-Free Sensor Networks

Abstract : Traditionally, in Wireless Sensor Networks, protocols are designed independently in the layered protocol stack, and metrics involved in several layers can be affected. Communication latency is one metric example, impacted by both the routing protocol in the network layer and the MAC protocol in the data link layer. Better performances can be obtained using cross-layer approaches.In this paper, we address latency optimizations for communications in sensor networks, based on cross-layer decisions. More particularly, we propose new time slot scheduling methods correlated to routing decisions. Slot allocation for nodes follows particular routing tree traversals, trying to reduce the gap between the slot of a child and that of its parent.Simulations show that latency performance of our contributions improves similar cross-layer approaches from 33 % up to 54 %. Duty cycle of obtained schedules are also improved from 7 % up to 11 %.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01434858
Contributor : Hal Ifip <>
Submitted on : Friday, January 13, 2017 - 2:34:30 PM
Last modification on : Wednesday, September 5, 2018 - 5:04:03 PM
Long-term archiving on: : Friday, April 14, 2017 - 7:36:28 PM

File

417220_1_En_21_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Lemia Louail, Violeta Felea. Routing-Aware Time Slot Allocation Heuristics in Contention-Free Sensor Networks. 14th International Conference on Wired/Wireless Internet Communication (WWIC), May 2016, Thessaloniki, Greece. pp.271-283, ⟨10.1007/978-3-319-33936-8_21⟩. ⟨hal-01434858⟩

Share

Metrics

Record views

123

Files downloads

287