Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks

Soares, Vasco N. G. J.; Rodrigues, Joel J. P. C.; Salvador, Paulo; Nogueira, António

doi:10.1109/icppw.2009.33

Cited by 26 publications

(16 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This contribution extends the main features of a previous laboratory testbed [13,[16][17][18] applying them into a real deployment (an embedded VDTN testbed). Simulations [19] and real experiments [20] contribute for modeling and analysis of vehicular architectures.…”

Section: Introductionmentioning

confidence: 77%

Performance Evaluation of a Real Vehicular Delay-Tolerant Network Testbed

Paula

Rodrigues

Dias

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

properly cited.Vehicular Delay-Tolerant Networks (VDTNs) are a breakthrough based DTN solution used to provide vehicular communications under challenging scenarios, characterized by long delays and sporadic connections. Using the store-carry-and-forward paradigm, this technology allows in-transit bundles to asynchronously reach the destination hop by hop over traveling vehicles equipped with short-range wireless devices. The VDTN architecture assumes out-of-band signaling with control and data planes separation and follows an IP over VDTN approach. This paper presents a real-world VDTN prototype evaluated through a safety application and a Traffic Jam Information Service. It also demonstrates the real deployment of this new vehicular communication approach. The real testbed is an important contribution since some complex issues presented in vehicular communication systems can be studied more accurately in real-world environments than in a laboratory approach. The results confirm that real deployment of VDTNs is doable and can be seen as a very promising technology for vehicular communications, although it requires appropriated technologies for outline interferences and quality of service support.

show abstract

Section: Introductionmentioning

confidence: 77%

Performance Evaluation of a Real Vehicular Delay-Tolerant Network Testbed

Paula

Rodrigues

Dias

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Our previous research efforts on the effect of scheduling and drop policies in the performance of vehicular delay-tolerant networks have shown that scheduling bundles with longer remaining lifetimes to be sent first, results in decreasing the bundles average delay significantly and increasing the overall bundles delivery ratio [12,16]. Based on those results, in each of the above-described buffer management strategies, bundles are sorted based on their remaining lifetimes per each priority class.…”

Section: Scheduling Policiesmentioning

confidence: 99%

Traffic differentiation support in vehicular delay-tolerant networks

2010

View full text Add to dashboard Cite

-Vehicular Delay-Tolerant Networking (VDTN) is a Delay-Tolerant Network (DTN) based architecture concept for transit networks, where vehicles movement and their bundle relaying service is opportunistically exploited to enable non-real time applications, under environments prone to connectivity disruptions, network partitions and potentially long delays. In VDTNs, network resources may be limited, for instance due to physical constraints of the network nodes. In order to be able to prioritize applications traffic according to its requirements in such constrained scenarios, traffic differentiation mechanisms must be introduced at the VDTN architecture. This work considers a priority classes of service (CoS) model and investigates how different buffer management strategies can be combined with drop and scheduling policies, to provide strict priority based services, or to provide custom allocation of network resources. The efficiency and tradeoffs of these proposals is evaluated through extensive simulation.2

show abstract

“…Such a cooperative data delivery scheme would be useful for many applications such as vehicular sensor networking, traffic safety, vehicular telematics, and infotainment applications. A few works in the literature proposed cooperative communications models with relay-based mechanisms in DTNs and mobile ad hoc networks to decrease the delay of data delivery (e.g., [2], [3], [4]). The key assumption in all of the existing schemes is that the mobile nodes which are located near each other always help each other for data delivery.…”

Section: Introductionmentioning

confidence: 99%

Coalition-Based Cooperative Packet Delivery under Uncertainty: A Dynamic Bayesian Coalitional Game

Akkarajitsakul

Hossain

Niyato

2013

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-Cooperative packet delivery can improve the data delivery performance in wireless networks by exploiting the mobility of the nodes, especially in networks with intermittent connectivity, high delay and error rates such as wireless mobile delay-tolerant networks (DTNs). For such a network, we study the problem of rational coalition formation among mobile nodes to cooperatively deliver packets to other mobile nodes in a coalition. Such coalitions are formed by mobile nodes which can be either well behaved or misbehaving in the sense that the well-behaved nodes always help each other for packet delivery, while the misbehaving nodes act selfishly and may not help the other nodes. A Bayesian coalitional game model is developed to analyze the behavior of mobile nodes in coalition formation in presence of this uncertainty of node behavior (i.e., type). Given the beliefs about the other mobile nodes' types, each mobile node makes a decision to form a coalition, and thus the coalitions in the network vary dynamically. A solution concept called Nash-stability is considered to find a stable coalitional structure in this coalitional game with incomplete information. We present a distributed algorithm and a discrete-time Markov chain (DTMC) model to find the Nash-stable coalitional structures. We also consider another solution concept, namely, the Bayesian core, which guarantees that no mobile node has an incentive to leave the grand coalition. The Bayesian game model is extended to a dynamic game model for which we propose a method for each mobile node to update its beliefs about other mobile nodes' types when the coalitional game is played repeatedly. The performance evaluation results show that, for this dynamic Bayesian coalitional game, a Nash-stable coalitional structure is obtained in each subgame. Also, the actual payoff of each mobile node is close to that when all the information is completely known. In addition, the payoffs of the mobile nodes will be at least as high as those when they act alone (i.e., the mobile nodes do not form coalitions).

show abstract

Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks

Cited by 26 publications

References 13 publications

Performance Evaluation of a Real Vehicular Delay-Tolerant Network Testbed

Performance Evaluation of a Real Vehicular Delay-Tolerant Network Testbed

Traffic differentiation support in vehicular delay-tolerant networks

Coalition-Based Cooperative Packet Delivery under Uncertainty: A Dynamic Bayesian Coalitional Game

Contact Info

Product

Resources

About