Active time scheduling for rechargeable sensor networks

    Authors

    V. Pryyma; D. Turgut;L. Boloni

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Comput. Netw.

    Keywords

    Rechargeable; Energy harvesting; Sensor network; POWER MANAGEMENT; EVENT DETECTION; Computer Science, Hardware & Architecture; Computer Science, Information; Systems; Engineering, Electrical & Electronic; Telecommunications

    Abstract

    Recent progress in energy harvesting technologies made it possible to build sensor networks with rechargeable nodes which target an indefinitely long operation. In these networks, the goal of energy management is to allocate the available energy such that the important performance metrics, such as the number of detected threats, are maximized. As the harvested energy is not sufficient for continuous operation, the scheduling of the active and inactive time is one of the main components of energy management. The active time scheduling protocols need to maintain the energy equilibrium of the nodes, while considering the uncertainties of the energy income, which is strongly influenced by the weather, and the energy expenditures, which are dependent on the behavior of the targets. In this paper, we describe and experimentally compare three active time scheduling protocols: (a) static active time, (b) dynamic active time based on a multi-parameter heuristic and (c) utility-based uniform sensing. We show that protocols which take into consideration the probabilistic models of the energy income and expenditure and can dynamically adapt to changes in the environment, can provide a significant performance advantage. (C) 2009 Published by Elsevier B.V.

    Journal Title

    Computer Networks

    Volume

    54

    Issue/Number

    4

    Publication Date

    1-1-2010

    Document Type

    Article

    Language

    English

    First Page

    631

    Last Page

    640

    WOS Identifier

    WOS:000276085700009

    ISSN

    1389-1286

    Share

    COinS