In this paper we consider the problem of sharing the costs of multicast transmissions in ad hoc wireless networks. Assuming that the receiving users are selfish, we provide strategyproof mechanisms that are either optimally budget balanced or efficient for the case in which the distance-power gradient α = 1 or the stations belong to a one-dimensional Euclidean space. Then, by extending to multicasting previous results on wireless broadcasting, we show the existence of efficiently computable 2(3d − 1)-approximate budget balance mechanisms in any d-dimensional space for every α ≥ d.

Sharing the Cost of Multicast Transmissions in Wireless Networks

FLAMMINI M;
2004

Abstract

In this paper we consider the problem of sharing the costs of multicast transmissions in ad hoc wireless networks. Assuming that the receiving users are selfish, we provide strategyproof mechanisms that are either optimally budget balanced or efficient for the case in which the distance-power gradient α = 1 or the stations belong to a one-dimensional Euclidean space. Then, by extending to multicasting previous results on wireless broadcasting, we show the existence of efficiently computable 2(3d − 1)-approximate budget balance mechanisms in any d-dimensional space for every α ≥ d.
1-58113-840-7
File in questo prodotto:
File Dimensione Formato  
2004_16AnnSPAA_Bilo.pdf

non disponibili

Tipologia: Versione Editoriale (PDF)
Licenza: Non pubblico
Dimensione 468.93 kB
Formato Adobe PDF
468.93 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.12571/3328
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact