Optimizing Routing Paths using Path Quality and Distance for Zigbee based Wireless Networks

Abstract

Neighbour Table based shortcut tree routing protocol provides the near optimal routing path as well as
maintains the advantages of the ZigBee tree routing such as no route discovery overhead and low memory consumption.
However, the route discovery is only on basis of Distance between Nodes; thus, it cannot provide optimized paths. Here,
the concept of path quality parameter between Source and Destination nodes is added along with the distance parameter
to calculate the shortest path between source and destination. Where the parameter Path quality will depend upon busy
factor of intermediate nodes from source to destination, higher the traffic at intermediate nodes, busy will be the nodes
due to which lesser the path quality parameter and vice versa. Cost will be calculated for paths which is function of
Distance and Path Quality parameter between source and destination nodes i.e cost = f(d,q), this is the concept proposed
in OPTIMIZING ROUTING PATHS USING PATH QUALITY AND DISTANCE FOR ZIGBEE BASED WIRELESS
NETWORK.