Open AccessThis article is
- freely available
Sensors 2004, 4(11), 181-186; doi:10.3390/s41100181
Received: 20 July 2004; Accepted: 28 November 2004 / Published: 30 November 2004
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: Ad-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.
Keywords: Sensors; matrix multiplication; covering