Borrowed Address Assignment Algorithm Based on Recursive Reduction Model in ZigBee Networks
| Autor: | Leqiang Bai, Xiangfei Zhao |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Router
Reduction (complexity) Address space Computer science Node (networking) 0202 electrical engineering electronic engineering information engineering 020206 networking & telecommunications 020201 artificial intelligence & image processing 02 engineering and technology Construct (python library) Algorithm |
| Zdroj: | ICNC-FSKD |
| DOI: | 10.1109/fskd.2018.8687204 |
| Popis: | Aiming at the problem that the existing ZigBee network borrow address assignment algorithm has many orphan nodes and the lower success rate of address assignment, a borrowed address assignment algorithm based on recursive reduction model in ZigBee networks is proposed. The algorithm uses the exponential relationship between the number of router nodes and the network depth in the DAAM algorithm to construct a recursively reduced router node model to provide reserved address space for orphan nodes. Theoretical analysis shows that the algorithm has the same time and storage complexity as the DAAM algorithm. The simulation results show that the algorithm outperforms the DAAM, DAAM-THN, SOSSA and ASTJ algorithms in terms of the success rate of address assignment, and the average time-consuming of assigning address etc. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|