Download now Free registration required
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, one proposes two strategies which facilitate increased convergence time. The paper evaluates the proposed algorithm via simulations over a range of network densities on both single-hop and acyclic multihop networks. Convergence and throughput comparison are performed against two previously proposed desynchronization algorithms.
- Format: PDF
- Size: 229.5 KB