Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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 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
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
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
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)
Proceedings of the 11th annual international conference on Mobile computing and networking
DOA: DSR over AODV Routing for 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
Network coding based reliable disjoint and braided multipath routing for sensor networks
Journal of Network and Computer Applications
Generalized second price auction in multi-path routing with selfish nodes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Adaptive routing in mobile ad hoc networks based on decision aid approach
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Discovering AODV-based multipath routes in wireless ad hoc networks
Security and Communication Networks
| Hi-index | 0.00 |
Multiple path routing protocols are shown to be performance-effective alternatives over single-path routing for ad hoc networks. They provide better resistance to link breakage and load balancing. However, these protocols typically assume a cooperative network setting. In practice nodes in an ad hoc network may behave selfishly and may not be willing to forward packets for other nodes freely. One way to stimulate nodes' cooperation is to reimburse forwarding nodes according to their cost such that these nodes get enough incentive. However, selfish nodes may cheat over their cost to maximize their payoff. This necessitates the need for a truthful protocol which maximizes a node's payoff only when it reveals its true cost. In this paper, we present GTMR, a generic mechanism to transform any table-driven multipath routing protocol into a truthful one, and prove that it guarantees truthfulness. Further, we present TMRP - a truthful multipath routing protocol based on AOMDV protocol as an instance of GTMR. A prominent feature of TMRP is that it incurs only 2n control packets for a route discovery and does not require new types of control messages over AOMDV. To the best of our knowledge, this is the lowest overhead incurred for any truthful routing protocols. TMRP can also achieve load balancing without compromising truthfulness. We conduct an extensive simulation study to evaluate the performance of TMRP. Simulation results show that TMRP provides high packet delivery ratio and has low overhead and low end-to-end delay without compromising the overpayment to the nodes.