The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Em uma rede ZigBee, um espaço de endereço finito é alocado para cada dispositivo pai em potencial e um dispositivo pode proibir uma solicitação de adesão quando esse espaço de endereço estiver esgotado. Quando um novo nó (filho) solicita a um coordenador (pai) para ingressar em uma rede ZigBee, o coordenador verifica seu espaço de endereçamento. Se tiver espaço de endereçamento suficiente, o coordenador aceita o novo nó como seu filho na rede ZigBee. Se o novo nó tiver capacidade de roteador (JoinAsRouter), ele se torna um roteador na rede ZigBee. Porém, este procedimento de associação torna as redes ZigBee ineficientes para roteamento, pois o coordenador verifica apenas o número máximo e atual de nós filhos. Na pior das hipóteses, a rede será organizada de forma que os nós do roteador fiquem lotados na rede. Portanto, propomos o algoritmo KMCD-IME (Mantendo a distância máxima de comunicação e a exclusão mútua inicial entre os nós roteadores) com duas condições adicionais quando um novo nó se junta à rede ZigBee. A primeira condição mantém a distância máxima de comunicação entre o novo nó e o suposto nó pai. A segunda condição é a exclusão mútua inicial entre os nós roteadores. Os nós do roteador são distribuídos uniformemente pela rede pelo KMCD-IME e uma topologia de roteamento eficaz é formada. Portanto, o algoritmo KMCD-IME estende a vida útil da rede ZigBee.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Saeyoung AHN, Sunshin AN, "KMCD-IME (Keeping the Maximum Communication Distance and Initial Mutual Exclusion among Router Nodes) Topology Control Algorithm for Effective Routing in ZigBee Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 10, pp. 1744-1747, October 2010, doi: 10.1587/transfun.E93.A.1744.
Abstract: In a ZigBee network, a finite address space is allocated to every potential parent device and a device may disallow a join request once this address space is exhausted. When a new node (child) requests to a coordinator (parent) to join a ZigBee network, the coordinator checks its address space. If it has sufficient address space, the coordinator accepts the new node as its child in the ZigBee network. If the new node has router capability (JoinAsRouter), it becomes a router in the ZigBee network. However, this association procedure makes ZigBee networks inefficient for routing, because the coordinator checks only the maximum and current numbers of child nodes. In the worst case, the network will be arranged so that the router nodes are crowded in the network. Therefore, we propose the KMCD-IME (Keeping the Maximum Communication Distance and Initial Mutual Exclusion among router nodes) algorithm with two additional conditions when a new node joins the ZigBee network. The first condition maintains the maximum communication distance between the new node and the would-be parent node. The second condition is the Initial Mutual Exclusion among router nodes. The router nodes are evenly spread across the network by KMCD-IME and an effective routing topology is formed. Therefore, the KMCD-IME algorithm extends the lifetime of the ZigBee network.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1744/_p
Copiar
@ARTICLE{e93-a_10_1744,
author={Saeyoung AHN, Sunshin AN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={KMCD-IME (Keeping the Maximum Communication Distance and Initial Mutual Exclusion among Router Nodes) Topology Control Algorithm for Effective Routing in ZigBee Networks},
year={2010},
volume={E93-A},
number={10},
pages={1744-1747},
abstract={In a ZigBee network, a finite address space is allocated to every potential parent device and a device may disallow a join request once this address space is exhausted. When a new node (child) requests to a coordinator (parent) to join a ZigBee network, the coordinator checks its address space. If it has sufficient address space, the coordinator accepts the new node as its child in the ZigBee network. If the new node has router capability (JoinAsRouter), it becomes a router in the ZigBee network. However, this association procedure makes ZigBee networks inefficient for routing, because the coordinator checks only the maximum and current numbers of child nodes. In the worst case, the network will be arranged so that the router nodes are crowded in the network. Therefore, we propose the KMCD-IME (Keeping the Maximum Communication Distance and Initial Mutual Exclusion among router nodes) algorithm with two additional conditions when a new node joins the ZigBee network. The first condition maintains the maximum communication distance between the new node and the would-be parent node. The second condition is the Initial Mutual Exclusion among router nodes. The router nodes are evenly spread across the network by KMCD-IME and an effective routing topology is formed. Therefore, the KMCD-IME algorithm extends the lifetime of the ZigBee network.},
keywords={},
doi={10.1587/transfun.E93.A.1744},
ISSN={1745-1337},
month={October},}
Copiar
TY - JOUR
TI - KMCD-IME (Keeping the Maximum Communication Distance and Initial Mutual Exclusion among Router Nodes) Topology Control Algorithm for Effective Routing in ZigBee Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1744
EP - 1747
AU - Saeyoung AHN
AU - Sunshin AN
PY - 2010
DO - 10.1587/transfun.E93.A.1744
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2010
AB - In a ZigBee network, a finite address space is allocated to every potential parent device and a device may disallow a join request once this address space is exhausted. When a new node (child) requests to a coordinator (parent) to join a ZigBee network, the coordinator checks its address space. If it has sufficient address space, the coordinator accepts the new node as its child in the ZigBee network. If the new node has router capability (JoinAsRouter), it becomes a router in the ZigBee network. However, this association procedure makes ZigBee networks inefficient for routing, because the coordinator checks only the maximum and current numbers of child nodes. In the worst case, the network will be arranged so that the router nodes are crowded in the network. Therefore, we propose the KMCD-IME (Keeping the Maximum Communication Distance and Initial Mutual Exclusion among router nodes) algorithm with two additional conditions when a new node joins the ZigBee network. The first condition maintains the maximum communication distance between the new node and the would-be parent node. The second condition is the Initial Mutual Exclusion among router nodes. The router nodes are evenly spread across the network by KMCD-IME and an effective routing topology is formed. Therefore, the KMCD-IME algorithm extends the lifetime of the ZigBee network.
ER -