ZigBee Tree Routing Research Articles

ZigBee Healthcare Monitoring System for Ambient Assisted Living Environments

Healthcare Monitoring Systems (HMSs) are promising to monitor patients in hospitals and elderly people living in Ambient Assisted Living environments using Wireless Sensor Networks. HMSs assist in monitoring chronic diseases such as Heart Attacks, High Blood Pressure and other cardiovascular diseases. Wearable and implanted devices are types of Body sensors that collect human health related data. Collected data is sent over Personal Area Networks (PANs). However, PANs are facing the challenge of increasing network traffic due to the increased number of IP-enabled devices connected in Healthcare Monitoring Systems to assist patients. ZigBee technology is an IEEE 802.15.4 standard designed to address network traffic issues in PANs. To route traffic, ZigBee network use ZigBee Tree Routing (ZTR) protocol. ZTR however suffers a challenge of network latency caused by end to end delay during packet forwarding. This paper is proposing a New Tree Routing Protocol (NTRP) for Healthcare Monitoring Systems to collect Heart Rate signals. NTRP uses Kruskal’s minimum spanning tree to find shortest routes on a ZigBee network which improves ZTR. Neighbor tables are implemented in NTRP instead of parent–child mechanism implemented in ZTR. To reduce end to end delay, NTRP groups’ nodes into clusters and the cluster heads use neighbor tables to forward heart rate data to the destination node. NS-2 simulation tool is used to evaluate NTRP performance.

Enhanced STR based geographic location in ZigBee wireless networks: a hybrid PSACO method

ABSTRACT In many resource-limited devices, ZigBee tree routing is widely utilised as it does not need any route discovery and routing table overhead through send a packet of destination. Therefore, packet follows a tree topology; thus, it may not give optimal routing path. This is fundamental limitation of ZigBee tree routing. This manuscript, establishes an enhanced shortcut tree routing-based geographic location (ESTRBGL) protocol, which implements close optimal routing path and obtain ZigBee tree routing benefits like less memory consumption as well as no discovery overhead route. The proposed routing algorithm is a combination of particle swarm optimisation (PSO) as well as ant colony optimisation (ACO) algorithm, named PSACO. Initially, for finding optimal routing path the ZTR has certain network issues like detour route as well as concentrated traffic impact, since rectify to establish ESTRBGL. Simulation outcomes display that established method extensively improves diverse network performance depend on throughput, packet delivery ratio, residual energy, delay as well as energy consumption. The results shows that proposed routing method has better throughput of 2.66%, 1.73%, 4.01%, 20.83%, 20.61%, and 95.71%, 95.88%, 95.89%, 95.88%, 95.90%, while comparing with Opportunistic Shortcut Tree Routing (OSTR) as well as Directional Opportunistic Shortcut Tree Routing (DOSTR).

An Energy Model Using Sleeping Algorithms for Wireless Sensor Networks under Proactive and Reactive Protocols: A Performance Evaluation

The continuous evolution of the Internet of Things (IoT) makes it possible to connect everyday objects to networks in order to monitor physical and environmental conditions, which is made possible due to wireless sensor networks (WSN) that enable the transfer of data. However, it has also brought about many challenges that need to be addressed, such as excess energy consumption. Accordingly, this paper presents and analyzes wireless network energy models using five different communication protocols: Ad Hoc On-Demand Distance Vector (AODV), Multi-Parent Hierarchical (MPH), Dynamic Source Routing (DSR), Low Energy Adaptive Clustering Hierarchy (LEACH) and Zigbee Tree Routing (ZTR). First, a series of metrics are defined to establish a comparison and determine which protocol exhibits the best energy consumption performance. Then, simulations are performed and the results are compared with real scenarios. The energy analysis is conducted with three proposed sleeping algorithms: Modified Sleeping Crown (MSC), Timer Sleeping Algorithm (TSA), and Local Energy Information (LEI). Thereafter, the proposed algorithms are compared by virtue of two widely used wireless technologies, namely Zigbee and WiFi. Indeed, the results suggest that Zigbee has a better energy performance than WiFi, but less redundancy in the topology links, and this study favors the analysis with the simulation of protocols with different nature. The tested scenario is implemented into a university campus to show a real network running.

