Security analysis of mobile edge computing in virtualized small cell networks

Based upon the context of Mobile Edge Computing (MEC) actual research and within the innovative scope of the SESAME EU-funded research project, we propose and assess a framework for security analysis applied in virtualised Small Cell Networks, with the aim of further extending MEC in the broader 5G environment. More specifically, by applying the fundamental concepts of the SESAME original architecture that aims at providing enhanced multi-tenant MEC services through Small Cells coordination and virtualization, we focus on a realistic 5G-oriented scenario enabling the provision of large multi-tenant enterprise services by using MEC. Then we evaluate several security issues by using a formal methodology, known as the Secure Tropos

evaluation of advanced routing strategies with information theoretic complexity measures

Based on hierarchy and recursion (shortly, HR), recursive networking has evolved to become a possible architecture for the future Internet. In this paper, we advance the study of HR-based routing by means of the Gershenson-Fernandez information-theoretic framework, which provides four different complexity measures. Then, we introduce a novel and general approach for computing the information associated to a known or estimated routing table. Finally, we present simulation results regarding networks that are characterized by different topologies and routing strategies. In particular, we discuss some interesting facts we observed while comparing HR-based to traditional routing in terms of complexity measures

Energy Efficient Mobile Routing in Actuator and Sensor Networks with Connectivity Preservation

International audienceIn mobile wireless sensor networks, flows sent from data col- lecting sensors to a sink could traverse inefficient resource expensive paths. Such paths may have several negative effects such as devices bat- tery depletion that may cause the network to be disconnected and packets to experience arbitrary delays. This is particularly problematic in event- based sensor networks (deployed in disaster recovery missions) where flows are of great importance. In this paper, we use node mobility to im- prove energy consumption of computed paths. Mobility is a two-sword edge, however. Moving a node may render the network disconnected and useless. We propose CoMNet (Connectivity preservation Mobile routing protocol for actuator and sensor NETworks), a localized mechanism that modifies the network topology to support resource efficient transmissions. To the best of our knowledge, CoMNet is the first georouting algorithm which considers controlled mobility to improve routing energy consump- tion while ensuring network connectivity. CoMNet is based on (i) a cost to progress metric which optimizes both sending and moving costs, (ii) the use of a connected dominating set to maintain network connectivity. CoMNet is general enough to be applied to various networks (actuator, sensor). Our simulations show that CoMNet guarantees network connec- tivity and is effective in achieving high delivery rates and substantial energy savings compared to traditional approaches