{"id":"https://openalex.org/W2068910591","doi":"https://doi.org/10.1145/1288107.1288130","title":"Maximum-lifetime routing","display_name":"Maximum-lifetime routing","publication_year":2007,"publication_date":"2007-09-09","ids":{"openalex":"https://openalex.org/W2068910591","doi":"https://doi.org/10.1145/1288107.1288130","mag":"2068910591"},"language":"en","primary_location":{"id":"doi:10.1145/1288107.1288130","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1288107.1288130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing","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/A5070677186","display_name":"Liane Lewin-Eytan","orcid":"https://orcid.org/0009-0002-4027-0083"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Liane Lewin-Eytan","raw_affiliation_strings":["Technion-Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["Technion-Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029763349","display_name":"Ariel Orda","orcid":"https://orcid.org/0000-0001-5561-6599"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ariel Orda","raw_affiliation_strings":["Technion-Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070677186"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.9626,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78276901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"160","last_page":"169"},"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.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/T11158","display_name":"Wireless Networks and Protocols","score":0.9995999932289124,"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.7046647071838379},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.6233593821525574},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5678706169128418},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5484994649887085},{"id":"https://openalex.org/keywords/anycast","display_name":"Anycast","score":0.46908584237098694},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.46668586134910583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4599520266056061},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.4505307674407959},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44767722487449646},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.4340004622936249},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4191981256008148},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.40162843465805054},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.3860986530780792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22128349542617798},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21738022565841675}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7046647071838379},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.6233593821525574},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5678706169128418},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5484994649887085},{"id":"https://openalex.org/C122005561","wikidata":"https://www.wikidata.org/wiki/Q613897","display_name":"Anycast","level":3,"score":0.46908584237098694},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.46668586134910583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4599520266056061},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.4505307674407959},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44767722487449646},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.4340004622936249},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4191981256008148},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.40162843465805054},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.3860986530780792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22128349542617798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21738022565841675},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1288107.1288130","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1288107.1288130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing","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":32,"referenced_works":["https://openalex.org/W170375476","https://openalex.org/W1522456302","https://openalex.org/W1526250527","https://openalex.org/W1932318776","https://openalex.org/W1967009389","https://openalex.org/W1975352161","https://openalex.org/W1989259681","https://openalex.org/W2011039300","https://openalex.org/W2029917975","https://openalex.org/W2035069154","https://openalex.org/W2045028348","https://openalex.org/W2062560222","https://openalex.org/W2066700938","https://openalex.org/W2083556259","https://openalex.org/W2092910894","https://openalex.org/W2103955286","https://openalex.org/W2106306378","https://openalex.org/W2106335692","https://openalex.org/W2107819530","https://openalex.org/W2115373791","https://openalex.org/W2116682091","https://openalex.org/W2122426592","https://openalex.org/W2125537511","https://openalex.org/W2132895032","https://openalex.org/W2135782021","https://openalex.org/W2142996770","https://openalex.org/W2159158762","https://openalex.org/W2167101557","https://openalex.org/W2170469173","https://openalex.org/W2803888831","https://openalex.org/W3022321359","https://openalex.org/W3151647019"],"related_works":["https://openalex.org/W2095197485","https://openalex.org/W2386030671","https://openalex.org/W2535302635","https://openalex.org/W2131810725","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"Routing":[0],"traffic":[1],"so":[2],"as":[3,36,38],"to":[4,28,31,58,250],"maximize":[5],"the":[6,47,74,92,110,120,126,131,135,142,157,183,202,212,216,221,234,244,255,263,266,269,276,283,290,299,304,320,327],"lifetime":[7,121],"of":[8,34,54,106,119,134,185,218,223,285,301],"a":[9,12,20,25,32,52,66,84,97,173,179,251],"transmission":[10,75,93,187,192],"is":[11,51,76,94,168,272,287,308,310],"major":[13],"problem":[14],"in":[15,125,152],"wireless":[16],"networks.":[17],"We":[18,63],"address":[19],"two-way":[21],"multicast":[22],"problem,":[23,49,123,204],"where":[24,70,88,215,303],"root":[26],"wishes":[27],"transmit":[29],"data":[30,40],"subset":[33,53],"nodes,":[35,225],"well":[37],"receive":[39],"from":[41],"them.":[42],"In":[43,109],"addition,":[44],"we":[45,113,129,161,171,195,232,259,280,293],"consider":[46,64,233],"anycast":[48],"wherethere":[50],"nodes":[55,80],"that":[56,163,177,241,261,282,295],"wish":[57],"communicate":[59],"with":[60],"each":[61,72,90,230],"other.":[62],"both":[65,101,297],"per-hop":[67,85,143,158,256,277],"multi-recipients":[68,144,257],"environment,":[69,87,145,160,231,258,279],"over":[71,89],"hop,":[73],"received":[77,95],"by":[78,96,242],"all":[79,224],"within":[81],"range,":[82],"and":[83,205,239],"single-recipient":[86,159,278],"hop":[91],"single":[98],"recipient.":[99],"For":[100,190,254,275],"environments,":[102,298],"our":[103],"work":[104],"consists":[105],"two":[107],"parts.":[108],"first":[111,138],"part":[112,128],"focus":[114],"on":[115,326],"system":[116],"optimization":[117],"perspectives":[118],"maximization":[122],"while":[124],"second":[127],"investigate":[130],"game-theoretic":[132],"perspective":[133],"respective":[136],"problems.We":[137],"note":[139],"that,":[140],"for":[141,156,182,201,211,296],"an":[146,165,197,206],"optimal":[147,166,313],"solution":[148,167,181],"can":[149,316,323],"be":[150,317,324],"computed":[151],"polynomial":[153,174],"time.":[154],"Nevertheless,":[155],"observe":[162],"computing":[164],"NP-hard.":[169],"Accordingly,":[170],"provide":[172,196],"time":[175],"algorithm":[176,200,210],"finds":[178],"2-approximate":[180],"case":[184,214],"uniform":[186],"power":[188,193],"levels.":[189],"different":[191],"levels,":[194],"O(log2n)":[198],"approximation":[199,209],"general":[203],"O(log":[207],"n)":[208],"special":[213],"set":[217,222],"terminals":[219],"equals":[220,228],"whose":[226],"size":[227],"n.For":[229],"corresponding":[235],"noncooperative":[236],"game":[237,246,267],"scenario,":[238],"prove":[240],"following":[243],"natural":[245],"course":[247],"users":[248],"converge":[249],"Nash":[252,270,306],"equilibrium.":[253],"show":[260,281,294],"if":[262,319],"players":[264],"join":[265],"sequentially,":[268],"equilibrium":[271,307],"(networkwide)":[273,314],"optimal.":[274],"price":[284,300],"anarchy":[286],"unbounded.":[288],"On":[289],"other":[291],"hand,":[292],"stability,":[302],"best":[305],"considered,":[309],"1;":[311],"hence,":[312],"performance":[315],"achieved":[318],"initial":[321],"configuration":[322],"imposed":[325],"players.":[328]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}