Distributed coverage hole detection and recovery scheme for heterogeneous wireless sensor networks

Repairing Confident Information Coverage Holes for Big Data Collection in Large-Scale Heterogeneous Wireless Sensor Networks

“…In this paper, we only consider the heterogeneity of the velocity of the data transmitted by sensor nodes in the LS-HWSN. Nearly existing literatures only explored heterogeneities such as communication range, sensing range and residual energy [14], [15], [30], but did not consider the important heterogeneity that is the velocity of the data transmitted by sensor nodes. Then, the procedure of healing CICHs can be described as follows:…”

“…Compared with traditional small-scale WSNs, the sensing area of is set as a circle of diameter 1500 m, and expands the scale to 3600 stationary sensor nodes and 2700 mobile sensor nodes which are randomly scattered. Considering the (10) end if (11) if m j has not joined in a RCICHC (12) m j joins in c i ∈ C for repairing h i (13) m j stores ϕ h i , m j as ϕ (14) else if m j has joined in a RCICHC (15) if ϕ h i , m j is greater than ϕ stored by m j (16) m j cancels to join the previous RCICHC (17) m j joins in c i for repairing h i (18) m j stores ϕ h i , m j as the ϕ (19) end if (20) end if (21) end if (22) end for (23) end for (24) each m j broadcasts the information (25) each m j that has the optimal repairing benefit in c i moves to repair h i and broadcasts its info at regular intervals heterogeneity of the transmitted data velocity of sensor nodes, the transmitted data velocity is set to be between 300 and 600 kbps. We set communication time of each sensor node to 0.01 second (one round) and the interval time of working rounds to 1 second (one round).…”

“…Based on the energy-balanced concept, the work in [13] efficiently schedules mobile sensor nodes to acquire the energy-efficient traveling paths in WSNs. On the other hand, few studies aimed to avoid coverage holes produced by small-scale HWSNs [14], [15]. Based on a circle packing technique and virtual forces among sensor nodes, the work [14] develops two distributed algorithms to maximize the network coverage.…”

“…Based on a circle packing technique and virtual forces among sensor nodes, the work [14] develops two distributed algorithms to maximize the network coverage. In [15], utilizing the collaboration of sensor nodes, authors presented a new scheme to detect and fix coverage holes. In addition, some literatures [16]- [22] present other concepts to eliminate coverage holes in recent years.…”

Effective data routing using mobile sinks in disjoint mobile wireless sensor networks

“…As a result, the coverage may be marginal as compared to the requirements of application and could remain true no matter the count of deployed WSN nodes. Therefore, it is required to make use of mobile nodes that are capable to move to required positions so as to ensure the desired area coverage [4][5][6].…”