Wireless Sensor Network Energy Model and Its Use in the Optimization of Routing Protocols

In this study, a Wireless Sensor Network (WSN) energy model is proposed by defining the energy consumption at each node. Such a model calculates the energy at each node by estimating the energy of the main functions developed at sensing and transmitting data when running the routing protocol. These functions are related to wireless communications and measured and compared to the most relevant impact on an energy standpoint and performance metrics. The energy model is validated using a Texas Instruments CC2530 system-on-chip (SoC), as a proof-of-concept. The proposed energy model is then used to calculate the energy consumption of a Multi-Parent Hierarchical (MPH) routing protocol and five widely known network sensors routing protocols: Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), ZigBee Tree Routing (ZTR), Low Energy Adaptive Clustering Hierarchy (LEACH), and Power Efficient Gathering in Sensor Information Systems (PEGASIS). Experimental test-bed simulations were performed on a random layout topology with two collector nodes. Each node was running under different wireless technologies: Zigbee, Bluetooth Low Energy, and LoRa by WiFi. The objective of this work is to analyze the performance of the proposed energy model in routing protocols of diverse nature: reactive, proactive, hybrid and energy-aware. Experimental results show that the MPH routing protocol consumes 16%, 13%, and 5% less energy when compared to AODV, DSR, and ZTR, respectively; and it presents only 2% and 3% of greater energy consumption with respect to the energy-aware PEGASIS and LEACH protocols, respectively. The proposed model achieves a 97% accuracy compared to the actual performance of a network. Tests are performed to analyze the consumption of the main tasks of a node in a network.

Extended Multipath Routing in Zigbee which Improves Performance Parameters

As we know Wireless Sensor Network is the perfect solution for quick capturing, processing, and transmission of critical data. Sensor nodes are often deployed in a generous environment but nodes suffer from low battery power. So, energy efficiency and network life are the main concerns in WSN. ZigBee has low cost, low power consumption, and is beneficial in wireless sensor networks by selecting adequate communication protocol. Routing protocols like AODV (Ad- hoc on-demand distance vector routing), ZTR (ZigBee tree routing), and STR (Shortcut tree routing) and ESTR (Extended Shortcut tree routing) are compared on the idea of various performance metrics like the end to finish delay, routing overload, throughput, packet delivery ratio (PDR). The mathematical analysis and performance evaluation shows that ESTR achieves better performance as compared to other routing protocols. The overall evaluation shows that ESTR achieves better performance as compared to other routing protocols. But there are some limitations to the ESTR method. The performance of the packet delivery ratio of STR is less as compared to AODV. The performance of end to finish delay of STR is poor as compared to AODV. Extended STR is proposed to represent the new ZigBee network routing protocol with the improved performance of the Packet Delivery ratio (PDR) and delay against STR and AODV. We are introducing here Efficient Extended Shortcut Tree Routing method (ESTR) for further improvement of delays of the ESTR method.

Survey on Performance of Multipath Routing Protocol in Wireless Sensor Network

