The goal for this thesis is to explore the possibilities with Bring Your OwnDevice (BYOD) on mobile devices using various Mobile Device Management(MDM) features on three different platforms - Android, iOS and Windows Phone8. The work involves a theoretical study and a practical implementation. Theresearch is to investigate the native (built-in) and implementable support forMDM using a client application, while the practical work is to implement aclient application for Android as a proof of concept based on the researchresult. The current threat landscape is revealed as well as suggestions on howto protect mobile devices for BYOD. The result shows that Android is the mostvulnerable platform and lacks native and implementable support for BYOD andMDM functionality using public frameworks. To provide more comprehensivesupport a client application would require more high-risk permissions, that areonly available using firmware signatures or restrictive manufacturer-specificApplication Programming Interface (API).

In this thesis, we present a formal control strategy synthesis algorithm for multirobot systems subject to both individual specications and collaboration requirements. We work in an environment that has been abstracted into nonoverlapping regions. The specications are expressed in Linear Temporal Logic, constructed over some predicates on the actions performed by the robots. Each collaboration requirement is given as a set of complementary actions which are distributed on the robots and must always be performed at the same time. In order to avoid computing a synchronized product of the robot behaviours we consider extracting a satisfying run for each agent. These runs satisfy the individual specications but a priori do not meet the collaboration requirements since they are picked in an individual manner. We study the conditions under which we can enforce these collaboration constraints (synchronize the robots) without violating the specications. Under the reasonnable assumption that all the regions are connected to each other, we prove that this property only depends on the sequences of actions performed by the robots. We formulate sufcient conditions for the property to hold, and propose a procedure for revising the initial sequences to solve the problem. The main contribution of this thesis is that it addresses the formal control of collaborative robots without computing any product between Transition Systems. In particular it proposes a characterization of deadlocks, resulting in a computational framework for their detection and removal.

In this master thesis we propose an aperiodic formulation of Model Predictive Control for distributed agents with additive bounded disturbances. In this control method, each agent solves an optimal control problem only when certain control performances are not guaranteed according to several triggering rules. This may lead not only to the dramatic reduction of energy expenditures but also to the alleviation of communication loads among them. The problem will be considered to be general and practical; it handles the non-linearity of the each agent which is perturbed by additive bounded disturbances, where the triggering rule is derived from several robust stability criterion. The triggering rule will be addressed for event-based control and self-triggered control, which are the two main different aperiodic control approaches. Finally some simulation results verify our proposal.

To prevent a power grid from having disturbances that may, in a worst case scenario, blackout entire countries, Transmission System Operators (TSO) want to be able to see what happens in different parts of the network faster, to have time to do the necessary changes and regulate the power grid. For this reason, a new technology called PMU-based Wide Area Monitoring System (WAMS) has been introduced to allow the real-time monitoring of the power grid. Due to having real-time information from many points in a large geographical area, the PMU technology allows the development of advanced applications to control, protect and monitor the entire power grid. The information gathered by the PMU is sent via a TCP/IP communication network to a PDC to be processed. The applications that use the PMU data have different requirements on that the data arrives within a certain time frame. As an IP network can only provide best effort service, the delay, jitter and packet loss can never be guaranteed which means that the PMU data can never be guaranteed to arrive in time with potentially serious consequences. This problem may be remedied by implementing different quality of service (QoS) schemes on the TCP/IP communication network to assure that the PMU data falls within its requirements. The purpose of this master thesis is to evaluate the different QoS schemes in a TCP/IP communication network dedicated for WAMS systems and the effect they have on the delay, jitter and packet loss on the different traffic flows. For this purpose, the typical TSO‟s TCP/IP traffic data and the communication network specifics have been studied and modeled using the simulator tool OPNET. The different scenarios‟ results have been collected and analyzed in regard to the different QoS schemes.

To prevent a power grid from having disturbances that may, in a worst case scenario, blackout entire countries, Transmission System Operators (TSO) want to be able to see what happens in different parts of the network faster, to have time to do the necessary changes and regulate the power grid. For this reason, a new technology called PMU-based Wide Area Monitoring System (WAMS) has been introduced to allow the real-time monitoring of the power grid. Due to having real-time information from many points in a large geographical area, the PMU technology allows the development of advanced applications to control, protect and monitor the entire power grid. The information gathered by the PMU is sent via a TCP/IP communication network to a PDC to be processed. The applications that use the PMU data have different requirements on that the data arrives within a certain time frame. As an IP network can only provide best effort service, the delay, jitter and packet loss can never be guaranteed which means that the PMU data can never be guaranteed to arrive in time with potentially serious consequences. This problem may be remedied by implementing different quality of service (QoS) schemes on the TCP/IP communication network to assure that the PMU data falls within its requirements. The purpose of this master thesis is to evaluate the different QoS schemes in a TCP/IP communication network dedicated for WAMS systems and the effect they have on the delay, jitter and packet loss on the different traffic flows. For this purpose, the typical TSO‟s TCP/IP traffic data and the communication network specifics have been studied and modeled using the simulator tool OPNET. The different scenarios‟ results have been collected and analyzed in regard to the different QoS schemes.

