Main Reference PaperNeighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks, IEEE Transactions on Parallel and Distributed Systems, March 2014.
  • This project proposed a method to solve the problem of ZigBee tree routing with the aim of achieving optimal path in ZigBee Networks. To provide the optimal path in ZigBee networks, proposed work implements Shortcut Tree Routing (STR). In STR, each node can find the optimal next hop node based on the remaining tree hops to the destination.

+ Description
  • This project proposed a method to solve the problem of ZigBee tree routing with the aim of achieving optimal path in ZigBee Networks. To provide the optimal path in ZigBee networks, proposed work implements Shortcut Tree Routing (STR). In STR, each node can find the optimal next hop node based on the remaining tree hops to the destination.

  • The aim of this project is to find the optimal routing path.

  • Low Route discovery overhead

  • Low memory consumption.

+ Aim & Objectives
  • The aim of this project is to find the optimal routing path.

  • Low Route discovery overhead

  • Low memory consumption.

  • A technique is contributed to improve the routing path efficiency in ZigBee Network.

+ Contribution
  • A technique is contributed to improve the routing path efficiency in ZigBee Network.

  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

+ Software Tools & Technologies
  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

  • B.E / B.Tech / M.E / M.Tech

+ Project Recommended For
  • B.E / B.Tech / M.E / M.Tech

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.