{"id":"https://openalex.org/W7165393285","doi":"https://doi.org/10.48550/arxiv.2606.19695","title":"A Unified Framework for Joint Sensor Placement and Scheduling for Intrusion Detection","display_name":"A Unified Framework for Joint Sensor Placement and Scheduling for Intrusion Detection","publication_year":2026,"publication_date":"2026-06-18","ids":{"openalex":"https://openalex.org/W7165393285","doi":"https://doi.org/10.48550/arxiv.2606.19695"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.19695","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.19695","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,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.19695","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138988912","display_name":"Jayanth Bhargav","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bhargav, Jayanth","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101793459","display_name":"Mahsa Ghasemi","orcid":"https://orcid.org/0000-0003-4302-4806"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ghasemi, Mahsa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5076731201","display_name":"Shreyas Sundaram","orcid":"https://orcid.org/0000-0002-5390-2505"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sundaram, Shreyas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.3188999891281128,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.3188999891281128,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.19030000269412994,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.17139999568462372,"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/submodular-set-function","display_name":"Submodular set function","score":0.7533000111579895},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5005000233650208},{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.45899999141693115},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45750001072883606},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.42100000381469727},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.3765000104904175},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.3732999861240387},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.3434999883174896},{"id":"https://openalex.org/keywords/intrusion-detection-system","display_name":"Intrusion detection system","score":0.3411000072956085},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.328900009393692}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7533000111579895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6384999752044678},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5875999927520752},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5005000233650208},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.45899999141693115},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45750001072883606},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.42100000381469727},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C35525427","wikidata":"https://www.wikidata.org/wiki/Q745881","display_name":"Intrusion detection system","level":2,"score":0.3411000072956085},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3091999888420105},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.30480000376701355},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C2781234732","wikidata":"https://www.wikidata.org/wiki/Q943505","display_name":"Fusion center","level":4,"score":0.29679998755455017},{"id":"https://openalex.org/C33954974","wikidata":"https://www.wikidata.org/wiki/Q486494","display_name":"Sensor fusion","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.28540000319480896},{"id":"https://openalex.org/C16345878","wikidata":"https://www.wikidata.org/wiki/Q107472979","display_name":"Orientation (vector space)","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2653000056743622},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.19695","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.19695","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,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.19695","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.19695","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,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.41813334822654724,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,32,170],"consider":[1],"an":[2,26,43,73,126],"intrusion":[3],"detection":[4,24,234],"task":[5],"in":[6,165],"which":[7],"a":[8,29,37,52,59,91,162,188],"defender":[9,65,71],"must":[10],"jointly":[11],"optimize":[12],"sensor":[13,54,184,218],"placement":[14,190,219],"locations":[15],"and":[16,42,66,110,128,141,186,220],"orientations":[17],"to":[18,80,95,147,204,242],"minimize":[19,81],"the":[20,64,67,70,77,82,88,99,106,113,134,137,148,153,166,181,200,229],"probability":[21,83],"of":[22,25,84,108,136,152,183,217],"missed":[23,85],"intruder":[27,89],"traversing":[28],"protected":[30],"environment.":[31],"decompose":[33],"this":[34,122,173,198],"problem":[35],"into":[36],"meta":[38,168],"problem,":[39],"termed":[40,46],"SensorPlacement,":[41],"embedded":[44],"subproblem,":[45,50],"OrientationScheduling.":[47],"The":[48],"OrientationScheduling":[49],"for":[51,76,145],"fixed":[53],"placement,":[55],"is":[56,158,177,199],"modeled":[57],"as":[58,161],"2-player":[60],"zero-sum":[61],"game":[62,114],"between":[63],"intruder,":[68],"where":[69],"seeks":[72,90],"orientation":[74,221],"strategy":[75,94,101],"deployed":[78],"sensors":[79,109],"detection,":[86],"while":[87,236],"path":[92],"selection":[93],"maximize":[96],"it.":[97],"Since":[98],"defender's":[100],"space":[102],"grows":[103],"combinatorially":[104],"with":[105,192,209],"number":[107],"orientations,":[111],"solving":[112],"via":[115],"standard":[116],"linear":[117],"programming":[118],"becomes":[119],"prohibitive.":[120],"To":[121,195],"end,":[123],"we":[124,226],"develop":[125],"iterative":[127],"efficient":[129],"equilibrium-seeking":[130],"algorithm":[131,191],"that":[132,172,228],"exploits":[133],"structure":[135],"game's":[138],"payoff":[139],"function":[140,176],"establishes":[142],"theoretical":[143],"guarantees":[144],"convergence":[146],"Nash":[149],"equilibrium":[150],"(NE)":[151],"game.":[154],"This":[155],"NE":[156],"value":[157],"then":[159],"used":[160],"utility":[163,175,207],"measure":[164],"SensorPlacement":[167],"problem.":[169],"show":[171],"game-value-based":[174],"weakly":[178],"submodular":[179,211],"over":[180],"set":[182],"placements":[185],"propose":[187],"greedy":[189],"near-optimality":[193],"guarantees.":[194],"our":[196],"knowledge,":[197],"first":[201],"unified":[202],"framework":[203],"integrate":[205],"game-theoretic":[206],"design":[208],"(weak)":[210],"optimization,":[212],"enabling":[213],"principled":[214],"joint":[215],"optimization":[216],"scheduling.":[222],"Through":[223],"extensive":[224],"simulations,":[225],"demonstrate":[227],"proposed":[230],"approach":[231],"achieves":[232],"near-optimal":[233],"performance":[235],"significantly":[237],"reducing":[238],"computation":[239],"time":[240],"compared":[241],"baselines.":[243]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-20T00:00:00"}