Sciweavers

Share
WINET
2010

TDMA scheduling algorithms for wireless sensor networks

8 years 5 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine the smallest length conflict-free assignment of slots during which the packets generated at each node reach their destination. The conflicting node transmissions are determined based on an interference graph, which may be different from connectivity graph due to the broadcast nature of wireless transmissions. We show that this problem is NP-complete. We first propose two centralized heuristic algorithms: one based on direct scheduling of the nodes or node-based scheduling, which is adapted from classical multi-hop scheduling a...
Sinem Coleri Ergen, Pravin Varaiya
Added 31 Jan 2011
Updated 31 Jan 2011
Type Journal
Year 2010
Where WINET
Authors Sinem Coleri Ergen, Pravin Varaiya
Comments (0)
books