TLC: Trust Point Load Balancing Method using Coalitional Game Theory for message forwarding in VANET

Message forwarding between vehicles has become an important aspect in Vehicular ad hoc network (IEEE 802.11e) where message gets forward from the source node to the destination node. As VANET is a dynamic network where independent identity node helps each other to forward the message. However many times nodes are not interested in forwarding the message due to their selfish nature or to save their resources like memory. Thus, it is essential to give the node some incentive to forward the message. Recently many routing protocol has been proposed for message forwarding like proportional, receipt counting and Frame. However for higher vehicle density area, they have not addressed the load balancing issue for messages forwarding. TLC (Trust point Load Balancing Method using Coalitional Game Theory) scheme proposes Trust point system for message forwarding using Coalitional game theory. Further TLC also addressed the load balancing issue based on trust points.

[1]  Jing Cao,et al.  Routing Algorithm Based on Multi-Community Evolutionary Game for VANET , 2012, J. Networks.

[2]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.

[3]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[4]  Henning Schulzrinne,et al.  Using a symmetric game based in volunteer's dilemma to improve VANETs multihop broadcast communication , 2011, 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications.

[5]  Oliver Brock,et al.  MV routing and capacity building in disruption tolerant networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Fan Wu,et al.  Incentive-compatible opportunistic routing for wireless networks , 2008, MobiCom '08.

[7]  Sheng Zhong,et al.  Stimulating Cooperation in Vehicular Ad Hoc Networks: A Coalitional Game Theoretic Approach , 2011, IEEE Transactions on Vehicular Technology.

[8]  Levente Buttyán,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, MobiHoc.

[9]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[10]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[11]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[12]  Amarsinh Vidhate,et al.  Routing in Delay Tolerant Network , 2016 .

[13]  R. Srikant,et al.  DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks , 2007, MobiCom '07.

[14]  Yin Zhang,et al.  Incentive-aware routing in DTNs , 2008, 2008 IEEE International Conference on Network Protocols.

[15]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

[16]  Songwu Lu,et al.  Secure Incentives for Commercial Ad Dissemination in Vehicular Networks , 2012, IEEE Trans. Veh. Technol..