On the bounds of separability in sensor networks
A pair of target locations are separable if sensor observations can distinguish between the following choices: no targets are present, one target is present at either of the locations or a target is present at each location. The sensors of interest in this paper are binary proximity sensors, whose b...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 5 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Krishnan, B.S. |
| description | A pair of target locations are separable if sensor observations can distinguish between the following choices: no targets are present, one target is present at either of the locations or a target is present at each location. The sensors of interest in this paper are binary proximity sensors, whose binary outputs are functions of the distance between the sensor and target. Sensors are deployed randomly according to a Poisson distribution. The probability that two target locations at a distance of r between them are separable is derived. This is extended to derive the probability of having at least Z among M uniformly distributed target locations to be non-separable from the origin. The bounds on this probability are expressed as a function of the sensor density ¿. |
| doi_str_mv | 10.1109/NCC.2010.5430169 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5430169</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5430169</ieee_id><sourcerecordid>5430169</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1329-a670adfba77e671d9f11e0b83b201eb716997eef81cd6d2d4b7d1c24e4521c553</originalsourceid><addsrcrecordid>eNo1j81KAzEYRSNSUNvZC27yAlPz5XeylME_KHaj65JMvmC0ZkoyIn17B6x3czmby7mEXANbAzB7-9L3a85mUlIw0PaMNNZ0ILmUWnRKnZOrfxBwQZpaP9gcYYVR4pKwbabTO1I_fudQ6RhpxYMrzqd9mo405ZlzHQvNOP2M5bOuyCK6fcXm1Evy9nD_2j-1m-3jc3-3aRMIblunDXMhemcMagPBRgBkvhN-lkVvZlNrEGMHQ9CBB-lNgIFLlIrDoJRYkpu_3YSIu0NJX64cd6eT4hcaE0Qp</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On the bounds of separability in sensor networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Krishnan, B.S.</creator><creatorcontrib>Krishnan, B.S.</creatorcontrib><description>A pair of target locations are separable if sensor observations can distinguish between the following choices: no targets are present, one target is present at either of the locations or a target is present at each location. The sensors of interest in this paper are binary proximity sensors, whose binary outputs are functions of the distance between the sensor and target. Sensors are deployed randomly according to a Poisson distribution. The probability that two target locations at a distance of r between them are separable is derived. This is extended to derive the probability of having at least Z among M uniformly distributed target locations to be non-separable from the origin. The bounds on this probability are expressed as a function of the sensor density ¿.</description><identifier>ISBN: 1424463831</identifier><identifier>ISBN: 9781424463831</identifier><identifier>EISBN: 9781424463855</identifier><identifier>EISBN: 1424463866</identifier><identifier>EISBN: 9781424463862</identifier><identifier>EISBN: 1424463858</identifier><identifier>DOI: 10.1109/NCC.2010.5430169</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Area measurement ; Condition monitoring ; Performance analysis ; Random variables ; Sensor phenomena and characterization ; Target tracking ; Temperature sensors ; Testing ; Upper bound</subject><ispartof>2010 National Conference On Communications (NCC), 2010, p.1-5</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5430169$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5430169$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Krishnan, B.S.</creatorcontrib><title>On the bounds of separability in sensor networks</title><title>2010 National Conference On Communications (NCC)</title><addtitle>NCC</addtitle><description>A pair of target locations are separable if sensor observations can distinguish between the following choices: no targets are present, one target is present at either of the locations or a target is present at each location. The sensors of interest in this paper are binary proximity sensors, whose binary outputs are functions of the distance between the sensor and target. Sensors are deployed randomly according to a Poisson distribution. The probability that two target locations at a distance of r between them are separable is derived. This is extended to derive the probability of having at least Z among M uniformly distributed target locations to be non-separable from the origin. The bounds on this probability are expressed as a function of the sensor density ¿.</description><subject>Algorithm design and analysis</subject><subject>Area measurement</subject><subject>Condition monitoring</subject><subject>Performance analysis</subject><subject>Random variables</subject><subject>Sensor phenomena and characterization</subject><subject>Target tracking</subject><subject>Temperature sensors</subject><subject>Testing</subject><subject>Upper bound</subject><isbn>1424463831</isbn><isbn>9781424463831</isbn><isbn>9781424463855</isbn><isbn>1424463866</isbn><isbn>9781424463862</isbn><isbn>1424463858</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j81KAzEYRSNSUNvZC27yAlPz5XeylME_KHaj65JMvmC0ZkoyIn17B6x3czmby7mEXANbAzB7-9L3a85mUlIw0PaMNNZ0ILmUWnRKnZOrfxBwQZpaP9gcYYVR4pKwbabTO1I_fudQ6RhpxYMrzqd9mo405ZlzHQvNOP2M5bOuyCK6fcXm1Evy9nD_2j-1m-3jc3-3aRMIblunDXMhemcMagPBRgBkvhN-lkVvZlNrEGMHQ9CBB-lNgIFLlIrDoJRYkpu_3YSIu0NJX64cd6eT4hcaE0Qp</recordid><startdate>201001</startdate><enddate>201001</enddate><creator>Krishnan, B.S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201001</creationdate><title>On the bounds of separability in sensor networks</title><author>Krishnan, B.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1329-a670adfba77e671d9f11e0b83b201eb716997eef81cd6d2d4b7d1c24e4521c553</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithm design and analysis</topic><topic>Area measurement</topic><topic>Condition monitoring</topic><topic>Performance analysis</topic><topic>Random variables</topic><topic>Sensor phenomena and characterization</topic><topic>Target tracking</topic><topic>Temperature sensors</topic><topic>Testing</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Krishnan, B.S.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Krishnan, B.S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On the bounds of separability in sensor networks</atitle><btitle>2010 National Conference On Communications (NCC)</btitle><stitle>NCC</stitle><date>2010-01</date><risdate>2010</risdate><spage>1</spage><epage>5</epage><pages>1-5</pages><isbn>1424463831</isbn><isbn>9781424463831</isbn><eisbn>9781424463855</eisbn><eisbn>1424463866</eisbn><eisbn>9781424463862</eisbn><eisbn>1424463858</eisbn><abstract>A pair of target locations are separable if sensor observations can distinguish between the following choices: no targets are present, one target is present at either of the locations or a target is present at each location. The sensors of interest in this paper are binary proximity sensors, whose binary outputs are functions of the distance between the sensor and target. Sensors are deployed randomly according to a Poisson distribution. The probability that two target locations at a distance of r between them are separable is derived. This is extended to derive the probability of having at least Z among M uniformly distributed target locations to be non-separable from the origin. The bounds on this probability are expressed as a function of the sensor density ¿.</abstract><pub>IEEE</pub><doi>10.1109/NCC.2010.5430169</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 1424463831 |
| ispartof | 2010 National Conference On Communications (NCC), 2010, p.1-5 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5430169 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Area measurement Condition monitoring Performance analysis Random variables Sensor phenomena and characterization Target tracking Temperature sensors Testing Upper bound |
| title | On the bounds of separability in sensor networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T01%3A58%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20the%20bounds%20of%20separability%20in%20sensor%20networks&rft.btitle=2010%20National%20Conference%20On%20Communications%20(NCC)&rft.au=Krishnan,%20B.S.&rft.date=2010-01&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.isbn=1424463831&rft.isbn_list=9781424463831&rft_id=info:doi/10.1109/NCC.2010.5430169&rft_dat=%3Cieee_6IE%3E5430169%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424463855&rft.eisbn_list=1424463866&rft.eisbn_list=9781424463862&rft.eisbn_list=1424463858&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5430169&rfr_iscdi=true |