A crosscut tree routing scheme for preemptive distributed address assignment mechanism

ZigBee is the emerging industrial standard for wireless sensor networks. Preemptive Distributed Address Assignment (PDAA) Mechanism improves ZigBee address assignment algorithm, and PDAA Mechanism presents an autorouting protocol which does not require any routing tables to send the packets to the destination. It can be used in any device in ZigBee, such as router and end device. However, the autorouting protocol has the problem that the packets follow the tree topology to the destination even if the destination is located nearby, and if the destination is a preempted node, a reduplicate path is induced. So, we propose a crosscut hierarchical routing scheme to reduce the routing cost of the autorouting algorithm by using the neighbor table that is originally defined in the ZigBee standard. The crosscut hierarchical has a nice character that it is adapted to ZigBee. Simulation results show that the crosscut hierarchical routing algorithm saves more than 20 percent of the hop count compared with the ZigBee hierarchical routing.