{"id":"https://openalex.org/W2505315107","doi":"https://doi.org/10.1109/infocom.2016.7524516","title":"Interference-aware time-based fairness for multihop wireless networks","display_name":"Interference-aware time-based fairness for multihop wireless networks","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2505315107","doi":"https://doi.org/10.1109/infocom.2016.7524516","mag":"2505315107"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2016.7524516","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524516","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","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/A5003154570","display_name":"Douglas M. Blough","orcid":"https://orcid.org/0000-0002-0803-7647"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Douglas M. Blough","raw_affiliation_strings":["School of Electrical and Computer Engr, Georgia Institute of Technology, Atlanta, GA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engr, Georgia Institute of Technology, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081575220","display_name":"Giovanni Resta","orcid":"https://orcid.org/0000-0003-1315-2700"},"institutions":[{"id":"https://openalex.org/I4210130157","display_name":"Institute of Informatics and Telematics","ror":"https://ror.org/02gdcn153","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210130157","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giovanni Resta","raw_affiliation_strings":["Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, Pisa, Italy","institution_ids":["https://openalex.org/I4210130157"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021463856","display_name":"Paolo Santi","orcid":"https://orcid.org/0000-0002-8942-8702"},"institutions":[{"id":"https://openalex.org/I4210130157","display_name":"Institute of Informatics and Telematics","ror":"https://ror.org/02gdcn153","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210130157","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paolo Santi","raw_affiliation_strings":["IIT-CNR, Pisa, Italy","MIT Senseable City Lab, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"IIT-CNR, Pisa, Italy","institution_ids":["https://openalex.org/I4210130157"]},{"raw_affiliation_string":"MIT Senseable City Lab, Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003154570"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.2953,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64383997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11158","display_name":"Wireless Networks and Protocols","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/T11158","display_name":"Wireless Networks and Protocols","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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9995999932289124,"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/T10796","display_name":"Cooperative Communication and Network Coding","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"}}],"keywords":[{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.841137170791626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8327714800834656},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6890475749969482},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6768420934677124},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.6325313448905945},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.6076379418373108},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5570837259292603},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.5368189811706543},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5363954305648804},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.47214630246162415},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.4636560380458832},{"id":"https://openalex.org/keywords/max-min-fairness","display_name":"Max-min fairness","score":0.43340083956718445},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2577348053455353},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.22046077251434326},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.2012159824371338},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.1436312198638916},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.12685257196426392},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10904210805892944},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.10865086317062378}],"concepts":[{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.841137170791626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8327714800834656},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6890475749969482},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6768420934677124},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.6325313448905945},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.6076379418373108},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5570837259292603},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.5368189811706543},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5363954305648804},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.47214630246162415},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.4636560380458832},{"id":"https://openalex.org/C177972170","wikidata":"https://www.wikidata.org/wiki/Q17097315","display_name":"Max-min fairness","level":3,"score":0.43340083956718445},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2577348053455353},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.22046077251434326},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2012159824371338},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.1436312198638916},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.12685257196426392},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10904210805892944},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.10865086317062378},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2016.7524516","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524516","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","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":20,"referenced_works":["https://openalex.org/W1489058467","https://openalex.org/W1500148551","https://openalex.org/W1969342263","https://openalex.org/W1970103089","https://openalex.org/W1981996334","https://openalex.org/W2039844927","https://openalex.org/W2051494969","https://openalex.org/W2064187378","https://openalex.org/W2069975285","https://openalex.org/W2110125288","https://openalex.org/W2113966777","https://openalex.org/W2117915154","https://openalex.org/W2132791560","https://openalex.org/W2140297044","https://openalex.org/W2141170258","https://openalex.org/W2149213581","https://openalex.org/W2156048811","https://openalex.org/W2161132858","https://openalex.org/W6629383947","https://openalex.org/W6629769278"],"related_works":["https://openalex.org/W1999684000","https://openalex.org/W1605983382","https://openalex.org/W2132850534","https://openalex.org/W2402400303","https://openalex.org/W2138888940","https://openalex.org/W2369668848","https://openalex.org/W2320592338","https://openalex.org/W3006570067","https://openalex.org/W2136681811","https://openalex.org/W2165715302"],"abstract_inverted_index":{"We":[0,42,150],"consider":[1],"the":[2,24,44,65,78,106,117,132,172,194],"problem":[3],"of":[4,48,171,197],"maximizing":[5],"performance":[6],"in":[7,28,77,141],"multihop":[8,39,52,142],"wireless":[9,30,40,143],"networks":[10,53,144],"while":[11,204],"achieving":[12,87,137,205],"fairness":[13,18,26,50,68,209],"among":[14,123],"flows.":[15],"While":[16],"time-based":[17,49,67,178],"has":[19,35],"been":[20,36],"widely":[21],"recognized":[22],"as":[23,190,192],"appropriate":[25,98,156],"mechanism":[27],"single-hop":[29,61,66],"networks,":[31],"no":[32],"analogous":[33],"notion":[34,47],"developed":[37],"for":[38,51,74,86,110,136],"networks.":[41],"define":[43],"first":[45,133],"general":[46],"by":[54],"abstracting":[55],"a":[56,59,83,168,198,206],"network":[57,62],"into":[58],"virtual":[60],"and":[63,80,116],"applying":[64],"notion.":[69],"This":[70],"produces":[71,161],"rate":[72,89,108,119,139,164,175,196],"shares":[73,90,109,140],"each":[75],"flow":[76],"network,":[79],"we":[81,181],"develop":[82],"constructive":[84,134],"method":[85],"these":[88],"through":[91],"physical-interference-aware":[92],"scheduling.":[93],"When":[94],"combined":[95],"with":[96,113,145,154],"an":[97,155,162],"link":[99],"transmission":[100],"policy,":[101],"this":[102,130,159],"scheduling":[103,157],"approach":[104,135,160,189],"preserves":[105],"time-based-fair":[107],"flows":[111],"even":[112],"spatial":[114],"reuse":[115],"resulting":[118],"reductions":[120],"that":[121,165,187,200],"occur":[122],"concurrent":[124],"links.":[125],"To":[126],"our":[127,188],"best":[128],"knowledge,":[129],"is":[131,166],"fair":[138],"or":[146],"without":[147],"interference":[148],"consideration.":[149],"also":[151],"prove":[152],"that,":[153],"algorithm,":[158],"aggregate":[163,174,195],"within":[167],"constant":[169],"factor":[170],"maximum":[173],"subject":[176],"to":[177],"fairness.":[179],"Finally,":[180],"perform":[182],"extensive":[183],"simulations,":[184],"which":[185],"show":[186],"much":[191],"doubles":[193],"solution":[199],"approximates":[201],"max-min":[202],"fairness,":[203],"more":[207],"natural":[208],"property.":[210]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-16T15:07:20.185449","created_date":"2025-10-10T00:00:00"}