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

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Approximation k-hop spanning trees

M. Skutella
Operations Research Letters, • 2005

Analysis of Fast Heuristics for the Minimum h - Hops Spanning Tree Problem on Random Instances of the Plane ( draft version )

G. Huiban, P. Penna, +3 authors R. Silvestri
On The Power Range Assignment Problem on Radio Networks . Mobile Networks and Applications • 2004

Twelve reasons not to route over many short hops

IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 • 2004

Approximating minimum spanning tree of depth 2 Approximation k - hop spanning trees

S. Rao
Operations Research Letters • 2000

Shortest connection networks and some generalizations

R. Prim
Bell System Technical Journal, • 1957

On the Construction of Energy - Efficient Broadcast and Multicast Trees in Wireless Networks

A. Israeli R. Bar-Yehuda, A. Itai
-1

Similar Papers

Loading similar papers…