{"corpus_id":3320365,"paper_sha":"ac62580c0fd8cbd282e484db19c0b78f27c23826","doi":"10.1109/TSP.2017.2773429","arxiv_id":"1702.04927","pmid":null,"pmcid":null,"mag_id":2962823509,"dblp_id":"journals/tsp/RusuTR18","acl_id":null,"title":"Sensor Scheduling With Time, Energy, and Communication Constraints","year":2017,"publication_date":"2017-02-16","venue":"IEEE Transactions on Signal Processing","journal":{"name":"IEEE Transactions on Signal Processing","pages":"528-539","volume":"66"},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle"],"pubmed_pub_types":null,"s2_fields_of_study":["Mathematics","Computer Science","Engineering"],"reference_count":50,"citation_count":30,"influential_citation_count":2,"is_open_access":true,"arxiv_categories":["cs.IT","math.IT"],"arxiv_license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"https://pure.qub.ac.uk/files/137291525/sensors_jrn.pdf","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/ac62580c0fd8cbd282e484db19c0b78f27c23826","s2_open_access_license":"other-oa","s2_open_access_status":"GREEN","pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"In this paper, we present new algorithms and analysis for the linear inverse sensor placement and scheduling problems over multiple time instances with power and communications constraints. The proposed algorithms, which deal directly with minimizing the mean squared error (MSE), are based on the convex relaxation approach to address the binary optimization scheduling problems that are formulated in sensor network scenarios. We propose to balance the energy and communications demands of operating a network of sensors over time while we still guarantee a minimum level of estimation accuracy. We measure this accuracy by the MSE for which we provide average case and lower bounds analyses that hold in general, irrespective of the scheduling algorithm used. We show experimentally how the proposed algorithms perform against state-of-the-art methods previously described in the literature.","claims":[{"public_id":"cl_d0ec6ae49d2da7dc07ba9ed09af6e2b9","status":"active","text":"Average-case and lower-bound analyses for estimation accuracy are provided and hold independently of the scheduling algorithm used.","confidence":0.94,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_d0ec6ae49d2da7dc07ba9ed09af6e2b9"},{"public_id":"cl_2aff923cd8dffc933062f952ebe9cb33","status":"active","text":"Convex-relaxation-based algorithms are proposed for linear inverse sensor placement and scheduling over multiple time instances with power and communications constraints.","confidence":0.98,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_2aff923cd8dffc933062f952ebe9cb33"},{"public_id":"cl_ae76593fd9808d8bce277a89c4cadd09","status":"active","text":"Experimental results show the proposed algorithms compared against state-of-the-art methods from the literature.","confidence":0.9,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_ae76593fd9808d8bce277a89c4cadd09"},{"public_id":"cl_c82352939d6cb5bdbbbe0ae1b521193a","status":"active","text":"The scheduling formulation directly minimizes mean squared error while balancing energy and communications demands across time.","confidence":0.97,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_c82352939d6cb5bdbbbe0ae1b521193a"}],"concepts":[{"public_id":"co_149b6d8b5f93333c5c9c375a0db134e0","status":"active","name":"convex relaxation","description":"An optimization technique that replaces a कठिन discrete problem with a convex approximation.","types":["method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_149b6d8b5f93333c5c9c375a0db134e0"},{"public_id":"co_1d6703ffcd7120054893c2ef3d6e3b00","status":"active","name":"state-of-the-art methods","description":"Previously reported leading methods used as comparison baselines.","types":["baseline"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_1d6703ffcd7120054893c2ef3d6e3b00"},{"public_id":"co_4131d6a9a360737f0384c0a5fd5c2907","status":"active","name":"communications constraints","description":"Limits on communication resources available to sensors or a sensor network.","types":["constraint"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_4131d6a9a360737f0384c0a5fd5c2907"},{"public_id":"co_5c989428d253b718cf78b8bc0d272b58","status":"active","name":"linear inverse sensor placement","description":"A sensor placement problem for estimating an underlying signal or field from linear inverse observations.","types":["problem"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_5c989428d253b718cf78b8bc0d272b58"},{"public_id":"co_61fe27ac2483ad7d8acbd2ccf0b8f2f2","status":"active","name":"lower bounds analysis","description":"An analysis that derives guaranteed minimum performance or error bounds.","types":["analysis method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_61fe27ac2483ad7d8acbd2ccf0b8f2f2"},{"public_id":"co_9188bc97a81b61fab270b6c96d316f38","status":"active","name":"sensor scheduling","description":"The task of deciding when sensors should be active over multiple time instances.","types":["problem"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_9188bc97a81b61fab270b6c96d316f38"},{"public_id":"co_9a50efbfe674d8e1945e8ce8fc9b2907","status":"active","name":"average case analysis","description":"An analysis that characterizes expected performance over typical or probabilistic cases.","types":["analysis method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_9a50efbfe674d8e1945e8ce8fc9b2907"},{"public_id":"co_ae78f0fe738b0288089295bb25fa252c","status":"active","name":"power constraints","description":"Limits on the electrical energy available for operating sensors.","types":["constraint"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_ae78f0fe738b0288089295bb25fa252c"},{"public_id":"co_dde3270c2df5a1c04c30a98cc15b650c","status":"active","name":"proposed algorithms","description":"The new algorithms introduced for sensor placement and scheduling under resource constraints.","types":["method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_dde3270c2df5a1c04c30a98cc15b650c"},{"public_id":"co_eb74467dc656b6a75430778a80bc17ef","status":"active","name":"binary optimization scheduling problems","description":"Scheduling problems whose decisions are represented with binary variables.","types":["problem"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_eb74467dc656b6a75430778a80bc17ef"},{"public_id":"co_f2474828f486e0c1c26ea33716c5c019","status":"active","name":"mean squared error","description":"An estimation accuracy metric based on the average squared difference between estimated and true values.","types":["metric"],"aliases":["MSE"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_f2474828f486e0c1c26ea33716c5c019"},{"public_id":"co_f4ec3b7ed4bde54473ac1a371e0d333e","status":"active","name":"energy and communications demands","description":"The resource requirements for powering sensors and supporting their communication over time.","types":["resource requirements"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_f4ec3b7ed4bde54473ac1a371e0d333e"}],"external_ids":{"DOI":"10.1109/TSP.2017.2773429","ArXiv":"1702.04927","PubMed":null,"PubMedCentral":null,"MAG":2962823509,"DBLP":"journals/tsp/RusuTR18","ACL":null},"open_access":{"is_open_access":true,"pdf_url":"https://pure.qub.ac.uk/files/137291525/sensors_jrn.pdf","landing_url":"https://www.semanticscholar.org/paper/ac62580c0fd8cbd282e484db19c0b78f27c23826","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":"other-oa","status":"GREEN","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":true,"full_text_source":"arxiv","count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":631501,"paper_uid":"7237ce52-d5d2-43b3-bd1d-a924cb33f359","canonical_identity":{"paper_id":631501,"paper_uid":"7237ce52-d5d2-43b3-bd1d-a924cb33f359","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/3320365"}