Protocols for stimulating packet forwarding in wireless ad hoc networks

Authors:
Chengqi Song;Qian Zhang
Affiliations:
Hong Kong University of Science and Technology;Hong Kong University of Science and Technology
Venue:
IEEE Wireless Communications
Year:
2010

Citing 8
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
Stimulating cooperation in self-organizing mobile ad hoc networks

Mobile Networks and Applications
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
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
OURS: optimal unicast routing systems in non-cooperative wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Anonymous connections and onion routing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A wireless ad hoc network is a self-organized wireless network without centralized infrastructure. In such a network, nodes rely on each other to forward packets to remote destinations. A threat to such multihop transmission is posed by selfish nodes, which may drop others' packets to save their own bandwidth and battery life. Therefore, stimulating packet forwarding is a fundamental problem for wireless ad hoc networks. Most solutions proposed so far are either reputation-based or credit-exchange-based, which are fundamentally context-based solutions. They need to accurately identify selfish behaviors, securely maintain the context, and appropriately punish selfish nodes. These requirements are difficult to satisfy. Recently a solution from a new angle is proposed: a context-free protocol that does not rely on observation and selfish behavior detection. Given a path, a context-free protocol can transmit packets through it without knowing whether the intermediate nodes are selfish or not. It can get rid of all troubles caused by establishing and maintaining the context, and has some significant advantages over context-based solutions. In this article we first provide an overview of traditional context-based solutions, then introduce the recently proposed context-free solution, and finally analyze them extensively.