The ONE simulator for DTN protocol evaluation

Keränen, Ari; Ott, Jörg; Kärkkäinen, Teemu

doi:10.4108/icst.simutools2009.5674

Cited by 1,997 publications

(1,050 citation statements)

References 29 publications

Supporting

Mentioning

989

Contrasting

Unclassified

Order By: Relevance

“…Simulation studies were conducted using the VDTNsim tool [22]. This tool is an extension of the ONE simulator [23,24] and allows simulating the VDTN architectural approach, which comprehends the store-carry-and-forward overlay network below the network layer. This section is divided into three subsections.…”

Section: Simulation Setupmentioning

confidence: 99%

Performance evaluation of a cooperative reputation system for vehicular delay-tolerant networks

Dias

Rodrigues

Shu

et al. 2014

J Wireless Com Network

View full text Add to dashboard Cite

In the last decade, both scientific community and automotive industry enabled communications among vehicles in different kinds of scenarios proposing different vehicular architectures. Vehicular delay-tolerant networks (VDTNs) were proposed as a solution to overcome some of the issues found in other vehicular architectures, namely, in dispersed regions and emergency scenarios. Most of these issues arise from the unique characteristics of vehicular networks. Contrary to delay-tolerant networks (DTNs), VDTNs place the bundle layer under the network layer in order to simplify the layered architecture and enable communications in sparse regions characterized by long propagation delays, high error rates, and short contact durations. However, such characteristics turn contacts very important in order to exchange as much information as possible between nodes at every contact opportunity. One way to accomplish this goal is to enforce cooperation between network nodes. To promote cooperation among nodes, it is important that nodes share their own resources to deliver messages from others. This can be a very difficult task, if selfish nodes affect the performance of cooperative nodes. This paper studies the performance of a cooperative reputation system that detects, identify, and avoid communications with selfish nodes. Two scenarios were considered across all the experiments enforcing three different routing protocols (First Contact, Spray and Wait, and GeoSpray). For both scenarios, it was shown that reputation mechanisms that punish aggressively selfish nodes contribute to increase the overall network performance.

show abstract

Section: Simulation Setupmentioning

confidence: 99%

Performance evaluation of a cooperative reputation system for vehicular delay-tolerant networks

Dias

Rodrigues

Shu

et al. 2014

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Then, we offer a method based on creating the lists maintained by each node to calculate the number of copies of message i at time t, ni(t). Finally, we have implemented many simulations and compared it to some other buffer policies in simulator ONE [7]. The simulation results show that our policy outperforms existing policies.…”

Section: Introductionmentioning

confidence: 99%

Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

Liu

et al. 2012

AEF

View full text Add to dashboard Cite

Abstract. Opportunistic Networks (ONs) are the newly emerging type of Delay Tolerant Network (DTN) systems that opportunistically exploit unpredicted contacts among nodes to share information. As with all DTN environments ONs experience frequent and large delays, and an end-to-end path may only exist for a brief and unpredictable time. In this paper, we employ optimal theory to propose a novel buffer management strategy named Optimal Buffer Scheduling Policy (OBSP) to optimize the sequence of message forwarding and message discarding. In OBSP, global optimization considering delivery ratio, transmission delay, and overhead is adopted to improve the overall performance of routing algorithms. The simulation results show that the OBSP is much better than the existing ones.

show abstract

“…This performance analysis considers scenarios with different node densities, and under distinctive constraints in terms of contact opportunities, contact durations, and buffer sizes. The study was conducted by simulation using a modified version of the Opportunistic Network Environment (ONE) simulator [17]. ONE was modified to implement the VDTN layered architecture model proposed in [1].…”

Section: Performance Evaluationmentioning

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

The ONE simulator for DTN protocol evaluation

Cited by 1,997 publications

References 29 publications

Performance evaluation of a cooperative reputation system for vehicular delay-tolerant networks

Performance evaluation of a cooperative reputation system for vehicular delay-tolerant networks

Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

Traffic differentiation support in vehicular delay-tolerant networks

Contact Info

Product

Resources

About