Broadcast in Ad hoc Wireless Networks with Selfish Nodes: A Bayesian Incentive Compatibility Approach

Author

Suri, N. Rama ; Narahari, Y.

Author_Institution

Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India

fYear

2007

fDate

7-12 Jan. 2007

Firstpage

1

Lastpage

9

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.

Keywords

Bayes methods; ad hoc networks; graph theory; network theory (graphs); protocols; radio broadcasting; Bayesian incentive compatibility broadcast protocol; VCG-based broadcast protocol; ad hoc wireless network broadcasting; dominant strategy incentive compatible protocol; selfish node; undirected graph; Automation; Bayesian methods; Communication industry; Computer science; Costs; Laboratories; Satellite broadcasting; Wireless application protocol; Wireless networks; Wireless sensor networks; Ad hoc wireless networks; VCG mechanisms; broadcast; budget balance; dAGVA mechanism; incentive compatibility; rationality; selfish nodes;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Systems Software and Middleware, 2007. COMSWARE 2007. 2nd International Conference on

Conference_Location

Bangalore

Print_ISBN

1-4244-0613-7

Type

conf

DOI

10.1109/COMSWA.2007.382618

Filename

4268042