Algorithms
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
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
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
UCAN: a unified cellular and ad-hoc network architecture
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
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)
Specification faithfulness in networks with rational nodes
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proceedings of the 11th annual international conference on Mobile computing and networking
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
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
Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
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
Integrated cellular and ad hoc relaying systems: iCAR
IEEE Journal on Selected Areas in Communications
Journal of Parallel and Distributed Computing
A combinational perspective in stimulating cooperation in mobile ad hoc networks
Journal of Computer Science and Technology
RBC-OLSR: Reputation-based clustering OLSR protocol for wireless ad hoc networks
Computer Communications
A novel acknowledgment-based approach against collude attacks in MANET
Expert Systems with Applications: An International Journal
Cross-layer metrics for reliable routing in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
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 (least cost) 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.