AbstractAd-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks continuously changes over time, due to the power of some sensors wearing out to new sensors being inserted into the network, or even due to designers moving sensors around during a network re-design phase (for example, in response to a change in the requirements of the network). In this paper, we address the problem of covering a given path by a limited number of sensors — in our case to two, and show its relation to the well-studied matrix multiplication problem. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Segal, M. 2-Sensor Problem. Sensors 2004, 4, 181-186.
Segal M. 2-Sensor Problem. Sensors. 2004; 4(11):181-186.Chicago/Turabian Style
Segal, Michael. 2004. "2-Sensor Problem." Sensors 4, no. 11: 181-186.