Distributed algorithms for dynamic coverage in sensor networks. (English) Zbl 1283.68099
Proceedings of the 26th annual ACM symposium on principles of distributed computing, PODC ’07, Portland, OR, USA, August 12–15, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-616-5). 392-393 (2007).
References:
| [1] | S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Coverage problems in wireless ad-hoc sensor networks. Proc. of the 20th IEEE INFOCOM, pages 1380-1387, 2001. 10.1145/381677.381691 |
| [2] | A. Sekhar, B. S. Manoj, and C. S. R. Murthy. Dynamic coverage maintenance algorithms for sensor networks with limited mobility. Proc. of the 3rd IEEE Intl Conf. on Pervasive Computing and Communications, 2005. 10.1109/PERCOM.2005.15 |
| [3] | H. Zhang and J. C. Hou. Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc & Sensor Wireless Networks, 1:89-124, March 2005. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
