A Localized Multi-Hop Desynchronization Algorithm for Wireless Sensor Networks

  title={A Localized Multi-Hop Desynchronization Algorithm for Wireless Sensor Networks},
  author={Hui Kang and Jennifer L. Wong},
  journal={IEEE INFOCOM 2009},
This paper presents a new desynchronization algorithm aimed at providing collision-free transmission scheduling for single-hop and acyclic multi-hop wireless sensor networks. The desynchronization approach is resilient to the hidden terminal problem and topology changes. Each node distributively converges upon a single collision-free transmission slot, utilizing only minimal neighbor information. In addition, we propose two strategies which facilitate increased convergence time. We evaluate the… 

Figures and Tables from this paper

Stable Desynchronization for Wireless Sensor Networks: (I) Concepts and Algorithms
M-DWARF is the only desynchronization algorithm that achieves fast convergence with high stability, while maintaining channel utilization fairness, and is the first to provide a stability analysis using dynamical systems and to prove that M-DwarF is stable at equilibrium.
Desynchronization in Multi-Hop Topologies : A Challenge
This paper compares the characteristics of single-hop and multi-hop topologies – with respect to the primitive of desynchronization, and analyzes one special multi-hops topology in detail, which not only shows the complexity of a multi- Hop desynchronized, but also provides new opportunities to support all sorts of multi-Hop topologies with reduced overhead for the neighboring information.
On the Pitfalls of Desynchronization in Multi-hop Topologies
This paper describes the experience when extending a single-hop MAC protocol based on the primitive of desynchronization for its usage within multi-hop topologies and presents the solution of a self-organized MAC protocolbased on the basic of des synchronization for multi-Hop topologies.
Stable Desynchronization for Wireless Sensor Networks: (II) Performance Evaluation
This paper validate its functionalities on TelosB motes and compare its performance with EXT-DESYNC, and LIGHTWEIGHT on TOSSIM, and proposes a method to reduce desynchronization overhead.
Convergence of Desynchronization Primitives in Wireless Sensor Networks: A Stochastic Modeling Approach
A novel framework to estimate the required iterations for convergence to fair TDMA scheduling is presented, and the proposed estimates are shown to characterize the desynchronization convergence iterations significantly better than existing conjectures or bounds.
Design of a Self-Organizing MAC Protocol for Dynamic Multi-Hop Topologies
This work presents the development of a self-organizing MAC protocol for dynamic multi-hop topologies, which is the first and only MAC protocol to the best of the knowledge and may be an appropriate starting base for additional network services, like time synchronization or routing.
Desynchronization-based weighted scheduling adaptive to traffic load for wireless networks
  • Y. Taniguchi
  • Business, Computer Science
    2014 International Conference on Computer, Communications, and Control Technology (I4CT)
  • 2014
Through simulation evaluations, it is shown that the proposed mechanism can schedule links in a self-organizing manner in accordance with traffic load of each link.
Desynchronization with an artificial force field for wireless networks
The proposed DWARF (Desynchronization With an ARtificial Force field), a novel technique for desynchronization in wireless networks, scales much better than existing approaches and is evaluated on TOSSIM, a simulator for wireless sensor networks.
Multichannel Distributed Coordination for Wireless Sensor Networks: Convergence Delay and Energy Consumption Aspects
This thesis develops new approaches for distributed coordination of data-intensive communications between wireless sensor nodes. In particular, the topic of synchronization, and its dual primitive,
DeVise: A tool for visualizing and validating desynchronization protocols for multi-hop wireless sensor networks
DeVise is proposed, a visualizer for validating desynchronization protocols on multi-hop wireless sensor networks and effectively helps explore advantages and drawbacks when comparing different des synchronization protocols.


A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
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.
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
Two biologically-inspired algorithms for achieving desynchronization are presented: DESYNC and INVERSE-MS, both of which are simple and decentralized and are able to self-adjust to the addition and removal of agents.
Lightweight Coloring and Desynchronization for Networks
A randomized algorithm for network desynchronization that uses an extremely lightweight model of computation, while being robust to link volatility and node failure is presented.
The flooding time synchronization protocol
The FTSP achieves its robustness by utilizing periodic flooding of synchronization messages, and implicit dynamic topology update and comprehensive error compensation including clock skew estimation, which is markedly better than that of the existing RBS and TPSN algorithms.
An energy-efficient MAC protocol for wireless sensor networks
  • W. Ye, J. Heidemann, D. Estrin
  • Computer Science
    Proceedings.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.
Self-stabilizing Deterministic TDMA for Sensor Networks
This is the first algorithm that demonstrates the feasibility of stabilization-preserving, deterministic transformation of a shared memory distributed program on an arbitrary topology into a program that is consistent with the sensor network model.
Efficient interference-aware TDMA link scheduling for static wireless networks
Using a mathematical formulation, synchronized TDMA link schedulings that optimize the networking throughput are developed that are both efficient centralized and distributed algorithms that use time slots within a constant factor of the optimum.
RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks
Simulation results in ns-2 show that RMAC achieves significant improvement in end-to-end delivery latency over S-MAC and can handle traffic contention much more efficiently than S- MAC, without sacrificing energy efficiency or network throughput.
Energy-Efficient, Collision-Free Medium Access Control for Wireless Sensor Networks
The results indicate that TRAMA outperforms contention-based protocols (CSMA, 802.11 and S-MAC) and also static scheduled-access protocols (NAMA) with significant energy savings and is shown to be fair and correct.
Link scheduling in sensor networks: distributed edge coloring revisited
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.