{"id":"https://openalex.org/W7212073141","doi":"https://doi.org/10.1145/3842721.3850126","title":"Resource-Constrained Semantic-Aware Remote Estimation with Overlapping Sensor Coverage","display_name":"Resource-Constrained Semantic-Aware Remote Estimation with Overlapping Sensor Coverage","publication_year":2026,"publication_date":"2026-10-30","ids":{"openalex":"https://openalex.org/W7212073141","doi":"https://doi.org/10.1145/3842721.3850126"},"language":"en","primary_location":{"id":"doi:10.1145/3842721.3850126","doi":"https://doi.org/10.1145/3842721.3850126","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3842721.3850126","pdf_url":null,"source":{"id":"https://openalex.org/S7407089234","display_name":"ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-seventh International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3842721.3850126","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5150976713","display_name":"Bowen Sun","orcid":"https://orcid.org/0000-0002-9599-4663","observed_orcids":["https://orcid.org/0000-0002-9599-4663"]},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bowen Sun","raw_affiliation_strings":["Link\u00f6ping University, Link\u00f6ping, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-9599-4663","affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084740578","display_name":"\u039d\u03b9\u03ba\u03cc\u03bb\u03b1\u03bf\u03c2 \u03a0\u03b1\u03c0\u03c0\u03ac\u03c2","orcid":"https://orcid.org/0000-0003-4416-7702","observed_orcids":["https://orcid.org/0000-0003-4416-7702"]},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Nikolaos Pappas","raw_affiliation_strings":["Link\u00f6ping University, Link\u00f6ping, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-4416-7702","affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67676349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"843","last_page":"848"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9229000210762024,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9229000210762024,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10046","display_name":"Stability and Control of Uncertain Systems","score":0.03909999877214432,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.009200000204145908,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/remote-estimation","display_name":"remote estimation","score":0.7490000128746033},{"id":"https://openalex.org/keywords/tdma","display_name":"TDMA","score":0.7889999747276306},{"id":"https://openalex.org/keywords/sensor-scheduling","display_name":"sensor scheduling","score":0.5929999947547913},{"id":"https://openalex.org/keywords/constrained-markov-decision-process","display_name":"constrained Markov decision process","score":0.8880000114440918},{"id":"https://openalex.org/keywords/lagrangian-duality","display_name":"Lagrangian duality","score":0.6819999814033508}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.7657999992370605},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7523999810218811},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6962000131607056},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6089000105857849},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5601999759674072},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.5401999950408936},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5027999877929688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48809999227523804},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.48739999532699585},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4438000023365021},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.4348999857902527},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.42559999227523804},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.388700008392334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3806999921798706},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.37950000166893005},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3314000070095062},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.3255000114440918},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.2922999858856201},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.29089999198913574},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.29019999504089355},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C183356978","wikidata":"https://www.wikidata.org/wiki/Q1779213","display_name":"Tracking error","level":3,"score":0.2621999979019165},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C187633118","wikidata":"https://www.wikidata.org/wiki/Q1317949","display_name":"Economic dispatch","level":4,"score":0.258899986743927},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25519999861717224},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2547999918460846},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3842721.3850126","doi":"https://doi.org/10.1145/3842721.3850126","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3842721.3850126","pdf_url":null,"source":{"id":"https://openalex.org/S7407089234","display_name":"ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-seventh International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2609.07563","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.07563","pdf_url":"https://arxiv.org/pdf/2609.07563","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.07563","doi":"https://doi.org/10.48550/arxiv.2609.07563","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.07563","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1145/3842721.3850126","doi":"https://doi.org/10.1145/3842721.3850126","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3842721.3850126","pdf_url":null,"source":{"id":"https://openalex.org/S7407089234","display_name":"ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-seventh International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7212073141.pdf","grobid_xml":"https://content.openalex.org/works/W7212073141.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1503425191","https://openalex.org/W1518931405","https://openalex.org/W2155397423","https://openalex.org/W2961841647","https://openalex.org/W3044517463","https://openalex.org/W3114602796","https://openalex.org/W4249667877","https://openalex.org/W4403534095","https://openalex.org/W4410152900","https://openalex.org/W4410536662","https://openalex.org/W7161570236"],"related_works":["https://openalex.org/W4410536662","https://openalex.org/W2809950409","https://openalex.org/W4200051637","https://openalex.org/W4405974566","https://openalex.org/W2122777576","https://openalex.org/W3000486967","https://openalex.org/W4411983377","https://openalex.org/W2571314227","https://openalex.org/W1980732596","https://openalex.org/W4405717646"],"abstract_inverted_index":{"We":[0,68,80,118],"study":[1],"semantic-aware":[2],"remote":[3],"estimation":[4],"of":[5,45,58],"multiple":[6],"finite-state":[7],"Markov":[8,77],"sources":[9],"observed":[10],"by":[11],"K":[12,98,113],"sensors":[13,18],"with":[14],"overlapping":[15],"coverage.":[16],"The":[17],"share":[19],"a":[20,41,73,151],"time-division":[21],"multiple-access":[22],"uplink":[23],"and":[24,31,43,64,102,127,154,159],"differ":[25],"in":[26,150],"transmission":[27,32,84,100,161],"reliability,":[28],"delivery":[29],"delay,":[30],"budget.":[33],"In":[34],"each":[35],"slot,":[36],"the":[37,54,83,93,121,142,145,155],"scheduler":[38],"jointly":[39],"selects":[40],"source":[42],"one":[44],"its":[46],"monitoring":[47],"sensors,":[48],"or":[49],"remains":[50],"idle,":[51],"to":[52,62],"minimize":[53],"long-run":[55],"average":[56],"cost":[57],"actuation":[59],"error":[60],"subject":[61],"global":[63,158],"per-sensor":[65,160],"transmission-frequency":[66],"constraints.":[67],"formulate":[69],"this":[70],"problem":[71],"as":[72],"finite":[74],"average-cost":[75],"constrained":[76,105],"decision":[78],"process.":[79],"show":[81],"that":[82],"resource":[85],"functions":[86],"have":[87],"rank":[88],"at":[89,111],"most":[90,112],"K.":[91],"Consequently,":[92],"Lagrangian":[94,124],"depends":[95],"only":[96],"on":[97],"effective":[99],"costs,":[101],"an":[103,134],"optimal":[104],"solution":[106],"can":[107],"be":[108],"represented":[109],"using":[110],"+1":[114],"deterministic":[115],"policy-recurrent-class":[116],"components.":[117],"further":[119],"characterize":[120],"piecewise-affine":[122],"concave":[123],"value":[125],"function":[126],"derive":[128],"projected":[129],"dual":[130],"subgradient":[131],"ascent":[132],"over":[133],"explicitly":[135],"bounded":[136],"multiplier":[137],"set.":[138],"Numerical":[139],"results":[140],"illustrate":[141],"value-function":[143],"structure,":[144],"need":[146],"for":[147],"policy":[148],"randomization":[149],"representative":[152],"instance,":[153],"interaction":[156],"between":[157],"budgets.":[162]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-09-10T00:00:00"}