A Game Theoretical Model for Energy-Aware DTN Routing in MANETs with Nodes’ Selfishness

Mao, Yuxin; Zhu, Ping

doi:10.1007/s11036-015-0610-7

Cited by 13 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous studies have investigated the problem of cooperation in VANETs using game theory, and have utilized a model with pairwise interactions [13][14][15][16][17][18][19]. This means that the effect of each player, or vehicle, is assumed to be limited to only one other companion player.…”

Section: Related Workmentioning

confidence: 99%

Ecological Dynamics and Evolution of Cooperation in Vehicular Ad Hoc Networks

Sartakhti

Ghajar

2023

Telecom

View full text Add to dashboard Cite

In Vehicular Ad Hoc Networks (VANETs), promoting cooperative behavior is a challenging problem for mechanism designers. Cooperative actions, such as disseminating data, can seem at odds with rationality and may benefit other vehicles at a cost to oneself. Without additional mechanisms, it is expected that cooperative behavior in the population will decrease and eventually disappear. Classical game theoretical models for cooperation, such as the public goods game, predict this outcome, but they assume fixed population sizes and overlook the ecological dynamics of the interacting vehicles. In this paper, we propose an evolutionary public goods game that incorporates VANET ecological dynamics and offers new insights for promoting cooperation. Our model considers free spaces, population density, departure rates of vehicles, and randomly composed groups for each data sender. Theoretical analysis and simulation results show that higher population densities and departure rates, due to minimum differences between pay-offs of vehicles, promote cooperative behavior. This feedback between ecological dynamics and evolutionary game dynamics leads to interesting results. Our proposed model demonstrates a new extension of evolutionary dynamics to vehicles of varying densities. We show that it is possible to promote cooperation in VANETs without the need for any supporting mechanisms. Future research can investigate the potential for using this model in practical settings.

show abstract

Section: Related Workmentioning

confidence: 99%

Ecological Dynamics and Evolution of Cooperation in Vehicular Ad Hoc Networks

Sartakhti

Ghajar

2023

Telecom

View full text Add to dashboard Cite

show abstract

“…In order to solve the quality problem of data transmission. Mao et al [33]. proposed an energy-based perceptual routing algorithm.…”

Section: (Ij)mentioning

confidence: 99%

GIR: An Opportunistic Network Routing Algorithm Based on Game Theory

Wang

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

A large number of routing algorithms in Opportunistic Networks are based on the assumption that nodes are free to help other nodes forward messages. However, when the Opportunistic Network is applied to an urban environment, the nodes will have certain social attributes. In many cases, a node can decide whether to execute the routing policy or not. Due to the limited resources and poor social relationships, nodes may be unwilling to forward messages from other nodes and have strong motivation to implement selfish policies. As a result, increased network latency reduces message delivery rates and affects the overall network performance. In order to solve this problem, we propose a perceptual routing protocol to promote node cooperation from the perspective of game theory. Specifically, We introduce the concept of virtual currency and construct a price function, and nodes can obtain a certain virtual currency through cooperation. In the process of message forwarding, we consider the change of link degree and energy of node (the energy exists in the form of electricity in this paper), and use them as factors of the trading node quotation. The trading node finally makes it through the multiple rounds of bargaining games, so that the proposed game between both sides reaches the Nash equilibrium. Experiments show that the algorithm outperforms Epidemic, EPSR, MINEIRO and ICRP algorithms in terms of delivery rate, average latency and energy consumption. According to the simulation experiments, the average delivery ratio of GIR algorithm is 0.68, which is 13% higher than that of the epidemic algorithm. In terms of average delay, 7% is better than ICRP algorithm. INDEX TERMS Cooperation, Routing algorithm, Nash equilibrium, Selfish.

show abstract

“…There are available trust management schemes to detect and filter out malicious nodes in DTNs based on the forwarding pattern and the energy level of the node, such as in Reference [78]. Besides that, faulty node detection mechanisms are also important to detect and isolate faulty nodes that might produce erroneous data [79].…”

Section: Node Integritymentioning

confidence: 99%

“…The former refers to the reluctance of a node to relay messages to conserve resources, and the latter points to its willingness to forward messages to nodes in the same community. Several incentive mechanisms [11,79,86] are proposed for DTN routing approaches to motivate selfish nodes to cooperate and help in improving system-wide performance.…”

Section: Selfish Behavior Of Nodesmentioning

confidence: 99%

Current State of Multicast Routing Protocols for Disruption Tolerant Networks: Survey and Open Issues

Wong

Wan

2019

Electronics

View full text Add to dashboard Cite

The deployment of Internet of Things (IoT) applications in remote areas, such as environmental sensing areas, requires Disruption Tolerant Networking (DTN) support due to the lack of continuous network connectivity. IoT devices in DTN generate and store data until a network link is available for data transmission. Data mules or ferries are scheduled to travel among intermittent networks to collect data and disseminate configuration updates from control centers to all participating nodes in a reliable manner. The incorporation of efficient, reliable multicast algorithms into DTN helps to overcome the current limitations in updating large numbers of nodes in remote areas with identical configurations. In this paper, the current state of multicast routing protocols in DTN is outlined according to their design aspects. Open issues are also discussed to provide impetus for further research into the Reliable Multicast DTN (RMDTN) protocol.

show abstract

A Game Theoretical Model for Energy-Aware DTN Routing in MANETs with Nodes’ Selfishness

Cited by 13 publications

References 26 publications

Ecological Dynamics and Evolution of Cooperation in Vehicular Ad Hoc Networks

Ecological Dynamics and Evolution of Cooperation in Vehicular Ad Hoc Networks

GIR: An Opportunistic Network Routing Algorithm Based on Game Theory

Current State of Multicast Routing Protocols for Disruption Tolerant Networks: Survey and Open Issues

Contact Info

Product

Resources

About