Routing-Aware Time Slot Allocation Heuristics in Contention-Free Sensor Networks
Affiliation auteurs | !!!! Error affiliation !!!! |
Titre | Routing-Aware Time Slot Allocation Heuristics in Contention-Free Sensor Networks |
Type de publication | Conference Paper |
Year of Publication | 2016 |
Auteurs | Louail L, Felea V |
Editor | Mamatas L, Matta I, Papadimitriou P, Koucheryavy Y |
Conference Name | WIRED/WIRELESS INTERNET COMMUNICATIONS, WWIC 2016 |
Publisher | Int Federat Informat Proc TC 6; Univ Macedonia, Appl Informat Dept, Grad Program Appl Informat; Int Federat Informat Proc WG 6 2 |
Conference Location | GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND |
ISBN Number | 978-3-319-33936-8; 978-3-319-33935-1 |
Mots-clés | Contention-free time slot scheduling, Cross-layer approaches, Routing protocol, Wireless Sensor Networks |
Résumé | 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%. |
DOI | 10.1007/978-3-319-33936-8_21 |