An Iterative Solution for the Coverage and Connectivity Problem in Wireless Sensor Network | Zendy

Mahmud Mansour | Zendy; Fethi Jarray | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Iterative Solution for the Coverage and Connectivity Problem in Wireless Sensor Network

Author(s) -

Mahmud Mansour,

Fethi Jarray

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.08.374

Subject(s) - computer science , wireless sensor network , wireless , computer network , wireless network , real time computing , telecommunications

We study the coverage and connectivity problem in wireless sensor networks. Given an area of targets to cover by a wireless sensor network with a coverage range for each sensor, the problem consists in minimizing the number of deployed sensors in an area while ensuring the connectivity of the sensors network and the coverage of the area. We formulate the problem by a binary integer programming model to minimize the total number of used sensors. Since the problem is NP-complete, firstly we design a separation oracle to establish the feasibility of each solution. Then we provide an iterative approximation based on combinatorial relaxation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research