Abstract
A wireless sensor network is a network consisting of wireless sensor nodes. There are usually requirements that need to be met when deploying a wireless sensor network, one being the placement of nodes. Due to placement requirements and limited node transmission range, a network might be partitioned initially. Therefore, additional relay nodes are added to the network to form an interconnected network. In this article, the minimum relay nodes placement problem in wireless sensor networks is addressed. This problem addresses the placement of relay nodes: the minimum number needed and where the nodes should be placed. The problem is formulated as a Steiner tree problem with minimum Steiner points and a bounded edge length problem, which is NP-hard. In this article, we present a variable-dimension meta-heuristic based on particle swarm optimization called multi-space particle swarm optimization to address the problem. We tested multi-space particle swarm optimization using randomly generated instances of the Steiner tree problem with minimum Steiner points and a bounded edge length problem of varying sizes and found that multi-space particle swarm optimization is effective in addressing the Steiner tree problem with minimum Steiner points and a bounded edge length problem.
Highlights
Wireless sensor nodes are programmable sensors that are usually battery-powered and capable of simple data processing and communicating with each other through wireless links to form a wireless sensor network (WSN)
To demonstrate the feasibility of the proposed method, we generate random instances of the STP-MSPBEL problem, use our program to obtain approximate solutions to these instances, and compare our results with those obtained by the minimum spanning tree (MST) heuristic and approximation algorithm
Instance Number of relay nodes in the solution obtained by our program Number of relay nodes in the solution obtained by the MST heuristic Number of relay nodes in the solution obtained by the approximation algorithm Improvement Number of anchor Steiner points by our program Runtime of our program Runtime of the MST heuristic Runtime of the approximation algorithm Runtime improvement
Summary
Wireless sensor nodes are programmable sensors that are usually battery-powered and capable of simple data processing and communicating with each other through wireless links to form a wireless sensor network (WSN). In constrained placement, relay nodes are to be placed only at certain locations Both versions of the problem find their uses in different applications. We consider the unconstrained MRP problem in 2D WSNs and attempt to solve the problem with a novel meta-heuristic based on particle swarm optimization (PSO).. Our contributions are as follows: First, a variable-dimension meta-heuristic based on PSO called the multi-space particle swarm optimization (MSPSO) is proposed for use in problems where candidate solutions (for an instance of the problem to be solved) could be of different lengths (having different numbers of dimensions). To the best of our knowledge, this is the first article to discuss the variable length property for candidate solutions of an instance of the STP-MSPBEL problem, transform the problem into the dual problem, and solve it (the primal problem) using a PSO-inspired optimization method.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callMore From: International Journal of Distributed Sensor Networks
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