De flesta organisationer är beroende av kommunikation mellan olika individer både inom och utanför organisationen för att fungera. Effektiviteten speglas ofta av kvalitén hos denna kommunikation. Det finns många parametrar som påverkar kommunikationssituationen (fackspråk: interoperabiliteten) inom en organisation, t.ex. företagskultur, arbetsrutiner, språk, IT-system och kommunikationsmedium. För att kunna påverka situationen krävs att man identifierar de involverade parametrarna och sambanden emellan dem. I ramverket IF/ELSE, som tagits fram av doktorand Johan Ullberg vid institutionen Industrial Information and Control systems (ICS) på Kungliga tekniska högskolan (KTH), beskrivs en metod och en metamodell för att kunna göra detta. Med hjälp av detta ramverk kan även ett kvantitativt värde på interoperabiliteten beräknas. I denna studie användes ramverket IF/ELSE för att undersöka interoperabiliteten på två radiologiavdelningar i västra götalandsregionen i syfte att testa ramverkets applicerbarhet på vårdrelaterade kommunikationssituationer. Studien visade att det, med största sannolikhet, fanns brister i kommunikationen inom de undersökta radiologiavdelningarna men också att IF/ELSE i sitt nuvarande utförande inte är full ut applicerbart på vården. / Most organizations are dependent on communication between individuals within and outside the organization to function. The effectiveness is often reflected by the quality of this communication. There are many parameters that influence the communication situation (jargon: interoperability) within an organization, such as corporate culture, working practices, languages, IT systems and communication medium. In order to influence the situation it is required to identify the parameters involved and the relationships between them. The framework IF/ELSE, developed by PhD student Johan Ullberg at the department Industrial Information and Control Systems (ICS) at the Royal Institute of Technology (KTH), describes a method and a meta-model to be able to do this. Using this framework a quantitative value of interoperability can be calculated. In this study, the framework IF/ELSE was used to investigate the interoperability at two radiology departments in västra götalandsregionen (VGR) in order to test the framework's applicability to healthcare-related communication situations. The study showed that there, most probably, was a lack of communication within the surveyed radiology departments but also that IF/ELSE in its current version is not fully applicable to healthcare organisations.

Multimedia Broadcast Multicast service (MBMS) proposed by 3GPP for efficient use of network resources in broadcast and multicast services, provides the operator a delivery mechanism to simultaneously send to multiple recipients at high speed. Although MBMS was introduced in 3GPP Release 6 at the time of 3G networks, the MBMS feature did not find much attention from the 3G network operators. This thesis studies the technical and market feasibility for a successful MBMS deployment today at the time of commercial LTE deployment. UE and RAN advancements that make MBMS technologically feasible are studied together with the market feasibility factors such as user demand on media streaming and the impending data explosion. The thesis concludes that today at the time of LTE, it is more feasible from both technology and market perspectives to deploy MBMS in comparison to the time of 3G. As a future work, the thesis provides some suggestions that the operators should take care of before deploying MBMS.

In this master thesis we address the problem of optimal pin selection in four elementary topologies. The augmented connectivity of a graph is defined as an extension of the algebraic connectivity in a pinning control scenario, and its key role in the pinning control problem is illustrated. For each of the considered topologies several pinning configurations are examined and they are compared in terms of the control strength they require to yield a desired value for the augmented connectivity. For each of the examined configurations a direct expression is provided for the control strength as a function of the augmented connectivity.

In this master thesis we present an algorithm for distributed event-triggered pinning control of a network of nonlinear oscillators. In order to extend the concepts of connected, switching connected and slow switching topology to a pinning control scenario, we introduce the denitions of pinned, switching pinned and frequently pinned topology respectively. For each of these three topologies we try to identify the conditions under which the network achieves exponential convergence of the error norm, find a lower bound for the rate of convergence and prove that the trigger sequences do not exhibit Zeno behavior. Some numerical results are presented for each of the considered scenarios; further numerical results are presented for four elementary static topologies.

We study a multi-agent system in R2 where agents have unicycle dynamics with time varying speed and control inputs corresponding to acceleration and angular velocity. The system has a dynamic communication topology based on proximity. We propose a novel decentralized control algorithm derived from a double integrator model using a pairwise potential function. By using an energy function we show that a leaderless system converges to a set where connected agents have equal direction and velocity and potential contributions to the control action cancel each other out. The concept of formation density is defined and studied by numerical simulation. We find a relation between parameters of the controller and the system that makes the system converge to a formation with low density, corresponding to agents being at appropriate distances from each other, also when agents are not restricted to communicating only with their closest neighbors. The algorithm is tested for a system with leaders and properties of this system are investigated numerically. The results confirm that the proportion of leaders needed to guide a certain proportion of the agent in average is nonlinear and decreasing with respect to the number of agents.