Abstract
We introduce Light-weight Scalable Truthful rOuting Protocol (LSTOP) for selfish nodes problem in mobile ad hoc networks where a node may use different cost to send packets to different neighbors. LSTOP is a truthful and scalable routing protocol. It incurs an overhead of O(n 2) in the worst case and only O(n) on the average, a substantial improvement over a recently proposed truthful routing protocol, which incurs an overhead of O(n 3). LSTOP encourages nodes’ cooperation by rewarding nodes for their forwarding service according to their cost and provides near-least-cost paths and even least paths with high probability in dense networks. We show the truthfulness of LSTOP and present results from an extensive simulation study to evaluate the performance of our protocol. Simulation results show that LSTOP approaches optimal (cost) routing, provides significantly higher packet delivery ratio, generates significantly lower control overhead, lower end-to-end delay and has better overpayment ratio compared to ad hoc-VCG.
This research was partially supported by NSF grants IIS-0242384 and IIS-0324836.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: A truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents. In: Proceedings of MobiCom 2003, pp. 245–259 (September 2003)
Srinivasan, V., Nuggehalli, P., Chiasserini, F., Rao, R.R.: Cooperation in wireless ad hoc networks. In: Proceeding of Infocom 2003 (2003)
Cai, J., Pooch, U.: Play Alone or Together-Truthful and Efficient Routing in Wireless Ad Hoc Networks with Selfish Nodes. In: Proceeding of MASS 2004 (2004)
Chen, K., Nahrstedt, K.: iPass: an Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in MANET. In: Proceedings of ICDCS 2004, pp. 534–542 (2004)
Wang, W., Li, X.Y.: Truthful Low Cost Unicast in Selfish Wireless Networks. In: Proceedings of IPDPS 2004-Workshop 12 (2004)
Buttyan, L., Hubaux, J.: Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks. ACM/Kluwer Mobile Networks and Applications 8(5), 579–592 (2003)
Zhong, S., Chen, J., Yang, Y.R.: Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks. In: Proceedings of Infocom 2003 (March 2003)
Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. In: Proceedings of PODC 2002, pp. 173–182 (2002)
Buttyan, L., Hubaux, J.-P.: Enforcing Service Availability in Mobile Ad-Hoc WANs. In: Proceedings of MobiHoc 2000 (2000)
Salem, N.B., Buttyan, L., Hubaus, J., Jakobsson, M.: A Charging and Rewarding Scheme for Packet Forwarding in Multi-hop Cellular Networks. In: Proceedings of MobiHoc 2003, pp. 13–24 (2003)
Fratkin, E., Vijayaraghavan, V., Liu, Y., Gutierrez, D., Li, T.M., Baker, M.: Participation Incentives for Ad Hoc Networks, http://www.stanford.edu/~yl314/ape/paper.ps
Pietro Michiardi and Refik Molva, Prevention of Denial of Service Attacks and Selfishness in Mobile Ad Hoc Networks, Research Report RR-02-063 - (January 2002)
Buchegger, S., Le-Boudec, J.Y.: Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc networks. In: Proceedings of EUROMICRO-PDP 2002 (2002)
Buchegger, S., Le-Boudec, J.Y.: Performance Analysis of the Confidant Protocol (Cooperation of Nodes: Fairness in Dynamic Ad-hoc Networks). In: Proceedings of MobiHoc 2002, pp. 226–236 (June 2002)
Marti, S., Giuli, T.J., Lai, K., Baker, M.: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. In: Proceedings of MobiCom 2000, pp. 255–265 (August 2000)
Miranda, H., Rodrigues, L.: Preventing Selfishness in Open Mobile Ad Hoc Networks. In: Proceedings of 7th CaberNet Radicals Workshop (October 2002)
Paul, K., Westhoff, D.: Context Aware Detection of Selfish Nodes in DSR based Ad-Hoc Networks. In: Proceedings of VTC 2002 (2002)
Wang, Y., Giruka, V.C., Singhal, M.: A Fair Distributed Solution for Selfish Node Problem in Mobile Ad Hoc Networks. In: Proceedings of ADHOCNOW 2004, pp. 211–224 (2004)
Zhong, S., Li, L., Liu, Y.G., Yang, Y.R.: On Designing Incentive-compatible Routing and Forwarding Protocols in Wireless Ad-Hoc Networks - An Integrated Approach Using Game Theoretical and Cryptographic Techniques. In: Proceedings of MobiCom 2005 (2005)
Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. Journal of Finance 16, 8–37 (1960)
Clarke, E.: Multipart Pricing of Public Goods. Public Choice 11, 17–33 (1971)
Groves, T.: Incentives in Teams. Econometrica 41, 617–663 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Singhal, M. (2006). LSTOP: A Light-Weight Scalable Truthful Routing Protocol in MANETs with Selfish Nodes. In: Kunz, T., Ravi, S.S. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2006. Lecture Notes in Computer Science, vol 4104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814764_23
Download citation
DOI: https://doi.org/10.1007/11814764_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37246-2
Online ISBN: 978-3-540-37248-6
eBook Packages: Computer ScienceComputer Science (R0)