A dempster-shafer based tit-for-tat strategy to regulate the cooperation in VANET using QoS-OLSR protocol

Wireless Personal Communications

Volumn 75, Issue 3, 2014, Pages 1635-1667

  Wahab, Omar Abdel ^a   Otrok, Hadi ^b   Mourad, Azzam ^a  

^a LEBANESE AMERICAN UNIVERSITY   (Lebanon)

^b KHALIFA UNIVERSITY   (United Arab Emirates)

Author keywords

Dempster Shafer; Game theory; Information dissemination; Packet collision; QoS OLSR; Tit for Tat; Vehicular Ad hoc Network (VANET)

Indexed keywords

GAME THEORY; INFORMATION DISSEMINATION; QUALITY OF SERVICE;

DEMPSTER-SHAFER; DEMPSTER-SHAFER THEORY; NODE COOPERATION; PACKET COLLISIONS; PROACTIVE PROTOCOL; TIT FOR TATS; TIT-FOR-TAT STRATEGIES; VEHICULAR NETWORKS;

VEHICULAR AD HOC NETWORKS;

EID: 84899423835     PISSN: 09296212     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11277-013-1443-y     Document Type: Article

References (39)

1. Anderegg, L.; & Eidenbenz, S. (2003). Ad hoc-VCG: A truthful and cost-efficient routing protocol for Mobile ad hoc networks with selfish agents. In Proceedings of the 9th annual international conference on Mobile computing and networking, pp. 245-259.
2. Anjum, F.; & Mouchtaris, P. (2007). Security for wireless ad hoc networks. Hoboken: Wiley.
3. Axelrod, R. (1981). The Emergence of Cooperation among Egoists. The American Political Science Review, 75, 306-318.
4. Axelrod, R. (1984). The evolution of cooperation. New York: Basic.
5. Badis, H.; & Al Agha, K. (2005). QOLSR, QoS routing for ad hoc wireless networks using OLSR. European Transactions on Telecommunications, 16, 427-442.
6. Balakrishnan, K.; Deng, J.; & Varshney, P.-K. (2005). TWOACK: Preventing selfishness in Mobile ad hoc networks. In Proceedings of IEEE wireless communications and networking conference (WCNC'05), (Vol. 4, pp. 2137-2142).
7. Buchegger, S.; & Le Boudec, J.-Y. (2002). Performance analysis of the confidant protocol. In Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, (pp. 226-236).
8. Chen, T.-M.; Venkataramanan, V. (2005). Dempster-shafer theory for intrusion detection in ad hoc networks. IEEE Internet Computing, 9, 35-41.
9. Cover, T.-M.; & Thomas, J.-A. (2006). Elements of information theory (2nd ed.). Hoboken: Wiley.
10. Douceur, J.-R.; & Moscibroda, T. (2007). Lottery trees: Motivational deployment of networked systems. In Proceedings of the 2007 conference on applications, technologies, architectures, and protocols for, computer communications, (pp. 121-132).
11. Felegyhazi, M.; Hubaux, J. P.; & Buttyan, L. (2006). Nash equilibria of packet forwarding strategies in wireless ad hoc networks. IEEE Transactions on Mobile Computing, 5, 463-476.
12. Fiore, M.; Harri, J.; Filali, F.; & Bonnet, C. (2007). Vehicular Mobility Simulation for VANETs. In Simulation symposium, annual, (pp. 301-309).
13. Gilat, A. (2008). MATLAB: An introduction with applications. Hoboken: Wiley.
14. Harri, J.; Filali, F.; Bonnet, C.; & Fiore, M. (2006). VanetMobiSim: Generating realistic mobility patterns for VANETs. In Proceedings of the 3rd international workshop on vehicular, ad hoc networks, (pp. 96-97).
15. Jain, S.; Fall, K.; & Patra, R. (2004). Routing in a delay tolerant network. SIGCOMM Computer Communications Review, 34, 145-158.
16. Jawandhiya, P.; Ghonge, M.; Ali, M.-S.; & Deshpande, J.-S. (2010). A survey of mobile ad hoc network attacks. International Journal of Engineering Science and Technology, 2, 4063-4071.
17. Johnson, D.-B.; & Maltz, D.-A. (1996). Dynamic source routing in ad hoc wireless networks. Mobile Computing, 353, 153-181.
18. Jones, E.; Li, L.; & Ward, P. (2007). Practical routing in delay-tolerant networks. IEEE Transactions on Mobile Computing, 6, 943-959.
19. Lee, S.; Pan, G.; Park, J.; Gerla, M.; & Lu, S. (2007). Secure incentives for commercial ad dissemination in vehicular networks. In Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, (pp. 150-159).
20. Li, F.; & Wu, J. (2009). FRAME: An innovative incentive scheme in vehicular networks. In Proceedings of the 2009 IEEE international conference on communications, (pp. 4638-4643).
21. Lian, Q.; Peng, Y.; Yang, M.; Zhang, Z.; Dai, Y.; & Li, X. (2008). Robust incentives via multi-level Tit-for-Tat: research articles. Concurrency and Computation: Practice and Experience, 20, 167-178.
22. Liu, K.; Deng, J.; Varshney, K.; & Balakrishnan, K. (2007). An acknowledgment-based approach for the detection of routing misbehavior in MANETs. IEEE Transactions on Mobile Computing, 6, 536-550.
23. Marasigan, D.; & Rommel, P. (2005). MV routing and capacity building in disruption tolerant networks. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, (Vol. 1, pp. 398-408).
24. Marti, S.; Giuli, T.-J.; Lai, K.; & Baker, M. (2000). Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the 6th annual international conference on Mobile computing and networking, (pp. 255-265).
25. Michiardi, P.; Molva, R. (2002). CORE: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In Proceedings of the IFIP TC6/TC11 sixth joint working conference on communications and multimedia security.
26. Milan, F. (2006). Achieving cooperation in multihop wireless networks of selfish nodes. In Workshop on game theory for networks (GameNets 2006).
27. Milan, F.; Jaramillo, & J.; Srikant, R. (2006). Performance analysis of Reputation-based mechanisms for multi-hop wireless networks. In Proceedings of 40TH conference on information sciences and systems (CISS 2006), (pp. 12-17).
28. Nowak, M.-A.; & Sigmund, K. (1992). Tit for tat in heterogeneous populations. Nature, 355, 250-253.
29. Nowak, M.-A.; & Sigmundl, K. (1994). The alternating prisoner's dilemma. Journal of Theoretical Biology, 168, 219-226.
30. Nzouonta, J.; Rajgure, N.; Wang, G.; Borcea, C. (2009). VANET routing on city roads using real-time vehicular traffic information. IEEE Transactions on Vehicular Technology, 58, 3609-3626.
31. Otrok, H.; Mourad, A.; Robert, J.-M.; Moati, N.; & Sanadiki, H. (2011). A cluster-based model for QoS-OLSR protocol. In IWCMC, (pp. 1099-1104).
32. Ramakrishnan, B. (2012). Performance analysis of AODV routing protocol in Vehicular ad-hoc network service discovery architecture. ARPN Journal of Systems and Software, 96, 65-72.
33. Shafer, G. (1976). A mathematical theory of evidence. Princeton, NJ, USA: Princeton University Press.
34. Spyropoulos, T.; Psounis, K.; & Raghavendra, C.-S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, (pp. 252-259).
35. Turocy, T.-L.; & Stengel, B. (2001). Game theory. Technical report.
36. Vahdat, A.; & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks. Technical report.
37. Wu, J.; & Axelrod, R. (1995). How to cope with noise in the iterated prisoner's dilemma. Journal of Conflict Resolution, 39, 183-189.
38. Zhao, J.; & Guohong, G. (2008). VADD: Vehicle-assisted data delivery in vehicular ad hoc networks. In IEEE Transactions on Vehicular Technology, (Vol. 57, pp. 1910-1922).
39. Zhong, S.; Yang, Y.; & Chen, J. (2003). Sprite: A simple, cheat-proof, credit-based system for Mobile ad hoc networks. In Proceedings of INFOCOM, (pp. 1987-1997).