Competitive Swarm Optimizer Based Gateway Deployment Algorithm in Cyber-Physical Systems

Wireless sensor network topology optimization is a highly important issue, and topology control through node selection can improve the efficiency of data forwarding, while saving energy and prolonging lifetime of the network. To address the problem of connecting a wireless sensor network to the Internet in cyber-physical systems, here we propose a geometric gateway deployment based on a competitive swarm optimizer algorithm. The particle swarm optimization (PSO) algorithm has a continuous search feature in the solution space, which makes it suitable for finding the geometric center of gateway deployment; however, its search mechanism is limited to the individual optimum (pbest) and the population optimum (gbest); thus, it easily falls into local optima. In order to improve the particle search mechanism and enhance the search efficiency of the algorithm, we introduce a new competitive swarm optimizer (CSO) algorithm. The CSO search algorithm is based on an inter-particle competition mechanism and can effectively avoid trapping of the population falling into a local optimum. With the improvement of an adaptive opposition-based search and its ability to dynamically parameter adjustments, this algorithm can maintain the diversity of the entire swarm to solve geometric K-center gateway deployment problems. The simulation results show that this CSO algorithm has a good global explorative ability as well as convergence speed and can improve the network quality of service (QoS) level of cyber-physical systems by obtaining a minimum network coverage radius. We also find that the CSO algorithm is more stable, robust and effective in solving the problem of geometric gateway deployment as compared to the PSO or Kmedoids algorithms.

[1]  Antonio Capone,et al.  The joint Gateway Placement and Spatial Reuse Problem in Wireless Mesh Networks , 2010, Comput. Networks.

[2]  J. Plesník On the computational complexity of centers locating in a graph , 1980 .

[3]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[4]  H. S. Wolff,et al.  iRun: Horizontal and Vertical Shape of a Region-Based Graph Compression , 2022, Sensors.

[5]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[6]  Jiawei Han,et al.  Mining sensor data in cyber-physical systems , 2014, Tsinghua Science and Technology.

[7]  Bing He,et al.  Optimizing deployment of Internet gateway in Wireless Mesh Networks , 2008, Comput. Commun..

[8]  Xiao Liu,et al.  A Trust-Based Adaptive Probability Marking and Storage Traceback Scheme for WSNs , 2016, Sensors.

[9]  Stephane Durocher,et al.  Algorithms, Theory , 2006 .

[10]  Shuqiang Huang,et al.  A Method of Geometric K-center Gateway Deployment of Wireless Mesh Networks: A Method of Geometric K-center Gateway Deployment of Wireless Mesh Networks , 2014 .

[11]  Chun-Cheng Lin,et al.  Adaptive router node placement with gateway positions and QoS constraints in dynamic wireless mesh networks , 2016, J. Netw. Comput. Appl..

[12]  Yaochu Jin,et al.  A Competitive Swarm Optimizer for Large Scale Optimization , 2015, IEEE Transactions on Cybernetics.

[13]  Yigal Bejerano Efficient integration of multihop wireless and wired networks with QoS constraints , 2004, IEEE/ACM Transactions on Networking.

[14]  Yang Li,et al.  SA-PSO based optimizing reader deployment in large-scale RFID Systems , 2015, J. Netw. Comput. Appl..

[15]  Vasilis Friderikos,et al.  Gateway selection and routing in wireless mesh networks , 2010, Comput. Networks.

[16]  Andrea Vinci,et al.  A Cyber-Physical System for Distributed Real-Time Control of Urban Drainage Networks in Smart Cities , 2014, IDCS.

[17]  Huang Shuqiang,et al.  Node Deployment Optimization of Wireless Network in Smart City , 2014 .

[18]  Minyi Guo,et al.  Joint Optimization of Lifetime and Transport Delay under Reliability Constraint Wireless Sensor Networks , 2016, IEEE Transactions on Parallel and Distributed Systems.

[19]  Der-Jiunn Deng,et al.  Router Node Placement With Service Priority in Wireless Mesh Networks Using Simulated Annealing With Momentum Terms , 2016, IEEE Systems Journal.

[20]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[21]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[22]  Jianzhong Li,et al.  Minimized Cost Gateway Deployment in Cyber-Physical Systems , 2015, Int. J. Distributed Sens. Networks.

[23]  Subramaniam Shamala,et al.  Zero-Degree algorithm for Internet GateWay placement in backbone wireless mesh networks , 2013, J. Netw. Comput. Appl..

[24]  Stephane Durocher,et al.  Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs , 2011, Comput. Geom..

[25]  Mianxiong Dong,et al.  PHACK: An Efficient Scheme for Selective Forwarding Attack Detection in WSNs , 2015, Sensors.