3rd International ICST Workshop on Interdisciplinary Systems Approach in Performance Evaluation and Design of Computer & Communication Systems

Research Article

Optimal Monotone Forwarding Policies in Delay Tolerant Mobile Ad-Hoc Networks

  • @INPROCEEDINGS{10.4108/ICST.VALUETOOLS2008.4430,
        author={Eitan Altman and Tamer Basar and Francesco De Pellegrini},
        title={Optimal Monotone Forwarding Policies in Delay Tolerant Mobile Ad-Hoc Networks},
        proceedings={3rd International ICST Workshop on Interdisciplinary Systems Approach in Performance Evaluation and Design of Computer \& Communication Systems},
        publisher={ACM},
        proceedings_a={INTER-PERF},
        year={2010},
        month={5},
        keywords={Delay tolerant networks fluid models optimal control},
        doi={10.4108/ICST.VALUETOOLS2008.4430}
    }
    
  • Eitan Altman
    Tamer Basar
    Francesco De Pellegrini
    Year: 2010
    Optimal Monotone Forwarding Policies in Delay Tolerant Mobile Ad-Hoc Networks
    INTER-PERF
    ICST
    DOI: 10.4108/ICST.VALUETOOLS2008.4430
Eitan Altman1,*, Tamer Basar2,*, Francesco De Pellegrini3,*
  • 1: INRIA B.P.93, 2004 Route des Lucioles, 06902 Sophia-Antipolis Cedex, France
  • 2: University of Illinois, 1308 West Main Street, Urbana, IL 61801-2307, USA.
  • 3: CREATE-NET, via Alla Cascata 56 c, 38100 Trento, Italy.
*Contact email: eitan.altman@sophia.inria.fr, tbasar@control.csl.uiuc.edu, fdepellegrini@create-net.org

Abstract

We study in this paper fluid approximations for a class of monotone relay policies in delay tolerant ad-hoc networks. This class includes the epidemic routing and the two-hops routing protocols. We enhance the relay policies with a probabilistic forwarding feature where a message is forwarded to a relay with some probability p. We formulate an optimal control problem where a tradeoff between delay and energy consumption is captured and optimized. We compute both the optimal static value of p as well as the optimal time dependent value of p. We show that the time dependent problem is optimized by threshold type policies and we compute explicitly the value of the optimal threshold for some special cases of relay policies.