Market sharing games applied to content distribution in ad-hoc networks

In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architectural and protocol framework that allows 3G service providers to host efficient content distribution services. We offload the spectrum intensive task of content distribution to an ad-hoc network. Less mobile users (resident subscribers) are provided incentives to cache popular data items while mobile users (transit subscribers) access this data from resident subscribers through the ad-hoc network. Since the participants of this data distribution network act as selfish agents, they may collude to maximize their individual payoff. Our proposed protocol discourages potential collusion scenarios. In this architecture the goal (social function) of the 3G service provider is to have the selfishly motivated resident subscribers service as many data requests as possible. However, the choice of which set of items ...

• Type: Conference
• Year: 2004
• Where: MOBIHOC
• Authors: Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni, Marina Thottan
• Keywords: MOBIHOC 2004, Nash Equilibria, Popular Data Items, Resident Subscribers, Wireless Networks