{"id":"https://openalex.org/W2950692221","doi":"https://doi.org/10.1109/mocast.2019.8741570","title":"An Alternative to Zigbee Routing Using a Cycles Description of a Planar Graph","display_name":"An Alternative to Zigbee Routing Using a Cycles Description of a Planar Graph","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2950692221","doi":"https://doi.org/10.1109/mocast.2019.8741570","mag":"2950692221"},"language":"en","primary_location":{"id":"doi:10.1109/mocast.2019.8741570","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mocast.2019.8741570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 8th International Conference on Modern Circuits and Systems Technologies (MOCAST)","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/A5053551907","display_name":"Cristian E. Onete","orcid":"https://orcid.org/0000-0001-6134-5908"},"institutions":[{"id":"https://openalex.org/I109147379","display_name":"NXP (Netherlands)","ror":"https://ror.org/059be4e97","country_code":"NL","type":"company","lineage":["https://openalex.org/I109147379"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Cristian E. Onete","raw_affiliation_strings":["Former NXP Semiconductors, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Former NXP Semiconductors, The Netherlands","institution_ids":["https://openalex.org/I109147379"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076094571","display_name":"Maria Cristina C. Onete","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210093397","display_name":"XLIM","ror":"https://ror.org/00f7srh09","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I32881790","https://openalex.org/I4210093397","https://openalex.org/I4210095849","https://openalex.org/I65806277"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Maria Cristina C. Onete","raw_affiliation_strings":["XLIM, CNRS 7252, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"XLIM, CNRS 7252, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210093397"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4422,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79703012,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"8","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.989799976348877,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.7485466003417969},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6825605034828186},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.6325566172599792},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.6203567981719971},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5566965937614441},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49661022424697876},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4952646791934967},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47723153233528137},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.4388737380504608},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3693990707397461},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.34078484773635864},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2961254417896271},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23439142107963562},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19064733386039734},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.14649125933647156}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7485466003417969},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6825605034828186},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.6325566172599792},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.6203567981719971},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5566965937614441},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49661022424697876},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4952646791934967},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47723153233528137},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.4388737380504608},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3693990707397461},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.34078484773635864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2961254417896271},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23439142107963562},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19064733386039734},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.14649125933647156},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mocast.2019.8741570","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mocast.2019.8741570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 8th International Conference on Modern Circuits and Systems Technologies (MOCAST)","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":10,"referenced_works":["https://openalex.org/W1485627046","https://openalex.org/W1585085059","https://openalex.org/W2010696803","https://openalex.org/W2050605560","https://openalex.org/W2080514786","https://openalex.org/W2560457873","https://openalex.org/W2790074392","https://openalex.org/W2791534228","https://openalex.org/W6730173507","https://openalex.org/W6737323235"],"related_works":["https://openalex.org/W4387272283","https://openalex.org/W4299647289","https://openalex.org/W1618127724","https://openalex.org/W2155631825","https://openalex.org/W2952856011","https://openalex.org/W2011032737","https://openalex.org/W2078431586","https://openalex.org/W2069133957","https://openalex.org/W140019436","https://openalex.org/W1541834747"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"a":[3],"new":[4],"alternative":[5],"routing":[6],"algorithm":[7,22],"suitable":[8],"for,":[9],"inter":[10],"alia,":[11],"static":[12],"Hamiltonian":[13,16,66],"Zigbee":[14],"and":[15,32,54],"mesh":[17],"networks":[18],"is":[19,23],"shown.":[20],"The":[21],"based":[24],"on":[25],"the":[26,30,44],"cycle":[27],"description":[28],"of":[29],"graph,":[31],"we":[33],"show":[34],"that":[35],"it":[36],"can":[37,60],"provide":[38],"some":[39],"advantages":[40],"when":[41],"compared":[42],"to":[43,72],"classical":[45],"path-finding":[46],"used":[47],"in":[48],"Zigbee.":[49],"We":[50],"also":[51,61],"give":[52],"examples":[53],"discuss":[55],"how":[56],"far":[57],"our":[58],"method":[59],"be":[62],"successfully":[63],"applied":[64],"beyond":[65],"graphs,":[67],"providing":[68],"speedups":[69],"with":[70],"respect":[71],"node-based":[73],"hopping":[74],"algorithm.":[75]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}