An Algorithm for Reconnecting Wireless Sensor Network Partitions

Abstract

Abstract. In a Wireless Sensor Network, sensor nodes may fail for several reasons and the network may split into two or more disconnected partitions. This may deteriorate or even nullify the usefulness and effectiveness of the network. Therefore, repairing partitions is a priority. In this paper we present a method to repair network partitions by using mobile nodes. By reasoning upon the degree of connectivity with neighbours, a mobile node finds the proper position where to stop in order to re-establish connectivity. Factors influencing the method performance are singled out and criteria for their selection are discussed. Simulations show that the proposed method is effective and efficient notwithstanding packet loss.

Efficient Routing Scheme for Mobile Wireless Sensor Networks using Hybrid multi-hop LEACH

“…MDC maximum residual energy LEACH creates clusters by the help of distributed algorithm where each node in the network must individually choose to become a cluster head or not using the probability of Pi [12]. The Pi node is computed utilizing the LEACH algorithm:…”

LEHP: Localized energy hole profiling in Wireless Sensor Networks

“…The common options are to reposition SNs [16]- [18] [22]- [24], to deploy redundant SNs that can be activated or added on demand [20] [21], increase the transmission range, or combinations [19]. These works are well suited to react on drop of connectivity or coverage resulting from failure of single SNs.…”

Optimized sink mobility for energy and delay efficient data collection in FWSNs

“…As a next step in the second stage for each of Ψ, Ψ 1 , and Ψ 2 , respectively, lines (13)(14)(15), RSA does the following: RSA starts performing new sequence evaluations looking for a better sequence solution as in previous evaluation where RSA was looking one step a head. However after each fragments-pair evaluation, the next fragments pair or new solution candidate, is derived from latest derived candidate so far ζ 2 , line 20.…”

“…The problem of fragmentation detection and fragment identification is beyond the scope of this paper. We assume that fragments are identified, in terms of location and shape, using any of the existing approaches in the literature [10], [11], [12], [13], and provided as an input.…”