Truthful routing for wireless hybrid networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 6, Issue , 2005, Pages 3461-3465

  Wang, Yu ^a   Wang, Weizhao ^b   Dahlberg, Teresa A ^a  

^a University of North Carolina at Charlotte   (United States)

^b Illinois Institute of Technology   (United States)

Author keywords

Game theory; Non cooperative computing; Payment; Strategyproof; Truthful routing; Wireless hybrid networks

Indexed keywords

ALGORITHMS; GAME THEORY; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; USER INTERFACES;

HYBRID NETWORKS; MOBILE NODES; NON COOPERATIVE COMPUTING; ROUTING PROTOCOLS; TRUTHFUL ROUTING;

BROADBAND NETWORKS;

EID: 33846608276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2005.1578416     Document Type: Conference Paper

References (18)

1. N. Immorlica, D. Karger, E. Nikolova, and R. Sami, "First-price path auctions,", in ACM Conf. on Electronic Commerce(EC'05). 2005.
2. H. Luo, R. Ramjee, P. Sinha, L. Li, and S. Lu, "UCAN: a unified cellular and ad-hoc network architecture," in ACM Mobicom. 2003.
3. H. Wu, C. Qiao, S. De, and O. Tonguz, "Integrated cellular and ad hoc relaying systems: iCAR," IEEE Journal on Selected Areas in Communications, vol. 19, no. 10, pp. 2105-2115, 2001.
4. H.-Y. Hsieh and R. Sivakumar, "On using peer-to-peer communication in cellular wireless data networks," IEEE Transactions on Mobile Computing, vol. 3, no. 1, pp. 57-72, 2004.
5. O. Dousse, P. Thiran, and M. Hasler, "Connectivity in ad-hoc and hybrid networks," in IEEE INFOCOM, 2002.
6. B. Carbunar, I. Ioannidis, and C. Nita-Rotaru, "Janus: towards robust and malicious resilient routing in hybrid wireless networks," in ACM workshop on Wireless Security (WiSe04). 2004.
7. N. B. Salem, L. Buttyan, J.-P. Hubaux, and M. Jakobsson, "A charging and rewarding scheme for packet forwarding in multi-hop cellular networks," in ACM MobiHoc. 2003.
8. T. Roughgarden, "Designing networks for selfish users is hard," in IEEE Symposium on Foundations of Computer Science, 2001.
9. N. Nisan, "Algorithms for selfish agents," Lecture Notes in Computer Science, vol. 1563, pp. 1-15, 1999.
10. J. Feigenbaum and S. Shenker, "Distributed algorithmic mechanism design: recent results and future directions," in ACM DIALM. 2002.
11. L. Buttyan and J. Hubaux, "Stimulating cooperation in self-organizing mobile ad hoc networks," Mobile Networks and Applications, vol. 5, no. 8, pp. 579-592, 2003.
12. S. Marti, T. J. Giuli, K. Lai, and M. Baker, "Mitigating routing misbehavior in mobile ad hoc networks," in ACM Mobicom, 2000.
13. V. Srinivasan, P. Nuggehalli, C. F. Chiasserini, and R. R. Rao, "Cooperation in wireless ad hoc networks," in IEEE INFOCOM, 2003.
14. L. Blazevic, L. Buttyan, S. Capkun, S. Giordano, J. P. Hubaux, and J. Y. Le Boudec, "Self-organization in mobile ad-hoc networks: the approach of terminodes," IEEE Communications Magazine, vol. 39, no. 6, pp. 166-174, 2001.
15. W. Wang, X.-Y. Li, and Y. Wang, "Truthful multicast in selfish wireless networks," in ACM MobiCom, 2004.
16. L. Anderegg and S. Eidenbenz, "Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents," in ACM MobiCom, 2003.
17. N. Nisan and A. Ronen, "Algorithmic mechanism design," in ACM STOC, 1999.
18. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, "A BGP-based mechanism for lowest-cost routing," in ACM PODC, 2002.