Solving Isolated Nodes Problem in ZigBee Pro for Wireless Sensor Networks

Wireless sensor network based on the ZigBee protocol consists of many sensor devices. In some cases, the sensor nodes may turn to isolated node because random distribution, particularly when creating the network. In this research was suggested two cases to overcome on the isolated node problem, the first case had able to overcome this problem by distributing the isolated nodes on the router nodes that carry the least number of sensor nodes, it helps to minimize the computational overhead on router nodes too, while the second one is able to overcome this problem by calculating the distance between the isolated nodes and the routers and then adds these nodes to the nearest routers. Subsequently, this method helps to minimize the energy consumption. The results show our approach able to solve the problem of isolated nodes using these two methods and when compared between them turns out the second method is better In terms of energy consumption. In addition, we are able to make the network larger scale

무선 센서 네트워크에서 에너지 효율적인 자가 치료 연구

학위논문 (석사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2015. 8. 이용환.One of key issues in the construction of wireless sensor network (WSN) is how efficiently sensor nodes re-subscribe to the network after networking failure. ZigBee has been considered as an attractive solution for the construction of cluster-tree structured WSNs due to its low-power and low-complexity features. However, it may be able to re-subscribes to the network through network rejoining which may require for large signaling overhead and time delay. In this thesis, we consider the design of a cluster-wise self-healing (CS) in a beacon-enabled cluster-tree structured WSN. When a router experience networking failure from its parent node, the proposed CS makes it maintain synchronization with its child nodes, preventing from orphan propagation to its child nodes. Meanwhile, it makes only the orphaned router initiate the re-subscription to the network on behalf of its child nodes. Thus, the proposed CS allows the network re-subscription through one re-subscription process of the orphaned cluster head, significantly reducing the recovery time and energy consumption for the recovery as well. We also design a backup link-aided self-healing (BL) where nodes select a parent node for the network subscription and also a back-up parent node for network re-subscription. The proposed BL can reduce the recovery time since it can minimizes the process for the selection of a new parent node and associated message exchanges for network re-subscription. Computer simulation and experimental results show that the proposed schemes can significantly reduce the energy consumption, recovery time and signaling overhead for network re-subscription.Abstract Contents List of Figures List of Tables 1. Introduction 2. System model 3. Previous works 3.1. Self-healing in ZigBee 3.2. Efficient self-healing process (ESP) 4. Proposed self-healing 4.1. Energy-efficient neighbor scan 4.2. Cluster-wise self-healing (CS) 4.3. Backup link aided self-healing (BL) 4.4. Messages for the proposed self-healing 5. Performance evaluation 6. Conclusions References 초 록Maste

An Efficient Addressing Scheme and Its Routing Algorithm for a Large-Scale Wireless Sensor Network

<p>Abstract</p> <p>So far, various addressing and routing algorithms have been extensively studied for wireless sensor networks (WSNs), but many of them were limited to cover less than hundreds of sensor nodes. It is largely due to stringent requirements for fully distributed coordination among sensor nodes, leading to the wasteful use of available address space. As there is a growing need for a large-scale WSN, it will be extremely challenging to support more than thousands of nodes, using existing standard bodies. Moreover, it is highly unlikely to change the existing standards, primarily due to backward compatibility issue. In response, we propose an elegant addressing scheme and its routing algorithm. While maintaining the existing address scheme, it tackles the wastage problem and achieves no additional memory storage during a routing. We also present an adaptive routing algorithm for location-aware applications, using our addressing scheme. Through a series of simulations, we prove that our approach can achieve two times lesser routing time than the existing standard in a ZigBee network.</p

An Efficient Addressing Scheme and Its Routing Algorithm for a Large-Scale Wireless Sensor Network

So far, various addressing and routing algorithms have been extensively studied for wireless sensor networks (WSNs), but many of them were limited to cover less than hundreds of sensor nodes. It is largely due to stringent requirements for fully distributed coordination among sensor nodes, leading to the wasteful use of available address space. As there is a growing need for a large-scale WSN, it will be extremely challenging to support more than thousands of nodes, using existing standard bodies. Moreover, it is highly unlikely to change the existing standards, primarily due to backward compatibility issue. In response, we propose an elegant addressing scheme and its routing algorithm. While maintaining the existing address scheme, it tackles the wastage problem and achieves no additional memory storage during a routing. We also present an adaptive routing algorithm for location-aware applications, using our addressing scheme. Through a series of simulations, we prove that our approach can achieve two times lesser routing time than the existing standard in a ZigBee network