Bioinspired Models of Network, Information, and Computing Systems. 4th International Conference, BIONETICS 2009, Avignon, France, December 9-11, 2009, Revised Selected Papers

Research Article

Delay Tolerant Networks in Partially Overlapped Networks: A Non-cooperative Game Approach

Download261 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-12808-0_19,
        author={Rachid El-Azouzi and Habib Sidi and Julio Rojas-Mora and Amar Azad},
        title={Delay Tolerant Networks in Partially Overlapped Networks: A Non-cooperative Game Approach},
        proceedings={Bioinspired Models of Network, Information, and Computing Systems. 4th International Conference, BIONETICS 2009, Avignon, France, December 9-11, 2009, Revised Selected Papers},
        proceedings_a={BIONETICS},
        year={2012},
        month={5},
        keywords={},
        doi={10.1007/978-3-642-12808-0_19}
    }
    
  • Rachid El-Azouzi
    Habib Sidi
    Julio Rojas-Mora
    Amar Azad
    Year: 2012
    Delay Tolerant Networks in Partially Overlapped Networks: A Non-cooperative Game Approach
    BIONETICS
    Springer
    DOI: 10.1007/978-3-642-12808-0_19
Rachid El-Azouzi1, Habib Sidi1, Julio Rojas-Mora1, Amar Azad1
  • 1: LIA, Université d’Avignon

Abstract

Epidemic forwarding protocol in Delay Tolerant Networks maximizes successful data delivery probability but at the same time incurs high costs in terms of redundancy of packet copies in the system and energy consumption. Two-hop routing on the other hand minimizes the packet flooding and the energy costs but degrades the delivery probability. This paper presents a framework to achieve a tradeoff between the successful data delivery probability and the energy costs. Each mobile has to decide which routing protocol it wants to use for packet delivering. In such a problem, we consider a non-cooperative game theory approach. We explore the scenario where the source and the destination mobiles are enclosed in two different regions, which are partially overlapped. We study the impact of the proportion of the surface covered by both regions on the Nash equilibrium and price of anarchy. We also design a fully distributed algorithm that can be employed for convergence to the Nash equilibrium. This algorithm does not require any knowledge of some parameter of the system as the number of mobiles or the rate of contacts between mobiles.