{"id":"https://openalex.org/W1512717867","doi":"https://doi.org/10.1109/wimob.2005.1512883","title":"An efficient algorithm for the optimal number of route transitions in mobile ad hoc networks","display_name":"An efficient algorithm for the optimal number of route transitions in mobile ad hoc networks","publication_year":2006,"publication_date":"2006-10-04","ids":{"openalex":"https://openalex.org/W1512717867","doi":"https://doi.org/10.1109/wimob.2005.1512883","mag":"1512717867"},"language":"en","primary_location":{"id":"doi:10.1109/wimob.2005.1512883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wimob.2005.1512883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005.","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/A5022212660","display_name":"Natarajan Meghanathan","orcid":"https://orcid.org/0000-0001-8565-4086"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. Meghanathan","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, USA","Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, USA","institution_ids":[]},{"raw_affiliation_string":"Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009539372","display_name":"Andr\u00e1s Farag\u00f3","orcid":"https://orcid.org/0000-0001-8952-6946"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Farago","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, USA","Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, USA","institution_ids":[]},{"raw_affiliation_string":"Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"41","last_page":"48"},"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9973000288009644,"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.5878114104270935},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5668960809707642},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5660897493362427},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5049553513526917},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4982118606567383},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.49327796697616577},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.467376172542572},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4560000002384186},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.43973419070243835},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4232163727283478},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42180532217025757},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4214051067829132},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.41945961117744446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3814792037010193},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2535087764263153},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22742041945457458},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09600809216499329},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.08759793639183044}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5878114104270935},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5668960809707642},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5660897493362427},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5049553513526917},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4982118606567383},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49327796697616577},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.467376172542572},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4560000002384186},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.43973419070243835},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4232163727283478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42180532217025757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4214051067829132},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.41945961117744446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3814792037010193},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2535087764263153},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22742041945457458},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09600809216499329},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.08759793639183044},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wimob.2005.1512883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wimob.2005.1512883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005.","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":11,"referenced_works":["https://openalex.org/W1568911979","https://openalex.org/W1583326271","https://openalex.org/W1968560005","https://openalex.org/W1977439837","https://openalex.org/W2000548713","https://openalex.org/W2040228414","https://openalex.org/W2133794215","https://openalex.org/W2149357920","https://openalex.org/W2171911290","https://openalex.org/W6650655300","https://openalex.org/W6685225524"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857","https://openalex.org/W2521054645","https://openalex.org/W2113270940"],"abstract_inverted_index":{"We":[0,18,162,204,240,266,292],"address":[1],"the":[2,12,29,60,72,75,88,102,107,112,115,121,126,134,141,150,154,164,184,195,201,207,213,222,227,237,242,260,268,272,305,319],"issue":[3],"of":[4,8,14,33,74,80,95,104,114,123,129,136,143,166,197,215,249,259,271,300],"finding":[5],"a":[6,37,45,246,250,297],"sequence":[7,79],"stable":[9,84,89,228,252,311],"paths":[10,85],"using":[11],"knowledge":[13,128],"future":[15,130,157],"topology":[16,131,158],"changes.":[17],"present":[19],"an":[20,50,281],"efficient":[21,282],"polynomial":[22],"time":[23,56,135,151],"algorithm":[24,167],"called":[25,87],"OptTrans":[26,42,93,168],"to":[27,175,233,284],"determine":[28],"minimum":[30,223],"required":[31,54],"number":[32,103,196,214,299],"route":[34,137,198,216,322],"transitions":[35,199,217],"for":[36,120,152],"source-destination":[38],"(s-d)":[39],"session.":[40,77,117],"Algorithm":[41,92],"operates":[43],"on":[44,194],"simple":[46],"greedy":[47],"heuristic:":[48],"Whenever":[49],"s-d":[51,62,76,116,301],"path":[52,63,225,229,253,312],"is":[53,69,86,94,101,111,183,191],"at":[55,133,236],"instant":[57],"t,":[58],"choose":[59],"longest-living":[61],"since":[64],"t.":[65],"The":[66,78],"above":[67,303],"strategy":[68],"repeated":[70],"over":[71],"duration":[73,113],"such":[81],"longest":[82],"living":[83],"mobile":[90],"path.":[91],"O(n/sup":[96],"2/T)":[97],"complexity":[98],"where":[99,179],"n":[100],"nodes":[105],"in":[106,308],"network":[108],"and":[109,212,218,226,279],"T":[110],"To":[118],"account":[119],"possibility":[122],"not":[124,231],"knowing":[125],"complete":[127],"changes":[132,159],"selection,":[138],"we":[139],"introduce":[140],"notion":[142],"look-ahead":[144,185,261],"window":[145,186,262],"size":[146,187],"/spl":[147,171,176,180],"Delta/":[148,172],"as":[149],"which":[153,189,304],"information":[155],"about":[156],"are":[160,230],"known.":[161],"study":[163],"performance":[165],"by":[169,244,289],"varying":[170],"from":[173],"O":[174],"Delta//sub":[177,181],"max/,":[178],"max/":[182],"beyond":[188],"there":[190,295],"no":[192],"impact":[193],"or":[200],"hop":[202,210,224],"count.":[203],"also":[205],"identify":[206],"tradeoff":[208],"between":[209],"count":[211],"show":[219,293],"that":[220,256,294],"both":[221],"likely":[232],"be":[234,316],"obtainable":[235],"same":[238],"time.":[239],"conclude":[241],"paper":[243],"presenting":[245],"preliminary":[247],"design":[248],"proactive":[251,310],"routing":[254,313],"protocol":[255],"makes":[257],"use":[258],"concept":[263],"proposed":[264],"here.":[265],"explore":[267],"stochastic":[269],"properties":[270],"commonly":[273],"used":[274],"random-way":[275],"point":[276],"mobility":[277],"model":[278],"propose":[280],"technique":[283],"dissipate":[285],"location":[286],"update":[287],"broadcasts":[288],"each":[290],"node.":[291],"exist":[296],"critical":[298],"sessions":[302],"location-update":[306],"overhead":[307],"our":[309],"approach":[314],"would":[315],"less":[317],"than":[318],"broadcast-based":[320],"on-demand":[321],"discovery":[323],"overhead.":[324]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}