Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Energy-efficient packet transmission over a wireless link
IEEE/ACM Transactions on Networking (TON)
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IEEE Transactions on Parallel and Distributed Systems
PEDAMACS: Power Efficient and Delay Aware Medium Access Protocol for Sensor Networks
IEEE Transactions on Mobile Computing
A TDMA scheduling scheme for many-to-one communications in wireless sensor networks
Computer Communications
Distributed time-optimal scheduling for convergecast in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An overview of scheduling algorithms in wireless multimedia networks
IEEE Wireless Communications
MH-TRACE: multihop time reservation using adaptive control for energy efficiency
IEEE Journal on Selected Areas in Communications
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Energy-balanced sampling workload allocation in wireless sensor networks
Computers & Mathematics with Applications
Interference-free scheduling with bounded delay in cluster-tree wireless sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
The elimination of spatial-temporal uncertainty in underwater sensor networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Degree-based link scheduling for collision avoidance in distributed wireless sensor networks
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
A decentralized minislot scheduling protocol (DMSP) in TDMA-based wireless mesh networks
Journal of Network and Computer Applications
Mobility Impact on Cluster Based MAC Layer Protocols in Wireless Sensor Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
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.