{"id":"https://openalex.org/W2109673948","doi":"https://doi.org/10.1109/icccn.2007.4317924","title":"A Network-flow based Integral Optimal Algorithm for Lexicographic Maximum Lifetime Routing in Wireless Sensor Networks","display_name":"A Network-flow based Integral Optimal Algorithm for Lexicographic Maximum Lifetime Routing in Wireless Sensor Networks","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2109673948","doi":"https://doi.org/10.1109/icccn.2007.4317924","mag":"2109673948"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2007.4317924","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th International Conference on Computer Communications and Networks","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/A5114031962","display_name":"Maulin Patel","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maulin Patel","raw_affiliation_strings":["Erik Jonsson School of Engineering and Computer Science, University of Texas, Dallas, Richardson, TX, USA","Univ. of Texas at Dallas, Richardson"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Erik Jonsson School of Engineering and Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Univ. of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002390750","display_name":"S. Venkatesan","orcid":"https://orcid.org/0000-0002-1367-0420"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Venkatesan","raw_affiliation_strings":["Erik Jonsson School of Engineering and Computer Science, University of Texas, Dallas, Richardson, TX, USA","Univ. of Texas at Dallas, Richardson"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Erik Jonsson School of Engineering and Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Univ. of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101650264","display_name":"R. Chandrasekaran","orcid":"https://orcid.org/0000-0002-4665-7847"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Chandrasekaran","raw_affiliation_strings":["Erik Jonsson School of Engineering and Computer Science, University of Texas, Dallas, Richardson, TX, USA","Univ. of Texas at Dallas, Richardson"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Erik Jonsson School of Engineering and Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Univ. of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3369,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.67344257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"850","last_page":"855"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor 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/T10080","display_name":"Energy Efficient Wireless Sensor 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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9993000030517578,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.6803176403045654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6740642786026001},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5510726571083069},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.5486092567443848},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4773067235946655},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46851587295532227},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.450417697429657},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3438865542411804},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3311932384967804},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31229156255722046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22006487846374512}],"concepts":[{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.6803176403045654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6740642786026001},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5510726571083069},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.5486092567443848},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4773067235946655},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46851587295532227},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.450417697429657},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3438865542411804},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3311932384967804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31229156255722046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22006487846374512},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2007.4317924","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th International Conference on Computer Communications and Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2040423259","https://openalex.org/W2062286747","https://openalex.org/W2078625610","https://openalex.org/W2108777122","https://openalex.org/W2111072230","https://openalex.org/W2132895032","https://openalex.org/W2135536356","https://openalex.org/W2156036190","https://openalex.org/W2338905098","https://openalex.org/W3123221209","https://openalex.org/W4253866995"],"related_works":["https://openalex.org/W1993634787","https://openalex.org/W3125614403","https://openalex.org/W2476923378","https://openalex.org/W2803221307","https://openalex.org/W2951826204","https://openalex.org/W4211001408","https://openalex.org/W2903963821","https://openalex.org/W2366147410","https://openalex.org/W62366039","https://openalex.org/W239928435"],"abstract_inverted_index":{"Longevity":[0],"is":[1,24,29,65,107,204,234,263],"one":[2],"the":[3,8,18,22,38,53,68,71,83,87,91,98,102,115,119,125,129,167,200,212,256],"key":[4],"design":[5,32],"goals":[6],"in":[7,21,196],"wireless":[9],"sensor":[10,19,75,95,159],"networks.":[11],"In":[12,144,218],"many":[13],"applications,":[14],"longevity":[15],"of":[16,41,62,74,94,105,122,134,227,240],"all":[17,82],"nodes":[20,42,76,96,106,123,135,160],"network":[23,33],"equally":[25],"important.":[26],"Therefore,":[27],"it":[28],"imperative":[30],"to":[31,66,174,270],"protocols":[34],"that":[35,157],"would":[36],"keep":[37],"maximum":[39,55],"number":[40,257],"alive":[43],"for":[44,90,101,118,128,207],"longest":[45],"possible":[46,140],"duration.":[47],"Towards":[48],"this":[49,219],"goal":[50],"we":[51,154,190,221],"study":[52],"lexicographic":[54],"lifetime":[56],"(Lex-max-life)":[57],"routing":[58,64,169,232],"scheme.":[59],"The":[60,230],"objective":[61],"Lex-max-life":[63,168,231],"maximize":[67,86,114],"time":[69,89,100,117,251],"until":[70],"lirst":[72],"set":[73,93,104,121,133],"deplete":[77],"their":[78],"battery":[79],"energies":[80],"(among":[81],"nodes),":[84],"then":[85,113,166],"depletion":[88,99,116,126],"second":[92,132],"if":[97,124,158],"first":[103,130],"as":[108,110,137,139],"long":[109,138],"possible,":[111],"and":[112,131,141,253,268],"third":[120],"times":[127],"are":[136,161],"so":[142],"on.":[143],"our":[145],"previous":[146],"work":[147],"by":[148,236],"M.":[149],"Patel":[150],"et":[151],"al.":[152],"(2006),":[153],"have":[155],"shown":[156],"equipped":[162],"with":[163],"non-adaptive":[164],"transmitters":[165],"problem":[170,182,209,233],"can":[171],"be":[172],"reduced":[173],"a":[175,179,184,223,237],"min-cost":[176,241],"flow":[177,181,242,245],"or":[178,243],"convex-cost":[180,244],"using":[183],"novel":[185,224],"cost":[186,201,213],"scaling":[187,202],"technique.":[188],"Hence,":[189],"obtain":[191],"an":[192],"integral":[193],"optimal":[194],"solution":[195],"polynomial":[197],"time.":[198],"However,":[199],"technique":[203],"not":[205],"suitable":[206],"large":[208],"instances":[210],"because":[211],"numbers":[214],"grow":[215],"very":[216,265],"fast.":[217],"paper,":[220],"propose":[222],"vectorial":[225,238],"representation":[226],"link":[228],"costs.":[229],"solved":[235],"version":[239],"algorithm":[246,262],"which":[247],"(i)":[248],"Improves":[249],"running":[250],"complexity":[252],"(ii)":[254],"Circumvents":[255],"explosion":[258],"phenomenon.":[259],"Thus,":[260],"developed":[261],"computationally":[264],"efficient,":[266],"scalable":[267],"easy":[269],"implement.":[271]},"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}