The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2008 vol.7)
pp: 19-33
ABSTRACT
We consider the problem of establishing a route and sending packets between a source/destination pair in ad hoc networks composed of rational selfish nodes, whose purpose is to maximize their own utility. In order to motivate nodes to follow the protocol specification, we use side payments that are made to the forwarding nodes. Our goal is to design a fully distributed algorithm such that: (i) a node is always better off participating in the protocol execution (individual rationality), (ii) a node is always better off behaving according to the protocol specification (truthfulness), (iii) messages are routed along the most energy-efficient (least cost) path, and (iv) the message complexity is reasonably low. We introduce the COMMIT protocol for individually rational, truthful, and energy efficient routing in ad hoc networks. To the best of our knowledge, this is the first ad hoc routing protocol with these features. COMMIT is based on the VCG payment scheme, in conjunction with a novel game-theoretic technique to achieve truthfulness for the sender node. By means of simulation, we show that the inevitable economic inefficiency is small. As an aside, our work demonstrates the advantage of using a cross-layer approach to solving problems: leveraging the existence of an underlying topology control protocol, we are able to simplify the design and analysis of our routing protocol, and to reduce its message complexity. On the other hand, our investigation of the routing problem in presence of selfish nodes disclosed a new metric under which topology control protocols can be evaluated: the cost of cooperation.
INDEX TERMS
wireless ad hoc networks, cooperation in ad hoc networks, cooperative routing, energy-efficiency, topology control
CITATION
Stephan Eidenbenz, Giovanni Resta, Paolo Santi, "The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes", IEEE Transactions on Mobile Computing, vol.7, no. 1, pp. 19-33, January 2008, doi:10.1109/TMC.2007.1069
REFERENCES
[1] G. Acs, L. Buttyan, and I. Vajda, “Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 11, pp. 1533-1546, Nov. 2006.
[2] 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.
[3] N. Ben Salem, L. Buttyan, J.P. Hubaux, and M. Jakobsson, “A Charging and Rewarding Scheme for Packet Forwarding in Multi-Hop Cellular Networks,” Proc. ACM MobiHoc, pp. 13-24, 2003.
[4] D.M. Blough, M. Leoncini, G. Resta, and P. Santi, “The k-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 141-152, June 2003.
[5] S. Buchegger and J. Le Boudec, “Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks,” Proc. 10th Euromicro Workshop Parallel, Distributed and Network-Based Processing, pp. 403-410, 2002.
[6] S. Buchegger and J. Le Boudec, “Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes—Fairness in Dynamic Ad-Hoc NeTworks,” Proc. ACM MobiHoc, 2002.
[7] L. Buttyan and J. Hubaux, “Enforcing Service Availability in Mobile Ad-Hoc WANs,” Proc. ACM MobiHoc, Aug. 2000.
[8] L. Buttyan and J. Hubaux, “Nuglets: A Virtual Currency to Stimulate Cooperation in Self-Organized Ad Hoc Networks, technical report, Communication Systems Dept. (DSC), Ecole Polytechnique Federale de Lausanne (EPFL), 2001.
[9] L. Buttyan and J. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks,” ACM/Kluwer Mobile Networks and Applications, vol. 8, no. 5, Oct. 2003.
[10] K. Chen and K. Nahrstedt, “iPass: An Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in Manets,” Proc. 24th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '04), 2004.
[11] Cisco Aironet 350 Data Sheets, http://www.cisco.com/en/US/products/hwwireless , 2007.
[12] S. Eidenbenz, V.S. Kumar, and S. Zust, “Equilibria in Topology Control Games for Ad Hoc Networks,” Proc. ACM Joint Workshop Foundations of Mobile Computing (DIALM-POMC '03), pp. 2-11, 2003.
[13] S. Eidenbenz, P. Santi, and G. Resta, “A Framework for Incentive Compatible Topology Control in Non-Cooperative Wireless Multi-Hop Networks,” Proc. Second ACM Workshop Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks (DIWANS '06), pp. 9-18, 2006.
[14] 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 '04), pp. 173-182, 2002.
[15] M. Felegyhazi, L. Buttyan, and J.P. Hubaux, “Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 5, pp. 463-476, May 2006.
[16] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, pp. 547-566, 1998.
[17] Y. Hu, A. Perrig, and D. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Proc. ACM MobiCom, pp.12-23, 2002.
[18] Y.-D. Lin and Y.-C. Hsu, “Multihop Cellular: A New Architecture for Wireless Communications,” Proc. IEEE INFOCOM, 2000.
[19] H. Luo, R. Ramjee, P. Sinha, L. Li, and S. Lu, “UCAN: A Unified Cellular and Ad Hoc Network Architecture,” Proc. ACM MobiCom, pp. 353-367, 2003.
[20] A. Mas-Colell, M. Whinston, and J. Green, Microeconomic Theory. Oxford Univ. Press, 1995.
[21] http:/www.priceline.com, 2007.
[22] P. Santi and D.M. Blough, “The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 1, pp. 25-39, Jan.-Mar. 2003.
[23] R. Sedgewick, Algorithms. Addison-Wesley, 1992.
[24] J. Shneidman and D. Parkes, “Specification Faithfulness in Networks with Rational Nodes,” Proc. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 88-97, 2004.
[25] V. Srinivasan, P. Nuggenhalli, C. Chiasserini, and R. Rao, “Cooperation in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, pp. 808-817, 2003.
[26] R. Wattenhofer, L. Li, P. Bahl, and Y. Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, pp. 1388-1397, 2001.
[27] H. Wu, C. Qios, S. De, and O. Tonguz, “Integrated Cellular and Ad Hoc Relaying Systems: iCAR,” IEEE J. Selected Areas in Comm., vol. 19, no. 10, Oct. 2001.
[28] S. Zhong, Y.R. Yang, and J. Chen, “Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-hoc Networks,” Proc. IEEE INFOCOM, pp. 1987-1997, 2003.
[29] S. Zhong, L. Li, Y. Liu, and Y. Yang, “On Designing Incentive Compatible Routing and Forwarding Protocols in Wireless AdHoc Networks—An Integrated Approach Using Game Theoretical and Cryptographic Techniques,” Proc. ACM MobiCom, pp. 117-131, 2005.
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool