Wireless data transmission in ZigBee using indegree and throughput optimization

In this paper, data transfer is done using the ZigBee networks which is of low implementation cost. In the previous ZigBee network model, the tree topology was used to construct the wireless sensor network for delivering the data that utilized large amount of resources and caused delivery failures due to the node movement. Thus, we first review the `in degree' of nodes in traditional way and address packet loss by calculating capacity of nodes. Next, mobility and coverage problems are presented. Finally, we comment on many issues like complexity in order to simulate more interest in large unexplored areas.

[1]  J. Antonio García-Macías,et al.  An experimental analysis of Zigbee networks , 2008, 2008 33rd IEEE Conference on Local Computer Networks (LCN).

[2]  Cheng-Zhong Xu,et al.  Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks , 2010, IEEE Trans. Parallel Distributed Syst..

[3]  Jisheng Sui,et al.  Study on ZigBee network architecture and routing algorithm , 2010, 2010 2nd International Conference on Signal Processing Systems.

[4]  Wei-Ho Chung,et al.  Mobility-Robust Tree Construction in ZigBee Wireless Networks , 2011, 2011 IEEE International Conference on Communications (ICC).

[5]  Daeyoung Kim,et al.  Shortcut Tree Routing in ZigBee Networks , 2007, 2007 2nd International Symposium on Wireless Pervasive Computing.

[6]  Ling-Jyh Chen,et al.  An Evaluation Study of Mobility Support in ZigBee Networks , 2010, J. Signal Process. Syst..

[7]  Daeyoung Kim,et al.  Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[8]  Symeon Papavassiliou,et al.  A mobility‐based clustering approach to support mobility management and multicast routing in mobile ad‐hoc wireless networks , 2001, Int. J. Netw. Manag..