{"id":"https://openalex.org/W2139889325","doi":"https://doi.org/10.1109/.2006.1629410","title":"Energy-Efficient Cooperative Routing in Multi-hop Wireless Ad Hoc Networks","display_name":"Energy-Efficient Cooperative Routing in Multi-hop Wireless Ad Hoc Networks","publication_year":2006,"publication_date":"2006-05-25","ids":{"openalex":"https://openalex.org/W2139889325","doi":"https://doi.org/10.1109/.2006.1629410","mag":"2139889325"},"language":"en","primary_location":{"id":"doi:10.1109/.2006.1629410","is_oa":false,"landing_page_url":"https://doi.org/10.1109/.2006.1629410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Performance Computing and Communications Conference","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/A5085268065","display_name":"Fulu Li","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fulu Li","raw_affiliation_strings":["The Media Laboratory, MIT, Cambridge, MA, USA","Media Lab., MIT, Cambridge, MA, , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Media Laboratory, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"Media Lab., MIT, Cambridge, MA, , USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100641549","display_name":"Kui Wu","orcid":"https://orcid.org/0000-0002-2069-0032"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kui Wu","raw_affiliation_strings":["Department of Computer Sci., University of Victoria, Canada","Department of Computer Science University of Victoria, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sci., University of Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"Department of Computer Science University of Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113714609","display_name":"Andrew Lippman","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Lippman","raw_affiliation_strings":["The Media Laboratory, MIT, Cambridge, MA, USA","[The Media Laboratory, MIT, Cambridge, MA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Media Laboratory, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"[The Media Laboratory, MIT, Cambridge, MA, USA]","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085268065"],"corresponding_institution_ids":["https://openalex.org/I4210122954","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":6.9352,"has_fulltext":false,"cited_by_count":93,"citation_normalized_percentile":{"value":0.97092034,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"215","last_page":"222"},"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":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/T11158","display_name":"Wireless Networks and Protocols","score":0.9991999864578247,"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.8010593056678772},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7202842831611633},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6243548393249512},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5657357573509216},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.5495287179946899},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5191563963890076},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5167914628982544},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.5089471340179443},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4407818913459778},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.4357329308986664},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.42001914978027344},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4165147840976715},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.36227092146873474},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3318520188331604},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1141766607761383},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10847911238670349}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8010593056678772},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7202842831611633},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6243548393249512},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5657357573509216},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.5495287179946899},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5191563963890076},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5167914628982544},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.5089471340179443},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4407818913459778},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.4357329308986664},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.42001914978027344},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4165147840976715},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.36227092146873474},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3318520188331604},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1141766607761383},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10847911238670349},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/.2006.1629410","is_oa":false,"landing_page_url":"https://doi.org/10.1109/.2006.1629410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Performance Computing and Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8899999856948853,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1525672794","https://openalex.org/W1971916396","https://openalex.org/W2011039300","https://openalex.org/W2051670670","https://openalex.org/W2065088444","https://openalex.org/W2081959234","https://openalex.org/W2083556259","https://openalex.org/W2096827091","https://openalex.org/W2103955286","https://openalex.org/W2113613181","https://openalex.org/W2129691081","https://openalex.org/W2132529528","https://openalex.org/W2137775453","https://openalex.org/W2141033252","https://openalex.org/W2148570604","https://openalex.org/W2152619617","https://openalex.org/W2170469173","https://openalex.org/W2476096155","https://openalex.org/W3145128584","https://openalex.org/W3152133380","https://openalex.org/W4233225156","https://openalex.org/W4255426758","https://openalex.org/W4285719527","https://openalex.org/W6679828649","https://openalex.org/W6681429823","https://openalex.org/W6682828411","https://openalex.org/W7011593532"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"We":[0,15,51],"study":[1],"the":[2,18,33,37,62,66,72,77,89,109],"routing":[3,24],"problem":[4],"for":[5],"multi-hop":[6],"wireless":[7],"ad":[8],"hoc":[9],"networks":[10],"based":[11],"on":[12],"cooperative":[13,21,28,55,73],"transmission.":[14],"prove":[16],"that":[17,60,83,108],"minimum":[19,38],"energy":[20,39,95],"path":[22,57,102],"(MECP)":[23],"problem,":[25],"i.e.,":[26],"using":[27],"radio":[29],"transmission":[30,74],"to":[31,45,98],"find":[32],"best":[34],"route":[35],"with":[36,84,118],"cost":[40],"from":[41],"a":[42,46,54],"source":[43],"node":[44],"destination":[47],"node,":[48],"is":[49,107],"NP-complete.":[50],"thus":[52],"propose":[53],"shortest":[56,101],"(CSP)":[58],"algorithm":[59,64,111],"uses":[61],"Dijkstra's":[63],"as":[65],"basic":[67],"building":[68],"block":[69],"and":[70],"reflects":[71],"properties":[75],"in":[76,88],"relaxation":[78],"procedure.":[79],"Simulation":[80],"results":[81],"show":[82],"more":[85,94],"nodes":[86,117],"added":[87],"network,":[90],"our":[91],"approach":[92],"achieves":[93,112],"saving":[96],"compared":[97],"traditional":[99],"non-cooperative":[100],"algorithms.":[103],"Another":[104],"interesting":[105],"observation":[106],"proposed":[110],"better":[113],"fairness":[114],"among":[115],"different":[116],"denser":[119],"networks.":[120],"Implementation":[121],"issues":[122],"are":[123],"also":[124],"discussed":[125]},"counts_by_year":[{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":12}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}