{"id":"https://openalex.org/W2077533970","doi":"https://doi.org/10.1109/ciss.2015.7086428","title":"Node-based scheduling with provable evacuation time","display_name":"Node-based scheduling with provable evacuation time","publication_year":2015,"publication_date":"2015-03-01","ids":{"openalex":"https://openalex.org/W2077533970","doi":"https://doi.org/10.1109/ciss.2015.7086428","mag":"2077533970"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2015.7086428","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2015.7086428","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 49th Annual Conference on Information Sciences and Systems (CISS)","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/A5040279482","display_name":"Bo Ji","orcid":"https://orcid.org/0000-0003-0149-7509"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bo Ji","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University, Philadelphia, PA","Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, Philadelphia, PA","institution_ids":["https://openalex.org/I84392919"]},{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100600528","display_name":"Jie Wu","orcid":"https://orcid.org/0000-0002-3472-1717"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jie Wu","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University, Philadelphia, PA","Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, Philadelphia, PA","institution_ids":["https://openalex.org/I84392919"]},{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I84392919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040279482"],"corresponding_institution_ids":["https://openalex.org/I84392919"],"apc_list":null,"apc_paid":null,"fwci":0.9985,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79584153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"28","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994999766349792,"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.9994999766349792,"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.9994999766349792,"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.9987999796867371,"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.7882206439971924},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6736255884170532},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6015341281890869},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5703397393226624},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.536510705947876},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46890461444854736},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45722806453704834},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.45658037066459656},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44921281933784485},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4490906000137329},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.42199164628982544},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3808063864707947},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.36613789200782776},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33845752477645874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27018263936042786},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25050467252731323},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24511238932609558},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15322333574295044}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7882206439971924},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6736255884170532},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6015341281890869},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5703397393226624},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.536510705947876},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46890461444854736},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45722806453704834},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.45658037066459656},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44921281933784485},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4490906000137329},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.42199164628982544},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3808063864707947},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.36613789200782776},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33845752477645874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27018263936042786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25050467252731323},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24511238932609558},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15322333574295044},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ciss.2015.7086428","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2015.7086428","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 49th Annual Conference on Information Sciences and Systems (CISS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320312387","display_name":"Temple University","ror":"https://ror.org/00kx1jb78"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1523988562","https://openalex.org/W1588435862","https://openalex.org/W1984382275","https://openalex.org/W1999102639","https://openalex.org/W2022269624","https://openalex.org/W2059739072","https://openalex.org/W2075687394","https://openalex.org/W2098645185","https://openalex.org/W2102669784","https://openalex.org/W2103468752","https://openalex.org/W2105177639","https://openalex.org/W2106717724","https://openalex.org/W2119523111","https://openalex.org/W2123452111","https://openalex.org/W2123893388","https://openalex.org/W2133499361","https://openalex.org/W2138993731","https://openalex.org/W2140029748","https://openalex.org/W2153086189","https://openalex.org/W2156214642","https://openalex.org/W2159044866","https://openalex.org/W2330003519","https://openalex.org/W2519741652","https://openalex.org/W4245479004","https://openalex.org/W4251767568","https://openalex.org/W4297972233","https://openalex.org/W6631287619","https://openalex.org/W6726850709"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W2086365412"],"abstract_inverted_index":{"This":[0],"paper":[1,201],"studies":[2],"the":[3,20,27,32,39,46,54,77,80,94,99,108,140,148,152,161,164,182,247],"link":[4,112,153],"scheduling":[5,113,205,230],"problem":[6,50],"in":[7,98,166,199,246],"multihop":[8],"wireless":[9],"networks":[10],"without":[11],"future":[12],"packet":[13,115],"arrivals,":[14],"with":[15,34],"an":[16,121,167,188,236],"aim":[17],"of":[18,73,96,111,131,181],"minimizing":[19],"time":[21,49],"interval":[22],"needed":[23],"for":[24,107,114,238],"evacuating":[25],"all":[26,72,82],"existing":[28,183],"packets.":[29],"We":[30],"consider":[31],"scenario":[33],"single-hop":[35],"traffic":[36],"flows":[37],"under":[38],"one-hop":[40],"interference":[41],"model.":[42],"In":[43,227],"this":[44,200],"setting,":[45],"minimum":[47],"evacuation":[48],"is":[51,61,91,157,243],"equivalent":[52],"to":[53,135,159,171],"classic":[55],"multigraph":[56],"edge":[57],"coloring":[58,249],"problem,":[59],"which":[60,242],"generally":[62],"NP-hard.":[63],"Although":[64],"many":[65],"approximation":[66,189,215],"algorithms":[67,105,185,206,231],"have":[68,87],"been":[69],"studied,":[70],"almost":[71],"them":[74],"require":[75],"computing":[76],"schedules":[78,162],"(or":[79,163,192,221],"colors)":[81,165],"at":[83,176],"once,":[84],"and":[85,151,211],"thus":[86],"a":[88,128,144,177,208],"complexity":[89,124],"that":[90,197,213],"dependent":[92],"on":[93],"number":[95,130],"packets":[97,133],"network.":[100],"This,":[101],"however,":[102],"renders":[103],"these":[104,229],"unsuitable":[106],"considered":[109],"application":[110],"evacuation,":[116],"as":[117,235],"they":[118],"typically":[119],"incur":[120],"impractically":[122],"high":[123],"when":[125],"there":[126],"are":[127,217],"large":[129],"initial":[132],"waiting":[134],"be":[136],"transmitted,":[137],"even":[138],"if":[139],"underlying":[141],"network":[142],"has":[143],"small":[145],"size":[146],"(i.e.,":[147],"node":[149],"count":[150],"count).":[154],"Instead,":[155],"it":[156],"desirable":[158],"compute":[160,173],"online":[168,184],"fashion,":[169],"i.e.,":[170],"quickly":[172],"one":[174],"schedule":[175],"time.":[178],"Unfortunately,":[179],"none":[180],"can":[186,232],"guarantee":[187],"ratio":[190],"better":[191],"smaller)":[193],"than":[194,223],"2.":[195,226],"To":[196],"end,":[198],"we":[202],"suggest":[203],"two":[204],"using":[207],"node-based":[209],"approach,":[210],"prove":[212],"their":[214],"ratios":[216],"both":[218],"no":[219],"worse":[220],"greater)":[222],"3":[224],"over":[225],"addition,":[228],"also":[233],"serve":[234],"alternative":[237],"achieving":[239],"Shannon's":[240],"bound,":[241],"well":[244],"known":[245],"graph":[248],"literature.":[250]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}