Evolutionary forwarding games in delay tolerant networks: Equilibria, mechanism design and stochastic approximation

The nonexistence of an end-to-end path poses great challenges to directly adapting the traditional routing algorithms for Internet and mobile ad hoc networks (MANETs) to mobile opportunistic networks (MONs). In this paper, we try to improve the routing performance by resorting to an efficient data item selection mechanism that takes the bandwidth and connection duration time into consideration. For the purpose of evaluation, a specific data item selection mechanism for a probability-based routing is devised, which is formally defined as an optimal decision-making problem and solved by the dynamic programming technique. The simulation results show that our data item selection mechanism greatly reduces the number of aborted transmissions thus enhancing the routing performance in aspects of delivery probability, average latency, and overhead ratio.

show abstract

“…In our scheme, the forward strategy is the same as PRoPHET, that a message will be transferred from (14) .…”

Section: Protocolmentioning

confidence: 99%

“…Reference [14] applies the evolutionary games to noncooperative forwarding control in MDTNs, of which the main focus is on mechanisms to rule the participation of the relays in the delivery of messages in DTNs. Reference [15] provides a reliable data delivery scheme for mobile sensor networks with an enhanced delaying technique.…”

Section: Related Workmentioning

confidence: 99%

A Data Item Selection Mechanism for Mobile Opportunistic Networks

You

Wei

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Next, a learning algorithm is suggested to drive the system to a stable operating point (Nash equilibrium). In the work by ElAzouzi et al, 9 the authors use evolutionary game theory and a fixed rewarding mechanism to model the behavior of the relay nodes in a dense DTN environment. In the work by Brun et al, 10 the authors consider a simple reward scheme and provide some interesting insights on how the source node could optimize the reward value based on received relays information.…”

Section: Literature Reviewmentioning

confidence: 99%

Robust fully distributed file caching for delay-tolerant networks: A reward-based incentive mechanism

Ezzahidi

Sabir

Koulali

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

This article exhibits a reward-based incentive mechanism for file caching in delay-tolerant networks. In delay-tolerant networks, nodes use relay's store-carry-forward paradigm to reach the final destination. Thereby, relay nodes may store data in their buffer and carry it till an appropriate contact opportunity with destination arises. However, the relays are not always willing to assist data forwarding due to a limited energy or a low storage capacity. Our proposal suggests a reward mechanism to uphold and to sustain cooperation among relay nodes. We model this distributed network interaction as a non-cooperative game. Namely, the source node offers to the relay nodes a positive reward if they accept to cache and to forward a given file successfully to a target destination, whereas the relay nodes may either accept or reject the source deal, depending on the reward attractiveness and on their battery status (their actual energy level). Next, full characterizations of both pure and mixed Nash equilibria are provided. Then, we propose three fully distributed algorithms to ensure convergence to the Nash equilibria (for both pure equilibrium and mixed equilibrium). Finally, we validate our proposal through extensive numerical examples and many learning simulations and draw some conclusions and insightful remarks.

show abstract

“…Reference [21] applies the evolutionary games to noncooperative forwarding control in MDTNs, of which the main focus is on mechanisms to rule the participation of the relays to the delivery of messages in DTNs. Reference [12] provides a reliable data delivery scheme for mobile sensor networks with an enhanced delaying technique.…”

Section: Related Workmentioning

confidence: 99%

A General and Specific Utility-Based Adaptive Routing for Delay Tolerant Networks

You

Wei

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The nonexistence of an end-to-end path poses great challenges in directly adapting the traditional routing algorithms for ad hoc or mobile ad hoc networks (MANETs) to delay tolerant networks (DTNs). In this paper, an adaptive routing protocol that makes use of both self-aware and destination-aware utility metrics to evaluate the potential throughput between every pair of nodes is proposed. We theoretically analyze the nodes' spraying process and discover the relationship between the initial number of copies and the latency of the message distribution process, by which we can further control the expected latency under a certain level. Compared with Epidemic, Spray And Wait Spray, And Focus and Encounter-based routing, our proposed algorithm is the only one that achieves comparable performance under both Helsinki City Scenario and Cambridge-iMote Scenario.

show abstract

Evolutionary forwarding games in delay tolerant networks: Equilibria, mechanism design and stochastic approximation

Cited by 31 publications

References 19 publications

A Data Item Selection Mechanism for Mobile Opportunistic Networks

A Data Item Selection Mechanism for Mobile Opportunistic Networks

Robust fully distributed file caching for delay-tolerant networks: A reward-based incentive mechanism

A General and Specific Utility-Based Adaptive Routing for Delay Tolerant Networks

Contact Info

Product

Resources

About