ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS.

Youngjik Lee; S. Unnikrishna Pillai

ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS.

Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

Abstract

The problem of finding the optimal minimum-redundancy integer locations for an array of given sensors that span a prescribed distance N, such that any missing integer i (0 less than i less than N) is expressible as the difference of two sensor locations, is addressed; a greedy algorithm is presented. This problem is formulated from a number-theoretic point of view and the actual algorithm for optimal sensor placement is described together with a modified version which reduces the computation time and required memory storage. It is shown that these greedy algorithms are clearly suboptimal, since for a given M the maximum attainable value for N is found to be less than N//M.

Original language	English (US)
Pages (from-to)	2674-2677
Number of pages	4
Journal	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
State	Published - 1988

ASJC Scopus subject areas

Software
Signal Processing
Electrical and Electronic Engineering

Access to Document

Fingerprint Dive into the research topics of 'ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS.'. Together they form a unique fingerprint.

Cite this

@article{beab3e12a4e348d2acf02cb9dd40fb74,

title = "ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS.",

abstract = "The problem of finding the optimal minimum-redundancy integer locations for an array of given sensors that span a prescribed distance N, such that any missing integer i (0 less than i less than N) is expressible as the difference of two sensor locations, is addressed; a greedy algorithm is presented. This problem is formulated from a number-theoretic point of view and the actual algorithm for optimal sensor placement is described together with a modified version which reduces the computation time and required memory storage. It is shown that these greedy algorithms are clearly suboptimal, since for a given M the maximum attainable value for N is found to be less than N//M.",

author = "Youngjik Lee and Pillai, {S. Unnikrishna}",

year = "1988",

language = "English (US)",

pages = "2674--2677",

journal = "Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing",

issn = "0736-7791",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS.

AU - Lee, Youngjik

AU - Pillai, S. Unnikrishna

PY - 1988

Y1 - 1988

N2 - The problem of finding the optimal minimum-redundancy integer locations for an array of given sensors that span a prescribed distance N, such that any missing integer i (0 less than i less than N) is expressible as the difference of two sensor locations, is addressed; a greedy algorithm is presented. This problem is formulated from a number-theoretic point of view and the actual algorithm for optimal sensor placement is described together with a modified version which reduces the computation time and required memory storage. It is shown that these greedy algorithms are clearly suboptimal, since for a given M the maximum attainable value for N is found to be less than N//M.

AB - The problem of finding the optimal minimum-redundancy integer locations for an array of given sensors that span a prescribed distance N, such that any missing integer i (0 less than i less than N) is expressible as the difference of two sensor locations, is addressed; a greedy algorithm is presented. This problem is formulated from a number-theoretic point of view and the actual algorithm for optimal sensor placement is described together with a modified version which reduces the computation time and required memory storage. It is shown that these greedy algorithms are clearly suboptimal, since for a given M the maximum attainable value for N is found to be less than N//M.

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

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

M3 - Conference article

AN - SCOPUS:0023739243

SP - 2674

EP - 2677

JO - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

JF - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

SN - 0736-7791

ER -