{"id":"https://openalex.org/W2152500387","doi":"https://doi.org/10.1109/icc.2011.5962584","title":"A Distributed Algorithm for Multi-Constrained Anypath Routing in Wireless Mesh Networks","display_name":"A Distributed Algorithm for Multi-Constrained Anypath Routing in Wireless Mesh Networks","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2152500387","doi":"https://doi.org/10.1109/icc.2011.5962584","mag":"2152500387"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2011.5962584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5010754242","display_name":"Xi Fang","orcid":"https://orcid.org/0000-0002-3783-2041"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xi Fang","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048130147","display_name":"Dejun Yang","orcid":"https://orcid.org/0000-0002-1811-4423"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dejun Yang","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoliang Xue","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"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":1.0,"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.9994000196456909,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9977999925613403,"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.7615336179733276},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5379918217658997},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5360648036003113},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5098828077316284},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5064898729324341},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4857664406299591},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.45776987075805664},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4512360692024231},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.4329456090927124},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4263085424900055},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4223022162914276},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4220197796821594},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41909992694854736},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4129827618598938},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.28689825534820557},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.0784410834312439}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7615336179733276},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5379918217658997},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5360648036003113},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5098828077316284},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5064898729324341},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4857664406299591},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.45776987075805664},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4512360692024231},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.4329456090927124},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4263085424900055},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4223022162914276},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4220197796821594},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41909992694854736},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4129827618598938},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.28689825534820557},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0784410834312439},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2011.5962584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W595252221","https://openalex.org/W1547286500","https://openalex.org/W1597161197","https://openalex.org/W1974877378","https://openalex.org/W1994596462","https://openalex.org/W2030170468","https://openalex.org/W2041248965","https://openalex.org/W2042279109","https://openalex.org/W2059795389","https://openalex.org/W2061701207","https://openalex.org/W2074117023","https://openalex.org/W2086110500","https://openalex.org/W2096774592","https://openalex.org/W2101771805","https://openalex.org/W2104911317","https://openalex.org/W2107401636","https://openalex.org/W2115735708","https://openalex.org/W2127350146","https://openalex.org/W2127456145","https://openalex.org/W2127754642","https://openalex.org/W2141151352","https://openalex.org/W2160658249","https://openalex.org/W2170358592","https://openalex.org/W2610335499","https://openalex.org/W2752885492","https://openalex.org/W3142251790","https://openalex.org/W3145128584","https://openalex.org/W4236269498","https://openalex.org/W4247201255","https://openalex.org/W6685121600"],"related_works":["https://openalex.org/W757657516","https://openalex.org/W2539097916","https://openalex.org/W4377970799","https://openalex.org/W2944616377","https://openalex.org/W3127002380","https://openalex.org/W2889464401","https://openalex.org/W2607223747","https://openalex.org/W2559324914","https://openalex.org/W2361465121","https://openalex.org/W2102969916"],"abstract_inverted_index":{"Anypath":[0],"routing,":[1],"a":[2,53],"new":[3],"routing":[4,57],"paradigm,":[5],"has":[6,45],"been":[7,46],"proposed":[8],"to":[9,40,48],"improve":[10],"the":[11,18,25,33,88,94],"performance":[12],"of":[13,24,35],"wireless":[14,26],"networks":[15],"by":[16,87],"exploiting":[17],"spatial":[19],"diversity":[20],"and":[21,78],"broadcast":[22],"nature":[23],"medium.":[27],"In":[28],"this":[29],"paper,":[30],"we":[31],"study":[32],"problem":[34],"finding":[36],"an":[37],"anypath":[38],"subject":[39],"multiple":[41],"(K)":[42],"constraints,":[43],"which":[44,92],"proved":[47],"be":[49],"NP-hard.":[50],"We":[51],"present":[52],"polynomial":[54],"distributed":[55],"K-approximation":[56],"algorithm.":[58,68],"Our":[59],"algorithm":[60,74,91],"is":[61,75,81],"as":[62,64,82,84],"simple":[63],"Bellman-Ford's":[65],"shortest":[66],"path":[67],"Extensive":[69],"experiments":[70],"show":[71],"that":[72,85],"our":[73],"very":[76],"efficient":[77],"its":[79],"result":[80],"good":[83],"obtained":[86],"best":[89],"centralized":[90],"requires":[93],"global":[95],"information.":[96]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}