FAROES: Fairness And Reliability using Overlay Expenseless Set-out for duty-cycle optimization in WSN
Overview & Synopsis
Wireless sensor networks (WSNs) consist of a large number of entities that collaborate in order to provide given services. Unfortunately, due to their tiny size, these entities cannot be equipped with a long-life battery. In order to minimize overall energy consumption and maximize the lifetime of the network, a widely accepted approach is to implement a \emph{duty cycle}. Specifically, in order to save energy, sensors are not active all the time, and switch off their capabilities according to a specific schedule. In this paper, we propose a generic method to schedule these duty-cycles, taking into account two important challenges in WSNs: \emph{strong reliability} of the network and \emph{fairness} between sensors. To achieve these aims, we ensure reliability by deploying several $k$-connected overlays, which became active one after the other. The fairness rule is ensured by spreading the sensors into overlay according to specific characteristics as energy consumption, network density, \emph{etc.} We then propose different heuristics and probability models to achieve our outcome, and finally validate them through numerical evaluation
hal.science)
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | FAROES: Fairness And Reliability using Overlay Expenseless Set-out for duty-cycle optimization in WSN |
|---|---|
| Author / Organization | Silvia Bonomi, Yann Busnel, Roberto Baldoni, Ravi Prakash |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2009 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-236083 |
| Original Source Link | Visit Source Page on hal.science » |