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 …

In wireless sensor networks, time division multiple access (TDMA)-based MAC can
potentially reduce the delay and provide real-time guarantees as well as save power by …

This paper presents a distributed implementation of RAND, a randomized time slot
scheduling algorithm, called DRAND. DRAND runs in O (δ) time and message complexity …

We consider the problem of link scheduling in a sensor network employing a TDMA MAC
protocol. Our algorithm consists of two phases. The first phase involves edge-coloring: an …

One of the major problems in wireless multihop networks is the scheduling of transmissions
in a fair and efficient manner. Time Division Multiple Access (TDMA) seems to be one of the …

We consider applications of sensor networks wherein data packets generated by every node
have to reach the base station. This results in a many-to-one communication paradigm …

In this paper, we propose a solution to the scheduling problem in clustered wireless sensor
networks (WSNs). The objective is to provide network-wide optimized time division multiple …

Scheduling algorithms are important components in the provision of guaranteed quality of
service parameters such as delay, delay jitter, packet loss rate, or throughput. The design of …

We study efficient link scheduling for a multihop wireless network to maximize its throughput.
Efficient link scheduling can greatly reduce the interference effect of close-by transmissions …

We investigate a unique wireless sensor network scheduling problem in which all nodes in a
cluster send exactly one packet to a designated sink node in an effort to minimize …