As we know Wireless Sensor Network is the perfect solution for quick capturing, processing and transmission of critical data. Sensor nodes are often deployed in generous environment but nodes suffer from low battery power. So, energy efficiency and network life are main concerns in WSN. Zig Bee have low cost, low power consumption and is beneficial in wireless sensor networks by selecting adequate communication protocol. Routing protocols like AODV (Ad- hoc on demand distance vector routing), ZTR (Zig Bee tree routing), and STR (Shortcut tree routing) and ESTR (Extended Shortcut tree routing) are compared on the idea of various performance metrics like end to finish delay, routing overload, throughput, packet delivery ratio (PDR). The mathematical analysis and performance evaluation shows that ESTR achieves better performance as compared to other routing protocols. The overall evaluation shows that ESTR achieves better performance as compared to other routing protocols. But there are some limitations of ESTR method. Performance of packet delivery ratio of STR is less as compared to AODV. Performance of end to end delay of STR is poor as compared to AODV. Extended STR is proposed to represent new ZigBee network routing protocol with improved performance of Packet Delivery ratio (PDR) and delay against STR and AODV. We are introducing here Efficient Extended Shortcut Tree Routing method (ESTR) for further improvement of delays of ESTR method.

ZigBee Healthcare Monitoring System for Ambient Assisted Living Environments

Healthcare Monitoring Systems (HMSs) are promising to monitor patients in hospitals and elderly people living in Ambient Assisted Living environments using Wireless Sensor Networks. HMSs assist in monitoring chronic diseases such as Heart Attacks, High Blood Pressure and other cardiovascular diseases. Wearable and implanted devices are types of Body sensors that collect human health related data. Collected data is sent over Personal Area Networks (PANs). However, PANs are facing the challenge of increasing network traffic due to the increased number of IP-enabled devices connected in Healthcare Monitoring Systems to assist patients. ZigBee technology is an IEEE 802.15.4 standard designed to address network traffic issues in PANs. To route traffic, ZigBee network use ZigBee Tree Routing (ZTR) protocol. ZTR however suffers a challenge of network latency caused by end to end delay during packet forwarding. This paper is proposing a New Tree Routing Protocol (NTRP) for Healthcare Monitoring Systems to collect Heart Rate signals. NTRP uses Kruskal’s minimum spanning tree to find shortest routes on a ZigBee network which improves ZTR. Neighbor tables are implemented in NTRP instead of parent–child mechanism implemented in ZTR. To reduce end to end delay, NTRP groups’ nodes into clusters and the cluster heads use neighbor tables to forward heart rate data to the destination node. NS-2 simulation tool is used to evaluate NTRP performance.

Opportunistic Shortcut Tree Routing in ZigBee Networks

The shortcut tree routing has been proposed to provide near optimal routing path as well as maintaining the advantages of the ZigBee tree routing, such as resource-free multi-hop routing capability. However, in spite of the efforts to provide an efficient and reliable protocol, the unicast routing itself has the fundamental limitation in wireless environment due to lossy, time-varying, and broadcast nature of wireless medium. For example, even one lossy link on a path may result in the failure of end-to-end packet delivery in wireless network environment. In this paper, we propose the opportunistic shortcut tree routing that combines the shortcut tree routing and the opportunistic routing. Instead of specifying a next hop node, the opportunistic shortcut tree routing allows the receiving nodes to compete to forward a packet with the priority of remaining hops. Since it has inherited advantages of both routing protocols, it can provide reliable packet delivery service without any resources for multi-hop routing and forwarder candidate selection for opportunistic routing. The performance evaluation proves that the opportunistic approach significantly enhances diverse network performances, while suppressing duplicate forwarding effectively with a metric of the remaining hops and the one-hop neighbor table.

Extended shortcut tree routing for ZigBee based wireless sensor network

Energy efficiency and network lifetime are main concerns in WSN. In order to improve these factors ZigBee plays an important role. Low cost, low data rate features of ZigBee results in low power consumption and makes it useful in wireless sensor networks, increasing life of small batteries of nodes in the network. Since tree routing in ZigBee does not require any routing tables to send the packet to the destination, it can be used in ZigBee end devices that have limited resources. Routing protocols such as AODV (Ad-hoc on demand distance vector routing), ZTR (ZigBee tree routing), and STR (Shortcut tree routing) are compared on the basis of different performance metrics (End to end delay, routing overload, throughput, packet delivery ratio). An extensive simulation in NS2 is carried out. The performance evaluation shows that STR achieves better performance as compared to other two routing protocols. But there are some limitations of the STR method. Performance of packet delivery ratio of STR is less as compared to AODV. Performance of end to end delay of STR is poor as compared to AODV. Hence ESTR is proposed. The main aim of proposed ESTR [Extended STR] is to present new ZigBee network routing protocol with goal of improving the performance of ESTR in terms of PDR and delay against STR and AODV.

