Adopting the borrowed address algorithm can decrease the orphan nodes in ZigBee networks that use distributed address assignment mechanism （DAAM）. The existing borrowed address algorithms can increase the success ra...Adopting the borrowed address algorithm can decrease the orphan nodes in ZigBee networks that use distributed address assignment mechanism （DAAM）. The existing borrowed address algorithms can increase the success rate of address assignment, but they have defects such as greater cost of overhead and time in founding network caused by breaking topology. To solve such problems, we propose an more efficient distributed borrowed address assignment algorithm based on topology maintenance （A2BTM） that has a topology maintenance function. It borrows address firstly from the offspring nodes in the same branch for the orphan nodes and replies distributed the request of the borrowed address message immediately, to maintain the network topology and decrease the overhead and time spent on the mechanism of borrowed address. Theoretical and simulation analyses manifest that AZBTM algorithm outperforms DAAM and its improved algorithms in terms of the overhead and time spent in founding network, on the premise of keeping a higher success rate of address assignment. Furthermore, A2BTM can lessen the influence from detour phenomenon efficiently.展开更多
Many proposed P2P networks are based on traditional interconnection topologies. Given a static topology, the maintenance mechanism for node join/departure is critical to designing an efficient P2P network. Kautz graph...Many proposed P2P networks are based on traditional interconnection topologies. Given a static topology, the maintenance mechanism for node join/departure is critical to designing an efficient P2P network. Kautz graphs have many good properties such as constant degree, low congestion and optimal diameter. Due to the complexity in topology maintenance, however, to date there have been no effective P2P networks that are proposed based on Kautz graphs with base ~ 2. To address this problem, this paper presents the ＂distributed Kautz （D-Kautz） graphs＂, which adapt Kautz graphs to the characteristics of P2P networks. Using the D-Kautz graphs we further propose SKY, the first effective P2P network based on Kautz graphs with arbitrary base. The effectiveness of SKY is demonstrated through analysis and simulations.展开更多
基金supported by Natural Science Foundation Project of CQ CSTC (2012jjA40040)the National Natural Science Foundation of China (60972068)
文摘Adopting the borrowed address algorithm can decrease the orphan nodes in ZigBee networks that use distributed address assignment mechanism （DAAM）. The existing borrowed address algorithms can increase the success rate of address assignment, but they have defects such as greater cost of overhead and time in founding network caused by breaking topology. To solve such problems, we propose an more efficient distributed borrowed address assignment algorithm based on topology maintenance （A2BTM） that has a topology maintenance function. It borrows address firstly from the offspring nodes in the same branch for the orphan nodes and replies distributed the request of the borrowed address message immediately, to maintain the network topology and decrease the overhead and time spent on the mechanism of borrowed address. Theoretical and simulation analyses manifest that AZBTM algorithm outperforms DAAM and its improved algorithms in terms of the overhead and time spent in founding network, on the premise of keeping a higher success rate of address assignment. Furthermore, A2BTM can lessen the influence from detour phenomenon efficiently.
基金Supported partially by the National Natural Science Foundation of China (Grant Nos. 60673167 and 60703072)the Hunan Provincial Natural Science Foundation of China (Grant No. 08JJ3125)the National Basic Research Program of China (973) (Grant No. 2005CB321801)
文摘Many proposed P2P networks are based on traditional interconnection topologies. Given a static topology, the maintenance mechanism for node join/departure is critical to designing an efficient P2P network. Kautz graphs have many good properties such as constant degree, low congestion and optimal diameter. Due to the complexity in topology maintenance, however, to date there have been no effective P2P networks that are proposed based on Kautz graphs with base ~ 2. To address this problem, this paper presents the ＂distributed Kautz （D-Kautz） graphs＂, which adapt Kautz graphs to the characteristics of P2P networks. Using the D-Kautz graphs we further propose SKY, the first effective P2P network based on Kautz graphs with arbitrary base. The effectiveness of SKY is demonstrated through analysis and simulations.
