Paper Info
Title
A Distributed Algorithm for Maximizing Linear Tree Density for One to Many Wireless Communication.
Abstract
Reliable and efficient broadcast functions are essential in large, dense, multi-hop low power wireless systems managed by a gateway. Previous approaches addressing this issue rely on centralized and/or solutions requiring complex implementations. This paper describes the {\\em Deal} algorithm for minimizing transmissions and hop count while maintaining reliability in a distributed fashion. The algorithm is compatible with and easily integrated into current low power, lossy network protocols. We first present Deal as a centralized algorithm and evaluate using numerical simulations. We then derive a distributed algorithm appropriate for low power, lossy networks. We evaluate the distributed algorithm using a testbed with over 300 nodes. Our results demonstrate that Deal is reliable and energy efficient. The experiments show that Deal significantly reduces the required number of transmissions for network broadcast in large low power, lossy networks.
Year
DOI
Venue
2016
10.1145/2989293.2989296
PE-WASUN@MSWiM
Field
DocType
Citations 
Wireless,Lossy compression,Efficient energy use,Computer science,Broadcasting (networking),Testbed,Computer network,Distributed algorithm,One-to-many,Communications protocol,Distributed computing
Conference
1
PageRank 
References 
Authors
0.34
9
2
Name
Order
Citations
PageRank
James Pope1174.23
Robert Simon2226.54