Tuesday 28
Networks
A. Mellouk
› 14:30 - 14:50 (20min)
Simulated Annealing for Solving the Wireless Sensor Networks Deployment Problem
Mustapha Senouci  1@  , Farouk Souilah  1@  , Daoud Bouguettouche  1@  , Abdelhamid Mellouk  2@  
1 : EMP
2 : UPEC
Université Paris-Est Créteil Val-de-Marne (UPEC)

As a fundamental issue in Wireless Sensor Networks, deployment is a research topic that has attracted much attention in recent years. Indeed, the number and locations of sensors deployed in a region of interest determine the topology of the network, which will further influence many of its intrinsic properties, such as its coverage, connectivity, cost, and lifetime. In this paper, we propose a polynomial-time deployment algorithm called Simulated Annealing-based sensor Deployment Algorithm (SADA). SADA is able to determine the minimum number of sensors and their locations to meet the desired user detection requirements.


Online user: 1 RSS Feed