2-Sensor Problem
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 durin...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2004-11-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1424-8220/4/11/181/ |
| _version_ | 1811187494722469888 |
|---|---|
| author | Michael Segal |
| author_facet | Michael Segal |
| author_sort | Michael Segal |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-11T14:04:21Z |
| format | Article |
| id | doaj.art-05fda3cae6bb48c9bbb97c9747ba3afe |
| institution | Directory Open Access Journal |
| issn | 1424-8220 |
| language | English |
| last_indexed | 2024-04-11T14:04:21Z |
| publishDate | 2004-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Sensors |
| spelling | doaj.art-05fda3cae6bb48c9bbb97c9747ba3afe2022-12-22T04:19:57ZengMDPI AGSensors1424-82202004-11-0141118118610.3390/s411001812-Sensor ProblemMichael SegalAbstract: 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.http://www.mdpi.com/1424-8220/4/11/181/Sensorsmatrix multiplicationcovering |
| spellingShingle | Michael Segal 2-Sensor Problem Sensors Sensors matrix multiplication covering |
| title | 2-Sensor Problem |
| title_full | 2-Sensor Problem |
| title_fullStr | 2-Sensor Problem |
| title_full_unstemmed | 2-Sensor Problem |
| title_short | 2-Sensor Problem |
| title_sort | 2 sensor problem |
| topic | Sensors matrix multiplication covering |
| url | http://www.mdpi.com/1424-8220/4/11/181/ |
| work_keys_str_mv | AT michaelsegal 2sensorproblem |