Disruption-tolerant content-driven information dissemination in partially connected military tactical radio networks

Haillot, Julien; Guidec, Frédéric; Corlay, Serge; Turbert, Jacques

doi:10.1109/milcom.2009.5379983

Cited by 8 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to mitigate this problem, we implemented the algorithms described in sections IV and V over a fully-functional opportunistic networking system that can run equally well in a real setting or in simulated conditions. This system, called DoDWAN, is implemented in Java, and it can notably run on Android smartphones, laptops, and tablets [26], [27]. DoDWAN essentially supports the dissemination of messages in an OppNet, using the epidemic forwarding model.…”

Section: Experimentationmentioning

confidence: 99%

Causal and Δ-causal broadcast in opportunistic networks

Guidec

Launay

Mahéo

2021

Future Generation Computer Systems

View full text Add to dashboard Cite

Causal broadcast is a fundamental communication abstraction for many distributed applications. Several implementations of this abstraction have been proposed over the last decades for traditional networks, that is, networks that assume the existence of a continuous bi-directional end-to-end path between any pair of nodes. Opportunistic networks constitute a kind of networks in which this assumption cannot be made, though, so the implementation of causal broadcast in such networks must be addressed differently. This paper presents two algorithms based on causal barriers that can ensure the causally-ordered delivery of broadcast messages in an opportunistic network, considering both cases where the messages propagate in the network without or with a bounded lifetime. The latter case is especially interesting in networks that must run for a long time, or with a population of nodes that changes continuously.

show abstract

Section: Experimentationmentioning

confidence: 99%

Causal and Δ-causal broadcast in opportunistic networks

Guidec

Launay

Mahéo

2021

Future Generation Computer Systems

View full text Add to dashboard Cite

show abstract

“…Over the last few years it has also been tested with a variety of alternative wireless technologies, such as Bluetooth, XBee, and VHF battlefield radios used in military tactical networks [39].…”

Section: Dodwan (Document Dissemination In Mobile Wirelessmentioning

confidence: 99%

Filling in the missing link between simulation and application in opportunistic networking

Sánchez-Carmona

Guidec

Launay

et al. 2018

Journal of Systems and Software

View full text Add to dashboard Cite

“…We focus on configurations where the entities of the network are not only mobile but have some decisional autonomy and for some of them can be remotely controlled (we are addressing convoys composed of troops, ground/air vehicles/robots/UAVs). Data mules have been identified as an option for circulating information in these situations where the network is not (always) fully connected and can be composed of disjoint islets (because the entities are spread over a possibly large geographical area and because of the potential mobility of the entities) [1,2]. In these configurations a set of data mules coming from the different islets cooperate so as to circulate the information within the network.…”

Section: Problem Statementmentioning

confidence: 99%

A proposal for exploring data mule based weak rendezvous for communication between loosely coupled convoys

Chaumette

Laplace

2014

Proceedings of the Third ACM Workshop on Airborne Networks and Communications

View full text Add to dashboard Cite

The goal of the project presented in this paper is to study a system of weak rendezvous that we introduce to support data mule based communication between two loosely coupled convoys. We will define distributed algorithms to deal with this situation, analyze the behavior of the system and derive upper and lower bounds on the time needed to move information from one convoy to the other. Our approach relies on dynamic graphs relabeling as previously studied in our research group. We will also, as far as possible, develop a prototype using the swarms of robots and UAVs that we have deployed at LaBRI. The approach proposed here is original in that it makes extremely weak assumptions on the network and focuses on the computation of lower bound values -for inter-convoy information exchange -and possibility results, depending on variations of these assumptions. The project described in this paper is

show abstract

Disruption-tolerant content-driven information dissemination in partially connected military tactical radio networks

Cited by 8 publications

References 9 publications

Causal and Δ-causal broadcast in opportunistic networks

Causal and Δ-causal broadcast in opportunistic networks

Filling in the missing link between simulation and application in opportunistic networking

A proposal for exploring data mule based weak rendezvous for communication between loosely coupled convoys

Contact Info

Product

Resources

About