DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks
@article{Rhee2006DRANDDR,
title={DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks},
author={Injong Rhee and Ajit Warrier and Jeong Sung Min and Lisong Xu},
journal={IEEE Transactions on Mobile Computing},
year={2006},
volume={8},
pages={1384-1396}
}This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(delta) time and message complexity where delta is the maximum size of a two-hop neighborhood in a wireless network while message complexity remains O(delta), assuming that message delays can be bounded by an unknown constant. DRAND is the first fully distributed version of RAND. The algorithm is suitable for a wireless network where most nodes do not move, such as…
Figures and Tables from this paper
548 Citations
Distributive and self-sustainable scheduling algorithm for wireless sensor networks
- Computer Science, Business2013 22nd Wireless and Optical Communication Conference
- 2013
DSSA is a simple, distributed and performance optimal scheduling algorithm and overcomes a variety of slot scheduling problems and is robust against any dynamic change without incurring extra message overhead and, utilizes minimal resources to provide an optimal collision free transmission.
Towards Optimal TDMA Frame Size in Wireless Sensor Networks
- Computer Science, Business
- 2007
A set of TDMA MAC protocols for wireless sensor networks that can achieve near-optimal throughput and good latency for regular periodic data delivery and a centralized TDMA slot assignment algorithm, Centralized Slot Assignment (CSA-CCH), that uses CCH.
A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs
- Computer Science, Business2013 27th International Conference on Advanced Information Networking and Applications Workshops
- 2013
A distributed TDMA slot scheduling algorithm, called DTSS algorithm, designed with the primary objective of reducing the time required to perform scheduling, while restricting the schedule length to maximum degree of interference graph.
An improved distributed scheduling algorithm for wireless sensor networks
- Computer Science, Business2012 4th International Conference on Intelligent and Advanced Systems (ICIAS2012)
- 2012
The Improved Distributed Scheduling Algorithm (IDSA), a novel heuristic scheduling technique that can provide effective collision free broadcasting, lower energy consumption, minimum message overhead and enhanced channel utilization, is proposed.
Fair scheduling algorithm for wireless sensor networks
- Computer Science, Business2011 National Postgraduate Conference
- 2011
A Fair Scheduling algorithm is presented to overcome the drawbacks of DRAND and provides negligible delay, minimum overhead and energy consumption in order to prolong network life.
Adaptive and Distributed TDMA Scheduling Protocol for Wireless Sensor Networks
- Business, Computer ScienceWirel. Pers. Commun.
- 2015
The proposed adaptive and distributed TDMA scheduling protocol for slot assignment in wireless sensor network called AD-TDMA saves energy by offering a suitable awake-sleep state scheduling for nodes and applies depth-first-search to send node data in network as routing path.
Adaptive and Distributed TDMA Scheduling Protocol for Wireless Sensor Networks
- Business, Computer ScienceWireless Personal Communications
- 2014
The proposed adaptive and distributed TDMA scheduling protocol for slot assignment in wireless sensor network called AD-TDMA saves energy by offering a suitable awake-sleep state scheduling for nodes and applies depth-first-search to send node data in network as routing path.
Distributed TDMA Scheduling Using Topological Ordering in Wireless Sensor Networks
- Business, Computer Science2019 28th International Conference on Computer Communication and Networks (ICCCN)
- 2019
DSTO aims to reduce conflict of scheduling time among neighbor nodes by creating a Topological Order with local neighborhood size as the main priority factor, and proved its effectiveness compared to DRAND in terms of running time and message overheads.
The SCREAM Approach for Efficient Distributed Scheduling with Physical Interference in Wireless Mesh Networks
- Computer Science2008 The 28th International Conference on Distributed Computing Systems
- 2008
This paper designs a global primitive, called SCREAM, which is used to verify the feasibility of a schedule during an iterative distributed scheduling procedure, and presents two distributed protocols for efficient, distributed scheduling under the physical interference model and proves an approximation bound for one of the protocols.
Distributed and Energy Efficient Scheduling for IEEE802.11s Wireless EDCA Networks
- Computer ScienceWirel. Pers. Commun.
- 2016
Time-Split, a very simple and distributed scheduling algorithm compatible with the conventional EDCA mode of access, is proposed with a simple mechanism to remove off-path interference without knowledge of the interference graph and split-depth is proposed as a means to strike a balance between interference elimination and spectrum sharing.
References
SHOWING 1-10 OF 39 REFERENCES
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
- Computer ScienceALGOSENSORS
- 2004
A distributed algorithm for TDMA slot assignment that is self-stabilizing to transient faults and dynamic topology change is reported, the expected local convergence time is O(1) for any size network satisfying a constant bound on the size of a node neighborhood.
Distributed Link Scheduling for TDMA Mesh Networks
- Computer Science, Business2007 IEEE International Conference on Communications
- 2007
A distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks and uses the distributed Bellman-Ford algorithm running on the conflict graph to detect when all nodes are locally scheduled and a new schedule should be activated.
Link Scheduling for Minimum Delay in Spatial Re-Use TDMA
- Computer Science, BusinessIEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
- 2007
This paper presents a method that finds schedules with minimum round trip scheduling delay, and shows that the scheduling delay can be interpreted as a cost collected over a cycle on the conflict graph, and designs heuristics to select appropriate transmission orders.
A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks
- Computer ScienceProceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
- 1998
A new single channel, time division multiple access (TDMA)-based broadcast scheduling protocol, termed the Five-Phase Reservation Protocol (FPRP), is presented for mobile ad hoc networks and shows that the protocol works very well in all three aspects.
Link scheduling in sensor networks: distributed edge coloring revisited
- Computer ScienceProceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
- 2005
This work considers the problem of link scheduling in a sensor network employing a TDMA MAC protocol and proposes a distributed edge coloring algorithm that needs at most (/spl delta/+1) colors, which is the first distributed algorithm that can edge color a graph with at most /spl delta/ colors.
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
- Computer ScienceMobiHoc '05
- 2005
A converging distributed link scheduling algorithm that exploits the logical tree structure that arises in several ad hoc network applications, and an end-to-end asynchronous distributed algorithm for the computation of the session MMF rates is introduced.
Coloring unstructured radio networks
- Computer ScienceSPAA '05
- 2005
This paper proposes an algorithm that works in the unstructured radio network model that captures the characteristics of newly deployed ad hoc and sensor networks, i.e. asynchronous wake-up, no collision-detection, and scarce knowledge about the network topology.
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
- Computer ScienceFSTTCS
- 2004
This work combines the properties of WCDS with other ideas to obtain the following interesting applications: An online distributed algorithm for collision-free, low latency, low redundancy and high throughput broadcasting, and Distributed capacity preserving backbones for unicast routing and scheduling.
An energy-efficient MAC protocol for wireless sensor networks
- Computer ScienceProceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
- 2002
S-MAC uses three novel techniques to reduce energy consumption and support self-configuration, and applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data move through the network.
SEEDEX: a MAC protocol for ad hoc networks
- Computer ScienceMobiHoc '01
- 2001
A new protocol for media access control in ad hoc networks that seeks to avoid collisions without making explicit reservations for each and every packet by employing a random schedule which is driven by a pseudo-random number generator.