{"id":"https://openalex.org/W3117585963","doi":"https://doi.org/10.1109/smartgridcomm47815.2020.9302929","title":"Network-aware Mitigation of Undetectable PMU Time Synchronization Attacks","display_name":"Network-aware Mitigation of Undetectable PMU Time Synchronization Attacks","publication_year":2020,"publication_date":"2020-11-11","ids":{"openalex":"https://openalex.org/W3117585963","doi":"https://doi.org/10.1109/smartgridcomm47815.2020.9302929","mag":"3117585963"},"language":"en","primary_location":{"id":"doi:10.1109/smartgridcomm47815.2020.9302929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smartgridcomm47815.2020.9302929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)","raw_type":"proceedings-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/A5087717727","display_name":"Ezzeldin Shereen","orcid":"https://orcid.org/0000-0002-9988-9545"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Ezzeldin Shereen","raw_affiliation_strings":["Division of Network and Systems Engineering, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Division of Network and Systems Engineering, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086721943","display_name":"Gy\u00f6rgy D\u00e1n","orcid":"https://orcid.org/0000-0002-4876-0223"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Gyorgy Dan","raw_affiliation_strings":["Division of Network and Systems Engineering, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Division of Network and Systems Engineering, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087717727"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.4413,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63988035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10917","display_name":"Smart Grid Security and Resilience","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10917","display_name":"Smart Grid Security and Resilience","score":1.0,"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/T10972","display_name":"Power Systems Fault Detection","score":0.9979000091552734,"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/T12216","display_name":"Network Time Synchronization Technologies","score":0.9966999888420105,"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/benchmark","display_name":"Benchmark (surveying)","score":0.695298433303833},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6842460632324219},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6710713505744934},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6614158153533936},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5677964091300964},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5558376312255859},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5474714040756226},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5323204398155212},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5275154709815979},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5221524238586426},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.464310884475708},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45085519552230835},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4104604125022888},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.364045113325119},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19160109758377075},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09104481339454651}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.695298433303833},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6842460632324219},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6710713505744934},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6614158153533936},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5677964091300964},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5558376312255859},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5474714040756226},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5323204398155212},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5275154709815979},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5221524238586426},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.464310884475708},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45085519552230835},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4104604125022888},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.364045113325119},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19160109758377075},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09104481339454651},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smartgridcomm47815.2020.9302929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smartgridcomm47815.2020.9302929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1598852905","https://openalex.org/W1976347161","https://openalex.org/W1980379191","https://openalex.org/W1988642664","https://openalex.org/W1990483314","https://openalex.org/W1991484043","https://openalex.org/W1992488456","https://openalex.org/W2049184889","https://openalex.org/W2119918317","https://openalex.org/W2131428619","https://openalex.org/W2164681195","https://openalex.org/W2169506396","https://openalex.org/W2305513921","https://openalex.org/W2559102461","https://openalex.org/W2564348914","https://openalex.org/W2586544129","https://openalex.org/W2752040793","https://openalex.org/W2806362792","https://openalex.org/W2962886057","https://openalex.org/W2964010205","https://openalex.org/W2972980536","https://openalex.org/W2982499446","https://openalex.org/W2983272077","https://openalex.org/W3003760618","https://openalex.org/W6648039416","https://openalex.org/W6662875218","https://openalex.org/W6678974415"],"related_works":["https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2962917430","https://openalex.org/W2163115662","https://openalex.org/W2107423006","https://openalex.org/W2045237525","https://openalex.org/W2028468530","https://openalex.org/W189401716","https://openalex.org/W2898570308"],"abstract_inverted_index":{"Time":[0],"synchronization":[1],"attacks":[2,29],"are":[3,31],"an":[4,49],"emerging":[5],"threat":[6],"to":[7,88],"many":[8],"future":[9],"smart":[10],"grid":[11],"applications,":[12],"their":[13],"mitigation":[14],"is":[15,57],"thus":[16],"of":[17,27,80,104,131],"utmost":[18],"importance.":[19],"In":[20],"this":[21],"paper":[22],"we":[23],"consider":[24],"the":[25,71,78,81,96,105,112,123,132,138],"problem":[26,47],"mitigating":[28],"that":[30,55,95],"undetectable":[32],"by":[33],"state-of-the-art":[34],"power":[35,121],"system":[36],"state":[37],"estimation,":[38],"in":[39],"precision":[40],"time":[41,64],"protocol":[42],"networks.":[43],"We":[44,59,76],"formulate":[45],"our":[46],"as":[48,135,137],"integer":[50],"linear":[51],"program":[52],"and":[53],"show":[54,94],"it":[56],"NP-hard.":[58],"then":[60],"provide":[61],"a":[62,68,89,101,128],"polynomial":[63],"approximation":[65,97,124],"algorithm":[66,83,98,114,125],"through":[67,84],"reduction":[69],"from":[70],"group":[72],"Steiner":[73],"tree":[74],"problem.":[75],"evaluate":[77],"performance":[79],"proposed":[82],"extensive":[85],"simulations":[86],"compared":[87],"greedy":[90,113,139],"heuristic.":[91,140],"Our":[92],"results":[93],"performs":[99,115,126],"within":[100,127],"factor":[102,129],"1.8":[103],"optimal":[106,133],"solution":[107],"for":[108],"synthetic":[109],"topologies,":[110],"while":[111],"even":[116],"better.":[117],"On":[118],"IEEE":[119],"benchmark":[120],"systems":[122],"1.1":[130],"solution,":[134],"good":[136]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}