Truthful routing for wireless hybrid networks

Wireless hybrid networks combine the characteristics of both cellular and mobile ad hoc networks. In wireless hybrid networks, it is often assumed that each individual mobile node faithfully follows the prescribed protocols without any deviation. However, these mobile devices, when owned by individual users, will likely do what is the most beneficial to their owners, i.e., act "selfishly". Therefore, an algorithm or protocol intended for selfish wireless devices must be designed. In this paper, we specifically study how to design routing protocols in wireless hybrid networks with selfish nodes. We first present a VCG-based routing protocol for hybrid networks, and show it is truthful but could be expensive. Then we modify the VCG-based routing protocol to make it more efficient for hybrid networks in term of total payment. However, we prove that nodes could lie up their costs in the modified method. Moreover, we propose a novel routing protocol based on first-price path auctions [N. Immorlica et al, 2005], which can achieve a Nash equilibrium with low total payment

[1]  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.

[2]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[3]  Yu Wang,et al.  Truthful Multicast in Selfish Wireless Networks , 2004 .

[4]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[6]  Joan Feigenbaum,et al.  Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.

[7]  Noam Nisan,et al.  Algorithms for Selfish Agents , 1999, STACS.

[8]  Chunming Qiao,et al.  Integrated cellular and ad hoc relaying systems: iCAR , 2001, IEEE J. Sel. Areas Commun..

[9]  Cristina Nita-Rotaru,et al.  JANUS: towards robust and malicious resilient routing in hybrid wireless networks , 2004, WiSe '04.

[10]  Nicole Immorlica,et al.  First-price path auctions , 2005, EC '05.

[11]  Raghupathy Sivakumar,et al.  On using peer-to-peer communication in cellular wireless data networks , 2004, IEEE Transactions on Mobile Computing.

[12]  Markus Jakobsson,et al.  A charging and rewarding scheme for packet forwarding in multi-hop cellular networks , 2003, MobiHoc '03.

[13]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[14]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[16]  Srdjan Capkun,et al.  Self-organization in mobile ad hoc networks: the approach of Terminodes , 2001, IEEE Commun. Mag..

[17]  Tim Roughgarden,et al.  Designing networks for selfish users is hard , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[18]  Haiyun Luo,et al.  UCAN: a unified cellular and ad-hoc network architecture , 2003, MobiCom '03.