Experimental analysis of practically efficient algorithms for bounded-hop accumulation in ad-hoc wireless networks

@article{Clementi2005ExperimentalAO,
title={Experimental analysis of practically efficient algorithms for bounded-hop accumulation in ad-hoc wireless networks},
author={Andrea E. F. Clementi and Miriam Di Ianni and Angelo Monti and Gianluca Rossi and Riccardo Silvestri},
journal={19th IEEE International Parallel and Distributed Processing Symposium},
year={2005},
pages={8 pp.-}
}

The paper studies the problem of computing a minimal energy-cost range assignment in an ad-hoc wireless network which allows a set S of stations located in the 2-dimensional Euclidean space to perform accumulation (all-to-one) operations towards some root station b in at most h hops (2-Dim Min h-accumulation range assignment problem). We experimentally investigate the behavior of fast and easy-to-implement heuristics for the 2-Dim Min h-accumulation range assignment problem on instances… CONTINUE READING