A light-weight scalable truthful routing protocol in MANETs with selfish nodes

Authors:
Yongwei Wang;Mukesh Singhal
Affiliations:
Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA.;Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2009

Citing 14
Cited 0

A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Mitigating routing misbehavior in mobile ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Effects of wireless physical layer modeling in mobile ad hoc networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Performance analysis of the CONFIDANT protocol

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Enforcing service availability in mobile ad-hoc WANs

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
A BGP-based mechanism for lowest-cost routing

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks

Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
A charging and rewarding scheme for packet forwarding in multi-hop cellular networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents

Proceedings of the 9th annual international conference on Mobile computing and networking
Stimulating cooperation in self-organizing mobile ad hoc networks

Mobile Networks and Applications
iPass: An Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in MANET

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques

Proceedings of the 11th annual international conference on Mobile computing and networking
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks

EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a 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 neighbours. LSTOP encourages nodes' cooperation by rewarding nodes for their forwarding service according to their cost. It incurs a low overhead of O(n2) in the worst case and only O(n) on the average. We show the truthfulness of LSTOP and present the result of an extensive simulation study to show that LSTOP approaches optimal (cost) routing and achieves significant better network performance compared to ad hoc-VCG.