Next Article in Journal
Tetraazacyclohexadeca Macrocyclic Ligand as a Neutral Carrier in a Cr Ion-selective Electrode
Previous Article in Journal
Electrochemical Study of Iodide in the Presence of Phenol and o-Cresol: Application to the Catalytic Determination of Phenol and o-Cresol
Open AccessArticle

2-Sensor Problem

Communication Systems Engineering Department, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel
Sensors 2004, 4(11), 181-186;
Received: 20 July 2004 / Accepted: 28 November 2004 / Published: 30 November 2004
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. View Full-Text
Keywords: Sensors; matrix multiplication; covering Sensors; matrix multiplication; covering
MDPI and ACS Style

Segal, M. 2-Sensor Problem. Sensors 2004, 4, 181-186.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Back to TopTop