Mikael Asplund


My research interests include the following areas:

  • Distributed systems
  • Dependability and security
  • Intermittently connected networks
  • Real-time systems

Research Background

My research has been focused on design and analysis of partition-tolerant distributed systems. During the first part of my graduate studies I was involved in a European FP6 research project called Dependable Distributed Systems (DeDiSys). The project included 7 other nodes and the outcome was a partition-tolerant middleware.

The second part of my dissertation is focused towards mobile intermittently connected networks. The application scenario for such networks is that of disaster area communication. The ability to communicate during and after such events is central for the success of the relief efforts. However, due the lack of infrastructure and other resources, setting up working systems for communication can be difficult and time consuming. Node mobility in large geographic areas will result in intermittent connectivity, thus requiring protocols to be partition-tolerant as well as energy efficient.

As part of this project we developed an energy-efficient partition-tolerant manycast algorithm, which has been evaluated using simulations and implemented as a proof-of-concept on real devices. Finally, the thesis also contains a theoretical analysis on the worst-case latency for intermittently connected networks. The novelty of this work is that it provides a new way of characterising intermittent connectivity.


Here are the projects that I have been involved in:

Current: Past:


  • Ny Teknik link
  • TV4 Linköping (Local TV news), link
  • Metro Teknik link
  • Ingenjören link

Source Code

Some of my publications include simuluations or measurements on algorithm performance. Therefore, I intend to provide the source code for those experiments here.

  • The code for the simulations of the reconciliation algorithms published at SAC2006 can be found here.
  • The code for the simulations of the continuous service protocol published at DSN2007 can be found here.
  • The CORBA implementation of the DeDiSys is available on request.
  • The ns-3 simulation code for Random walk gossip published at SRDS09 is available on request.
Last modified January 2011 by Mikael Asplund