Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem

2008 ◽  
pp. 188-199 ◽  
Author(s):  
Zheng Fang ◽  
Jie Wang
Keyword(s):  
Convex Combination ◽  
Coverage Problem ◽  
Point Coverage

scholarly journals Solving Point Coverage Problem in Wireless Sensor Networks Using Whale Optimization Algorithm

2021 ◽  
Author(s):  
Mahnaz Toloueiashtian ◽  
Mehdi Golsorkhtabaramiri ◽  
Seyed Yaser Bozorgi Rad
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Energy Use ◽  
Whale Optimization Algorithm ◽  
Wireless Sensor ◽  
Dynamic Power Management ◽  
Coverage Problem ◽  
Whale Optimization ◽  
Point Coverage

Todays, dynamic power management methods that decrease the energy use of sensor networks after their design and deployment are of paramount importance. In Wireless Sensor Networks (WSN), coverage and detection quality are one aspect of service quality and power consumption reduction aspect. The aim of the coverage problem is to monitor at least one node at each point in the targeted area and is divided into three categories: border, area, and point coverage. In point coverage, which is our interest, the problem is to cover specific points of the environment scattered on the surface of the environment; their position is decided on and called the goal. In this paper, a new metaheuristic algorithm based on Whale Optimization Algorithm (WOA) is proposed. The proposed algorithm tries to find the Best Solution (BS) based on three operations exploration, spiral attack, and siege attack. Several scenarios, including medium, hard and complex problems, are designed to evaluate the proposed technique, and it is compared to Genetic Algorithm (GA) and Ant Colony Optimization (ACO) based on time complexity criteria in providing a suitable coverage, network lifetime, energy consumption. The simulation results show that the proposed algorithm performs better than the compared ones in most scenarios.

A leader-follower game for the point coverage problem in wireless sensor networks

2013 ◽  
Vol 7 (5) ◽  
pp. 635 ◽  
Author(s):  
Mehmet Başdere ◽  
Necati Aras ◽  
N.A. �° ◽  
. Kuban Altınel ◽  
Sezin Afşar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Coverage Problem ◽  
Point Coverage

A Class of Harmonic Starlike Functions defined by Multiplier Transformation

2020 ◽  
pp. 455-469
Author(s):  
Deepali Khurana ◽  
Raj Kumar ◽  
Sibel Yalcin
Keyword(s):  
Convex Combination ◽  
Univalent Functions ◽  
Extreme Points ◽  
Starlike Functions ◽  
Harmonic Mappings ◽  
Distortion Bounds ◽  
Radius Of Convexity ◽  
Univalent Harmonic Mappings ◽  
Harmonic Starlike ◽  
Multiplier Transformation

We define two new subclasses, $HS(k, \lambda, b, \alpha)$ and \linebreak $\overline{HS}(k, \lambda, b, \alpha)$, of univalent harmonic mappings using multiplier transformation. We obtain a sufficient condition for harmonic univalent functions to be in $HS(k,\lambda,b,\alpha)$ and we prove that this condition is also necessary for the functions in the class $\overline{HS} (k,\lambda,b,\alpha)$. We also obtain extreme points, distortion bounds, convex combination, radius of convexity and Bernandi-Libera-Livingston integral for the functions in the class $\overline{HS}(k,\lambda,b,\alpha)$.

Sign in / Sign up

Export Citation Format

Share Document