Zigbee Technology

This paper aims at presenting the concept of ZigBee, the name of a specification for a suite of high level communication protocols using small, low - power digital radios based on the IEEE802.15.4 - 2006 standard for wireless personal area networks (WPANs),such as wireless headphones connecting with cell phones via short - range radio. The technology is intended to be simpler and less expensive than other WPANs, such as Bluetooth. ZigBee is targeted at radio - frequency (RF) applications that require a low data rate, long battery life, and secure networking. The ZigBee communication is a communication technology to connect local wireless nodes and provides high stability an d 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 net work a shortage of low performance and inefficient use of resources due to transferring delay and increasing delay time and thus cannot conduct seamless communication

Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design heuristic protocols, and analyze their performance by simulations on networks generated randomly or obtained in practical measurements of some (usually small-size) wireless networks. %some library. Moreover, they often assume access to truly random sources, which is often not reasonable in case of wireless devices. In this work we use a formal framework to study the problem of broadcasting and its time complexity in any two dimensional Euclidean wireless network with uniform transmission powers. For the analysis, we consider two popular models of ad hoc networks based on the Signal-to-Interference-and-Noise Ratio (SINR): one with opportunistic links, and the other with randomly disturbed SINR. In the former model, we show that one of our algorithms accomplishes broadcasting in $O(D\log^2 n)$ rounds, where $n$ is the number of nodes and $D$ is the diameter of the network. If nodes know a priori the granularity $g$ of the network, i.e., the inverse of the maximum transmission range over the minimum distance between any two stations, a modification of this algorithm accomplishes broadcasting in $O(D\log g)$ rounds. Finally, we modify both algorithms to make them efficient in the latter model with randomly disturbed SINR, with only logarithmic growth of performance. Ours are the first provably efficient and well-scalable, under the two models, distributed deterministic solutions for the broadcast task.Comment: arXiv admin note: substantial text overlap with arXiv:1207.673