Evolutionary Algorithms for Coverage and Connectivity Problems in Wireless Sensor Networks: A Study

Harizan, Subash; Kuila, Pratyay

doi:10.1007/978-981-13-9574-1_11

Cited by 24 publications

(13 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two sensor nodes are connected if they can communicate either directly (single‐hop connectivity), or indirectly (multi‐hop connectivity). In WSN, the network is considered to be fully connected if there is at least one path between the sink and each sensor node in the sensing area [17]. For a traditional WSN, which has static nodes and a static sink, several problems may occur, such as sink node isolation.…”

Section: Proposed Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Use of multiple mobile sinks in wireless sensor networks for large‐scale areas

Al-Behadili¹,

Alwane²,

Al‐Yasir

et al. 2020

IET wirel. sens. syst.

View full text Add to dashboard Cite

Sensing coverage and network connectivity are two of the most fundamental issues to ensure that there are effective environmental sensing and robust data communication in a wireless sensor network (WSN) application. Random positioning of nodes in a WSN may result in random connectivity, which can cause a large variety of key parameters within the WSN. For example, data latency and battery lifetime can lead to the isolation of nodes, which causes a disconnection between nodes within the network. These problems can be avoided by using mobile data sinks, which travel between nodes that have connection problems. This research aims to design, test, and optimise a data collection system that addresses the isolated node problem, as well as to improve the connectivity between sensor nodes and base station, and to reduce the energy consumption simultaneously. In addition, this system will help to solve several problems such as the imbalance of delay and hotspot problems. The effort in this study is focused on the feasibility of using the proposed methodology in different applications. More ongoing experimental work will aim to provide a detailed study for advanced applications, e.g. transport systems for civil purposes.

show abstract

Section: Proposed Methodsmentioning

confidence: 99%

“…Recent studies, such as [16], have been conducted to survey the different methods for node deployment, given in research literature, for CC purposes. In [17], evolutionary algorithms that deal with the problems of CC are assessed.…”

Section: Previous Studiesmentioning

confidence: 99%

Use of multiple mobile sinks in wireless sensor networks for large‐scale areas

Al-Behadili¹,

Alwane²,

Al‐Yasir

et al. 2020

IET wirel. sens. syst.

View full text Add to dashboard Cite

show abstract

“…Constraint (18) guarantees that each UE is associated with at most one BS, i.e., it is not considered a coordinated multipoint transmission scenario (CoMP). Constraint (19) ensures that the number of resource blocks used by the ith UE is less than or equal to the total number of RBs available at the jth BS.…”

Section: Problem Formulationmentioning

confidence: 99%

Particle Swarm-Based Cell Range Expansion for Heterogeneous Mobile Networks

et al. 2020

View full text Add to dashboard Cite

Traffic demand in wireless communication systems has emerged as a key issue over recent decades. An ever-increasing trend is projected for the next few years, with explosive data traffic expected to materialize and mobile users imposing new quality of service requirements. This growing traffic demand, combined with increasingly complex heterogeneous network (HetNet) scenarios, has presented ever more challenges for mobile network operators in terms of service, coverage, load balancing, and quality of service. Considering the traditional association mechanism based on maximum power received, HetNets tend to remain unbalanced, making it challenging to satisfy mobile users' traffic requirements. In this paper, instead of trying to maximize the achievable downlink rate per user, we couple the cell range expansion (CRE) technique with a particle swarm optimization (PSO) algorithm to maximize the number of users whose downlink requirements are met. The proposed scheme considers both the loads of base stations and the signal-to-interference-plus-noise ratio (SINR) of user equipment to model an objective function that seeks to compute specific CRE bias values per small base station. The proposed scheme is also compared with some classical PSO implementations. Numerical results validate the performance of the proposed schemes, which effectively fulfill users' data traffic requirements by reducing network imbalance.INDEX TERMS Cell range expansion, heterogeneous mobile networks, load balancing, particle swarm optimization, user association.

show abstract

“…So motility can be used to minimize the overlapped regions. Because of limited energy resources in these networks, providing desired target coverage is a challenging problem [1][2][3].…”

Section: -Introductionmentioning

confidence: 99%

A New Game Theory-Based Algorithm for Target Coverage in Directional Sensor Networks

Golrasan¹,

Shirazi²,

Varposhti³

et al. 2021

JIST

View full text Add to dashboard Cite

One of the challenging problems in directional sensor networks is maximizing target coverage while minimizing the amount of energy consumption. Considering the high redundancy in dense directional sensor networks, it is possible to preserve energy and enhance coverage quality by turning off redundant sensors and adjusting the direction of the active sensor nodes. In this paper, we address the problem of maximizing network lifetime with adjustable ranges (MNLAR) and propose a new game theory-based algorithm in which sensor nodes try to adjust their working direction and sensing range in a distributed manner to achieve the desired coverage. For this purpose, we formulate this problem as a multiplayer repeated game in which each sensor as a player tries to maximize its utility function which is designed to capture the tradeoff between target coverage and energy consumption. To achieve an efficient action profile, we present a distributed payoff-based learning algorithm. The performance of the proposed algorithm is evaluated via simulations and compared to some existing methods. The simulation results demonstrate the performance of the proposed algorithm and its superiority over previous approaches in terms of network lifetime.

show abstract

Evolutionary Algorithms for Coverage and Connectivity Problems in Wireless Sensor Networks: A Study

Cited by 24 publications

References 48 publications

Use of multiple mobile sinks in wireless sensor networks for large‐scale areas

Use of multiple mobile sinks in wireless sensor networks for large‐scale areas

Particle Swarm-Based Cell Range Expansion for Heterogeneous Mobile Networks

A New Game Theory-Based Algorithm for Target Coverage in Directional Sensor Networks

Contact Info

Product

Resources

About