An optimization-based approach for connecting partitioned mobile sensor/Actuator Networks

Abstract

Abstract-Wireless Sensor and Actuator Networks (WSANs) employ mobile nodes in addition to stationary tiny sensors. Similarly, mobile sensors make it possible to have the flexibility of mobility in mobile sensor network (MSN) applications. Mobility can be exploited to connect partitioned WSANs and MSNs due to large scale damages or deployment problems. However, since mobility consume significant energy and it can be limited due to terrain constraints, the travel distance for the mobile nodes should be minimized in such a recovery effort. In this paper, we present a mathematical model which minimizes the total travel distance for connecting a given number of partitions. The idea is based on network flows and the problem is modeled as a mixed integer nonlinear program. The nonlinear terms in the model are linearized using a polygon approximation for computational efficiency. We evaluated the performance of the proposed approach in terms of total distance as well as the time to reconnect the partitions. The results show that our approach outperforms the heuristic approach in terms of total distance and delay and reveals various trade-offs involved in connecting multiple partitions.

Obstacle-Avoiding Connectivity Restoration based on Node’S Movement and Deploying New Relay Node in Disjoint Mobile Sensor Networks

“…In Literature [5], Abbasi focuses on movement-assisted connectivity restoration in WSANs, and presents a Distributed Actor Recovery Algorithm (DARA), which opts to efficiently restore the connectivity of the inter-actor network that has been affected by the failure of an actor. In literature [10], a mathematical model that minimizes the total travel distance for connecting a given number of partitions is proposed. B. Obstacle-Avoiding…”

“…In this section, we evaluate and analyze our proposed heuristic algorithm, OACRNMDR, and compared it with the optimal solution OBA to minimize the total travel distance for connecting a given number of partitions until now in literature [10] and the CPANMCR and OACRPANM algorithm proposed in literature [14] and [15].…”

An online approach for wireless network repair in partially-known environments

“…Several papers consider the use of mobile actor nodes in network restoration, e.g. [6], [7], [8], [9], [10], [11], [12], [13], [14]. The papers assume that all sensors are connected and propose different strategies to choose the moving actors, for example, based on estimating the shortest moving distance and/or degree of connectivity to achieve goals of connectivity or coverage for the actor network (an overlay network of all actors).…”

Multi-objective hierarchical algorithms for restoring Wireless Sensor Network connectivity in known environments

“…Several papers consider the use of mobile actor nodes in network restoration, e.g. [9], [10], [11], [12], [13], [14], [15], [16], [17]. The papers work on the Wireless Sensor and Actor Network with the assumption that all the sensors are connected and the work is to propose different strategies to choose the moving actors, for example, based on estimating the shortest moving distance and/or degree of connectivity to achieve goals of connectivity or coverage for the actor network (an overlay network of all actors).…”