GTDM: A DTN Routing on Noncooperative Game Theory in a City Environment

Abstract

The performance of delay tolerant networks (DTNs) can be influenced by movement model in different application environments. The existing routing algorithms of DTNs do not meet the current city environments due to the large differences in node densities, social characteristics, and limited energy. The key indicators of DTNs such as success delivery ratio, average delivery latency, network lifetime, and network overhead ratio can influence the performances of civil DTNs applications. Aiming to improve the key indicators of DTNs in city environments, this paper presents a fixed sink station based structure and a more proper routing algorithm named Game Theory Based Decision Making (GTDM). GTDM shows decision-making process for neighborhood selection and packet delivering strategy which is based on the noncooperative game theory method and city environment characteristics. GTDM performance is evaluated using numerical simulations under Working Day Movement (WDM) model and the results suggested that GTDM outperforms other traditional DTNs routing approaches, such as Epidemic and Prophet algorithms.

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

“…For an instance, two persons will spend all day working, which causes the mobile nodes to have repeated contact [17]. In addition, S Bharathi et al [18] and Li Wenzao et al [10] tells that in city environments there are active objects and inactive objects, which we also agree. Based on S Bharathi research, the high encounter opportunity will belong to the former objects than inactive objects, and the active sensor carrier is fit as a relay node in the network [18].…”

“…Clearly, the Prophet routing algorithm and Epidemic routing algorithm do not fulfill prerequisites in city environment, where all the characteristics of social relationships and the routines of pedestrians are not considered in Prophet routing algorithm and the ability under the limited resource scenario cannot be released by Epidemic routing algorithm. A more practical and effective GTDM-based routing algorithm has proposed by Li Wenzao et al [10]. GTDMbased has proved as a more flexible and scalable DTN routing algorithm for city environments and also can prolong the network lifetime than Epidemic and Prophet, because it considers various aspects of city environments.…”

“…The steps of the original GTDM routing protocol can be seen in Figure 2, but basically GTDM routing protocols has 5 steps. • 𝜔 = the successful delivery of nodes, which is calculated as follow [10]: (1) where 𝜔i φ (t) represents the accumulated packet delivery statistics at time t, φ is the destination address set, and ε is the event counting function.…”

“…• 𝐶𝑖 𝑟 = coins count • V = asset value • 𝐿𝑟 = the remaining buffer size • 𝐸 𝑟 = the energy level, which is calculated as follow [10]:…”

“…Several works have proposed to improve delivery ratio and mitigate average delay, but it gains the wasting amount of energy [8]. Based on the considerations, Wenzao Li et al [10] has proposed a non-cooperative routing protocol algorithm called GTDM which can maintain the waste amount of energy and also without neglect several DTN parameters such as Packet Delivery Ratio (PDR), Average Latency, and Overhead Ratio compare to Epidemic and ProPHET protocols. [11] VDTN is a blend between DTN technology and VANET technology.…”