{"id":"https://openalex.org/W2554188976","doi":"https://doi.org/10.1109/tnet.2016.2622002","title":"Optimal Power Allocation and Scheduling Under Jamming Attacks","display_name":"Optimal Power Allocation and Scheduling Under Jamming Attacks","publication_year":2016,"publication_date":"2016-11-15","ids":{"openalex":"https://openalex.org/W2554188976","doi":"https://doi.org/10.1109/tnet.2016.2622002","mag":"2554188976"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2016.2622002","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2016.2622002","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},"type":"article","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/A5053788606","display_name":"Salvatore D\u2019Oro","orcid":"https://orcid.org/0000-0002-7690-0449"},"institutions":[{"id":"https://openalex.org/I39063666","display_name":"University of Catania","ror":"https://ror.org/03a64bh57","country_code":"IT","type":"education","lineage":["https://openalex.org/I39063666"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Salvatore D'Oro","raw_affiliation_strings":["University of Catania, Catania, Italy"],"raw_orcid":"https://orcid.org/0000-0002-7690-0449","affiliations":[{"raw_affiliation_string":"University of Catania, Catania, Italy","institution_ids":["https://openalex.org/I39063666"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082165966","display_name":"Eylem Ekici","orcid":"https://orcid.org/0000-0002-6227-8951"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eylem Ekici","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061649682","display_name":"Sergio Palazzo","orcid":"https://orcid.org/0000-0001-7428-0533"},"institutions":[{"id":"https://openalex.org/I39063666","display_name":"University of Catania","ror":"https://ror.org/03a64bh57","country_code":"IT","type":"education","lineage":["https://openalex.org/I39063666"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Sergio Palazzo","raw_affiliation_strings":["University of Catania, Catania, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Catania, Catania, Italy","institution_ids":["https://openalex.org/I39063666"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0827,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.97283389,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"25","issue":"3","first_page":"1310","last_page":"1323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9997000098228455,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9997000098228455,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9977999925613403,"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/computer-science","display_name":"Computer science","score":0.8319617509841919},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6228998303413391},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5969442129135132},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5267086625099182},{"id":"https://openalex.org/keywords/power-control","display_name":"Power control","score":0.4868542551994324},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4689929783344269},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.4546629786491394},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4508705139160156},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4386642575263977},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4313593804836273},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.42745018005371094},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4167829751968384},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3918949365615845},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3671995997428894},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.21523171663284302},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1992703676223755},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14859533309936523}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8319617509841919},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6228998303413391},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5969442129135132},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5267086625099182},{"id":"https://openalex.org/C56685638","wikidata":"https://www.wikidata.org/wiki/Q2300474","display_name":"Power control","level":3,"score":0.4868542551994324},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4689929783344269},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.4546629786491394},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4508705139160156},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4386642575263977},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4313593804836273},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.42745018005371094},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4167829751968384},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3918949365615845},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3671995997428894},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.21523171663284302},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1992703676223755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14859533309936523},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2016.2622002","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2016.2622002","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1491706803","https://openalex.org/W1572298868","https://openalex.org/W1966104830","https://openalex.org/W1971460123","https://openalex.org/W1991113998","https://openalex.org/W1997237176","https://openalex.org/W2001542086","https://openalex.org/W2004203064","https://openalex.org/W2011039300","https://openalex.org/W2040772779","https://openalex.org/W2043053235","https://openalex.org/W2048092462","https://openalex.org/W2065483835","https://openalex.org/W2065555571","https://openalex.org/W2070230694","https://openalex.org/W2082142260","https://openalex.org/W2086174184","https://openalex.org/W2087294514","https://openalex.org/W2088188780","https://openalex.org/W2098432798","https://openalex.org/W2103285648","https://openalex.org/W2114316404","https://openalex.org/W2116748333","https://openalex.org/W2120193433","https://openalex.org/W2122285088","https://openalex.org/W2138056241","https://openalex.org/W2152148218","https://openalex.org/W2153526702","https://openalex.org/W2162926971","https://openalex.org/W2164284962","https://openalex.org/W2191966684","https://openalex.org/W2293156966","https://openalex.org/W2531891978","https://openalex.org/W2548395820","https://openalex.org/W4302033506","https://openalex.org/W6671170368","https://openalex.org/W6696762234"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W189401716","https://openalex.org/W2019216770","https://openalex.org/W2574250816","https://openalex.org/W2898570308"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,81,126,146],"consider":[4,31],"a":[5,10,23,61,159,166],"jammed":[6],"wireless":[7],"scenario":[8],"where":[9,34],"network":[11,19,53],"operator":[12],"aims":[13],"to":[14,17,27,132,138,164,170],"schedule":[15],"users":[16],"maximize":[18],"performance":[20,25,54,121],"while":[21],"guaranteeing":[22],"minimum":[24,180],"level":[26],"each":[28,110],"user.":[29],"We":[30,49,86,112,156],"the":[32,38,41,45,52,75,79,89,96,101,114,119,123,133,139,143,171,198],"case":[33],"no":[35],"information":[36],"about":[37],"position":[39],"and":[40,66,100,125,175,193],"triggering":[42],"threshold":[43],"of":[44,78,116,122,142,185],"jammer":[46],"is":[47,71,188],"available.":[48],"show":[50,87,127,196],"that":[51,88,128,197],"maximization":[55],"problem":[56,91,99,104,178],"can":[57,92,105],"be":[58,93,106],"modeled":[59],"as":[60],"finite-horizon":[62],"joint":[63,172],"power":[64,97,173],"control":[65,98,174],"user":[67,102,176],"scheduling":[68,103,177,204],"problem,":[69,80],"which":[70],"NP-hard.":[72],"To":[73],"find":[74],"optimal":[76,144],"solution":[77,169],"exploit":[82],"dynamic":[83],"programming":[84],"techniques.":[85,155],"obtained":[90],"decomposed,":[94],"i.e.,":[95],"sequentially":[107],"solved":[108],"at":[109],"slot.":[111],"investigate":[113],"impact":[115],"uncertainty":[117,130],"on":[118],"achievable":[120],"system":[124],"such":[129],"leads":[131],"well-known":[134],"exploration-exploitation":[135],"tradeoff.":[136],"Due":[137],"high":[140],"complexity":[141],"solution,":[145],"introduce":[147],"an":[148],"approximation":[149],"algorithm":[150,163],"by":[151],"exploiting":[152],"state":[153],"aggregation":[154],"also":[157],"propose":[158],"performance-aware":[160],"online":[161],"greedy":[162],"provide":[165],"low-complexity":[167],"sub-optimal":[168],"under":[179],"quality-of-service":[181],"requirements.":[182],"The":[183],"efficiency":[184],"both":[186],"solutions":[187,200],"evaluated":[189],"through":[190],"extensive":[191],"simulations,":[192],"our":[194],"results":[195],"proposed":[199],"outperform":[201],"other":[202],"traditional":[203],"policies.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}