{"id":"https://openalex.org/W1994798111","doi":"https://doi.org/10.1109/lcnw.2014.6927728","title":"Optimal encounter-based routing via objects with periodic behaviours","display_name":"Optimal encounter-based routing via objects with periodic behaviours","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W1994798111","doi":"https://doi.org/10.1109/lcnw.2014.6927728","mag":"1994798111"},"language":"en","primary_location":{"id":"doi:10.1109/lcnw.2014.6927728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcnw.2014.6927728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"39th Annual IEEE Conference on Local Computer Networks Workshops","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":["Department of Computing Sciences, University of Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Sciences, University of Alberta, 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":["Department of Computing Sciences, University of Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Sciences, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029371742","display_name":"M.H. MacGregor","orcid":"https://orcid.org/0000-0002-2381-1290"},"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":"Mike H. MacGregor","raw_affiliation_strings":["Department of Computing Sciences, University of Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Sciences, University of Alberta, 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.3448,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63503184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":null,"first_page":"730","last_page":"737"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991999864578247,"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.9958000183105469,"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.7773517370223999},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6550683975219727},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5800080299377441},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5573651194572449},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5396059155464172},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5353349447250366},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.527152955532074},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.506869375705719},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5016043186187744},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.47705212235450745},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4753432273864746},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46370014548301697},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.423258513212204},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4212067723274231},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.186526358127594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15160012245178223}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7773517370223999},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6550683975219727},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5800080299377441},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5573651194572449},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5396059155464172},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5353349447250366},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.527152955532074},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.506869375705719},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5016043186187744},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.47705212235450745},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4753432273864746},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46370014548301697},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.423258513212204},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4212067723274231},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.186526358127594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15160012245178223},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/lcnw.2014.6927728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcnw.2014.6927728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"39th Annual IEEE Conference on Local Computer Networks Workshops","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W1005876121","https://openalex.org/W1518080829","https://openalex.org/W1572481965","https://openalex.org/W1746637951","https://openalex.org/W1966559656","https://openalex.org/W1968497507","https://openalex.org/W1982300822","https://openalex.org/W1982459859","https://openalex.org/W1983799289","https://openalex.org/W1990488643","https://openalex.org/W1990920784","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2031093729","https://openalex.org/W2037853761","https://openalex.org/W2112316694","https://openalex.org/W2136257106","https://openalex.org/W2140053824","https://openalex.org/W2142522527","https://openalex.org/W2752885492","https://openalex.org/W2890659396","https://openalex.org/W3127447045","https://openalex.org/W3142519342","https://openalex.org/W4234068324","https://openalex.org/W6634082847","https://openalex.org/W6642392778","https://openalex.org/W6680817513","https://openalex.org/W6789680617","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2807251790","https://openalex.org/W2799406489","https://openalex.org/W2049792449","https://openalex.org/W986251431","https://openalex.org/W563727013","https://openalex.org/W2502468346","https://openalex.org/W2963420405","https://openalex.org/W4224257934","https://openalex.org/W2373440974","https://openalex.org/W1997350652"],"abstract_inverted_index":{"In":[0,18,49],"MANETs,":[1],"communication":[2],"often":[3,45],"relies":[4],"on":[5],"finding":[6],"a":[7,76,79],"set":[8],"of":[9,15,55],"sequential":[10],"opportunistic":[11],"encounters":[12,58],"between":[13,59],"pairs":[14],"mobile":[16,22,43],"nodes.":[17,60],"this":[19,50],"context,":[20],"understanding":[21],"node":[23,39],"behaviour":[24],"is":[25,41],"essential":[26],"to":[27,68,88,107],"design":[28],"effective":[29],"and":[30,92],"efficient":[31],"network":[32],"protocols.":[33,110],"One":[34],"characteristic":[35],"that":[36,42,98],"emerges":[37],"from":[38],"mobility":[40],"nodes":[44],"have":[46],"periodic":[47],"behaviours.":[48],"paper":[51],"we":[52,65,83],"take":[53],"advantage":[54],"periodically":[56],"repeated":[57],"Given":[61],"these":[62],"encounter":[63],"patterns,":[64],"show":[66,97],"how":[67],"model":[69],"routing":[70],"as":[71],"an":[72],"optimization":[73],"problem":[74],"in":[75],"graph":[77],"with":[78],"domain-specific":[80],"constraint.":[81],"Further,":[82],"propose":[84],"polynomial":[85],"time":[86],"algorithms":[87],"find":[89,103],"the":[90],"optimal":[91],"near-optimal":[93],"solutions.":[94],"Experimental":[95],"results":[96],"our":[99],"proposed":[100],"approaches":[101],"always":[102],"better":[104],"routes":[105],"compared":[106],"other":[108],"state-of-the-art":[109]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
