LiU > IDA > Real-Time Systems Lab
ABOUT
MEMBERS
COOPERATION
PROJECTS
PUBLICATIONS
COURSES
OPEN POSITIONS
THESES
ALUMNI

Announcements

[16 May 2017] A bachelor student at RTSLAB was awarded the best thesis award from IDA - Tim Hultman. more ...

[12 May 2016] A master student at RTSLAB was awarded the best thesis award from IDA - Alexander Alesand. more ...

[12 May 2016] A bachelor student at RTSLAB was awarded the best thesis award from IDA - Mathias Almquist and Viktor Almquist. more ...

[25 May 2015] A master student at RTSLAB was awarded the best thesis award from IDA - Klervie Toczé. more ...

[26 May 2014] A bachelor student at RTSLAB was awarded the best thesis award from IDA - Simon Andersson. more ...

[31 May 2012] A masters student at RTSLAB was awarded the best thesis award from IDA - Ulf Magnusson. more ...

[27 February 2008] A masters student at RTSLAB was awarded the best thesis award from IDA - Johan Sigholm. more ...

[03 March 2004] A masters student at RTSLAB was awarded the best thesis award from IDA - Tobias Chyssler. more ...

[01 Jul 2003] For second year in a row a masters student at RTSLAB was awarded the best thesis award from SNART - Mehdi Amirijoo. more ...

Master/Bachelor Thesis - Proposals

Vehicular platoon management using Bitcoin-inspired algorithms

Contact: Mikael Asplund

Starting time: HT2017 or VT2018

The virtual currency Bitcoin is having a disruptive effect on the financial sector. While initially considered as a curiosity, the technology behind bitcoin, so called blockchains now receive investments from companies like Goldman Sachs and IBM. The potential of blockchains go beyond that of currencies, allowing decentralised coordination and smart contracts, and IBM is advocating it as a basis for coordination in the Internet of Things. In this project the goal is to design, implement and evaluate a blockchain-based coordination mechanism for vehicular networks. More details will follow.


Vehicular group membership resilient to malicious attacks

Contact: Mikael Asplund

Starting time: HT2017 or VT2018

Next generation of smart vehicles will use wireless communication and advanced sensor technology to enable platoon driving where vehicles coordinate their driving in order to make traffic more efficient and sustainable. Such advanced applications require vehicles to be able to accurately determine which other vehicles that are participating in the cooperation and to detect and adapt to changes as vehicles come and go. A key challenge is how such a membership protocol can withstand attacks from malicious actors in the environment (other vehicles or even from vehicles within the group).

This project is focused on design and implementation of a secure group membership protocol for vehicular groups. The project will start from an existing (insecure) implementation of a group membership protocol. After making a systematic threat analysis mitigation measures should be designed and evaluated against the identified threats.


Performance study of actor-based programs

Contact: Simin Nadjm-Tehrani

Functional reactive programming (FRP) is a high-level programming paradigm, by nature data-oriented, and as such very convenient for writing a whole category of applications (with GUI as a typical example). In previous work we studied FRP in the context of a telecom server (link to Klervie Thesis), showing that it made it easier to write code than object-oriented programming (OOP) but not performant enough. The purpose of this work is to investigate intermediate programming paradigms in between FRP and OOP, that provide a satisfactory compromise between expressiveness and performance. In this work, Scala would be chosen as a target because at the same time it features a FRP library and it allows the implementation of actor-based programming that lies in between OOP and FRP in terms of expressiveness and efficiency. The objective would be not only to investigate the performance of the different models, but also to investigate the respective strengths of FRP and actor-based reactive programming in an application context. The work is performed in cooperation with I3S laboratory in Sophia Antipolis (France) and the candidate will spend a number of weeks on location near Nice.

Säkra samhällstjänster: systemberoenden och kritikalitet

Contact: Simin Nadjm-Tehrani

Ett företag som levererar olika samhällskritiska tjänster har flera olika delsystem som är mer eller mindre beroende av varandra. Dessutom upphandlas produkter och tjänster från tredje part. System som kan ha otydliga beroenden kan vara för komplexa för att ha en helhetssyn vad gäller kritikalitet och arkitektur. Målet med detta examensarbete är att kartlägga systemkomponenter som är nödvändiga för att leverera ett antal av Tekniska Verkens tjänster, deras beroenden som uppfattas av olika aktörer inom organisationen, och hur incidenthantering för olika delsystem sköts. Utgångspunkten ska vara leverans av tjänsten och dess tillgänglighet. Kartläggningen sker genom informationssamling inne i organisationen eller underleverantörer (från 15-25 personer) och leder till ett underlag som kan användas för att skapa en generell metod för att effektivt göra likartade kartläggningar hos andra företag. Detta exjobb görs i samarbete med forskningscentret RICS (www.rics.se) och kommer till nytta för dess andra avnämare (inom referensgruppen) inklusive företaget Sectra.

Verktyg för att skapa syntetisk data från realistiska nätverksloggar

Contact: Simin Nadjm-Tehrani

Att säkerställa informationssäkerhet hos ett nätverkat system, t.ex. kritiska infrastrukturer som levererar samhällskritiska tjänster, bygger på analys av systemet under olika förutsättningar inklusive eventuella attack scenarier och felyttringar. För att kunna utföra systematiska och repeterbara tester där olika försvarsmekanismer utvärderas behöver man utsätta samma normalscenario för en mängd olika attacker och detektioner. Experiment med olika utgångspunkter kan skapas i en test nätverk där flera aktörer (forskare, leverantörer) kan testa sina prototyper och produkter. Därmed behöver data vara frikopplad från en viss organisation och inte kunna spåras till de ursprungliga miljöer där det skapades i. Målet med detta exjobb är att skapa syntetisk data som liknar realistisk data genom att "tvätta" data som normalt inte skulle vara tillgänglig inom en organisation, men som kan delas med andra aktörer under ordnade former. Exjobbsarbetet ska resultera i en metod med tillhörande verktyg som skapar syntetiska datan samt definiera kriterier och metrik för att validera både "likheten" med det ursprungliga datan och dessa anonimitetsegenskaper. Detta exjobb görs i samarbete med forskningscentret RICS (www.rics.se) och kommer till nytta för dess andra avnämare (inom referensgruppen) inklusive Tekniska Verken.


