Research And Improvement Of ZigBee Address Assignment Algorithm And Routing Policy

ZigBee is a worldwide standard of wireless personal area network targeted to low rate, low power, cost effective, reliable products and applications. Different from the other wireless personal area network standard such as Bluetooth, Wi-Fi, ZigBee provides the low power wireless tree and mesh networking, and supports up to thousands of devices in a network. Although ZigBee technology has been more mature, there is still room for improvement.In order to introduce the improvement of ZigBee as below, this paper first introduces the whole framework and the levels of ZigBee standard, ZigBee network topology and equipment types, and introduces the current application and comparison with other methods of communication. Then analyzes the networking process and address allocation mechanism, and illustrates the reason why ZigBee distributed address allocation mechanism produces the orphan nodes. Then this thesis examines the tree routing and AODVjr routing algorithm, and points out the advantages and disadvantages of both kinds of routing algorithm. To solve the shortage of the above proposed ZigBee, this paper proposed ABAAM algorithm and the shortest path algorithm based on the neighbor table STR.In view of the problem that ZigBee without further measures after the emerge of orphan nodes, this paper proposes a agent-based address allocation mechanism (ABAAM), while added some formats and command on the basis of the maximum compatibility with the original, and let the orphan nodes which cannot associate with the potential parent nodes in the neighbor table to select one as the agent node. The agent node will allocated the unused address of the network and let the orphan j oin the network, thus reduce the orphan nodes. This article also proposes a shortest path routing algorithm based on the neighbor table, STR, which find the next hop base on the least hops calculation from the nodes in the neighbor table to the destination nodes. Theoretical analysis concludes that the STR algorithm can reduce the hop counts of ZTR algorithm. The simulation and comparison of ZTR, STR and AODV algorithm in NS2 shows that the algorithm is a simple and good network performance routing algorithm.