Home > Research > Publications & Outputs > Broadcast in ad hoc wireless networks with self...

Links

Text available via DOI:

View graph of relations

Broadcast in ad hoc wireless networks with selfish nodes: A Bayesian incentive compatibility approach

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Broadcast in ad hoc wireless networks with selfish nodes: A Bayesian incentive compatibility approach. / Suri, Neeraj; Narahari, Y.
2007 2nd International Conference on Communication Systems Software and Middleware. IEEE, 2007.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Suri, N & Narahari, Y 2007, Broadcast in ad hoc wireless networks with selfish nodes: A Bayesian incentive compatibility approach. in 2007 2nd International Conference on Communication Systems Software and Middleware. IEEE. https://doi.org/10.1109/COMSWA.2007.382618

APA

Suri, N., & Narahari, Y. (2007). Broadcast in ad hoc wireless networks with selfish nodes: A Bayesian incentive compatibility approach. In 2007 2nd International Conference on Communication Systems Software and Middleware IEEE. https://doi.org/10.1109/COMSWA.2007.382618

Vancouver

Suri N, Narahari Y. Broadcast in ad hoc wireless networks with selfish nodes: A Bayesian incentive compatibility approach. In 2007 2nd International Conference on Communication Systems Software and Middleware. IEEE. 2007 doi: 10.1109/COMSWA.2007.382618

Author

Suri, Neeraj ; Narahari, Y. / Broadcast in ad hoc wireless networks with selfish nodes : A Bayesian incentive compatibility approach. 2007 2nd International Conference on Communication Systems Software and Middleware. IEEE, 2007.

Bibtex

@inproceedings{b84958febee84cb383439cc8e9baab6e,
title = "Broadcast in ad hoc wireless networks with selfish nodes: A Bayesian incentive compatibility approach",
abstract = "We consider the incentive compatible broadcast (ICB) problem in ad hoc wireless networks with selfish nodes. We design a Bayesian incentive compatible Broadcast (BIC-B) protocol to address this problem. VCG mechanism based schemes have been popularly used in the literature to design dominant strategy incentive compatible (DSIC) protocols for ad hoc wireless networks. VCG based mechanisms have two critical limitations: (i) the network is required to be bi-connected, (ii) the resulting protocol is not budget balanced. Our proposed BIC-B protocol overcomes these difficulties. We also prove the optimality of the proposed scheme. {\textcopyright} 2007 IEEE.",
keywords = "Ad hoc wireless networks, Broadcast, Budget balance, dAGVA mechanism, Incentive compatibility, Rationality, Selfish nodes, VCG mechanisms, Bayesian networks, Broadcasting, Network protocols, Problem solving, DAGVA mechanism, Ad hoc networks",
author = "Neeraj Suri and Y. Narahari",
year = "2007",
month = jan,
day = "7",
doi = "10.1109/COMSWA.2007.382618",
language = "English",
isbn = "1424406137",
booktitle = "2007 2nd International Conference on Communication Systems Software and Middleware",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Broadcast in ad hoc wireless networks with selfish nodes

T2 - A Bayesian incentive compatibility approach

AU - Suri, Neeraj

AU - Narahari, Y.

PY - 2007/1/7

Y1 - 2007/1/7

N2 - We consider the incentive compatible broadcast (ICB) problem in ad hoc wireless networks with selfish nodes. We design a Bayesian incentive compatible Broadcast (BIC-B) protocol to address this problem. VCG mechanism based schemes have been popularly used in the literature to design dominant strategy incentive compatible (DSIC) protocols for ad hoc wireless networks. VCG based mechanisms have two critical limitations: (i) the network is required to be bi-connected, (ii) the resulting protocol is not budget balanced. Our proposed BIC-B protocol overcomes these difficulties. We also prove the optimality of the proposed scheme. © 2007 IEEE.

AB - We consider the incentive compatible broadcast (ICB) problem in ad hoc wireless networks with selfish nodes. We design a Bayesian incentive compatible Broadcast (BIC-B) protocol to address this problem. VCG mechanism based schemes have been popularly used in the literature to design dominant strategy incentive compatible (DSIC) protocols for ad hoc wireless networks. VCG based mechanisms have two critical limitations: (i) the network is required to be bi-connected, (ii) the resulting protocol is not budget balanced. Our proposed BIC-B protocol overcomes these difficulties. We also prove the optimality of the proposed scheme. © 2007 IEEE.

KW - Ad hoc wireless networks

KW - Broadcast

KW - Budget balance

KW - dAGVA mechanism

KW - Incentive compatibility

KW - Rationality

KW - Selfish nodes

KW - VCG mechanisms

KW - Bayesian networks

KW - Broadcasting

KW - Network protocols

KW - Problem solving

KW - DAGVA mechanism

KW - Ad hoc networks

U2 - 10.1109/COMSWA.2007.382618

DO - 10.1109/COMSWA.2007.382618

M3 - Conference contribution/Paper

SN - 1424406137

BT - 2007 2nd International Conference on Communication Systems Software and Middleware

PB - IEEE

ER -