14 citations · 15 across the 5 of their papers we have counts for
8 papers
On the use of chaotic dynamics for mobile network design and analysis: towards a trace data generator
Martin Rosalie, Serge Chaumette
With the constant increase of the number of autonomous vehicles and connected objects, tools to understand and reproduce their mobility models are required. We focus on chaotic dyn…
Security, Privacy and Safety Evaluation of Dynamic and Static Fleets of Drones
Raja Naeem Akram, Konstantinos Markantonakis, Keith Mayes +4
Inter-connected objects, either via public or private networks are the near future of modern societies. Such inter-connected objects are referred to as Internet-of-Things (IoT) and…
Serverless Protocols for Inventory and Tracking with a UAV
Collins Mtita, Maryline Laurent, Damien Sauveron +3
It is widely acknowledged that the proliferation of Unmanned Aerial Vehicles (UAVs) may lead to serious concerns regarding avionics safety, particularly when end-users are not adhe…
Security and Performance Comparison of Different Secure Channel Protocols for Avionics Wireless Networks
Raja Naeem Akram, Konstantinos Markantonakis, Keith Mayes +3
The notion of Integrated Modular Avionics (IMA) refers to inter-connected pieces of avionics equipment supported by a wired technology, with stringent reliability and safety requir…
An Efficient, Secure and Trusted Channel Protocol for Avionics Wireless Networks
Raja Naeem Akram, Konstantinos Markantonakis, Keith Mayes +3
Avionics networks rely on a set of stringent reliability and safety requirements. In existing deployments, these networks are based on a wired technology, which supports these requ…
Maintaining a Distributed Spanning Forest in Highly Dynamic Networks
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette +2
Highly dynamic networks are characterized by frequent changes in the availability of communication links. These networks are often partitioned into several components, which split…
Testing Temporal Connectivity in Sparse Dynamic Graphs
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette +2
We address the problem of testing whether a given dynamic graph is temporally connected, {\it i.e} a temporal path (also called a {\em journey}) exists between all pairs of vertice…
Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks
Arnaud Casteigts, Serge Chaumette, Frédéric Guinand +1
We address the problem of building and maintaining distributed spanning trees in highly dynamic networks, in which topological events can occur at any time and any rate, and no sta…