Incentive Compatible Cost- and Stability-Based Routing in Ad Hoc Networks

Authors:
Mingming Lu;Feng Li;Jie Wu
Affiliations:
Florida Atlantic University, USA;Florida Atlantic University, USA;Florida Atlantic University, USA
Venue:
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Year:
2006

Citing 7
Cited 0

Frugal path mechanisms

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
First-price path auctions

Proceedings of the 6th ACM conference on Electronic commerce
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
A new scheme on link quality prediction and its applications to metric-based routing

Proceedings of the 3rd international conference on Embedded networked sensor systems
Social Welfare Based Routing in Ad hoc Networks

ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we embed an incentive-compatible, efficient, and individual rational payment scheme into our cost- and stability-based routing protocol in ad hoc networks which consist of selfish nodes. Unlike traditional routing protocols in ad hoc networks, which only elicit cost information from selfish nodes, our protocol motivates selfish nodes to report truthfully both their stability and cost information.