2-sensor problem

Michael Segal

doi:10.3390/s41100181

2-sensor problem

Michael Segal

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	181-186
Number of pages	6
Journal	Sensors
Volume	4
Issue number	11
DOIs	https://doi.org/10.3390/s41100181
State	Published - 1 Jan 2004

Keywords

Covering
Matrix multiplication
Sensors

ASJC Scopus subject areas

Analytical Chemistry
Biochemistry
Atomic and Molecular Physics, and Optics
Instrumentation
Electrical and Electronic Engineering

Access to Document

10.3390/s41100181

Cite this

@article{0a8517ab965b4b6b89673d237d522e21,

title = "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 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 = "Covering, Matrix multiplication, Sensors",

author = "Michael Segal",

year = "2004",

month = jan,

day = "1",

doi = "10.3390/s41100181",

language = "English",

volume = "4",

pages = "181--186",

journal = "Sensors",

issn = "1424-3210",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "11",

}

TY - JOUR

T1 - 2-sensor problem

AU - Segal, Michael

PY - 2004/1/1

Y1 - 2004/1/1

N2 - 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.

AB - 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.

KW - Covering

KW - Matrix multiplication

KW - Sensors

UR - http://www.scopus.com/inward/record.url?scp=18444364517&partnerID=8YFLogxK

U2 - 10.3390/s41100181

DO - 10.3390/s41100181

M3 - Article

AN - SCOPUS:18444364517

SN - 1424-3210

VL - 4

SP - 181

EP - 186

JO - Sensors

JF - Sensors

IS - 11

ER -

2-sensor problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this