Routing game in hybrid wireless mesh networks with selfish mesh clients

Yu Wang, Teresa A. Dahlberg, Weizhao Wang

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

Wireless mesh networks (WMNs) consist of mesh routers and mesh clients where fixed mesh routers form the multi-hop backbone of the network. It is often assumed that each individual mesh client will faithfully follow the prescribed protocols. However, these mobile devices, owned by individual users, will likely do what is the most beneficial to their owners, i.e. act 'selfishly'. In this article, we study how to design routing protocols in WMNs with selfish mesh clients. We first show that the totalpayment of the classical Vickrey-Clarke-Groves (VCG)-based routing protocol could be very expensive and inefficient for hybrid mesh networks. Then, we modify the VCG-based method to make it more efficient in terms of total payment, but we also prove that mesh clients could lie about their costs in this modified method. Instead of the VCG-based method, we then propose a novel routing protocol that could achieve Nash equilibrium with low total payments.

Original languageEnglish (US)
Pages (from-to)425-446
Number of pages22
JournalInternational Journal of Autonomous and Adaptive Communications Systems
Volume1
Issue number4
DOIs
StatePublished - Nov 2008

Keywords

  • Game theory
  • Nash equilibrium
  • Routing
  • VCG mechanism
  • Vickrey-clarke-groves mechanism
  • Wireless mesh networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Routing game in hybrid wireless mesh networks with selfish mesh clients'. Together they form a unique fingerprint.

  • Cite this