Optimization of Constrained Relay Node Deployment using a Metaheuristic

Abstract

Wireless Sensor Networks have emerged as a fascinating and rapidly growing area of research, capturing the attention of numerous researchers across a wide range of scientific disciplines. These networks, which consist of a collection of small, autonomous sensor and relay nodes capable of wirelessly communicating with each other, hold immense value and offer an array of limitless possibilities. In this thesis, our primary focus will revolve around the domain of surveillance. Our objective is to build a two-tierd topology where sensor nodes are deployed on the sensitive site border to cover each point of we aim to minimize the number of relay nodes deployed while ensuring communications between the all sensor nodes and the sink node, in addition to that we strive to minimize the number of hops in the network. The multi-objective combinatorial optimization problem described above has been resolved using Variable Neighborhood Search metaheuristic algorithm and the wighted sum approach. The obtained results are very encouraging since we can resolve a relative big instances of the problem compared to the exact method. on the other hand, the results in terms of optimal number of relay node to deploy and the average hop count are near optimal.