Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3945
Título: Collision-free beacon scheduling mechanisms for IEEE 802.15.4/Zigbee cluster-tree wireless sensor networks
Autor: Koubâa, Anis
Alves, Mário
Attia, Melek
Nieuwenhuyse, Anneleen Van
Data: 2007
Editora: IPP Hurray! Research Group
Resumo: The recently standardized IEEE 802.15.4/Zigbee protocol stack offers great potentials for ubiquitous and pervasive computing, namely for Wireless Sensor Networks (WSNs). However, there are still some open and ambiguous issues that turn its practical use a challenging task. One of those issues is how to build a synchronized multi-hop cluster-tree network, which is quite suitable for QoS support in WSNs. In fact, the current IEEE 802.15.4/Zigbee specifications restrict the synchronization in the beacon-enabled mode (by the generation of periodic beacon frames) to star-based networks, while it supports multi-hop networking using the peer-to-peer mesh topology, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multi-hop and synchronization features, the description on how to effectively construct such a network topology is missing. This paper tackles this problem, unveils the ambiguities regarding the use of the cluster-tree topology and proposes two collision-free beacon frame scheduling schemes. We strongly believe that the results provided in this paper trigger a significant step towards the practical and efficient use of IEEE 802.15.4/Zigbee cluster-tree networks.
Peer review: no
URI: http://hdl.handle.net/10400.22/3945
Versão do Editor: http://www.cister.isep.ipp.pt/docs/
Aparece nas colecções:ISEP – CISTER – Relatórios

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
REL_AnisK_2007_CISTER.pdf828,02 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.