Open AccessJoint node selection, flow routing, and cell coverage optimisation for network sum‐rate maximisation in wireless sensor networks
Author(s) -
Baidas Mohammed W.,
Awad Mohamad K.,
ElAmine Ahmad,
Hassan Omar A.,
Sherman Shen Xuemin
Publication year - 2019
Publication title -
iet wireless sensor systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.433
H-Index - 27
eISSN - 2043-6394
pISSN - 2043-6386
DOI - 10.1049/iet-wss.2019.0072
Subject(s) - computer network , computer science , joint (building) , selection (genetic algorithm) , node (physics) , routing (electronic design automation) , geographic routing , wireless sensor network , wireless , dynamic source routing , routing protocol , telecommunications , engineering , artificial intelligence , structural engineering , architectural engineering
In this study, the problems of joint node selection, flow routing, and cell coverage optimisation in energy‐constrained wireless sensor networks (WSNs) are considered. Due to the energy constraints on network nodes, maximising network sum‐rate under target network lifetime, flow routing, cell coverage, and minimum rate constraints is of paramount importance in WSNs. To this end, a mixed‐integer non‐linear programming problem is formulated, where the aim is to optimally select which network nodes to act as sensors or relays while ensuring connectivity to the fusion centre optimised network flows, and full network coverage. The formulated problem happens to be NP‐hard (i.e. computationally prohibitive). In turn, a solution procedure based on the branch and bound with the reformulation‐linearisation technique (BB‐RLT) is devised to provide a ( 1 − ϵ ) ‐optimal solution to the formulated problem. Simulation results are presented to validate the efficacy of the devised BB‐RLT solution procedure. This work provides significant theoretical results on network sum‐rate maximisation for WSNs under a variety of practical constraints.