Abstract
The problem of finding the number and optimal positions of relay nodes for restoring the network connectivity in partitioned Wireless Sensor Networks (WSNs) is Non-deterministic Polynomial-time hard (NP-hard) and thus heuristic methods are preferred to solve it. This paper proposes a novel polynomial time heuristic algorithm, namely, Relay Placement using Space Network Coding (RPSNC), to solve this problem, where Space Network Coding, also called Space Information Flow (SIF), is a new research paradigm that studies network coding in Euclidean space, in which extra relay nodes can be introduced to reduce the cost of communication. Unlike contemporary schemes that are often based on Minimum Spanning Tree (MST), Euclidean Steiner Minimal Tree (ESMT) or a combination of MST with ESMT, RPSNC is a new min-cost multicast space network coding approach that combines Delaunay triangulation and non-uniform partitioning techniques for generating a number of candidate relay nodes, and then linear programming is applied for choosing the optimal relay nodes and computing their connection links with terminals. Subsequently, an equilibrium method is used to refine the locations of the optimal relay nodes, by moving them to balanced positions. RPSNC can adapt to any density distribution of relay nodes and terminals, as well as any density distribution of terminals. The performance and complexity of RPSNC are analyzed and its performance is validated through simulation experiments.
Highlights
Recent years have witnessed a massive growth in the use of Wireless Sensor Networks (WSNs) in numerous applications, especially those operating in hostile environments such as space exploration, disaster management, search and rescue, and battlefield surveillance [1]
Unlike most existing works that are based on Minimum Spanning Tree (MST) or Euclidean Steiner Minimal Tree (ESMT), we propose a new polynomial time min-cost multicast Relay Placement algorithm based on Space Network Coding (RPSNC) that optimally solves the problem of restoring the network connectivity for the special case of three terminals and strives to minimize the number of relay nodes required for restoring the connectivity for larger networks using Delaunay triangulation, non-uniform partitioning and linear programming techniques
Our work is different from the above works in a significant aspect: we introduce a new min-cost multicast space network coding approach that aims to solve the problem of restoring the network connectivity in partitioned WSNs
Summary
Recent years have witnessed a massive growth in the use of Wireless Sensor Networks (WSNs) in numerous applications, especially those operating in hostile environments such as space exploration, disaster management, search and rescue, and battlefield surveillance [1]. We propose a novel relay nodes placement strategy based on space network coding that minimizes the number of required relay nodes to restore the connectivity of a partitioned WSN. Unlike most existing works that are based on MST or ESMT, we propose a new polynomial time min-cost multicast Relay Placement algorithm based on Space Network Coding (RPSNC) that optimally solves the problem of restoring the network connectivity for the special case of three terminals and strives to minimize the number of relay nodes required for restoring the connectivity for larger networks using Delaunay triangulation, non-uniform partitioning and linear programming techniques. To the best of our knowledge, this is the first work to propose a min-cost multicast space network coding based algorithm for connectivity restoration in WSNs. RPSNC first selects one representative sensor node in each partition and sets it as a terminal.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
