ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS.

Youngjik Lee, Unnikrishna Pillai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
PublisherIEEE
Pages2674-2677
Number of pages4
StatePublished - 1988

Fingerprint

greedy algorithms
integers
sensors
Sensors
redundancy
Redundancy
Data storage equipment

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering
  • Acoustics and Ultrasonics

Cite this

Lee, Y., & Pillai, U. (1988). ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings (pp. 2674-2677). IEEE.

ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS. / Lee, Youngjik; Pillai, Unnikrishna.

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. IEEE, 1988. p. 2674-2677.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, Y & Pillai, U 1988, ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS. in ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. IEEE, pp. 2674-2677.
Lee Y, Pillai U. ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. IEEE. 1988. p. 2674-2677
Lee, Youngjik ; Pillai, Unnikrishna. / ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. IEEE, 1988. pp. 2674-2677
@inproceedings{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 Unnikrishna Pillai",
year = "1988",
language = "English (US)",
pages = "2674--2677",
booktitle = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS.

AU - Lee, Youngjik

AU - Pillai, 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 contribution

AN - SCOPUS:0023739243

SP - 2674

EP - 2677

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

PB - IEEE

ER -