{"id":"https://openalex.org/W1492154738","doi":"https://doi.org/10.1109/wfcs.2015.7160572","title":"ZigBee cluster tree formation for time-bounded data flows in one collision domain","display_name":"ZigBee cluster tree formation for time-bounded data flows in one collision domain","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1492154738","doi":"https://doi.org/10.1109/wfcs.2015.7160572","mag":"1492154738"},"language":"en","primary_location":{"id":"doi:10.1109/wfcs.2015.7160572","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wfcs.2015.7160572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE World Conference on Factory Communication Systems (WFCS)","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/A5081641140","display_name":"Aasem Ahmad","orcid":"https://orcid.org/0000-0002-7268-6094"},"institutions":[{"id":"https://openalex.org/I151321946","display_name":"Center for Economic Research and Graduate Education \u2013 Economics Institute","ror":"https://ror.org/0362ttz08","country_code":"CZ","type":"education","lineage":["https://openalex.org/I151321946"]},{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Aasem Ahmad","raw_affiliation_strings":["DCE, FEE, Czech Republic","DCE, FEE, CTU in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"DCE, FEE, Czech Republic","institution_ids":["https://openalex.org/I151321946"]},{"raw_affiliation_string":"DCE, FEE, CTU in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I151321946","https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039174863","display_name":"Zden\u011bk Hanz\u00e1lek","orcid":"https://orcid.org/0000-0002-8135-1296"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]},{"id":"https://openalex.org/I151321946","display_name":"Center for Economic Research and Graduate Education \u2013 Economics Institute","ror":"https://ror.org/0362ttz08","country_code":"CZ","type":"education","lineage":["https://openalex.org/I151321946"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Zdenek Hanzalek","raw_affiliation_strings":["DCE, FEE, Czech Republic","DCE, FEE, CTU in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"DCE, FEE, Czech Republic","institution_ids":["https://openalex.org/I151321946"]},{"raw_affiliation_string":"DCE, FEE, CTU in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I151321946","https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081641140"],"corresponding_institution_ids":["https://openalex.org/I151321946","https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02352849,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9987999796867371,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9987999796867371,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9979000091552734,"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.9975000023841858,"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/bounded-function","display_name":"Bounded function","score":0.6571320295333862},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6507675051689148},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.5737805366516113},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5369197130203247},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5325796604156494},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.525377631187439},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4352788031101227},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4286808669567108},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4269633889198303},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.41654354333877563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3759550154209137},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35628676414489746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2565781772136688},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14283236861228943},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12895289063453674}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6571320295333862},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6507675051689148},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.5737805366516113},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5369197130203247},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5325796604156494},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.525377631187439},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4352788031101227},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4286808669567108},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4269633889198303},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.41654354333877563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3759550154209137},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35628676414489746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2565781772136688},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14283236861228943},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12895289063453674},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wfcs.2015.7160572","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wfcs.2015.7160572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE World Conference on Factory Communication Systems (WFCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8999999761581421,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1966032234","https://openalex.org/W1977545325","https://openalex.org/W1990866376","https://openalex.org/W2004667306","https://openalex.org/W2125564986","https://openalex.org/W2150175126","https://openalex.org/W2150318719","https://openalex.org/W2540051214","https://openalex.org/W4251907433","https://openalex.org/W6682491527","https://openalex.org/W6996013747"],"related_works":["https://openalex.org/W3113932901","https://openalex.org/W650625605","https://openalex.org/W2086397253","https://openalex.org/W2801025257","https://openalex.org/W2551285827","https://openalex.org/W1919219501","https://openalex.org/W2027504272","https://openalex.org/W2133122801","https://openalex.org/W2372181157","https://openalex.org/W2347750628"],"abstract_inverted_index":{"We":[0,94],"study":[1],"one-collision":[2],"domain":[3],"ZigBee":[4],"cluster-tree":[5,18],"design":[6,123],"problems":[7],"to":[8,35,70,120],"satisfy":[9],"periodic":[10],"time-bounded":[11],"data":[12],"flows.":[13,60],"The":[14,32],"formation":[15,129],"of":[16,39,58,82,91],"the":[17,37,56,59,62,65,80,83,89,92,107,110,115,127,131],"topology":[19],"can":[20,45,75],"be":[21,71,76],"seen":[22],"as":[23],"a":[24,51,96],"bounded-degree-and-depth":[25],"tree":[26],"which":[27,74],"is":[28,34,68],"an":[29],"NP-complete":[30],"problem.":[31,136],"objective":[33],"minimize":[36],"number":[38],"clusters":[40,101],"such":[41],"that":[42,54,125],"all":[43],"flows":[44],"take":[46],"place":[47],"and":[48,86,99,114,117,130],"there":[49],"exists":[50],"cluster":[52,66,128,132],"schedule":[53,67,84],"meets":[55],"deadlines":[57],"For":[61],"resulting":[63],"tree,":[64],"required":[69],"energy":[72],"efficient,":[73],"achieved":[77],"by":[78],"maximizing":[79],"length":[81],"period,":[85],"consequently,":[87],"increasing":[88],"lifetime":[90],"network.":[93],"present":[95],"Cluster-Tree":[97],"Formation":[98],"Energy-Efficient":[100],"scheduling":[102,133],"algorithm,":[103,109],"CFEFS,":[104],"based":[105],"on":[106],"Hungarian":[108],"Maximum":[111],"Matching":[112],"algorithm":[113,119],"Branch":[116],"Bound":[118],"tackle":[121],"this":[122],"problem":[124],"integrates":[126],"in":[134],"one":[135]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}