{"id":"https://openalex.org/W2138088216","doi":"https://doi.org/10.1145/1287853.1287870","title":"Adaptive network coding and scheduling for maximizing throughput in wireless networks","display_name":"Adaptive network coding and scheduling for maximizing throughput in wireless networks","publication_year":2007,"publication_date":"2007-09-09","ids":{"openalex":"https://openalex.org/W2138088216","doi":"https://doi.org/10.1145/1287853.1287870","mag":"2138088216"},"language":"en","primary_location":{"id":"doi:10.1145/1287853.1287870","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1287853.1287870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th annual ACM international conference on Mobile computing and networking","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/A5034853149","display_name":"Prasanna Chaporkar","orcid":"https://orcid.org/0000-0001-5082-0179"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Prasanna Chaporkar","raw_affiliation_strings":["IIT"],"affiliations":[{"raw_affiliation_string":"IIT","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025136069","display_name":"Alexandre Prouti\u00e8re","orcid":"https://orcid.org/0000-0002-4679-4673"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Alexandre Proutiere","raw_affiliation_strings":["Microsoft Research","Microsoft research#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft research#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034853149"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":22.2154,"has_fulltext":false,"cited_by_count":179,"citation_normalized_percentile":{"value":0.99552991,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"135","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9932000041007996,"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.9919999837875366,"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/linear-network-coding","display_name":"Linear network coding","score":0.8955727815628052},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8268681764602661},{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.7305444478988647},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6487596035003662},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5614571571350098},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5418800115585327},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.5273046493530273},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5224777460098267},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.48705461621284485},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4503074586391449},{"id":"https://openalex.org/keywords/link-adaptation","display_name":"Link adaptation","score":0.42619240283966064},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.41665780544281006},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.3571207523345947},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.2793375253677368},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.20412150025367737},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12164616584777832},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.113148033618927},{"id":"https://openalex.org/keywords/fading","display_name":"Fading","score":0.08574321866035461},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07349497079849243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07182693481445312}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8955727815628052},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8268681764602661},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.7305444478988647},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6487596035003662},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5614571571350098},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5418800115585327},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.5273046493530273},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5224777460098267},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.48705461621284485},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4503074586391449},{"id":"https://openalex.org/C138916503","wikidata":"https://www.wikidata.org/wiki/Q2714551","display_name":"Link adaptation","level":4,"score":0.42619240283966064},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.41665780544281006},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.3571207523345947},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2793375253677368},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.20412150025367737},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12164616584777832},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.113148033618927},{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.08574321866035461},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07349497079849243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07182693481445312},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1287853.1287870","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1287853.1287870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th annual ACM international conference on Mobile computing and networking","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.8071","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.8071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/users/Cambridge/aproutie/pub/mobicom-netcod.pdf.pdf","raw_type":"text"},{"id":"pmh:oai:dsapce.library.iitb.ac.in:100/2261","is_oa":false,"landing_page_url":"http://dspace.library.iitb.ac.in/xmlui/handle/10054/15895","pdf_url":null,"source":{"id":"https://openalex.org/S4306400899","display_name":"DSpace (IIT Bombay)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162827531","host_organization_name":"Indian Institute of Technology Bombay","host_organization_lineage":["https://openalex.org/I162827531"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"13th ACM International Conference on Mobile Computing and Networking,Montreal, CANADA,SEP 09-14, 2007","raw_type":"Proceedings Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W111868505","https://openalex.org/W1833312001","https://openalex.org/W2018994370","https://openalex.org/W2098232769","https://openalex.org/W2105177639","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2119805989","https://openalex.org/W2124107971","https://openalex.org/W2127904018","https://openalex.org/W2137775453","https://openalex.org/W2146742112","https://openalex.org/W2147214202","https://openalex.org/W2149769217","https://openalex.org/W2149863032","https://openalex.org/W2152652256","https://openalex.org/W2155062198","https://openalex.org/W2156214642","https://openalex.org/W2163634514","https://openalex.org/W2167652794","https://openalex.org/W2169704709","https://openalex.org/W4214714086","https://openalex.org/W4254068909"],"related_works":["https://openalex.org/W2794998165","https://openalex.org/W2962934782","https://openalex.org/W1982696243","https://openalex.org/W1997326586","https://openalex.org/W2138841883","https://openalex.org/W148846283","https://openalex.org/W2303790217","https://openalex.org/W2164280516","https://openalex.org/W1984617503","https://openalex.org/W4229782249"],"abstract_inverted_index":{"Recently,":[0],"network":[1,26,74,82,102,118,139],"coding":[2,27,83,119,140],"emerged":[3],"as":[4,31],"a":[5,109,143,151,162],"promising":[6],"technology":[7],"that":[8,52,64,88,167],"can":[9],"provide":[10,173],"significant":[11],"improvements":[12],"in":[13,49,70,147],"throughput":[14,99,175],"and":[15,40,43,115,120,129,149,170],"energy":[16],"efficiency":[17],"of":[18,36,55,58,168],"wireless":[19],"networks,":[20],"even":[21],"for":[22,80,96,126],"unicast":[23],"communication.":[24],"Often,":[25],"schemes":[28,46],"are":[29,47,60],"designed":[30,159],"an":[32],"autonomous":[33],"layer,":[34],"independent":[35],"the":[37,50,73,78,98],"underlying":[38],"Phy":[39,128],"MAC":[41,91,130],"capabilities":[42],"algorithms.Consequently,":[44],"these":[45],"greedy,":[48],"sense":[51],"all":[53],"opportunities":[54],"broadcasting":[56],"combinations":[57],"packets":[59],"exploited.":[61],"We":[62,85,132],"demonstrate":[63],"this":[65,105,134],"greedy":[66],"design":[67],"principle":[68],"may":[69],"fact":[71],"reduce":[72],"throughput.":[75],"This":[76],"begets":[77],"need":[79],"adaptive":[81,116],"schemes.":[84,122],"further":[86],"show":[87],"designing":[89],"appropriate":[90],"scheduling":[92,121],"algorithms":[93],"is":[94,124,158],"critical":[95],"achieving":[97],"gainsexpected":[100],"from":[101],"coding.":[103],"In":[104],"paper,":[106],"we":[107,154],"propose":[108],"general":[110],"framework":[111,135],"to":[112,136,160,172],"develop":[113],"optimal":[114],"joint":[117],"Optimality":[123],"shown":[125],"various":[127],"constraints.":[131],"apply":[133],"two":[137],"different":[138],"architectures:":[141],"COPE,":[142,169],"scheme":[144,153],"recently":[145],"proposed":[146],"[7],":[148],"XOR-Sym,":[150],"new":[152],"present":[155],"here.":[156],"XOR-Sym":[157],"achieve":[161],"lower":[163],"implementation":[164],"complexity":[165],"than":[166],"yet":[171],"similar":[174],"gains.":[176]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":24},{"year":2012,"cited_by_count":18}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}