A Branch and Bound Algorithm for the Critical Grid Coverage Problem in Wireless Sensor Networks

A Branch and Bound Algorithm for the Critical Grid Coverage Problem in Wireless Sensor Networks

We aim to cover a grid fully by deploying the necessary wireless sensors while maintaining connectivity between the deployed sensors and a base station ( the sink ). The problem is NP - Complete as it can be reduced to a 2 - dimensional critical coverage problem, which is an NP - Complete problem. W...

Full description

Saved in:
Bibliographic Details
Main Authors: Maher Rebai, Matthieu Le Berre, Faicel Hnaien, Hichem Snoussi, Lyes Khoukhi
Format: Article
Language:English
Published: Wiley 2014-02-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1155/2014/769658
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items