{"id":"https://openalex.org/W2131881003","doi":"https://doi.org/10.1109/isit.2005.1523668","title":"Crosslayer design for distributed MAC and network coding in wireless ad hoc networks","display_name":"Crosslayer design for distributed MAC and network coding in wireless ad hoc networks","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2131881003","doi":"https://doi.org/10.1109/isit.2005.1523668","mag":"2131881003"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5089570143","display_name":"Yalin E. Sagduyu","orcid":"https://orcid.org/0000-0003-1576-5527"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y.E. Sagduyu","raw_affiliation_strings":["Electrical and Computer Engineering Department and Institute for Systems Research, University of Maryland, College Park, MD, USA","Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department and Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008039780","display_name":"Anthony Ephremides","orcid":"https://orcid.org/0000-0003-0172-8944"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Ephremides","raw_affiliation_strings":["Electrical and Computer Engineering Department and Institute for Systems Research, University of Maryland, College Park, MD, USA","Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department and Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089570143"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":4.4123,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.95105619,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1863","last_page":"1867"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9743000268936157,"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.9609000086784363,"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-network","display_name":"Computer network","score":0.8110527396202087},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8021115064620972},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.7533414363861084},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.7412370443344116},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.6767423748970032},{"id":"https://openalex.org/keywords/wireless-wan","display_name":"Wireless WAN","score":0.5900522470474243},{"id":"https://openalex.org/keywords/multiple-access-with-collision-avoidance-for-wireless","display_name":"Multiple Access with Collision Avoidance for Wireless","score":0.4779217839241028},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.47786587476730347},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4766976535320282},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.45593446493148804},{"id":"https://openalex.org/keywords/wireless-mesh-network","display_name":"Wireless mesh network","score":0.45422863960266113},{"id":"https://openalex.org/keywords/stochastic-geometry-models-of-wireless-networks","display_name":"Stochastic geometry models of wireless networks","score":0.44146114587783813},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.4325104355812073},{"id":"https://openalex.org/keywords/service-set","display_name":"Service set","score":0.42411336302757263},{"id":"https://openalex.org/keywords/mobile-ad-hoc-network","display_name":"Mobile ad hoc network","score":0.4216215908527374},{"id":"https://openalex.org/keywords/key-distribution-in-wireless-sensor-networks","display_name":"Key distribution in wireless sensor networks","score":0.3919699192047119},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.2571166157722473},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19728824496269226},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10389438271522522},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.09492245316505432},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.08881261944770813},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08374136686325073}],"concepts":[{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.8110527396202087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8021115064620972},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.7533414363861084},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.7412370443344116},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.6767423748970032},{"id":"https://openalex.org/C87379069","wikidata":"https://www.wikidata.org/wiki/Q938054","display_name":"Wireless WAN","level":5,"score":0.5900522470474243},{"id":"https://openalex.org/C156643399","wikidata":"https://www.wikidata.org/wiki/Q15995329","display_name":"Multiple Access with Collision Avoidance for Wireless","level":5,"score":0.4779217839241028},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.47786587476730347},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4766976535320282},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.45593446493148804},{"id":"https://openalex.org/C31548570","wikidata":"https://www.wikidata.org/wiki/Q6453712","display_name":"Wireless mesh network","level":4,"score":0.45422863960266113},{"id":"https://openalex.org/C27819379","wikidata":"https://www.wikidata.org/wiki/Q17166031","display_name":"Stochastic geometry models of wireless networks","level":5,"score":0.44146114587783813},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.4325104355812073},{"id":"https://openalex.org/C31910662","wikidata":"https://www.wikidata.org/wiki/Q1043562","display_name":"Service set","level":5,"score":0.42411336302757263},{"id":"https://openalex.org/C91280400","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Mobile ad hoc network","level":3,"score":0.4216215908527374},{"id":"https://openalex.org/C41971633","wikidata":"https://www.wikidata.org/wiki/Q6398155","display_name":"Key distribution in wireless sensor networks","level":4,"score":0.3919699192047119},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.2571166157722473},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19728824496269226},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10389438271522522},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.09492245316505432},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.08881261944770813},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08374136686325073}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8700000047683716,"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":11,"referenced_works":["https://openalex.org/W132104731","https://openalex.org/W1991982486","https://openalex.org/W2090164156","https://openalex.org/W2103182676","https://openalex.org/W2105831729","https://openalex.org/W2115791687","https://openalex.org/W2126707445","https://openalex.org/W2130350209","https://openalex.org/W2164446822","https://openalex.org/W4285719527","https://openalex.org/W6605389123"],"related_works":["https://openalex.org/W3206458211","https://openalex.org/W2368526973","https://openalex.org/W2355352889","https://openalex.org/W2067864308","https://openalex.org/W2379549849","https://openalex.org/W2392261800","https://openalex.org/W2391163222","https://openalex.org/W2769559298","https://openalex.org/W2372438076","https://openalex.org/W2776507963"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,79,134,189],"address":[4],"the":[5,70,74,111,118,166,173,182],"joint":[6,140],"design":[7],"and":[8,16,42,48,110,144,161],"distributed":[9,149],"implementation":[10],"of":[11,61,90,139,185],"medium":[12],"access":[13],"control":[14],"(MAC)":[15],"network":[17,29,55,63,84,92,100,112,131,142,169,175,191],"coding":[18,64,85,143,192],"in":[19],"wireless":[20,28,54,91,99,130,141,157,174],"ad":[21],"hoc":[22],"networks.":[23],"We":[24,37],"consider":[25],"a":[26,58,87,106,148],"slotted":[27],"with":[30,65,73,94,147,195],"links":[31],"modeled":[32],"as":[33,122],"classical":[34],"collision":[35],"channels.":[36],"assume":[38],"omnidirectional":[39],"packet":[40],"transmissions":[41],"do":[43],"not":[44],"allow":[45],"simultaneous":[46],"transmission":[47,96,186],"reception":[49],"by":[50],"any":[51],"node.":[52],"These":[53],"properties":[56],"demand":[57],"new":[59],"formulation":[60],"time-varying":[62],"additional":[66],"constraints":[67],"that":[68,177],"reflect":[69],"strong":[71],"interactions":[72],"underlying":[75],"MAC":[76,198],"operation.":[77],"First,":[78],"outline":[80],"how":[81],"to":[82,116,171,181,193],"construct":[83],"over":[86],"predetermined":[88],"set":[89],"realizations":[93,101],"conflict-free":[95,183],"schedules.":[97,187],"The":[98,151],"are":[102,114,178],"separately":[103],"activated":[104],"using":[105],"time":[107],"division":[108],"mechanism":[109],"flows":[113],"chosen":[115],"optimize":[117],"performance":[119],"measures":[120],"(such":[121],"stable":[123],"throughput":[124],"or":[125],"average":[126],"energy":[127],"costs)":[128],"through":[129],"coding.":[132],"Next,":[133],"follow":[135],"an":[136],"alternative":[137],"approach":[138],"link":[145],"scheduling":[146],"implementation.":[150],"analysis":[152],"is":[153],"based":[154],"on":[155,165],"decomposing":[156],"networks":[158],"into":[159],"subtrees":[160],"applying":[162],"graph":[163],"coloring":[164],"simplified":[167],"subtree":[168],"representations":[170],"derive":[172],"codes":[176],"further":[179],"converted":[180],"sets":[184],"Finally,":[188],"extend":[190],"operate":[194],"arbitrary":[196],"single-receiver":[197],"protocols":[199],"within":[200],"each":[201],"receiver's":[202],"area":[203]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}