Name
Abstract | ||
|---|---|---|
The network coverage and the number of residential users that a network operator may serve through a Wireless Mesh Network can be significantly increased by subleasing the available bandwidth to a subset of customers. In this paper we propose an innovative mechanism to allocate the available bandwidth of a wireless network operator to those customers who are willing to pay the higher price for satisfying their bandwidth demand. We formulate the allocation mechanism as a combinatorial truthful auction and further present a greedy algorithm that finds efficient allocations even for large-size, real scenarios, while maintaining the truthfulness property. Numerical results show that the greedy algorithm represents an efficient and practical alternative to the combinatorial auction mechanism. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/WD.2011.6098174 | 2011 IFIP Wireless Days (WD) |
Keywords | Field | DocType |
Bandwidth Auctions,Mechanism Design,Wireless Community Networks | Wireless network,Wireless,Bandwidth allocation,Computer science,Combinatorial auction,Computer network,Greedy algorithm,Bandwidth (signal processing),Dynamic bandwidth allocation,Wireless mesh network,Distributed computing | Conference |
ISSN | ISBN | Citations |
2156-9711 | 978-1-4577-2027-7 | 3 |
PageRank | References | Authors |
0.43 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabio Martignon | 1 | 390 | 33.88 |
| Stefano Paris | 2 | 140 | 15.36 |
| Ilario Filippini | 3 | 231 | 21.51 |
| Antonio Capone | 4 | 138 | 13.37 |