{"id":"https://openalex.org/W2091788990","doi":"https://doi.org/10.1145/2069000.2069012","title":"Towards end-to-end routing for periodic mobile objects","display_name":"Towards end-to-end routing for periodic mobile objects","publication_year":2011,"publication_date":"2011-11-04","ids":{"openalex":"https://openalex.org/W2091788990","doi":"https://doi.org/10.1145/2069000.2069012","mag":"2091788990"},"language":"en","primary_location":{"id":"doi:10.1145/2069000.2069012","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2069000.2069012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the first ACM international symposium on Design and analysis of intelligent vehicular networks and applications","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/A5100357180","display_name":"Zhiyu Wang","orcid":"https://orcid.org/0000-0002-0041-2924"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Zhiyu Wang","raw_affiliation_strings":["University of Alberta, Edmonton, AB, Canada"],"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014272131","display_name":"M\u00e1rio A. Nascimento","orcid":"https://orcid.org/0000-0002-7609-1805"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mario A. Nascimento","raw_affiliation_strings":["University of Alberta, Edmonton, AB, Canada"],"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109112369","display_name":"Michael H. MacGregor","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michael H. MacGregor","raw_affiliation_strings":["University of Alberta, Edmonton, AB, Canada"],"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100357180"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":0.366883,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63544752,"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":"61","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9977999925613403,"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/T11478","display_name":"Caching and Content Delivery","score":0.9962000250816345,"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.8181794881820679},{"id":"https://openalex.org/keywords/flooding","display_name":"Flooding (psychology)","score":0.6951391696929932},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5249345898628235},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5073606371879578},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4975133240222931},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48447108268737793},{"id":"https://openalex.org/keywords/base-station","display_name":"Base station","score":0.46175360679626465},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.45510756969451904},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.453419029712677},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43437671661376953},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4203539490699768},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3422545790672302},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31739115715026855},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10097339749336243}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8181794881820679},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.6951391696929932},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5249345898628235},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5073606371879578},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4975133240222931},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48447108268737793},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.46175360679626465},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.45510756969451904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.453419029712677},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43437671661376953},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4203539490699768},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3422545790672302},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31739115715026855},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10097339749336243},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2069000.2069012","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2069000.2069012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the first ACM international symposium on Design and analysis of intelligent vehicular networks and applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8799999952316284,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1972863896","https://openalex.org/W2000548713","https://openalex.org/W2003600644","https://openalex.org/W2019950050","https://openalex.org/W2044630035","https://openalex.org/W2073418598","https://openalex.org/W2096509679","https://openalex.org/W2100468043","https://openalex.org/W2102258543","https://openalex.org/W2103344667","https://openalex.org/W2112316694","https://openalex.org/W2117526746","https://openalex.org/W2136420233","https://openalex.org/W2168452204","https://openalex.org/W2169528473","https://openalex.org/W3016630876","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"Mobile":[0],"objects":[1,62],"can":[2,100],"be":[3,27],"equipped":[4],"with":[5,46,102,126],"hardware":[6],"enabling":[7],"them":[8],"to":[9,26,29,37,83,112,136],"collect":[10],"data,":[11],"as":[12,14,92,118],"well":[13],"answer":[15],"queries":[16,32],"remotely":[17],"and":[18,129,142],"in":[19,41,57,123],"real-time.":[20],"For":[21],"the":[22,38,60,114,138,151,167],"latter,":[23],"one":[24],"needs":[25],"able":[28],"effectively":[30],"route":[31],"from":[33],"a":[34,66,93,119,124,160,172],"base":[35],"station":[36],"queried":[39],"object":[40],"an":[42,88],"efficient":[43],"way,":[44],"i.e.,":[45],"minimum":[47,50],"energy-cost":[48],"or":[49],"delay.":[51],"A":[52],"complicating":[53],"factor":[54],"is":[55,90],"that":[56,98,150],"many":[58],"domains":[59],"mobile":[61],"may":[63],"not":[64],"form":[65],"single":[67],"connected":[68],"component":[69],"at":[70],"all":[71],"times.":[72],"In":[73],"this":[74],"paper":[75],"we":[76,109,130],"take":[77],"advantage":[78],"of":[79,162,166],"periodically":[80],"repeating":[81],"movements":[82],"establish":[84],"encounter":[85,89,107],"patterns,":[86,108],"where":[87],"defined":[91],"time-period":[94],"long":[95],"enough":[96],"so":[97],"sensors":[99],"communicate":[101],"each":[103],"other.":[104],"Possessing":[105],"such":[106],"show":[110,149],"how":[111],"model":[113],"query":[115],"routing":[116],"problem":[117,122],"shortest":[120],"path":[121],"graph":[125],"domain-oriented":[127],"constraints,":[128],"also":[131],"present":[132],"polynomial":[133],"time":[134],"algorithms":[135],"find":[137],"guaranteed":[139],"minimal":[140,143,152],"delay":[141],"energy":[144,153],"routes.":[145],"Furthermore,":[146],"our":[147,157],"experiments":[148],"routes":[154],"found":[155],"by":[156],"algorithm":[158],"have":[159],"cost":[161,168],"less":[163],"than":[164],"1%":[165],"obtained":[169],"when":[170],"using":[171],"flooding-based":[173],"protocol.":[174]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}