{"id":"https://openalex.org/W4414539035","doi":"https://doi.org/10.1109/icc52391.2025.11162082","title":"Optimized Persistent Scheduling for Smart Jamming Resiliency in Manned-Unmanned Teaming","display_name":"Optimized Persistent Scheduling for Smart Jamming Resiliency in Manned-Unmanned Teaming","publication_year":2025,"publication_date":"2025-06-08","ids":{"openalex":"https://openalex.org/W4414539035","doi":"https://doi.org/10.1109/icc52391.2025.11162082"},"language":"en","primary_location":{"id":"doi:10.1109/icc52391.2025.11162082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc52391.2025.11162082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2025 - IEEE International Conference on Communications","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082065073","display_name":"Maya Flores","orcid":"https://orcid.org/0009-0004-6399-7431"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maya Flores","raw_affiliation_strings":["Worcester Polytechnic Institute,Worcester,MA,USA,01609"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute,Worcester,MA,USA,01609","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089109536","display_name":"Thomas Stahlbuhk","orcid":"https://orcid.org/0000-0002-2128-5004"},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Stahlbuhk","raw_affiliation_strings":["MIT Lincoln Laboratory,Lexington,MA,USA,02421"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory,Lexington,MA,USA,02421","institution_ids":["https://openalex.org/I4210122954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011856267","display_name":"Alexander M. Wyglinski","orcid":"https://orcid.org/0000-0002-3357-0064"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander M. Wyglinski","raw_affiliation_strings":["Worcester Polytechnic Institute,Worcester,MA,USA,01609"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute,Worcester,MA,USA,01609","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36874123,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2248","last_page":"2253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11357","display_name":"Risk and Safety Analysis","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11357","display_name":"Risk and Safety Analysis","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12000","display_name":"Systems Engineering Methodologies and Applications","score":0.9804999828338623,"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/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.954800009727478,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6976000070571899},{"id":"https://openalex.org/keywords/jamming","display_name":"Jamming","score":0.6402000188827515},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5843999981880188},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5296000242233276},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.41830000281333923},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.415800005197525},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.39579999446868896},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.3675000071525574},{"id":"https://openalex.org/keywords/information-exchange","display_name":"Information exchange","score":0.3345000147819519}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6976000070571899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6796000003814697},{"id":"https://openalex.org/C2779079576","wikidata":"https://www.wikidata.org/wiki/Q17092823","display_name":"Jamming","level":2,"score":0.6402000188827515},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5843999981880188},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5296000242233276},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5167999863624573},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4706999957561493},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.41830000281333923},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.415800005197525},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.39579999446868896},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.36890000104904175},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.3675000071525574},{"id":"https://openalex.org/C189693848","wikidata":"https://www.wikidata.org/wiki/Q6031064","display_name":"Information exchange","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.2969000041484833},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.29179999232292175},{"id":"https://openalex.org/C2989335485","wikidata":"https://www.wikidata.org/wiki/Q17130189","display_name":"Transmission rate","level":3,"score":0.29109999537467957},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.2897999882698059},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.28279998898506165},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.28209999203681946},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.2818000018596649},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.2775000035762787},{"id":"https://openalex.org/C205875254","wikidata":"https://www.wikidata.org/wiki/Q17156857","display_name":"Decentralised system","level":3,"score":0.2662000060081482},{"id":"https://openalex.org/C2983568541","wikidata":"https://www.wikidata.org/wiki/Q389772","display_name":"Information transmission","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.26089999079704285}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc52391.2025.11162082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc52391.2025.11162082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2025 - IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"work":[1],"addresses":[2],"control":[3,19,51,81,105],"information":[4,52,106],"loss":[5],"in":[6,47],"manned-unmanned":[7],"teaming":[8],"networks.":[9],"We":[10,56],"consider":[11],"methods":[12],"for":[13],"mitigating":[14],"smart":[15],"jammers":[16],"that":[17],"target":[18],"channels":[20],"to":[21,65,76,98,111],"disrupt":[22],"transmission":[23],"scheduling":[24,60,91],"and":[25,63,89,120],"degrade":[26],"communication.":[27],"In":[28],"this":[29],"context,":[30],"the":[31,48,72,80,94,101],"well-studied":[32],"Max-Weight":[33],"algorithm":[34],"achieves":[35],"throughput":[36],"optimality":[37],"without":[38],"prior":[39],"knowledge":[40],"of":[41,50,79],"arrival":[42],"rates,":[43],"but":[44],"its":[45],"performance":[46],"presence":[49],"jamming":[53,78],"is":[54,107],"under-explored.":[55],"propose":[57],"two":[58],"novel":[59],"policies,":[61],"VFMW-OS":[62,69],"VFMW-HS,":[64],"improve":[66],"network":[67],"resilience.":[68],"dynamically":[70],"adjusts":[71],"control-information":[73],"coding":[74],"rate":[75,102],"overcome":[77],"channel.":[82],"Likewise,":[83],"VFMW-HS":[84],"opportunistically":[85],"switches":[86],"between":[87],"centralized":[88],"decentralized":[90],"based":[92],"on":[93],"network's":[95],"queue":[96],"lengths":[97],"further":[99],"adjust":[100],"at":[103],"which":[104],"exchanged":[108],"so":[109],"as":[110],"minimize":[112],"delay.":[113],"Simulations":[114],"show":[115],"both":[116],"policies":[117],"enhance":[118],"robustness":[119],"reduce":[121],"delay":[122],"under":[123],"adversarial":[124],"conditions.":[125]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}