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
Dalam rangkaian ZigBee, ruang alamat terhingga diperuntukkan kepada setiap peranti induk yang berpotensi dan peranti mungkin tidak membenarkan permintaan penyertaan setelah ruang alamat ini kehabisan. Apabila nod baharu (anak) meminta kepada penyelaras (ibu bapa) untuk menyertai rangkaian ZigBee, penyelaras menyemak ruang alamatnya. Jika ia mempunyai ruang alamat yang mencukupi, penyelaras menerima nod baharu sebagai anaknya dalam rangkaian ZigBee. Jika nod baharu mempunyai keupayaan penghala (SertaiAsRouter), ia menjadi penghala dalam rangkaian ZigBee. Walau bagaimanapun, prosedur perkaitan ini menjadikan rangkaian ZigBee tidak cekap untuk penghalaan, kerana penyelaras hanya menyemak nombor maksimum dan semasa nod anak. Dalam kes yang paling teruk, rangkaian akan diatur supaya nod penghala sesak dalam rangkaian. Oleh itu, kami mencadangkan algoritma KMCD-IME (Mengekalkan Jarak Komunikasi Maksimum dan Pengecualian Bersama Awal antara nod penghala) dengan dua syarat tambahan apabila nod baharu menyertai rangkaian ZigBee. Syarat pertama mengekalkan jarak komunikasi maksimum antara nod baharu dan nod induk yang bakal menjadi. Syarat kedua ialah Pengecualian Bersama Awal di antara nod penghala. Nod penghala tersebar sama rata di seluruh rangkaian oleh KMCD-IME dan topologi penghalaan yang berkesan terbentuk. Oleh itu, algoritma KMCD-IME memanjangkan hayat rangkaian 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.
Salinan
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
Salinan
@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},}
Salinan
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 -