A Quick Routing Method Based on Improved Binary Tree Topology for ZigBee Networks and its Application

碩士 === 國立高雄應用科技大學 === 電子工程系 === 100 === Wireless sensor network (WSN) is one of popular research issues, and ZigBee is an important protocol for WSN. In general, the addresses of devices in WSN are given by a Distributed Address Allocation Mechanism (DAAM). Although DAAM has better extensibility, th...

Full description

Bibliographic Details
Main Authors: Yan-Cheng Lee, 李彥澂
Other Authors: Jeng-Shyang Pan
Format: Others
Language:zh-TW
Published: 101
Online Access:http://ndltd.ncl.edu.tw/handle/00529826490065600215
Description
Summary:碩士 === 國立高雄應用科技大學 === 電子工程系 === 100 === Wireless sensor network (WSN) is one of popular research issues, and ZigBee is an important protocol for WSN. In general, the addresses of devices in WSN are given by a Distributed Address Allocation Mechanism (DAAM). Although DAAM has better extensibility, this given network topology by DAAM lacks of fast route between source node and destination node. Binary tree topology offers a faster packet routing through a simple Boolean computation. However, the binary tree is less extensibility. In this paper, in order to increase the number of terminal nodes, the modified binary tree topology is proposed to assign multiple network addresses under routers. The source node can find the route from destination node and effectively reduce the routing cost through a binary shortcut routing algorithm. DAAM mechanism is ineffective to allocate network address. Hence, an approach of average network address allocation is assigned with the same number of each underlying router network address to each end device. Users can change the node amount for deployment according to their demands. The proposed approach improves the low utility rate of the network address for DAAM.