Efficient Routing in Zigbee Wireless Network using Shortcut Tree Routing

Zigbee Tree Routing, which doesn‟t need any routing table/route discovery overhead is used in several resource limited devices and applications. ZTR has a basic limitation regarding providing of optimal routing path as it follows tree topology, hence an optimal routing path can‟t be achieved. In this paper, we proposed a protocol stated as Shortcut Tree Routing (STR) similar to ZTR‟s entities, such as low memory consumption, no route discovery overhead, providing nearest optimal routing path using hierarchical addressing scheme and calculating the remaining hops from source to destination. The specifications are unaltered, as STR uses just the addressing scheme and neighbor table in association with the Zigbee standards. The research process illustrates the 1Hop neighbor communication representation upgrades the overall network performance execution by splitting up of the traffic load concentrated on the tree links. The performance evaluation indicates, STR accomplishes the performances of AODV and ZTR in certain conditions of it, such as network density, configurations and network traffic patterns.

English

Zigbee is Associate in Nursing communication customary that is intended for Associate in Nursing low rate wireless personal space network, it's less price, less complexness and low power consumption in mobile device. Among the zigbee topologies, tree topologies are appropriate for low power and low price detector network as a result of is supports for power saving operation and even for the sunshine weight routing. Zigbee tree routing is IEEE 802.15.4 customary that is employed in several resources, applications and even within the restricted device. Zigbee tree routing doesn't offer any routing table and route discovery to send the packet from supply to the destination. In Zigbee tree routing, packet follows the tree topology that because the basic limitation and it doesn't offer the optimal(correct) routing path to destination .In this paper ,we planned the road tree routing(STR) protocol to decrease the routing price of ZTR with facilitate of neighbor table and conjointly scale back the overhead. The most plan is by employing a hierarchic addressing theme, the road tree routing calculate the remaining hops from discretionary supply to destination. By victimization mathematically analysis, prove that the one hop neighbor info increase overall network performance by requiring the routing path expeditiously and distributing the traffic load targeting the tree links.

A Novel Shortcut Tree Routing Method Based on Load-balanced in ZigBee Wireless Sensor Networks

ZigBee Tree Routing has two major problems; the first problem is its more hop-counts as compared to the reactive routing and another one is the hotspot problem. In this paper, we propose an improved routing algorithm called Load-balanced Shortcut Tree Routing (LSTR) which utilizes the information of neighbors within two hops. In LSTR, the intermediate or source node can find the optimal next hop node which has the smallest remaining hop-count to the destination within its transmission range. In the process of data transmitting, node’s depth, node’s residual energy and energy threshold are taken into account. The simulation result shows that this algorithm can transmit data efficiently, balance the energy of network and prolong network’s lifetime.

On the MAC/network/energy performance evaluation of Wireless Sensor Networks: Contrasting MPH, AODV, DSR and ZTR routing protocols.

