Loading…

Optimum Sleep-Wake Scheduling of Sensors for Quickest Event Detection in Small Extent Wireless Sensor Networks

We consider the problem of quickest event detection with sleep-wake scheduling in small extent wireless sensor networks in which, at each time slot, each sensor node in the awake state observes a sample and communicates the information to the fusion centre. The sensor nodes in the sleep state do not...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2011-05
Main Authors: Premkumar Karumbu, Kumar, Anurag
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Premkumar Karumbu
Kumar, Anurag
description We consider the problem of quickest event detection with sleep-wake scheduling in small extent wireless sensor networks in which, at each time slot, each sensor node in the awake state observes a sample and communicates the information to the fusion centre. The sensor nodes in the sleep state do not sample or communicate any information to the fusion centre (FC), thereby conserving energy. At each time slot, the FC, after having received the samples from the sensor nodes in the wake state, makes a decision to stop (and thus declare that the event has occurred) or to continue observing. If it decides to continue, the FC also makes the decision of choosing the number of sensor nodes to be in the wake state in the next time slot. We consider three alternative approaches to the problem of choosing the number of sensor nodes to be in the wake state in time slot k+1, based on the information available at time slot k, namely, 1. optimal control of M_{k+1}, the number of sensor nodes to be in the awake state in time slot k+1, 2. optimal control of q_{k+1}, the probability of a sensor node to be in the awake state in time slot k+1, and 3. optimal probability q that a sensor node is in the awake state in any time slot. In each case, we formulate the problem as a sequential decision process. We show that a sufficient statistic for the decision at time k is the a posteriori probability of change Pi_k. Also, we show that the optimal stopping rule is a threshold rule on Pi_k. The optimal policy for M_{k+1} can keep very few sensors wake during the prechange phase and then quickly increase the number of sensors in the wake state when a change is "suspected". Among the three sleep-wake algorithms described, we observe that the total cost is minimum for the optimum control of M_{k+1} and is maximum for the optimum control on q.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2086789496</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2086789496</sourcerecordid><originalsourceid>FETCH-proquest_journals_20867894963</originalsourceid><addsrcrecordid>eNqNjMEKgkAURYcgSKp_eNBasLFM12W0KsLApYg9a3ScsXkz1edn0Ae0Ootz7h0xj4fh0o9XnE_YnKgJgoBHG75ehx5Tp96KznWQScTez8sWIavueHVSqBvoGjJUpA1BrQ2cnahaJAvpE5WFHVqsrNAKhIKsK6WE9G2_JhcGJRL91nBE-9KmpRkb16UknP84ZYt9etke_N7ohxuei0Y7owZV8CCONnGySqLwv-oDH4pKKA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2086789496</pqid></control><display><type>article</type><title>Optimum Sleep-Wake Scheduling of Sensors for Quickest Event Detection in Small Extent Wireless Sensor Networks</title><source>Publicly Available Content Database</source><creator>Premkumar Karumbu ; Kumar, Anurag</creator><creatorcontrib>Premkumar Karumbu ; Kumar, Anurag</creatorcontrib><description>We consider the problem of quickest event detection with sleep-wake scheduling in small extent wireless sensor networks in which, at each time slot, each sensor node in the awake state observes a sample and communicates the information to the fusion centre. The sensor nodes in the sleep state do not sample or communicate any information to the fusion centre (FC), thereby conserving energy. At each time slot, the FC, after having received the samples from the sensor nodes in the wake state, makes a decision to stop (and thus declare that the event has occurred) or to continue observing. If it decides to continue, the FC also makes the decision of choosing the number of sensor nodes to be in the wake state in the next time slot. We consider three alternative approaches to the problem of choosing the number of sensor nodes to be in the wake state in time slot k+1, based on the information available at time slot k, namely, 1. optimal control of M_{k+1}, the number of sensor nodes to be in the awake state in time slot k+1, 2. optimal control of q_{k+1}, the probability of a sensor node to be in the awake state in time slot k+1, and 3. optimal probability q that a sensor node is in the awake state in any time slot. In each case, we formulate the problem as a sequential decision process. We show that a sufficient statistic for the decision at time k is the a posteriori probability of change Pi_k. Also, we show that the optimal stopping rule is a threshold rule on Pi_k. The optimal policy for M_{k+1} can keep very few sensors wake during the prechange phase and then quickly increase the number of sensors in the wake state when a change is "suspected". Among the three sleep-wake algorithms described, we observe that the total cost is minimum for the optimum control of M_{k+1} and is maximum for the optimum control on q.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Energy conservation ; Nodes ; Optimal control ; Optimization ; Remote sensors ; Scheduling ; Sensors ; Sleep ; Statistical analysis ; Statistical methods ; Wireless sensor networks</subject><ispartof>arXiv.org, 2011-05</ispartof><rights>2011. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><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://www.proquest.com/docview/2086789496?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Premkumar Karumbu</creatorcontrib><creatorcontrib>Kumar, Anurag</creatorcontrib><title>Optimum Sleep-Wake Scheduling of Sensors for Quickest Event Detection in Small Extent Wireless Sensor Networks</title><title>arXiv.org</title><description>We consider the problem of quickest event detection with sleep-wake scheduling in small extent wireless sensor networks in which, at each time slot, each sensor node in the awake state observes a sample and communicates the information to the fusion centre. The sensor nodes in the sleep state do not sample or communicate any information to the fusion centre (FC), thereby conserving energy. At each time slot, the FC, after having received the samples from the sensor nodes in the wake state, makes a decision to stop (and thus declare that the event has occurred) or to continue observing. If it decides to continue, the FC also makes the decision of choosing the number of sensor nodes to be in the wake state in the next time slot. We consider three alternative approaches to the problem of choosing the number of sensor nodes to be in the wake state in time slot k+1, based on the information available at time slot k, namely, 1. optimal control of M_{k+1}, the number of sensor nodes to be in the awake state in time slot k+1, 2. optimal control of q_{k+1}, the probability of a sensor node to be in the awake state in time slot k+1, and 3. optimal probability q that a sensor node is in the awake state in any time slot. In each case, we formulate the problem as a sequential decision process. We show that a sufficient statistic for the decision at time k is the a posteriori probability of change Pi_k. Also, we show that the optimal stopping rule is a threshold rule on Pi_k. The optimal policy for M_{k+1} can keep very few sensors wake during the prechange phase and then quickly increase the number of sensors in the wake state when a change is "suspected". Among the three sleep-wake algorithms described, we observe that the total cost is minimum for the optimum control of M_{k+1} and is maximum for the optimum control on q.</description><subject>Algorithms</subject><subject>Energy conservation</subject><subject>Nodes</subject><subject>Optimal control</subject><subject>Optimization</subject><subject>Remote sensors</subject><subject>Scheduling</subject><subject>Sensors</subject><subject>Sleep</subject><subject>Statistical analysis</subject><subject>Statistical methods</subject><subject>Wireless sensor networks</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNjMEKgkAURYcgSKp_eNBasLFM12W0KsLApYg9a3ScsXkz1edn0Ae0Ootz7h0xj4fh0o9XnE_YnKgJgoBHG75ehx5Tp96KznWQScTez8sWIavueHVSqBvoGjJUpA1BrQ2cnahaJAvpE5WFHVqsrNAKhIKsK6WE9G2_JhcGJRL91nBE-9KmpRkb16UknP84ZYt9etke_N7ohxuei0Y7owZV8CCONnGySqLwv-oDH4pKKA</recordid><startdate>20110530</startdate><enddate>20110530</enddate><creator>Premkumar Karumbu</creator><creator>Kumar, Anurag</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20110530</creationdate><title>Optimum Sleep-Wake Scheduling of Sensors for Quickest Event Detection in Small Extent Wireless Sensor Networks</title><author>Premkumar Karumbu ; Kumar, Anurag</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20867894963</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Energy conservation</topic><topic>Nodes</topic><topic>Optimal control</topic><topic>Optimization</topic><topic>Remote sensors</topic><topic>Scheduling</topic><topic>Sensors</topic><topic>Sleep</topic><topic>Statistical analysis</topic><topic>Statistical methods</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Premkumar Karumbu</creatorcontrib><creatorcontrib>Kumar, Anurag</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Premkumar Karumbu</au><au>Kumar, Anurag</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Optimum Sleep-Wake Scheduling of Sensors for Quickest Event Detection in Small Extent Wireless Sensor Networks</atitle><jtitle>arXiv.org</jtitle><date>2011-05-30</date><risdate>2011</risdate><eissn>2331-8422</eissn><abstract>We consider the problem of quickest event detection with sleep-wake scheduling in small extent wireless sensor networks in which, at each time slot, each sensor node in the awake state observes a sample and communicates the information to the fusion centre. The sensor nodes in the sleep state do not sample or communicate any information to the fusion centre (FC), thereby conserving energy. At each time slot, the FC, after having received the samples from the sensor nodes in the wake state, makes a decision to stop (and thus declare that the event has occurred) or to continue observing. If it decides to continue, the FC also makes the decision of choosing the number of sensor nodes to be in the wake state in the next time slot. We consider three alternative approaches to the problem of choosing the number of sensor nodes to be in the wake state in time slot k+1, based on the information available at time slot k, namely, 1. optimal control of M_{k+1}, the number of sensor nodes to be in the awake state in time slot k+1, 2. optimal control of q_{k+1}, the probability of a sensor node to be in the awake state in time slot k+1, and 3. optimal probability q that a sensor node is in the awake state in any time slot. In each case, we formulate the problem as a sequential decision process. We show that a sufficient statistic for the decision at time k is the a posteriori probability of change Pi_k. Also, we show that the optimal stopping rule is a threshold rule on Pi_k. The optimal policy for M_{k+1} can keep very few sensors wake during the prechange phase and then quickly increase the number of sensors in the wake state when a change is "suspected". Among the three sleep-wake algorithms described, we observe that the total cost is minimum for the optimum control of M_{k+1} and is maximum for the optimum control on q.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2011-05
issn 2331-8422
language eng
recordid cdi_proquest_journals_2086789496
source Publicly Available Content Database
subjects Algorithms
Energy conservation
Nodes
Optimal control
Optimization
Remote sensors
Scheduling
Sensors
Sleep
Statistical analysis
Statistical methods
Wireless sensor networks
title Optimum Sleep-Wake Scheduling of Sensors for Quickest Event Detection in Small Extent Wireless Sensor Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T13%3A08%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Optimum%20Sleep-Wake%20Scheduling%20of%20Sensors%20for%20Quickest%20Event%20Detection%20in%20Small%20Extent%20Wireless%20Sensor%20Networks&rft.jtitle=arXiv.org&rft.au=Premkumar%20Karumbu&rft.date=2011-05-30&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2086789496%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20867894963%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2086789496&rft_id=info:pmid/&rfr_iscdi=true