Please use this identifier to cite or link to this item:
|Title:||Towards energy-fairness in asynchronous duty-cycling sensor networks||Authors:||Li, Zhenjiang.
|Keywords:||DRNTU::Engineering::Computer science and engineering||Issue Date:||2012||Abstract:||In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. We propose a mathematical model to describe the energy efficiency of such networks and observe that traditional sleep interval setting strategy, i.e., operating sensor nodes with identical sleep intervals, or intuitive control heuristics, i.e., greedily increasing sleep intervals of sensor nodes with high energy consumption rates, hardly perform well in practice. There is an urgent need to develop an efficient sleep interval control strategy for achieving fair and high energy efficiency. To this end, we theoretically formulate the Sleep Interval Control (SIC) problem and find it a convex optimization problem. By utilizing the convex property, we decompose the original problem and propose a distributed algorithm, called GDSIC. In GDSIC, sensor nodes can tune sleep intervals through a local information exchange such that the maximum energy consumption rate in the network approaches to be minimized. The algorithm is self-adjustable to the traffic load variance and is able to serve as a unified framework for a variety of asynchronous duty-cycling MAC protocols. We implement our approach in a prototype system and test its feasibility and applicability on a 50-node testbed. We further conduct extensive trace-driven simulations to examine the efficiency and scalability of our algorithm with various settings.||URI:||https://hdl.handle.net/10356/84223
|DOI:||10.1109/INFCOM.2012.6195827||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Conference Papers|
checked on Jul 13, 2020
Page view(s) 50398
checked on Oct 26, 2020
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.