{"id":"https://openalex.org/W2126866049","doi":"https://doi.org/10.1109/infcom.2003.1208717","title":"Routing for network capacity maximization in energy-constrained ad-hoc networks","display_name":"Routing for network capacity maximization in energy-constrained ad-hoc networks","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W2126866049","doi":"https://doi.org/10.1109/infcom.2003.1208717","mag":"2126866049"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2003.1208717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2003.1208717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)","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/A5090686321","display_name":"Koushik Kar","orcid":"https://orcid.org/0000-0003-2506-672X"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Kar","raw_affiliation_strings":["ECSE Department, Rensselaer Polytechnic Institute, Troy, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECSE Department, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108507325","display_name":"Murali Kodialam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Murali Kodialam","raw_affiliation_strings":["Bell Laboratories, Lucent Technologies, Inc., Holmdel, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lucent Technologies, Inc., Holmdel, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079816803","display_name":"T. V. Lakshman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T.V. Lakshman","raw_affiliation_strings":["Bell Laboratories, Lucent Technologies, Inc., Holmdel, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lucent Technologies, Inc., Holmdel, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014892027","display_name":"Leandros Tassiulas","orcid":"https://orcid.org/0000-0003-0932-774X"},"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":"L. Tassiulas","raw_affiliation_strings":["ECE Department, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Department, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":218,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"673","last_page":"681"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","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/computer-science","display_name":"Computer science","score":0.8311094641685486},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6874898672103882},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.6116613149642944},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5409475564956665},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5358430743217468},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5311958193778992},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4601934254169464},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.4469171166419983},{"id":"https://openalex.org/keywords/mobile-ad-hoc-network","display_name":"Mobile ad hoc network","score":0.4326028823852539},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.41786131262779236},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.35576048493385315},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32372933626174927},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3235453963279724},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25779134035110474},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.176839679479599},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.11580350995063782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07571995258331299}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8311094641685486},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6874898672103882},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.6116613149642944},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5409475564956665},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5358430743217468},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5311958193778992},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4601934254169464},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.4469171166419983},{"id":"https://openalex.org/C91280400","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Mobile ad hoc network","level":3,"score":0.4326028823852539},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41786131262779236},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.35576048493385315},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32372933626174927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3235453963279724},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25779134035110474},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.176839679479599},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.11580350995063782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07571995258331299},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","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":2,"locations":[{"id":"doi:10.1109/infcom.2003.1208717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2003.1208717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.4901","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.4901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieee-infocom.org/2003/papers/17_01.PDF","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1581215653","https://openalex.org/W1787995280","https://openalex.org/W1992876548","https://openalex.org/W2006033216","https://openalex.org/W2011662871","https://openalex.org/W2041645394","https://openalex.org/W2050129755","https://openalex.org/W2096909875","https://openalex.org/W2142928312","https://openalex.org/W2170469173","https://openalex.org/W6634744199","https://openalex.org/W6638183917","https://openalex.org/W6648283419"],"related_works":["https://openalex.org/W3035283282","https://openalex.org/W2768875466","https://openalex.org/W1591014886","https://openalex.org/W1581687089","https://openalex.org/W2551975114","https://openalex.org/W2025838880","https://openalex.org/W2123281165","https://openalex.org/W2003275014","https://openalex.org/W2620689363","https://openalex.org/W4210799434"],"abstract_inverted_index":{"A":[0],"new":[1],"algorithm":[2,68,85,121,164],"for":[3,97,154],"routing":[4,18],"of":[5,26,58,66,73,76,119,129,185,188,195,201],"messages":[6,27,59],"in":[7,126],"ad-hoc":[8],"networks":[9],"where":[10],"the":[11,23,34,63,77,117,120,127,140,182,193],"nodes":[12],"are":[13],"energy-constrained":[14],"is":[15,20,60,69,122,172],"presented.":[16],"The":[17],"objective":[19],"to":[21,138,174,199],"maximize":[22],"total":[24],"number":[25],"that":[28,54,100,116,145],"can":[29],"be":[30],"successfully":[31],"sent":[32],"over":[33],"network":[35,160],"without":[36],"knowing":[37],"any":[38],"information":[39],"regarding":[40],"future":[41],"message":[42,45],"arrivals":[43],"or":[44],"generation":[46],"rates.":[47],"From":[48,107],"a":[49,71,87,108,166],"theoretical":[50,95],"perspective,":[51,110],"we":[52,111],"show":[53,112],"if":[55],"admission":[56,130,133],"control":[57,131,134],"permitted,":[61],"then":[62],"worst-case":[64],"performance":[65,118,183],"our":[67,84],"within":[70],"factor":[72],"O(log(network":[74],"size))":[75],"best":[78],"achievable":[79],"solution.":[80],"In":[81],"other":[82,155],"words,":[83],"achieves":[86],"logarithmic":[88],"competitive":[89,141],"ratio.":[90],"Our":[91,163],"approach":[92],"provides":[93],"sound":[94],"backing":[96],"several":[98],"observations":[99],"have":[101],"been":[102],"made":[103],"by":[104,113,180],"previous":[105],"researchers.":[106],"practical":[109],"extensive":[114],"simulations":[115,181],"very":[123],"good":[124],"even":[125],"absence":[128],"(the":[132],"being":[135],"necessary":[136],"only":[137],"prove":[139],"ratio":[142],"result),":[143],"and":[144,171,192],"it":[146],"also":[147,178],"performs":[148],"better":[149],"than":[150],"previously":[151],"proposed":[152],"algorithms":[153],"suggested":[156],"metrics":[157],"such":[158],"as":[159],"lifetime":[161],"maximization.":[162],"uses":[165],"single":[167],"shortest":[168],"path":[169],"computation,":[170],"amenable":[173],"efficient":[175],"implementation.":[176],"We":[177],"evaluate":[179],"impact":[184,194],"inexact":[186],"knowledge":[187],"residual":[189,202],"battery":[190],"energy,":[191],"energy":[196,203],"drain":[197],"due":[198],"dissemination":[200],"information.":[204]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":16}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}