The Repair Strategy for Event Coverage Holes Based on Mobile Robots in Wireless Sensor and Robot Networks

Abstract

In the application of the wireless sensor and robot networks (WSRNs), there is an urgent need to accommodate flexible surveillance tasks in intricate surveillance scenarios. On the condition of flexible surveillance missions and demands, event coverage holes occur in the networks. The conventional network repair methods based on the geometric graph theory such as Voronoi diagram method are unable to meet the conditions of flexible surveillance tasks and severe multi-restraint scenarios. Mobile robots show obvious advantages in terms of adaptation capacity and mobility in hazardous and severe scenarios. First, we propose an event coverage hole healing model for multi-constrained scenarios. Then, we propose a joint event coverage hole repair algorithm (JECHR) on the basis of global repair and local repair to apply mobile robots to heal event coverage holes in WSRNs. Different from conventional healing methods, the proposed algorithm can heal event coverage holes efficaciously which are resulted from changing surveillance demands and scenarios. The JECHR algorithm can provide an optimal repair method, which is able to adapt different kinds of severe multi-constrained circumstances. Finally, a large number of repair simulation experiments verify the performance of the JECHR algorithm which can be adapted to a variety of intricate surveillance tasks and application scenarios.

A Comprehensive Review of Coverage Path Planning in Robotics Using Classical and Heuristic Algorithms

“…The algorithm transforms the weed individuals into a positive integer by an encoder to reform its population (the set of all weeds) to solve TSP problems [266]. Ghalenoei et al [267] employed the discrete IWO algorithm in a centralized manner for multiple task assignments, resulting in less computation time relative to GA. Zhuang et al [268] presented the local and global coverage holes' detection and healing in the wireless sensor by using IWO and DE algorithms. Sandamurthy and Ramanujam [269] proposed the CPP based on a discrete IWO algorithm with an improved 2-Opt operator for harvesting robots.…”

High-Gain Omnidirectional Dual-Polarized Antenna for Sink Nodes in Wireless Sensor Networks

“…The dramatically booming requirement of wireless sensor networks (WSN) demand more sensor nodes with sensing ability for different applications, such as ecological monitoring, health surveillance, and traffic control [ 1 , 2 , 3 , 4 ]. To ensure the stability of a reception link from plenty of the sensor nodes, high-performance antennas with high gains, orthogonal polarizations, and omnidirectional coverage are required in sink nodes.…”