scholarly journals Wireless Charging Deployment in Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (1) ◽  
pp. 201 ◽  
Author(s):  
Wei-Yu Lai ◽  
Tien-Ruey Hsiang

Charging schemes utilizing mobile wireless chargers can be applied to prolong the lifespan of a wireless sensor network. In considering charging schemes with mobile chargers, most current studies focus on charging each sensor from a single position, then optimizing the moving paths of the chargers. However, in reality, a wireless charger may charge the same sensor from several positions in its path. In this paper we consider this fact and seek to minimize both the number of charging locations and the total required charging time. Two charging plans are developed. The first plan considers the charging time required by each sensor and greedily selects the charging service positions. The second one is a two-phase plan, where the number of charging positions is first minimized, then minimum charging times are assigned to every position according to the charging requirements of the nearby sensors. This paper also corrects a problem neglected by some studies in minimizing the number of charging service positions and further provides a corresponding solution. Empirical studies show that compared with other minimal clique partition (MCP)-based methods, the proposed charging plan may save up to 60% in terms of both the number of charging positions and the total required charging time.

2011 ◽  
Vol 216 ◽  
pp. 617-620
Author(s):  
Xin Lian Zhou ◽  
Bin Xiao ◽  
Jing Liang Cheng

In mobile wireless sensor networks, sensor nodes may due to their own moves, energy loss, physical damage, errors and failures or other factors, will result the case of coverage holes, and then lead to inefficient network coverage. This paper designed a new algorithm based on clustering approach for mobile wireless sensor network, can monitor the network in real-time and repairing coverage holes quickly. Simulation results show that, the algorithm used in mobile wireless sensor network not only can achieve the desired uniformity of coverage, but also increase the coverage area, and better performance than the Virtual force algorithm(VFA) [1].


Author(s):  
Ewa Niewiadomska-Szynkiewicz ◽  
Michał Marks

Optimization Schemes For Wireless Sensor Network LocalizationMany applications of wireless sensor networks (WSN) require information about the geographical location of each sensor node. Self-organization and localization capabilities are one of the most important requirements in sensor networks. This paper provides an overview of centralized distance-based algorithms for estimating the positions of nodes in a sensor network. We discuss and compare three approaches: semidefinite programming, simulated annealing and two-phase stochastic optimization—a hybrid scheme that we have proposed. We analyze the properties of all listed methods and report the results of numerical tests. Particular attention is paid to our technique—the two-phase method—that uses a combination of trilateration, and stochastic optimization for performing sensor localization. We describe its performance in the case of centralized and distributed implementations.


Sign in / Sign up

Export Citation Format

Share Document