Relay Node Position Optimization in Complex Environment

Environment has an essential effect on the selection of relay node positions. Real application environment of Wireless Sensor Networks usually is complex and heterogeneous where wireless channel has different characteristics at different locations. In network deployment, the environment also constrains relay node locations. There are areas unfeasible for node deployment. This paper studies the relay node placement problem in such complex environment. Our target of relay node position optimization is to minimize the relay node number and improve network performance by optimizing route paths of sensor nodes. Heuristic operations for genetic algorithms are proposed to optimize relay node positions. Simulation results show that the relay nodes number of the proposed algorithm is less than that of 2-approximation Steiner tree algorithm and the route paths of selected relay nodes have almost the best cost among route paths of all feasible relay nodes.

[1]  Marc Parizeau,et al.  DEAP: evolutionary algorithms made easy , 2012, J. Mach. Learn. Res..

[2]  Abdellah Chehri,et al.  Link-Quality Measurement and Reporting in Wireless Sensor Networks , 2013, Sensors.

[3]  Wei Zhang,et al.  The Research of Wireless Sensor Network Channel Propagation Model in the Wild Environment , 2014, 2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing.

[4]  Pravin Varaiya,et al.  Optimal Placement of Relay Nodes for Energy Efficiency in Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[5]  Gang Wang,et al.  Relay Node Placement for Maximizing Network Lifetime in Wireless Sensor Networks , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.

[6]  Anis Koubaa,et al.  Radio link quality estimation in wireless sensor networks , 2012, ACM Trans. Sens. Networks.

[7]  Xiang Cao,et al.  Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  Ruoshui Liu,et al.  Relay node placement for Wireless Sensor Networks deployed in tunnels , 2010, 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications.

[9]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[10]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008 .

[11]  Alex Zelikovsky,et al.  Tighter Bounds for Graph Steiner Tree Approximation , 2005, SIAM J. Discret. Math..

[12]  Satyajayant Misra,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[13]  Satyajayant Misra,et al.  Constrained Relay Node Placement in Wireless Sensor Networks: Formulation and Approximations , 2010, IEEE/ACM Transactions on Networking.

[14]  Seung Ho Hong,et al.  Experimental investigation of the packet loss rate of wireless industrial networks in real industrial environments , 2015, 2015 IEEE International Conference on Information and Automation.

[15]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[16]  Joseph S. B. Mitchell,et al.  Improved Approximation Algorithms for Relay Placement , 2008, ESA.