Restoration Strategy Based on Optimal Relay Node Placement in Wireless Sensor Networks

Abstract

In wireless sensor networks (WSNs), connecting disjoint segments is significant for network restoration, especially in some mission critical applications. However, the variability of distances between disjoint segments has tremendous influence on relay nodes deployment. In fact, finding the optimal solution for connecting disjoint segments in terms of the number and positions of relay nodes is NP-hard. To address this issue, plenty of heuristics, such as STP-MSP (Cheng et al., 2008), MST-1tRN (Lloyd et al., 2007), and CORP (Lee and Younis, 2010) are deeply pursued. In this paper, we propose a distributed restoration algorithm based on optimal relay node placement (simply, ORNP). It aims at federating separated segments by populating the minimum number of relay nodes in a WSN that has suffered a significant damage. In addition, both of complexity and upper bound of the relay count for ORNP are explored. The simulation results show that ORNP performs better than STP-MSP, MST-1tRN, and CORP in terms of relay count and the connectivity of resulting topology.

Distributed Data Storage Strategy in Wireless Sensor Networks

“…For example, animal detect need frequently update for location tracking, and animal information is large with id, speed, location, direction, etc. In [10] they improve DCS method by index update to decrease traffic complexity. If the ratio of data/index is small as environment detect that we defined, the additional query forward cost will reduce network lifetime.…”

“…These researches neglect that WSNs can be configurable. In fact, after sensor nodes are dispersed into the sensing field, Wang's paper [10] can take advantage of the mobility of sensor nodes, or adding some sensor nodes to rebuild the structure of WSNs, so that the performance of wireless sensor networks can enhanced significantly. This is the placement problem in wireless sensor networks that we will focus on in this paper.…”

Intelligent On‐Demand Connectivity Restoration for Wireless Sensor Networks

“…A distributed restoration algorithm called ORNP (Optimal Relay Node Placement) proposed in [8] efficiently minimizes the relay node (RN) count while restoring the connectivity of segmented WSNs. ORNP makes use of Voronoi partition to subdivide the area of interest into clusters.…”

“…Calculate ( reng ( )) (5) if ( reng ( )) < threshold then (6) //Send energy alert message to neighboring nodes (Nbr j ) (7) energy alert (Nbr j ) (8) For each neighboring node Nbr j of n i (9) //Neighboring node will increase its transmission range (10) recovery offered (Nbr j ) (11) end if (12) if reng ( ) < threshold then (13) Send energy defficiency message to slave keeper (14) Send activity time message to master keeper (15) Send activity granted message from master keeper have sufficient energy, then the total number of iterations (best score) required to execute the algorithm is (n × E). If the number of slave keepers is s, then the total executions required will be {(n × E) × s}.…”

Remote System for Oil Spill Detection Based on ZigBee and GIS

“…Sun's paper [8] put forward the dynamic damage model for the offshore oil spill against the practical needs for the oil spill emergency due to the enormous damage of the marine oil spill accidents to the marine ecology environment, which was mainly on assessing the damage caused by oil spill. Comprehending the current achievements on the ecology damage of marine oil spill, the corresponding disaster loss evaluation formulas were constructed to realize the functions of loss evaluations on marine environment capability, marine ecology service and natural fishing.…”