LSTOP: 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;Department of Computer Science, University of Kentucky, Lexington, KY
Venue:
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Year:
2006

Citing 10
Cited 0

Mitigating routing misbehavior in mobile ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
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 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(n2) 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(n3). 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.