Interdependency modelling in critical infrastructure

Contact: Simin Nadjm-Tehrani

Tekniska verken delivers different critical societal services and has different subsystems that are more or less dependent on each other. It is a challenge to maintain a holistic overview of the systems and their interdependencies, criticality, and architecture. The aim of this thesis work is to create a map of those system components that are essential for delivery of several critical services, and determine how their dependencies is perceived by different actors within the organisation, as well as how incident reporting for the different systems is managed. The basic premise shall be the ability to deliver the service, i.e. availability. The investigation takes place through information gathering within the organisation or from the third party suppliers (about 20-25 persons). The result will be a basis for creation of a general methodology for performing similar investigations at other companies efficiently. This thesis project is performed in collaboration with the research centre RICS and will be useful for its stakeholders (within its reference group) including the company Sectra.

Evaluating energy efficiency of apps without rooting

Contact: Simin Nadjm-Tehrani

This Bachelor thesis work requires reading and understanding the following documents before planning: EnergyBox and EnergyBox: Tool improvement and GUI The idea of the project is to make EnergyBox usable for a user running an Android smartphone without rooting the phone. That requires a few investigations: can the packet capturing APIs from Android be used to create the packet traces (with time stamps) so that the data pattern can be fed to EnergyBox for energy estimation? If that is the case, how can we isolate one app’s packet trace as opposed to a trace that includes data transmisions from several apps? If an isolation by manual disabling of all app’s transmissions (except the one subject to measure) is possible, can this be verified by comparing the unrooted phone collected trace in this way, and a rooted phone (properly isolated at OS level) collected trace, and check the validity of the trace from the unrooted phone (by feeding into EnergyBox)? If all of these steps succeed, the next step is to make a runnable app of EnergyBox and then a user should be able to use this app to monitor/profile a given app’s transmission energy footprint before starting to use it!

Theoretical analysis of distributed coordination

Contact: Mikael Asplund

Autonomous cars are already on the horizon. The next generation of self-driving cars will interact with other vehicles using wireless communication to coordinate their actions and and enable more efficient traffic solutions than human drivers can accomplish. However, distributed coordination is still an open problem, especially in situations where the local actions taken by vehicles propagate to other parts of the system causing congestion and unpredictable delays.

This Master’s thesis project will consider an abstraction of this problem in a theoretical setting to investigate the asymptotic behaviour of distributed coordination under varying circumstances. Consider a system composed of N mobile agents that move around in a directed graph G=(V,E). At any point in time a node v ∈ V can contain either zero or one mobile agents. Obviously |V| ≥ N.

Each agent can communicate locally with agents located in neighbouring nodes, and nodes up to h hops away (h being a parameter under study). Moreover, for each agent a there is a set of nodes Va such that the agent wishes to visit all nodes in Va as many times as possible. The performance of an agent is determined by the number of visits to the node in Va with the least number of visits.

The task of this thesis project will be to investigate the bounds on achievable performance under varying conditions (starting with a restricted setting, and using increasingly complex models). A suitable student should be comfortable with mathematical reasoning, and interested in theoretical analysis of distributed algorithms.


From location-tagged social interactions to mobility models

Contact: Simin Nadjm-Tehrani

The mobility of individuals over extended periods of time can increasingly be attached to their interactions over social networks. There are several applications (such as Twitter) that make tracking of the individual’s locality possible through tagging the social interactions with location data. This master thesis project (30hp) consists of two components: 1) a study of the state-of-practice in the social applications domain and identifying the extent of availability of the location data over time for a subset of interaction traces that are openly obtainable on the Internet. 2) using the traces collected to create typical (generic) movement patterns that one can use to test applications that are dependent on mobility models. For example dissemination of some attractive news, or a warning, on a peer-to-peer basis over a geographic area, and computing the latency for the dissemination based on the generic movement patterns (so called mobility models).

A secure BATMAN implementation for the Android platform

Contact: Simin Nadjm-Tehrani

Traditional internet based networks are composed of many networks with a number of core nodes. These nodes, which are owned by several cooperating entities, route the data according to pre-established agreements. As opposed to this, in mesh networks, there are many nodes than do not only transmit their own data, but they also forward the data of other nodes. The information routing in mesh networks is not based on agreements, but on dynamic routing or dissemination protocols. These protocol can be classified under "ad-hoc networking". One example protocol is BATMAN, a totally decentralised routing protocol that dynamically creates the routes to forward the data. It was originally intended for communication in rural areas where commodity mobile handsets can set up a network with no pre-existing infrastructure.

The decentralisation and the adaptability to network topology changes are the main advantages of BATMAN. Nevertheless, the information exchanged among the nodes to keep the routing tables is not protected and makes it vulnerable to attacks. The purpose of this thesis project is to 1) implement the BATMAN protocol on an Android platform (or find open source code that already does it). For this existing (C ) code on a simulation platform in our lab can be used as a basis. 2) Reduce the security threats by enhancing BATMAN with authentication based on X.509 certificates on the same platform. For this part existing code from another Master student project can be integrated.


Last modified February 2017. If you have questions or suggestions for the webpages, contact the webmaster