Interference-Aware Selfish Routing in Multi-ratio Multi-channel Wireless Mesh Networks

In this paper, we consider the selfish routing problem in non- cooperative wireless mesh networks where the capacity can be improved by transmitting over multiple radios simultaneously using orthogonal channels. The problem is that there are some agents who are in charge of their transmissions and each of them is selfish to minimize its own transmission cost without considering the overall performance of the network. But the embarrassment in wireless mesh networks is that the selfish agents perhaps may cause interference for the non-cooperation. We think that the game theoretic tools are helpful for the selfish agents to make feasible choices. We yield a sufficient condition of the existence of pure strategy Nash equilibrium in our Strong Transmission Game and prove it in this paper. Some simulations reveal the feasibility of our game theoretic approach.

[1]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[2]  Marina Thottan,et al.  Market sharing games applied to content distribution in ad hoc networks , 2004, IEEE Journal on Selected Areas in Communications.

[3]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques , 2005, MobiCom '05.

[4]  Xiang-Yang Li,et al.  Truthful multicast routing in selfish wireless networks , 2004, MobiCom '04.

[5]  Randeep Bhatia,et al.  Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks , 2005, IEEE Journal on Selected Areas in Communications.

[6]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[7]  Tzi-cker Chiueh,et al.  Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks , 2004, MOCO.

[8]  Marco Conti,et al.  Mesh networks: commodity multihop ad hoc networks , 2005, IEEE Communications Magazine.

[9]  Xiaotie Deng,et al.  On the complexity of equilibria , 2002, STOC '02.

[10]  Eitan Altman,et al.  Competitive routing in multicast communications , 2005 .

[11]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[12]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[13]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[14]  Adrian Vetta,et al.  Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[15]  Jian Tang,et al.  Interference-aware topology control and QoS routing in multi-channel wireless mesh networks , 2005, MobiHoc '05.

[16]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.