• Corpus ID: 16501231

Stable Desynchronization for Wireless Sensor Networks: (I) Concepts and Algorithms

  title={Stable Desynchronization for Wireless Sensor Networks: (I) Concepts and Algorithms},
  author={Supasate Choochaisri and Kittipat Apicharttrisorn and Chalermek Intanagonwiwat},
Desynchronization is one of the primitive services for complex networks because it arranges nodes to take turns accessing a shared resource. TDMA is a practical application of desynchronization because it allows node to share a common medium. In this paper, we propose a novel desynchronization algorithm using artificial force field called Multi-hop Desynchronization With an ARtificial Force field or M-DWARF and use it to solve TDMA problems in wireless sensor networks (WSNs). M-DWARF solves… 


A Localized Multi-Hop Desynchronization Algorithm for Wireless Sensor Networks
A new desynchronization algorithm aimed at providing collision-free transmission scheduling for single-hop and acyclic multi-hop wireless sensor networks and is resilient to the hidden terminal problem and topology changes is presented.
Extended Desynchronization for Multi-Hop Topologies
This paper recapitulates the single-hop desynchronization algorit hm DESYNC for Wireless Sensor Networks (WSNs) and identifies its lack of handling hidden nodes in multi-hop envi ronments, and explains in detail its decentralized and selforganizing multi-Hop extension EXTENDED-DESYNC, solving the hidden node problem although it uses just locally available information.
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.
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.
Energy-Efficient Gradient Time Synchronization for Wireless Sensor Networks
The experimental results indicate that the Energy-Efficient Gradient Time Synchronization Protocol achieves a network-wide global notion of time, attains small synchronization errors, and utilizes energy efficiently.
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.
Firefly-inspired sensor network synchronicity with realistic radio effects
This paper presents the Reachback Firefly Algorithm (RFA), a decentralized synchronicity algorithm implemented on TinyOS-based motes based on a mathematical model that describes how fireflies and neurons spontaneously synchronize.
A Study on Event-Driven TDMA Protocol for Wireless Sensor Networks
Simulation results show that ED-TDMA performs better for event-driven application in wireless sensor networks with high-density deployment and under low traffic than other MAC protocols such as BMA, S-MAC, and LMAC.
Towards Desynchronization of Multi-hop Topologies
  • Julius Degesys, R. Nagpal
  • Computer Science
    2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
  • 2008
The results suggest that DESYNC has significant potential as a lightweight method for providing non-overlapping variable-sized slots in ad-hoc multi-hop settings and the performance and efficiency of resource allocation in simulation.