A New Variant of Game Theory Based Decision Making (GTDM) Algorithm Routing Protocols to Improve Energy Efficiency on Vehicular Delay Tolerant Network (VDTN)

Muhammad Biben Triadi, Doan Perdana, Rendy Munadi, Li Wenzao


These days, the application of Delay Tolerant Networks (DTN) have been expanded into various scenarios of communications field. Vehicular Ad hoc Networks (VANETs) as a communication scenario which treat its subject to disruption and disconnection with frequent partitioning and high latency. Therefore, Vehicular Delay Tolerant Network (VDTN) is introduced as a new research paradigm due to several characteristics match according to specific prerequisites. DTNs is proposed in Vehicular Network because its mechanisms which is using store-carry-forward, can be implemented to deliver the packets, without end-to-end connection, to the destination. One of challenging research of DTN in routing protocol is to meet prerequisites of many applications, especially in vehicular network (VDTN).  This paper presents a new variant of Game Theory based on Decision Making (GTDM) that can deliver packet to static node due to improve the energy efficiency of DTNs in city environments. Hence, its destination node (Receiver Node) needs to go to the static node to take their packet under Working Day Movement (WDM), because relay node will be passing by the static node with continuously move to its track to deliver packet. In this paper author will analyze the new variant of GTDM (NVGTDM) which can be more useful than original GTDM for application in city environment with using transportation movement. We conclude that modification of GTDM routing algorithm (NVGTDM) improves energy efficiency as much as 10.38% than the original GTDM. Hence, it can be ensured to compare either to Epidemic or PRoPHET routing algorithm with 55.44% and 68.75% in rates of energy efficiency respectively.

Full Text: PDF


  • There are currently no refbacks.

International Journal of Communication Networks and Information Security (IJCNIS)          ISSN: 2076-0930 (Print)           ISSN: 2073-607X (Online)