Routing-Aware Time Slot Allocation Heuristics in Contention-Free Sensor Networks - Wired/Wireless Internet Communications Access content directly
Conference Papers Year : 2016

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

Lemia Louail
Violeta Felea
  • Function : Author
  • PersonId : 998257

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 %.
Fichier principal
Vignette du fichier
417220_1_En_21_Chapter.pdf (592.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01434858 , version 1 (13-01-2017)

Licence

Attribution

Identifiers

Cite

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⟩
53 View
171 Download

Altmetric

Share

Gmail Facebook X LinkedIn More