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
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile 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
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Proceedings of the 9th annual international conference on Mobile computing and networking
Equilibria in topology control games for ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
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
Incentive Compatible Cost- and Stability-Based Routing in Ad Hoc Networks
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A framework for incentive compatible topology control in non-cooperative wireless multi-hop networks
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
OURS: optimal unicast routing systems in non-cooperative wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Profit-Based Routing for Multihop Coverage Extension in Wireless Networks
Wireless Personal Communications: An International Journal
On improving the efficiency of truthful routing in MANETs with selfish nodes
Pervasive and Mobile Computing
Trust management for secure information flows
Proceedings of the 15th ACM conference on Computer and communications security
COFFEE: a context-free protocol for stimulating data forwarding in wireless ad hoc networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Studying on economic-inspired mechanisms for routing and forwarding in wireless ad hoc network
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
DDoS mitigation in non-cooperative environments
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Emergency connectivity in ad-hoc networks with selfish nodes
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Pricing, competition, and routing in relay networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A collusion-resistant routing scheme for noncooperative wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
A cross-layer route discovery strategy for virtual currency systems in mobile ad hoc networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
An optimal, strategy-proof scheme for multi-path traffic assignment in non-cooperative networks
IEEE Transactions on Wireless Communications
Protocols for stimulating packet forwarding in wireless ad hoc networks
IEEE Wireless Communications
On effectiveness of cooperation enforcement mechanisms in wireless ad hoc networks
International Journal of Communication Networks and Distributed Systems
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
A multi-hop advertising discovery and delivering protocol for multi administrative domain MANET
Mobile Information Systems
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
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 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.