The distributed wireless gathering problem

@article{Bonifaci2008TheDW,
  title={The distributed wireless gathering problem},
  author={Vincenzo Bonifaci and Peter Korteweg and Alberto Marchetti-Spaccamela and Leen Stougie},
  journal={Theor. Comput. Sci.},
  year={2008},
  volume={412},
  pages={633-641}
}
We address the problem of data gathering in a wireless network using multi-hop communication; our main goal is the analysis of simple algorithms suitable for implementation in realistic scenarios. We study the performance of distributed algorithms, which do not use any form of local coordination, and we focus on the objective of minimizing average flow times of data packets. We prove a lower bound of @W(n) on the expected competitive ratio of any acknowledgment-based distributed algorithm… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

Algorithmic models for sensor networks

  • Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
  • 2006
VIEW 2 EXCERPTS

Hardness and approximation of gathering in static radio networks

  • Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)
  • 2006
VIEW 3 EXCERPTS