The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2010 vol.9)
pp: 420-434
Yanwei Wu , Illinois Institute of Technology, Chicago
Shaojie Tang , Illinois Institute of Technology, Chicago
Ping Xu , Illinois Institute of Technology, Chicago
Xiang-Yang Li , Illinois Institute of Technology, Chicago
ABSTRACT
For noncooperative networks in which each node is a selfish agent, certain incentives must be given to intermediate nodes to let them forward the data for others. What makes the scenario worse is that, in a multihop noncooperative network, the end points can only observe whether or not the end-to-end transaction was successful or not, but not the individual actions of intermediate nodes. Thus, in the absence of properly designed incentive schemes, rational and selfish intermediate nodes may choose to forward data packets at a very low priority or simply drop the packets, and they could put the blame on the unreliable channel. In this paper, assuming the receiver is a trusted authority, we propose several methods that discourage the hidden actions under hidden information in multihop noncooperative networks with high probability. We design several algorithmic mechanisms for a number of routing scenarios such that each selfish agent will maximize its expected utility (i.e., profit) when it truthfully declares its type (i.e., cost and its actions) and it truthfully follows its declared actions. Our simulations show that the payments by our mechanisms are only slightly larger than the actual cost incurred by all intermediate nodes.
INDEX TERMS
Noncooperative networks, reliability, hidden action, hidden information, selfish, truthful, mechanism.
CITATION
Yanwei Wu, Shaojie Tang, Ping Xu, Xiang-Yang Li, "Dealing with Selfishness and Moral Hazard in Noncooperative Wireless Networks", IEEE Transactions on Mobile Computing, vol.9, no. 3, pp. 420-434, March 2010, doi:10.1109/TMC.2009.142
REFERENCES
[1] L. Anderegg and S. Eidenbenz, “Ad Hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents,” Proc. ACM MobiCom, pp. 245-259, 2003.
[2] A. Archer and L. Tardos, “Frugal Path Mechanisms,” Proc. ACM Symp. Discrete Algorithms (SODA), pp. 991-998, 2002.
[3] S. Banerjee and A. Misra, “Minimum Energy Paths for Reliable Communication in Multi-Hop Wireless Networks,” Proc. ACM MobiHoc, pp. 146-156, 2002.
[4] B. Bollobás, Random Graphs. Cambridge Univ. Press, 2001.
[5] L. Buttyan and J. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks,” ACM/Kluwer Mobile Networks and Applications, vol. 8, no. 5, pp. 579-592, Oct. 2003.
[6] L. Buttyan and J.P. Hubaux, “Enforcing Service Availability in Mobile Ad-Hoc Wans,” Proc. ACM MobiHoc, pp. 87-96, 2000.
[7] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “SPAN: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Proc. Conf. Mobile Computing and Networking, pp. 85-96, 2001.
[8] K. Chen and K. Nahrstedt, “IPASS: An Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in Manet,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS), pp. 534-542, 2004.
[9] E.H. Clarke, “Multipart Pricing of Public Goods,” Public Choice, vol. 11, pp. 17-33, 1971.
[10] Q. Dong, S. Banerjee, M. Adler, and A. Misra, “Minimum Energy Reliable Paths Using Unreliable Wireless Links,” Proc. ACM MobiHoc, 2005.
[11] S. Eidenbenz, G. Resta, and P. Santi, “Commit: A Sender Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes,” Proc. IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), Apr. 2005.
[12] S. Eidenbenz, G. Resta, and P. Santi, “The Commit Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes,” IEEE Trans. Mobile Computing, vol. 7, no. 1, pp. 19-33, Jan. 2008.
[13] J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, “A BGP-Based Mechanism for Lowest-Cost Routing,” Proc. ACM Symp. Principles of Distributed Computing (PODC), pp. 173-182, 2002.
[14] M. Feldman and J. Chuang, “Hidden Action in Multi-Hop Routing,” Proc. Second Workshop Economics of Peer-to-Peer Systems, in conjunction with ACM Sigcomm, 2004.
[15] M. Feldman, J. Chuang, I. Stoica, and S. Shenker, “Hidden Action in Multi-Hop Routing,” Proc. ACM E-Commerce Conf., 2005.
[16] M. Felegyhazi, L. Buttyan, and J. Hubaux, “Equilibrium Analysis of Packet Forwarding Strategies in Wireless Ad Hoc Networks—The Static Case,” Personal Wireless Communications, Springer, 2003.
[17] T. Groves, “Incentives in Teams,” Econometrica, pp. 617-631, 1973.
[18] J. Hershberger and S. Suri, “Vickrey Pricing in Network Routing: Fast Payment Computation,” Proc. IEEE Symp. Foundations of Computer Science (FOCS), pp. 252-259, 2001.
[19] M. Jakobsson, J.-P. Hubaux, and L. Buttyan, “A Micro-Payment Scheme Encouraging Collaboration in Multi-Hop Cellular Networks,” Proc. Conf. Financial Cryptography, 2003.
[20] J.J. Jaramillo and R. Srikant, “Darwin: Distributed and Adaptive Reputation Mechanism for Wireless Ad-Hoc Networks,” Proc. ACM MobiCom, pp. 87-98, 2007.
[21] R. Kannan and S. Iyengar, “Game-Theoretic Models for Reliable Path-Length and Energy-Constrained Routing with Data Aggregation in Wireless Sensor Networks,” IEEE J. Selected Areas Comm., vol. 22, no. 6, pp. 1141-1150, Aug. 2004.
[22] R. Kannan, S. Sarangi, and S.S. Iyengar, “Sensor-Centric Energy-Constrained Reliable Query Routing for Wireless Sensor Networks,” J. Parallel and Distributed Computing vol. 64, no. 7, pp. 839-852, 2004.
[23] R. Kannan, S. Sarangi, S.S. Iyengar, and L. Ray, “Sensor-Centric Quality of Routing in Sensor Networks,” Proc. IEEE INFOCOM, 2003.
[24] M.-Y. Kao, X.-Y. Li, and W. Wang, “Towards Truthful Mechanisms for Binary Demand Games: A General Framework,” Proc. ACM Conf. Electronic Commerce, 2005.
[25] X. Li, Y. Wu, P. Xu, G. Chen, and M. Li, “Hidden Information and Actions in Multi-Hop Wireless Ad Hoc Networks,” Proc. ACM MobiHoc, 2008.
[26] B. Liang and Z.J. Haas, “Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management,” Proc. IEEE INFOCOM, vol. 3, pp. 1293-1302, 2000.
[27] H. Liu and B. Krishnamachari, “A Price-Based Reliable Routing Game in Wireless Networks,” Proc. 2006 Workshop Game Theory for Comm. and Networks (GameNets '06), p. 7, 2006.
[28] S. Marti, T.J. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proc. ACM MobiCom, 2000.
[29] N. Immorlica, D.E.N. Karger, and R. Sami, “First-Price Path Auctions,” Proc. Sixth ACM Conf. Electronic Commerce, 2005.
[30] N. Nisan and A. Ronen, “Algorithmic Mechanism Design,” Proc. ACM Symp. Theory of Computing (STOC '99), pp. 129-140, 1999.
[31] M.J. Osborne and A. Rubinstein, A Course in Game Theory. The MIT Press, 2002.
[32] L. Qiu, Y.R. Yang, Y. Zhang, and S. Shenker, “On Selfish Routing in Internet-Like Environments,” Proc. ACM SIGCOMM, pp. 151-162, 2003.
[33] N.B. Salem, L. Buttyan, J.-P. Hubaux, and M. Kakobsson, “A Charging and Rewarding Scheme for Packet Forwarding in Multi-Hop Cellular Networks,” Proc. ACM MobiHoc, 2003.
[34] P. Sinha, R. Sivakumar, and V. Bharghavan, “Cedar: Core Extraction Distributed Ad Hoc Routing Algorithm,” IEEE J.Selected Areas Comm., vol. 17, no. 8, pp. 1454-1465, Aug. 1999.
[35] V. Srinivasan, P. Nuggehalli, C.F. Chiasserini, and R.R. Rao, “Energy Efficiency of Ad Hoc Wireless Networks with Selfish Users,” Proc. European Wireless Conf. 2002 (EW '02), 2002.
[36] V. Srinivasan, P. Nuggehalli, C.F. Chiasserini, and R.R. Rao, “Cooperation in Wireless Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM, 2003.
[37] W. Vickrey, “Counterspeculation, Auctions and Competitive Sealed Tenders,” J. Finance, pp. 8-37, 1961.
[38] W. Wang, X.-Y. Li, Y. Wang, and Z. Sun, “Designing Multicast Protocols for Non-Cooperative Networks,” IEEE J. Selected Areas Comm., vol. 26, no. 7, pp. 1238-1249, Sept. 2008.
[39] W. Wang, S. Eidenbez, Y. Wang, and X.-Y. Li, “OURS—Optimal Unicast Routing Systems in Non-Cooperative Wireless Networks,” Proc. ACM MobiCom, 2006.
[40] W. Wang and X.-Y. Li, “Low-Cost Routing in Selfish and Rational Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 5, pp. 596-607, May 2006.
[41] W. Wang, X.-Y. Li, and Y. Wang, “Truthful Multicast in Selfish Wireless Networks,” Proc. ACM MobiCom, 2004.
[42] C.-W. Yi, “Probabilistic Aspects of Wireless Ad Hoc Networks,” PhD thesis, Illinois Inst. of Tech nology, 2005.
[43] W. Yu and K. Liu, “Attack-Resistant Cooperation Stimulation in Autonomous Ad Hoc Networks,” IEEE J. Selected Areas Comm., vol. 23, no. 12, pp. 2260-2271, Dec. 2005.
[44] W. Yu, Y. Sun, and K. Liu, “Hadof: Defense Against Routing Disruptions in Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, vol. 2, pp. 1252-1261, 2005.
[45] S. Zhong, J. Chen, and Y. Yang, “Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, 2003.
[46] S. Zhong, E.L. Li, Y. Liu, and Y.R. Yang, “On Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad-Hoc Networks,” Proc. ACM MobiCom, 2005.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool