Abstrait

Proactive Source Routing (PSR) In Shortcut Tree For Wireless Networks

S. Shabnam, T.Mohanraj

The main 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, and each source or intermediate node forwards a packet to the neighbor node with the smallest remaining hops in its neighbor table. The shortcut tree routing is fully distributed and compatible with ZigBee standard in that it only utilizes addressing scheme and neighbor table without any changes of the specification.The shortcut tree routing (STR) protocol provides the near optimal routing path as well as maintains the advantages of the ZigBee tree routing such as low memory consumption. There is a chance for high delay and low delivery ratio . In this paper, we propose a lightweight proactive source routing (PSR) protocol that can maintain more network topology information than distance vector (DV) routing to facilitate source routing. It increases the delivery ratio and reduce the delay. Tests using computer simulation in Network Simulator 2 (ns-2) indicate that the delay in PSR is only a fraction of the delay of STR protocols, and PSR yields better data transportation performance than the STR protocol.