In recent years, with the evolution of new and content-rich Internet services, mobile network operators face the challenging task to guarantee ubiquitous access to their customers, while minimizing network deployment costs. In order to foster the opportunistic utilization of unexploited Internet connections of residential users, we propose a new marketplace where mobile network operators can rent the unused capacity of residential users' access devices (e.g., wireless access points or femtocells) when the traffic demand of their mobile customers exceeds the operator's network capacity. We formulate the allocation problem as a combinatorial reverse auction, which prevents market manipulation, and we further propose a greedy algorithm that finds efficient allocations in polynomial time, even for large-size network scenarios. Numerical results demonstrate that our proposed schemes well capture the economical and networking essence of the allocation problem, thus representing a promising approach to enhance the performance of next-generation wireless access networks.
(2012). A truthful auction for access point selection in heterogeneous mobile networks . Retrieved from http://hdl.handle.net/10446/140261
A truthful auction for access point selection in heterogeneous mobile networks
Martignon, Fabio;
2012-01-01
Abstract
In recent years, with the evolution of new and content-rich Internet services, mobile network operators face the challenging task to guarantee ubiquitous access to their customers, while minimizing network deployment costs. In order to foster the opportunistic utilization of unexploited Internet connections of residential users, we propose a new marketplace where mobile network operators can rent the unused capacity of residential users' access devices (e.g., wireless access points or femtocells) when the traffic demand of their mobile customers exceeds the operator's network capacity. We formulate the allocation problem as a combinatorial reverse auction, which prevents market manipulation, and we further propose a greedy algorithm that finds efficient allocations in polynomial time, even for large-size network scenarios. Numerical results demonstrate that our proposed schemes well capture the economical and networking essence of the allocation problem, thus representing a promising approach to enhance the performance of next-generation wireless access networks.File | Dimensione del file | Formato | |
---|---|---|---|
ICC2012.pdf
Solo gestori di archivio
Versione:
postprint - versione referata/accettata senza referaggio
Licenza:
Licenza default Aisberg
Dimensione del file
181.11 kB
Formato
Adobe PDF
|
181.11 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo