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
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Security for Wireless Ad--hoc Networks
Security for Wireless Ad--hoc Networks
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Dempster-Shafer Theory for Intrusion Detection in Ad Hoc Networks
IEEE Internet Computing
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
VanetMobiSim: generating realistic mobility patterns for VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Achieving cooperation in multihop wireless networks of selfish nodes
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
MATLAB: An Introduction with Applications
MATLAB: An Introduction with Applications
Vehicular Mobility Simulation for VANETs
ANSS '07 Proceedings of the 40th Annual Simulation Symposium
An Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETs
IEEE Transactions on Mobile Computing
Practical Routing in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
Lottery trees: motivational deployment of networked systems
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Secure incentives for commercial ad dissemination in vehicular networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Robust incentives via multi-level Tit-for-Tat: Research Articles
Concurrency and Computation: Practice & Experience - Recent Advances in Peer-to-Peer Systems and Security (P2P 2006)
FRAME: an innovative incentive scheme in vehicular networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 0.00 |
In this paper, we address the problem of cooperation among vehicles in VANET using QoS-OLSR protocol in the presence of selfish nodes. QoS-OLSR is a proactive protocol that considers the Quality of Service (QoS) of the nodes while electing the cluster-heads and selecting the Multi-Point Relay (MPRs) nodes. Cluster-heads and MPRs might misbehave on the roads by over-speeding or under-speeding. Classical and generous Tit-for-Tats are proposed to analyze the interaction among vehicles. However, both strategies are not able to enforce the cooperation due the fact that they (1) count on individual watchdogs monitoring, (2) rely on the node-to-node cooperation decision, (3) and ignore the high mobility and packet collisions. Therefore, we propose a Dempster---Shafer based Tit-for-Tat strategy that is able to improve the decision and regulate the cooperation in the vehicular network. This is done by (1) launching a cooperative watchdogs monitoring, (2) correlating the observations of the different watchdogs using Dempster---Shafer theory, and (3) propagating the decisions among clusters. Thereafter, we compare the Dempster---Shafer based strategy with several strategies derived from the original Tit-for-Tat. Simulation results prove that the Dempster---Shafer based strategy is able to maintain the survivability of the vehicular network in the presence of high mobility and packet collisions with minimal time and overhead.