scholarly journals Simulated Annealing Application to Maximum Lifetime Coverage Problem in Wireless Sensor Networks

10.29007/gl61 ◽  
2018 ◽  
Author(s):  
Antonina Tretyakova ◽  
Franciszek Seredynski

Energy optimization problem in Wireless Sensor Networks (WSN) is a backbone of efficient performance of sensor network consisting of small devices with limited and non-recovering battery. WSN lifetime maximization problem under assumption of that the coverage is main task of the network is known as Maximal lifetime coverage problem (MLCP).This problem belongs to a class of NP-hard problems. In this paper we propose a novel simulated annealing (SA) algorithm to solve MLCP. The proposed algorithm is studied for high dense WSN instances under different parameter setup.

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 74315-74325 ◽  
Author(s):  
Manju ◽  
Samayveer Singh ◽  
Sandeep Kumar ◽  
Anand Nayyar ◽  
Fadi Al-Turjman ◽  
...  

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Yong Zhang ◽  
Li Cao ◽  
Yinggao Yue ◽  
Yong Cai ◽  
Bo Hang

The coverage optimization problem of wireless sensor network has become one of the hot topics in the current field. Through the research on the problem of coverage optimization, the coverage of the network can be improved, the distribution redundancy of the sensor nodes can be reduced, the energy consumption can be reduced, and the network life cycle can be prolonged, thereby ensuring the stability of the entire network. In this paper, a novel grey wolf algorithm optimized by simulated annealing is proposed according to the problem that the sensor nodes have high aggregation degree and low coverage rate when they are deployed randomly. Firstly, the mathematical model of the coverage optimization of wireless sensor networks is established. Secondly, in the process of grey wolf optimization algorithm, the simulated annealing algorithm is embedded into the grey wolf after the siege behavior ends and before the grey wolf is updated to enhance the global optimization ability of the grey wolf algorithm and at the same time improve the convergence rate of the grey wolf algorithm. Simulation experiments show that the improved grey wolf algorithm optimized by simulated annealing is applied to the coverage optimization of wireless sensor networks. It has better effect than particle swarm optimization algorithm and standard grey wolf optimization algorithm, has faster optimization speed, improves the coverage of the network, reduces the energy consumption of the nodes, and prolongs the network life cycle.


Author(s):  
Smriti Joshi ◽  
Anant Kr. Jayswal

Energy efficiency is the kernel issue in the designing of wireless sensor network(WSN) MAC protocols. Energy efficiency is a major consideration while designing wireless sensor network nodes. Most sensor network applications require energy autonomy for the complete lifetime of the node, which may span up to several years. These energy constraints require that the system be built such that Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. Each component consumes minimum possible power, ensure the average successful transmission rate, decrease the data packet average waiting time, and reduce the average energy consumption. Influencing by the design principles of traditional layered protocol stack, current MAC protocol designing for wireless sensor networks (WSN) seldom takes load balance into consideration, which greatly restricts WSN lifetime. As a novel Forwarding Election-based MAC protocol, is presented to prolong WSN lifetime by means of improving energy efficiency and enhancing load balance.


2021 ◽  
Vol 11 (21) ◽  
pp. 10197
Author(s):  
Wenbo Zhu ◽  
Chia-Ling Huang ◽  
Wei-Chang Yeh ◽  
Yunzhi Jiang ◽  
Shi-Yi Tan

The wireless sensor network (WSN) plays an essential role in various practical smart applications, e.g., smart grids, smart factories, Internet of Things, and smart homes, etc. WSNs are comprised and embedded wireless smart sensors. With advanced developments in wireless sensor networks research, sensors have been rapidly used in various fields. In the meantime, the WSN performance depends on the coverage ratio of the sensors being used. However, the coverage of sensors generally relates to their cost, which usually has a limit. Hence, a new bi-tuning simplified swarm optimization (SSO) is proposed that is based on the SSO to solve such a budget-limited WSN sensing coverage problem to maximize the number of coverage areas to improve the performance of WSNs. The proposed bi-tuning SSO enhances SSO by integrating the novel concept to tune both the SSO parameters and SSO update mechanism simultaneously. The performance and applicability of the proposed bi-tuning SSO using seven different parameter settings are demonstrated through an experiment involving nine WSN tests ranging from 20, 100, to 300 sensors. The proposed bi-tuning SSO outperforms two state-of-the-art algorithms: genetic algorithm (GA) and particle swarm optimization (PSO), and can efficiently accomplish the goals of this work.


Sign in / Sign up

Export Citation Format

Share Document