Improving Selfish Node Detection in ZigBee Wireless Network with Shortcut Tree Routing?

The ZigBee tree routing and Bluetooth is used in many resources, limited devices and applications. ZigBee tree routing is not requiring any routing table and route discovery cost to send a packet to the destination. But, the ZigBee tree routing has the basic limitation that a packet follows the tree topology. So ZigBee tree routing is cannot provide the correct routing path. In this project work, a shortcut tree routing protocol is proposed that offering the near advantageous routing path and as well as maintains the advantages of the ZigBee tree routing such as no route discovery overhead and low memory consumption. The key idea of the shortcut tree routing is to calculate remaining hops from an arbitrary source to the destination using the hierarchical addressing scheme in ZigBee. Each source or intermediate node forwards a packet to the neighbour node with the Slight remaining hops in its neighbour table. The shortcut tree routing is completely distributed and compatible with ZigBee standard in that it only using the addressing scheme and neighbour table without any changes of the specification. The mathematical analysis proves that the 1- hop neighbour information improves overall network performance by providing an efficient routing path and distributing the traffic load concentrated on the tree links. The efficient performance rating, it shows that the shortcut tree routing achieves better to performance compared to Ad Hoc On Demand Distance Vector with limited overhead of neighbour table maintenance as well as overwhelms the ZigBee tree routing in all the network conditions such as network density, network Structures, traffic type and the network traffic.