Wireless Sensor Networks deliver valuable information for long periods, then it is desirable to have optimum performance, reduced delays, low overhead, and reliable delivery of information. In this work, proposed metrics that influence energy consumption are used for a performance comparison among our proposed routing protocol, called Multi-Parent Hierarchical (MPH), the well-known protocols for sensor networks, Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Zigbee Tree Routing (ZTR), all of them working with the IEEE 802.15.4 MAC layer. Results show how some communication metrics affect performance, throughput, reliability and energy consumption. It can be concluded that MPH is an efficient protocol since it reaches the best performance against the other three protocols under evaluation, such as 19.3% reduction of packet retransmissions, 26.9% decrease of overhead, and 41.2% improvement on the capacity of the protocol for recovering the topology from failures with respect to AODV protocol. We implemented and tested MPH in a real network of 99 nodes during ten days and analyzed parameters as number of hops, connectivity and delay, in order to validate our simulator and obtain reliable results. Moreover, an energy model of CC2530 chip is proposed and used for simulations of the four aforementioned protocols, showing that MPH has 15.9% reduction of energy consumption with respect to AODV, 13.7% versus DSR, and 5% against ZTR.

Monitoring System in Pig Farm Based on Improved Zigbee Tree Routing Algorithm

In view of the fixed testing point and complex wiring in conventional piggery environment control, a new system based on wireless sensor network was designed. This system consisted of the control center with ARM-Linux, executing mechanism nodes and wireless sensor network containing the flexible sensor nodes which could be arbitrarily placed in piggery. In order to make reasonable use of the energy of Zigbee network and prolong the survival time, a improved zigbee tree routing algorithm was proposed. First of all, by analyzing the advantages and disadvantages of the Cluster-tree and AODVjr algorithm in the Zigbee protocol, the neighbor table was introduced into the improved algorithm. Secondly, the scope of the destination node was confirmed to control the radio range of the RREQ and prevented invalid RREQ flooding. Simulation results show that the improved algorithm optimized the overall energy consumption effectively, prolonged the time of the critical nodes, reduced the number of death nodes, balanced the network load and improved the overall performance of the network.

Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks

The ZigBee tree routing is widely used in many resource-limited devices and applications, since it does not require any routing table and route discovery overhead to send a packet to the destination. However, the ZigBee tree routing has the fundamental limitation that a packet follows the tree topology; thus, it cannot provide the optimal routing path. In this paper, we propose the shortcut tree routing (STR) protocol that 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. 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 mathematical analysis proves that the 1-hop neighbor information improves overall network performances by providing an efficient routing path and distributing the traffic load concentrated on the tree links. In the performance evaluation, we show that the shortcut tree routing achieves the comparable performance to AODV with limited overhead of neighbor table maintenance as well as overwhelms the ZigBee tree routing in all the network conditions such as network density, network configurations, traffic type, and the network traffic.

Multipath Extension of the ZigBee Tree Routing in Cluster-Tree Wireless Sensor Networks

Wireless Multimedia Sensor Networks (WMSNs) are one of the most challenging applications of WSN. They require large amounts of data to be transmitted with high reporting rates which consume an order of magnitude of resources, such as storage, computation, bandwidth, and energy. On the other hand, the ZigBee standard was originally specified for low data rate, low power consumption, and low cost wireless personal area networks (WPANs), making it suitable to WSN. However, handling high data rate applications, such as video surveillance in WPANs, is a challenge. Simultaneous multipath routing is one solution to increase the available bandwidth in a ZigBee network. In this paper, we proposed Z-MHTR (ZigBee Multipath Hierarchical Tree Routing), a node disjoint multipath routing extension of the ZigBee tree routing protocol in cluster-tree WSNs. Extensive simulations were performed and showed that the propsed multipath routing enhances application performance in terms of packet delivery ratio, end to end delay, and network lifetime even under heavy data rates.

ZigBee tree routing algorithm based on energy balance

Aiming at the problems of ZigBee tree routing algorithm that the routing may not be optimal and some nodes may use up all the energy because of heavy transmissions,an improved ZigBee tree routing algorithm based on energy balance was proposed.The neighbor table was introduced to make sure that the routing was locally optimal by considering the routing hops.At the same time,the residual energy of nodes was also considered to avoid selecting some nodes with low residual energy in routing selection.The simulation results show that the energy consumption was reduced efficiently,the problem of unbalanced load was resolved and the lifetime of the whole network was maximized in this improved algorithm.