{"id":"https://openalex.org/W2095568852","doi":"https://doi.org/10.1109/ciss.2008.4558649","title":"Optimal path planning for mobile backbone networks","display_name":"Optimal path planning for mobile backbone networks","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W2095568852","doi":"https://doi.org/10.1109/ciss.2008.4558649","mag":"2095568852"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2008.4558649","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2008.4558649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 42nd Annual Conference on Information Sciences and Systems","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/A5111538133","display_name":"Anand Srinivas","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anand Srinivas","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology, Cambridge, MA,"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA,","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036587377","display_name":"Eytan Modiano","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eytan Modiano","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology, Cambridge, MA,"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA,","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111538133"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12622192,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"913","last_page":"918"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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.9984999895095825,"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.9980000257492065,"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/heuristic","display_name":"Heuristic","score":0.6766117215156555},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6379343867301941},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5369533896446228},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4175618588924408},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3649473190307617},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.320029079914093},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3197421431541443},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2661089301109314}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6766117215156555},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6379343867301941},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5369533896446228},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4175618588924408},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3649473190307617},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.320029079914093},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3197421431541443},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2661089301109314}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ciss.2008.4558649","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2008.4558649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 42nd Annual Conference on Information Sciences and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1534525309","https://openalex.org/W1757708442","https://openalex.org/W1985025885","https://openalex.org/W1998185535","https://openalex.org/W1999795674","https://openalex.org/W2022029425","https://openalex.org/W2042736474","https://openalex.org/W2075229172","https://openalex.org/W2081151223","https://openalex.org/W2091324292","https://openalex.org/W2136272408","https://openalex.org/W2139201057","https://openalex.org/W2139878667","https://openalex.org/W2157703255","https://openalex.org/W2161779238","https://openalex.org/W2612977707","https://openalex.org/W4248623570"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843"],"abstract_inverted_index":{"Mobile":[0,27],"Backbone":[1,28],"Networks":[2],"are":[3,14,23],"heterogeneous":[4],"wireless":[5],"networks":[6],"in":[7,40,49],"which":[8],"a":[9,37,87,100,120,124,137],"subset":[10],"of":[11,59,86],"the":[12,50,57,62,83,94,110,129,144,149],"nodes":[13,22,48],"more":[15,20],"capable":[16,21],"than":[17],"others.":[18],"The":[19],"referred":[24],"to":[25,35,42,92],"as":[26,119],"Nodes":[29],"(MBNs),":[30],"whose":[31],"primary":[32],"role":[33],"is":[34],"provide":[36,123],"mobile":[38],"infrastructure":[39],"order":[41],"facilitate":[43],"reliable":[44],"end-to-end":[45],"communication":[46],"between":[47],"Network.":[51],"In":[52],"this":[53,118],"paper,":[54],"we":[55,81,122,135,147],"consider":[56,82],"problem":[58,102],"optimally":[60],"placing":[61],"MBNs":[63],"<i":[64,67,70,73,76],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[65,68,71,74,77],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">over</i>":[66],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">a</i>":[69],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">finite</i>":[72],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">time</i>":[75],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">horizon</i>":[78],".":[79],"Specifically,":[80],"path":[84,131],"planning":[85,132],"single":[88,111],"MBN":[89,114],"and":[90,104],"aim":[91],"maximize":[93],"time-average":[95],"system":[96],"throughput.":[97],"We":[98],"present":[99],"discrete":[101],"formulation,":[103],"develop":[105,136],"an":[106],"optimal":[107],"solution":[108],"for":[109,128,143],"step":[112],"velocity-constrained":[113],"placement":[115],"problem.":[116,133,145],"Using":[117],"sub-routine,":[121],"greedy":[125],"heuristic":[126],"algorithm":[127,142],"overall":[130],"Next,":[134],"dynamic":[138],"programming":[139],"based":[140],"approximation":[141],"Finally,":[146],"compare":[148],"developed":[150],"approaches":[151],"via":[152],"simulation.":[153]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}