New Mechanisms to Allocate Addresses in a Tree-Based Zigbee Environment
碩士 === 國立東華大學 === 資訊工程學系 === 99 === ZigBee technology development has approached a mature stage in the military, medical and family life. However, with the expanding application of information technology, more and more devices will be added to the wireless transmission areas. It is necessary to...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/13705802209574482429 |
| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 99 === ZigBee technology development has approached a mature stage in the military, medical and family life. However, with the expanding application of information technology, more and more devices will be added to the wireless transmission areas. It is necessary to find a better mechanism to allocate addresses. This mechanism must be able to accommodate a large number of devices, efficient in routing and able to respond quickly when adding or deleting devices. The recent popular discussion about “power save” should also be considered.
In this thesis, we propose two mechanisms to handle the problem when nodes cannot get addresses. The first mechanism “Fine-tuning parameters” is used to solve the unsuitable setting of parameters. A small adjustment of tuning parameters can connect with more nodes and decrease the phenomenon of isolated nodes. Another method is the Sector mechanism. This mechanism introduces the concept of sectors into the ZigBee network topology and can gain more links without the maximum limitation. These two mechanisms can contain more nodes than the current DAAM mechanism proposed by the ZigBee Alliance. Our simulation result also shows that the approach of fine-tuning parameters and the Sector mechanism can allocate more nodes than other mechanisms by adding a small amount of execution time.
|
|---|