TDMA scheduling algorithms for wireless sensor networks

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 se...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks Vol. 16; no. 4; pp. 985 - 997
Main Authors: Ergen, Sinem Coleri, Varaiya, Pravin
Format: Journal Article
Language:English
Published: Boston Springer US 01.05.2010
Springer Nature B.V
Subjects:
Access control
Communications Engineering
Computer Communication Networks
Electrical Engineering
Energy consumption
Engineering
Genetic algorithms
Heuristic
IT in Business
Networks
Protocol
Schedules
Scheduling
Scheduling algorithms
Sensors
Signal processing
Studies
Wireless communications
Wireless networks
MAC protocol
Scheduling algorithm
Sensor network
ISSN:1022-0038, 1572-8196
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 algorithms for general ad hoc networks, and the other based on scheduling the levels in the routing tree before scheduling the nodes or level-based scheduling, which is a novel scheduling algorithm for many-to-one communication in sensor networks. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10–70 over centralized algorithms for 1000 nodes. We also obtain upper bound for these schedules as a function of the total number of packets generated in the network.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-009-0183-0