{"id":"https://openalex.org/W2537061795","doi":"https://doi.org/10.1109/mahss.2004.1392187","title":"Reliable routing in mobile ad hoc networks based on mobility prediction","display_name":"Reliable routing in mobile ad hoc networks based on mobility prediction","publication_year":2005,"publication_date":"2005-02-22","ids":{"openalex":"https://openalex.org/W2537061795","doi":"https://doi.org/10.1109/mahss.2004.1392187","mag":"2537061795"},"language":"en","primary_location":{"id":"doi:10.1109/mahss.2004.1392187","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mahss.2004.1392187","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","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/A5039176528","display_name":"Jian Tang","orcid":"https://orcid.org/0000-0003-4418-0114"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jian Tang","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoliang Xue","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100718232","display_name":"Weiyi Zhang","orcid":"https://orcid.org/0000-0002-7953-9644"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weiyi Zhang","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":3.3348,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.93869302,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"466","last_page":"474"},"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.9994999766349792,"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.9972000122070312,"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.7491137385368347},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5740874409675598},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5433592796325684},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5330694317817688},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5290580987930298},{"id":"https://openalex.org/keywords/mobile-ad-hoc-network","display_name":"Mobile ad hoc network","score":0.5243078470230103},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.52274090051651},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.47801077365875244},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.47331559658050537},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.43400466442108154},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.41567254066467285},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36726588010787964},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.35873669385910034},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.31530964374542236},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.26687735319137573},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.23660925030708313},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.23520132899284363},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18300846219062805},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.07114869356155396},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06987500190734863}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7491137385368347},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5740874409675598},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5433592796325684},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5330694317817688},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5290580987930298},{"id":"https://openalex.org/C91280400","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Mobile ad hoc network","level":3,"score":0.5243078470230103},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.52274090051651},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.47801077365875244},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.47331559658050537},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.43400466442108154},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.41567254066467285},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36726588010787964},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.35873669385910034},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.31530964374542236},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.26687735319137573},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.23660925030708313},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.23520132899284363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18300846219062805},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.07114869356155396},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06987500190734863}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/mahss.2004.1392187","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mahss.2004.1392187","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.526.2455","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.526.2455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.uc.edu/~cdmc/mass/mass2004/35267.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W37280751","https://openalex.org/W1482700972","https://openalex.org/W1618708475","https://openalex.org/W1964165176","https://openalex.org/W2017751697","https://openalex.org/W2030824584","https://openalex.org/W2035776116","https://openalex.org/W2053694592","https://openalex.org/W2099574482","https://openalex.org/W2107345572","https://openalex.org/W2120889123","https://openalex.org/W2126245380","https://openalex.org/W2132932625","https://openalex.org/W2140000065","https://openalex.org/W2157635692","https://openalex.org/W2160742791","https://openalex.org/W2164905298","https://openalex.org/W2171911290","https://openalex.org/W6636706205","https://openalex.org/W6659666874","https://openalex.org/W6680287473","https://openalex.org/W6684275936","https://openalex.org/W6685225524"],"related_works":["https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W2154023691","https://openalex.org/W2064711473","https://openalex.org/W1515277195","https://openalex.org/W2237860883","https://openalex.org/W1579931977","https://openalex.org/W1971025399","https://openalex.org/W2121598558","https://openalex.org/W341099795"],"abstract_inverted_index":{"Reliability":[0],"is":[1,48],"a":[2,25,69,99,111,125,137,142,151,160,194],"major":[3],"issue":[4],"in":[5,18,60,71,86,171,203],"mobile":[6,19,54],"ad":[7,20],"hoc":[8,21],"routing.":[9],"Shortest":[10],"paths":[11],"are":[12],"usually":[13],"used":[14],"to":[15,51,83,103,129,145,158,231],"route":[16],"packets":[17],"networks":[22],"(MANET)":[23],"However,":[24],"shortest":[26,39,243],"path":[27,40,47,93,105,119,131,238,244],"may":[28,41],"fail":[29],"quickly,":[30],"because":[31],"some":[32],"of":[33,53,150,181],"the":[34,38,46,72,89,115,147,165,172,177,182,200,204,215,242],"wireless":[35,184],"links":[36],"on":[37],"be":[42],"broken":[43],"shortly":[44],"after":[45],"established":[49],"due":[50],"mobility":[52,225],"nodes.":[55],"Rediscovering":[56],"routes":[57],"can":[58],"result":[59],"substantial":[61],"data":[62],"loss":[63],"and":[64,77,153,235],"communication":[65],"overheads.":[66],"We":[67,75,140,186,208],"consider":[68],"MANET":[70,152],"urban":[73],"environment.":[74],"formulate":[76],"study":[78],"two":[79],"optimization":[80],"problems":[81],"related":[82],"reliable":[84],"routing":[85,95,121,217,228],"MANET.":[87],"In":[88,114],"minimum":[90,100,195],"cost":[91,101,133,196],"duration-bounded":[92,197],"(MCDBP)":[94],"problem,":[96,122],"we":[97,123],"seek":[98,124],"source":[102,128],"destination":[104,130],"with":[106,132,241],"duration":[107,117,127,161,173,180,205],"no":[108,134],"less":[109],"than":[110,136],"given":[112,138,166],"threshold.":[113],"maximum":[116,126],"cost-bounded":[118],"(MDCBP)":[120],"greater":[135],"constraint.":[139],"use":[141],"waypoint":[143,167],"graph":[144],"model":[146],"working":[148],"area":[149],"present":[154,188,210],"an":[155,189,211],"offline":[156],"algorithm":[157,191,213],"compute":[159],"prediction":[162,174,206,226],"table":[163,175],"for":[164,214],"graph.":[168],"An":[169],"entry":[170],"contains":[176],"guaranteed":[178],"worst-case":[179],"corresponding":[183],"link.":[185],"then":[187],"efficient":[190],"which":[192],"computes":[193],"path,":[198],"using":[199],"information":[201],"provided":[202],"table.":[207],"also":[209],"heuristic":[212],"MDCBP":[216],"problem.":[218],"Our":[219],"simulation":[220],"results":[221],"show":[222],"that":[223],"our":[224],"based":[227],"algorithms":[229],"lead":[230],"better":[232],"network":[233],"throughput":[234],"longer":[236],"average":[237],"duration,":[239],"compared":[240],"algorithm.":[245]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}