Performance Investigation of Wireless Sensor Network for Long Distance Overhead Power Lines; Mica2 Motes, a Case Study

Author(s):  
Sibukele Gumbo ◽  
Hippolyte N. Muyingi
2019 ◽  
Vol 12 (2) ◽  
pp. 204-216
Author(s):  
Yi Wang ◽  
Paul R. Weckler ◽  
Bei Liu ◽  
Haixin Zhang ◽  
Yuting Zhao ◽  
...  

2018 ◽  
Vol 14 (11) ◽  
pp. 117
Author(s):  
Bo Qiu

To realize the design of mobile 4G gateway of ZigBee wireless sensor network (WSN), a scheme of wireless remote monitoring based on ZigBee and general packet radio service (GPRS) WSN gateway system is proposed. The scheme combines the advantages of short distance, low power consumption, low cost and long distance popular communication of ZigBee technology, and uses the system architecture of ZigBee + GPRS + Android. On this hardware platform, the transplantation of Android system and the development of related hardware device drivers are designed and implemented, so as to build the software platform of the system. Based on the software and hardware platform of the system, the related applications are designed and realized according to the function requirements of the system, and the software and hardware platform and the application program are tested and analyzed. The test results show that the system runs steadily and has good performance. To sum up, the hardware platform has the advantages of low energy consumption, high performance and scalability.


2013 ◽  
Vol 13 (4) ◽  
pp. 200-205 ◽  
Author(s):  
Wang Tong ◽  
Wu Jiyi ◽  
Xu He ◽  
Zhu Jinghua ◽  
Charles Munyabugingo

In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the “hot spot” problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node’s position and node’s remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime


Sign in / Sign up

Export Citation Format

Share Document