A STUDY OF ZIGBEE TECHNOLOGY

The zigbee communication is a communication technology to connect local wireless nodes and provides high stability and transfer rate due to data communication with low power. In the nodes away from coordinator in one PAN, the signal strength is weak causing the network a shortage of low performance and inefficient use of resources due to transferring delay and increasing delay time and thus cannot conduct seamless communication. This study suggests the grouping method, that makes it possible to perform wide range data transferring depending on the node signal strength in zigbee node and analyzes the suggested algorithm through simulation. Based on IEEE 802.15.4 Low Rate-Wireless Personal Area Network (LR-WPAN) standard, the Zigbee standard has been proposed to interconnect simple, low rate and battery powered wireless devices. The de-ployment of Zigbee networks is expected to facilitate numerous applications such as Home-appliance net-works, home healthcare, medical monitoring and environmental sensors. An effective routing scheme is more important for Zigbee mesh networks. In order to achieve effective routing in Zigbee Mesh networks, a Zigbee protocol module is realized using NS-2. The suitable routing for different data services in the Zigbee application layer and a best routing strategy for Zigbee mesh network are proposed. The ZigBee standard provides network, security, and application support services operating on top of the IEEE 802.15.4 Medium AccessControl (MAC) and Physical Layer wireless standard. It employs a group of technologies to enable scalable, self-organizing, self-healing networks that can manage various data traffic patterns. ZigBee is a low-cost, low-power, wireless mesh networking standard. The low costal lows the technologyto be widely deployed in wireless control and monitoring applications, the low power-usage allows longerlife with smaller batteries, and the mesh networking which promises high reliability and larger range. ZigBee has-been developed to meet the growing demand for capable wireless networking between numerous low power devices. The aims of this network are to reduce the energy consumption and latency by enhancing routing algorithm. In a traditional tree routing when a node wants to transmit a packet to the destination, the packet has to follow child/parent relationship and go along tree topology, even if the destination is lying at nearby source. In order to solve this problem, an Enhanced Tree Routing Algorithm is introduced using ZigBee network. This algorithm can find the shortest path by computing the routing cost for all of router that stored in neighbor table, and transmit the packet to the neighbor router that can reduce the hop count of transmission. The enhanced tree routing algorithm can achieve more stable and better efficiency then the previous traditional tree routing algorithm

Low Power, Low Delay: Opportunistic Routing meets Duty Cycling

Traditionally, routing in wireless sensor networks consists of two steps: First, the routing protocol selects a next hop, and, second, the MAC protocol waits for the intended destination to wake up and receive the data. This design makes it difficult to adapt to link dynamics and introduces delays while waiting for the next hop to wake up. In this paper we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. In a dutycycled setting, packets are addressed to sets of potential receivers and forwarded by the neighbor that wakes up first and successfully receives the packet. This reduces delay and energy consumption by utilizing all neighbors as potential forwarders. Furthermore, this increases resilience to wireless link dynamics by exploiting spatial diversity. Our results show that ORW reduces radio duty-cycles on average by 50% (up to 90% on individual nodes) and delays by 30% to 90% when compared to the state of the art

Identifying Design Requirements for Wireless Routing Link Metrics

In this paper, we identify and analyze the requirements to design a new routing link metric for wireless multihop networks. Considering these requirements, when a link metric is proposed, then both the design and implementation of the link metric with a routing protocol become easy. Secondly, the underlying network issues can easily be tackled. Thirdly, an appreciable performance of the network is guaranteed. Along with the existing implementation of three link metrics Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show that how the computational burden of a metric degrades the performance of the respective protocol and how a metric has to trade-off between different performance parameters