Conference
Workshop Challenged Networks
About: Workshop Challenged Networks is an academic conference. The conference publishes majorly in the area(s): Wireless network & Delay-tolerant networking. Over the lifetime, 154 publications have been published by the conference receiving 4059 citations.
Topics: Wireless network, Delay-tolerant networking, Routing protocol, Node (networking), Computer science
Papers
24 Sep 2010
TL;DR: This work investigates the target-set selection problem for information delivery in the emerging Mobile Social Networks (MoSoNets), and proposes three algorithms, called Greedy, Heuristic, and Random, to exploit opportunistic communications to facilitate the information dissemination and thus reduce the amount of cellular traffic.
Abstract: Due to the increasing popularity of various applications for smartphones, 3G networks are currently overloaded by mobile data traffic. Offloading cellular traffic through opportunistic communications is a promising solution to partially solve this problem, because there is no monetary cost for it. As a case study, we investigate the target-set selection problem for information delivery in the emerging Mobile Social Networks (MoSoNets). We propose to exploit opportunistic communications to facilitate the information dissemination and thus reduce the amount of cellular traffic. In particular, we study how to select the target set with only k users, such that we can minimize the cellular data traffic.In this scenario, initially the content service providers deliver information over cellular networks to only users in the target set. Then through opportunistic communications, target-users will further propagate the information among all the subscribed users. Finally, service providers will send the information to users who fail to receive it before the delivery deadline (i.e., delay-tolerance threshold). We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. The simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload cellular traffic by up to 73.66% for a real-world mobility trace.
309 citations
23 Sep 2011
TL;DR: This paper proposes some minor modifications to the routing metric calculations done in PRoPHET which has potential to alleviate some issues and improve the performance of the protocol.
Abstract: Research within Delay- and Disruption Tolerant Networks (DTN) has evolved into a mature research area. PRoPHET is a routing protocol for DTNs that was developed when DTN research was in its infancy and which has been studied by many. In this paper we investigate how the protocol can evolve to meet new challenges that has been identified through research and practical experience. We propose some minor modifications to the routing metric calculations done in PRoPHET which has potential to alleviate some issues and improve the performance of the protocol. Using these modifications, we define an updated version of the protocol called PRoPHETv2. We run simulations to verify the operation of the protocol and compare its performance against the original version of the protocol as well as some other routing protocols. The evaluations are done using both traces from an existing DTN deployment and a synthetic mobility model. Since the basic mechanisms of the protocol remain the same, migrating existing implementations to the new version of PRoPHET is possible with limited effort.
169 citations
15 Sep 2008
TL;DR: DIsruption REsilient Content Transport is presented, which is a content dissemination approach for ad hoc networks that exploits in-network storage and the hop-by-hop dissemination of named information objects and provides a high degree of reliability while maintaining low levels of delivery latencies and signaling and data overhead.
Abstract: Content dissemination in disrupted networks poses a big challenge, given that the current routing architectures of ad hoc networks require establishing routes from sources to destinations before content can disseminated between them. In ad hoc networks subject to disruption, lack of reliable connectivity between producers and consumers of information makes most routing protocols perform very poorly or not work at all. We present DIRECT (DIsruption REsilient Content Transport), which is a content dissemination approach for ad hoc networks that exploits in-network storage and the hop-by-hop dissemination of named information objects. Simulation experiments illustrate that DIRECT provides a high degree of reliability while maintaining low levels of delivery latencies and signaling and data overhead compared to traditional on-demand routing and epidemic routing.
157 citations
11 Sep 2006
TL;DR: This paper proposes a hybrid scheme that combines AODV and DTN-based routing and allows keeping the A ODV advantage of maintaining end-to-end semantics whenever possible while, at the same time, also offeringDTN- based communication options whenever available---leaving the choice to the application.
Abstract: Mobile Ad-hoc Network (MANET) routing protocols aim at establishing end-to-end paths between communicating nodes and thus support end-to-end semantics of existing transports and applications. In contrast, DTN-based communication schemes imply asynchronous communication (and thus often require new applications) but achieve better reachability, particularly in sparsely populated environments. In this paper, we suggest a hybrid scheme that combines AODV and DTN-based routing and allows keeping the AODV advantage of maintaining end-to-end semantics whenever possible while, at the same time, also offering DTN-based communication options whenever available---leaving the choice to the application. We present our protocol and system design, particularly including the interaction of AODV and DTN, demonstrate achievable performance gains based upon measurements, and report on initial experiments with our implementation in an emulation environment.
147 citations
11 Sep 2006
TL;DR: H-EC is designed to fully combine the robustness of erasure coding based routing techniques, while preserving the performance advantages of replication techniques, and is found that H-EC offers robustness in worst-casedelay performance cases while achieving good performance in small delay performance cases.
Abstract: With wireless networking technologies extending into the fabrics of our working and operating environments, proper handling of intermittent wireless connectivity and network disruptions is of significance. As the sheer number of potential opportunistic application continues to surge (i.e. wireless sensor networks, underwater sensor networks, pocket switched networks, transportation networks, and etc.), the design for an effective routing scheme that considers and accommodates the various intricate behaviors observed in an opportunistic network is of interest and remained desirable. While previous solutions use either replication or coding techniques to address the challenges in opportunistic networks, the tradeoff of these two techniques only make them ideal under certain network scenarios. In this paper, we propose a hybrid scheme, named H-EC, to deal with a wide variety of opportunistic network cases. H-EC is designed to fully combine the robustness of erasure coding based routing techniques, while preserving the performance advantages of replication techniques. We evaluate H-EC against other similar strategies in terms of delivery ratio and latency, and find that H-EC offers robustness in worst-case delay performance cases while achieving good performance in small delay performance cases. We also discuss the traffic overhead issues associated with H-EC as compared to other schemes, and present several strategies that can potentially alleviate the traffic overhead of H-EC schemes.
129 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2019 | 6 |
| 2018 | 9 |
| 2017 | 15 |
| 2016 | 17 |
| 2012 | 17 |
| 2011 | 19 |