Local Optimum Algorithms for Self-Protection in Wireless Sensor Networks

Author(s):  
Jibin Cheng ◽  
Wenzhe Zhang ◽  
Jiwen Yang
2007 ◽  
Vol 3 (4) ◽  
pp. 20 ◽  
Author(s):  
Dan Wang ◽  
Qian Zhang ◽  
Jiangchuan Liu

2020 ◽  
Vol 16 (6) ◽  
pp. 155014772093274 ◽  
Author(s):  
Xiao-Xue Sun ◽  
Jeng-Shyang Pan ◽  
Shu-Chuan Chu ◽  
Pei Hu ◽  
Ai-Qing Tian

In modern times, swarm intelligence has played an increasingly important role in finding an optimal solution within a search range. This study comes up with a novel solution algorithm named QUasi-Affine TRansformation-Pigeon-Inspired Optimization Algorithm, which uses an evolutionary matrix in QUasi-Affine TRansformation Evolutionary Algorithm for the Pigeon-Inspired Optimization Algorithm that was designed using the homing behavior of pigeon. We abstract the pigeons into particles of no quality and improve the learning strategy of the particles. Having different update strategies, the particles get more scientific movement and space exploration on account of adopting the matrix of the QUasi-Affine TRansformation Evolutionary algorithm. It increases the versatility of the Pigeon-Inspired Optimization algorithm and makes the Pigeon-Inspired Optimization less simple. This new algorithm effectively improves the shortcoming that is liable to fall into local optimum. Under a number of benchmark functions, our algorithm exhibits good optimization performance. In wireless sensor networks, there are still some problems that need to be optimized, for example, the error of node positioning can be further reduced. Hence, we attempt to apply the proposed optimization algorithm in terms of positioning, that is, integrating the QUasi-Affine TRansformation-Pigeon-Inspired Optimization algorithm into the Distance Vector–Hop algorithm. Simultaneously, the algorithm verifies its optimization ability by node location. According to the experimental results, they demonstrate that it is more outstanding than the Pigeon-Inspired Optimization algorithm, the QUasi-Affine TRansformation Evolutionary algorithm, and particle swarm optimization algorithm. Furthermore, this algorithm shows up minor errors and embodies a much more accurate location.


2013 ◽  
Vol 846-847 ◽  
pp. 914-917
Author(s):  
Su Fen Yao ◽  
Jian Qiang Zhao

A strategy for controlling mobile nodes based on PSO algorithm with neighborhood disturbance was proposed for improving the network coverage rate in wireless sensor networks. The non-dominated sorting strategy was led into basic PSO algorithm to seek best particle and adaptive neighborhood disturbance operation was used to conquer the drawback of PSO falling into local optimum. Therefore, the effect of network coverage had been improved and the network energy consumption can be reduced.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Yang Liu ◽  
Jing Xiao ◽  
Chaoqun Li ◽  
Hu Qin ◽  
Jie Zhou

The application of industrial wireless sensor networks (IWSNs) frequently appears in modern industry, and it is usually to deploy a large quantity of sensor nodes in the monitoring area. This way of deployment improves the robustness of the IWSNs but introduces many redundant nodes, thereby increasing unnecessary overhead. The purpose of this paper is to increase the lifetime of IWSNs without changing the physical facilities and ensuring the coverage of sensors as much as possible. Therefore, we propose a quantum clone grey wolf optimization (QCGWO) algorithm, design a sensor duty cycle model (SDCM) based on real factory conditions, and use the QCGWO to optimize the SDCM. Specifically, QCGWO combines the concept of quantum computing and the clone operation for avoiding the algorithm from falling into a local optimum. Subsequently, we compare the proposed algorithm with the genetic algorithm (GA) and simulated annealing (SA) algorithm. The experimental results suggest that the lifetime of the IWSNs based on QCGWO is longer than that of GA and SA, and the convergence speed of QCGWO is also faster than that of GA and SA. In comparison with the traditional IWSN working mode, our model and algorithm can effectively prolong the lifetime of IWSNs, thus greatly reducing the maintenance cost without replacing sensor nodes in actual industrial production.


2011 ◽  
Vol 55-57 ◽  
pp. 1305-1309
Author(s):  
Zheng Yao ◽  
Zhao Hua Wang

Energy consumption is a critical problem in operation of wireless sensor networks. For the sake of avoiding the data abundance and balancing the energy consumption in wireless sensor networks, this paper makes a research on network nodes Optimization in wireless sensor network based on ant colony algorithm and WIA-PA protocol stack. The novel design improved on hardware and software to control consumption of the energy and used transition probability of ant colony algorithm from one node to the other to calculate and determine the optimal path of network node in traversal of these locations. The results of the examples show that this method has lower energy consumption, computational briefness and higher positioning accuracy; it can not easily run into the local optimum, and also be applied to other tracking of complex network systems.


2012 ◽  
Vol 17 (1-2) ◽  
pp. 33-46
Author(s):  
Bartosz Musznicki ◽  
Mikołaj Tomczak ◽  
Piotr Zwierzykowski

Abstract. Limited resources in Wireless Sensor Networks (WSNs) are the key concern that needs to be given a careful consideration when studying virtually any aspect of a sensor network. Therefore, energy demands and radio bandwidth utilization should be addressed, especially in one-to-many communication. It is evident that a need for centralized networkwide topology knowledge can jeopardize scarce energy resources of a sensor network. Thus, localized geographic multicast relies solely on locally available information about the position of current node, other nodes within the radio range and the location of destination group members. Greedy multicast routing procedures often transport messages along paths that may be far from being optimal. Therefore, Dijkstrabased Localized Energy-Efficient Multicast Algorithm (DLEMA) is presented, described with pseudocode, and discussed. DLEMA focuses on discovering energy shortest paths leading through nodes that provide the maximum geographical advance towards desired destinations. Local routes are followed owing to the use of a source routing technique. Additionally, the algorithm takes advantage of the broadcast nature of omnidirectional radio communication and utilizes perimeter routing to find a solution for local optimum situations. The analysis of the simulation results confirms interesting characteristics of the proposed algorithm


Sign in / Sign up

Export Citation Format

Share Document