D. Turgut and L. Bölöni

Three heuristics for transmission scheduling in sensor networks with multiple mobile sinks


Cite as:

D. Turgut and L. Bölöni. Three heuristics for transmission scheduling in sensor networks with multiple mobile sinks. In Proceedings of International Workshop on Agent Technology for Sensor Networks (ATSN-08), in conjunction with the Seventh Joint Conference on Autonomous and Multi-Agent Systems (AAMAS 2008) , pp. 1–8, May 2008.

Download:

Download 

Abstract:

A large part of the energy budget of traditional sensor networks is consumed by the hop-by-hop routing of the collected information to the static sink. In many applications it is possible to replace the static sink with one or more mobile sinks which move in a sensor field and collect the data through one hop transmissions. This greatly reduces the power consumption of the nodes, which can be further reduced by the choosing the appropriate moment of transmission. In general, the transmission energy increases quickly with the distance, thus it makes sense for the nodes to transmit when one of the mobile sinks is in close proximity. One of the side effects of the one-hop transmission is that the node is responsible only for its own data and its own energy resources. Thus, it makes good sense to treat the sensor node as an autonomous agent which maximizes the utility of the collected and transmitted data, while minimizing the energy expenditure. This paper proposes several approaches for such an agent controlled sensor node. As the basis of comparison, we describe a dynamic programming-based approach for the optimal policy in the context of full world knowledge. Then, we describe and compare three heuristics based on different principles (imitation of human decision making, stochastic transmission and constant risk). We compare the proposed approaches in an experimental study.

BibTeX:

@inproceedings{Turgut-2008-ATSN,
    author = "D. Turgut and L. B{\"o}l{\"o}ni",
    title = "Three heuristics for transmission scheduling in sensor networks
    with multiple mobile sinks",
    booktitle = "Proceedings of International
    Workshop on Agent Technology for Sensor Networks (ATSN-08), in conjunction
    with the Seventh Joint Conference on Autonomous and Multi-Agent Systems
    (AAMAS 2008) ",
    pages = "1-8",
    month = "May",
    year = "2008",
    abstract = {
       A large part of the energy budget of traditional sensor networks
       is consumed by the hop-by-hop routing of the collected
       information to the static sink. In many applications it is
       possible to replace the static sink with one or more mobile sinks
       which move in a sensor field and collect the data through one hop
       transmissions. This greatly reduces the power consumption of the
       nodes, which can be further reduced by the choosing the
       appropriate moment of transmission. In general, the transmission
       energy increases quickly with the distance, thus it makes sense
       for the nodes to transmit when one of the mobile sinks is in
       close proximity.
       One of the side effects of the one-hop transmission is that the
       node is responsible only for its own data and its own energy
       resources. Thus, it makes good sense to treat the sensor node as
       an autonomous agent which maximizes the utility of the collected
       and transmitted data, while minimizing the energy expenditure.
       This paper proposes several approaches for such an agent
       controlled sensor node. As the basis of comparison, we describe a
       dynamic programming-based approach for the optimal policy in the
       context of full world knowledge. Then, we describe and compare
       three heuristics based on different principles (imitation of
       human decision making, stochastic transmission and constant
       risk). We compare the proposed approaches in an experimental
       study.
    },
}

Generated by bib2html.pl (written by Patrick Riley, Lotzi Boloni ) on Fri Oct 06, 2017 18:15:24