Skip to main content
main-content

Über dieses Buch

This book constitutes the thoroughly refereed post-conference proceedings of the Second International Conference on Mobile, Secure and Programmable Networking, held in Paris, France,

in June 2016. The 17 papers presented in this volume were carefully reviewed and selected from 37 submissions. They discuss new trends in networking infrastructures, security, services and applications while focusing on virtualization and Cloud computing for networks, network programming, software defined networks (SDN) and their security.

Inhaltsverzeichnis

Frontmatter

Efficient Intermediate Data Placement in Federated Cloud Data Centers Storage

Abstract
The goal of cloud federation strategies is to define a mechanism for resources sharing among federation collaborators. Those mechanisms must be fair to guaranty the common benefits of all the federation members. This paper focuses on intermediate data allocation cost in federated cloud storage. Through a federation mechanism, we propose a mixed integer linear programming model (MILP) to assist multiple data centers hosting intermediate data generated from a scientific community. Under the constraints of the problem, an exact algorithm is proposed to minimize intermediate data allocation cost over the federated data centers storage, taking into account scientific users requirements, intermediate data dependency and data size. Experimental results show the cost-efficiency and scalability of the proposed federated cloud storage model.
Sonia Ikken, Eric Renault, Amine Barkat, M. Tahar Kechadi, Abdelkamel Tari

Tasks Scheduling and Resource Allocation for High Data Management in Scientific Cloud Computing Environment

Abstract
Cloud computing refers to the use of computing, platform, software, as a service. It’s a form of utility computing where the customer need not own the necessary infrastructure and pay for only what they use. Computing resources are delivered as virtual machines. In such a scenario, data management in virtual machines in Cloud Computing is a new challenge and task scheduling algorithms play an important role where the aim is to schedule the tasks effectively so as to reduce the turnaround time and improve resource utilization and Data Management.
In this work, we propose two strategies for task scheduling and resource allocation for high data in Cloud computing. The main objective is to improve data management in virtual machine in Cloud computing and optimize the total execution time of all tasks.
Esma Insaf Djebbar, Ghalem Belalem

Autonomous Intercloud Reference Architecture Driven by Interoperability

Abstract
Cloud computing is on the hype nowadays, new offering appears frequently and the demand on cloud services is growing in an exponential rate. In such dynamic and competitive market, working in silos is not a successful strategy. Therefore, single providers should integrate their resources and move up to a new level of cooperation and interconnection. This federation would bring in added value in terms of QoS, security, economics, etc. but also more complexity regarding federation management and how interoperability between disparate providers would be established. In this paper, we will present our federation concept through a layered autonomous intercloud reference architecture driven by interoperability.
Yosra Abassi, Cherif Ghazel, Leila Saidane

Traffic Monitoring in Software Defined Networks Using Opendaylight Controller

Abstract
Software Defined Network (SDN) is an emerging approach in network technology appeared in recent years. In the SDN revolution, OpenFlow is defined as the first communication standard to separates the control plane and data plane this allows the control plane to be centralized by an OpenFlow controller. The rise of SDN and OpenFlow has changed the point of view of the conventional model for network devices. In this paper, we focus on QoS monitoring in SDN controller using OpenFlow protocol. We propose a monitoring method for collecting the statistic and calculating the throughput of link traffics. We also design a new forwarding algorithm for control plane that avoids bottleneck and provides load-balancing. To evaluate our algorithm in real time traffic, we setup a test-bed in Mininet where we design the applications using the devised algorithm in Opendaylight controller, a fully functional open-source project with a rich set of API.
Duc-Hung Luong, Abdelkader Outtagarts, Abdelkrim Hebbar

Virtualization Techniques: Challenges and Opportunities

Abstract
The gap between the deployment costs for the new services, apps and hosting machines with the expected revenue forces the operators to think in the virtualization concept although the heterogeneity in virtualization techniques solutions. While this virtualization architecture came with different challenges like instances isolation in the hardware or software layers, it anticipated many opportunities for fast deployment and resources management. This position paper lists the main challenges starting from tenants’ isolation and hardware trusting for virtualization layer till the software and network mapping issues for virtual instances communication under the softwarization techniques. Moreover, it sums up the directions for this research point in terms of the vision of software and hardware.
Lyes Bouali, Emad Abd-Elrahman, Hossam Afifi, Samia Bouzefrane, Mehammed Daoui

Prediction of a Mobile’s Location Based on Classification According to His Profile and His Communication Bill

Abstract
In this paper, we present a new approach to predict the displacement of a mobile based on classification according to profile (all significant information that characterizes a user), and taking account of communication bill of this one. Our solution can be implemented in a third generation network, by exploiting information of users (age, function, residence place, work place …), the existing infrastructure (roads …) and the historical of displacements.
Linda Chamek, Mehammed Daoui, Selma Boumerdassi

A Comparative Study of the Mobile Learning Approaches

Abstract
With the emergence of mobile devices (Smart Phone, PDA, UMPC, game consoles, etc.), and the growth of offers and needs of a company under formation in motion, multiply the work to identify relevant new learning platforms to improve and facilitate the process of distance learning. The next stage of distance learning is naturally the port of e-learning to new mobile systems. This is called m-learning (mobile learning). Because of the mobility feature, m-learning courses have to be adapted dynamically to the learner’s context. Several researches addressed this issue and implemented a mobile learning environment. In this paper, we compare a list of mobile learning architectures with methods presented in the literature. The evaluation presents a set of criteria specifically identified to qualify m-learning architectures dedicated to the context-change management.
Sameh Baccari, Florence Mendes, Christophe Nicolle, Fayrouz Soualah-Alila, Mahmoud Neji

Improved Document Feature Selection with Categorical Parameter for Text Classification

Abstract
Social network develops rapidly and thousands of new data appears on the Internet every day. Classification technology is the key to organize big data. Feature Selection (FS) is a direct way to improve classification efficiency. FS can reduce the size of the feature subset and ensure classification accuracy based on features’ score, which is calculated by FS methods. Most previous studies of FS emphasized on precision while time-efficiency was commonly ignored. In our study, we proposed a method named CDFDC at first. It combines both CDF and Category-Frequency. Secondly, we compared DF, CDF, CHI, IG, CDFP_VM and CDFDC to figure out the relationships among algorithm complexity, time efficiency and classification accuracy. The experiment is implemented with 20-news-group data set and NB classifier. The performance of the FS methods evaluated by seven aspects: precision, Micro F1, Macro F1, feature-selection-time, documents-conversion-time, training-time and classification-time. The result shows that the proposed method performs well on efficiency and accuracy when the size of feature subset is greater than 3,000. And it is also discovered that FS algorithm’s complexity is unrelated to accuracy but complexity can ensure time stability and predictability.
Fen Wang, Xiaoxuan Li, Xiaotao Huang, Ling Kang

A Geographic Multipath Routing Protocol for Wireless Multimedia Sensor Networks

Abstract
The availability of low-cost hardware such as cameras and microphones has fostered the development of wirelessly interconnected devices that are able to retrieve from the environment, in addition to scalar data, the audio and video streams. Transfering the large multimedia content while guaranteeing QoS requirements is a very challenge to solve, given that multimedia applications convey a large mass of data that requires high transmission rate and intensive treatment. Therefore, in this paper, we propose a Geographic Multipath Routing Protocol (GMRP) that satisfies the realistic characteristics of multimedia transmission in wireless sensor networks.
Simulations results show a significant contribution and indicate that GMRP achieves lower average delay, higher packet delivery ratio and ensures load balancing in the network.
Mohamed Nacer Bouatit, Selma Boumerdassi, Adel Djama

Ensuring Connectivity in Wireless Sensor Network with a Robot-Assisted Sensor Relocation

Abstract
Wireless sensor networks (WSN) are used to survey a given Region Of Interest (ROI) especially the WSNs are used to survey hazardous and unreacheable zones like military zone or frontiers, the survey of this kind of areas is very important and can prevent from terorrist events. Ensuring connectivity between all deployed sensors of the (ROI) is a challenging issue. Random technique of node deployment such as stochastic node dropping result in hole creating in some areas of the network and redundant nodes may appear in other areas. In this paper, we propose two assisted-robot algorithms in which we use redundant sensors and relocate them in order to cover holes. We exploit here the redundancy of sensors to connect the formed partitions of sensors. We propose two strategies for the robot functioning and sensor relocation, the first strategy is a grid based one, in this solution the controlled area is divided into a virtual grid and the robot movement is based on this grid, we called this strategy “Grid-Based Walk with Memorization” (GBWM). The second strategy is an island based strategy, the network is composed of a set of disconnected island and the task of the robot is to connect the formed islands, we called this strategy “Island-Based Walk with Memorization”, noted (IBWM). Through extensive simulations we show the importance of these algorithms.
Sahla Masmoudi Mnif, Leila Azouz Saidane

A New Non-intrusive Assessment Method for VoLTE Quality Based on Extended E-Model

Abstract
Voice over Long Term Evolution (VoLTE) is always a main service that brings a big benefit for mobile operators. However, the deployment of VoLTE is very complex, specially for guaranteeing of Quality of Service (QoS) to meet quality of experience of mobile users. The key purpose of this paper is to present an object non-intrusive prediction model for VoLTE quality based on LTE-Sim framework and the extended E-model. This combination allows overcoming the lack of the E-model is that how to determine exactly its inputs. Besides, we propose to complement the jitter buffer as an essential input factor to the E-model. The simulation results show that the proposed model can predict voice quality in LTE network via both the E-model and the extended E-model. The proposed model does not refer to the original signal, thus, it is very suitable for predicting voice quality in LTE network for many different scenarios which are configured in the LTE-Sim framework. The simulation results also show that the effect of jitter buffer on user perception is very significant.
Duy-Huy Nguyen, Hang Nguyen, Éric Renault

A Modular Secure Framework Based on SDMN for Mobile Core Cloud

Abstract
During these last few years, mobile data traffic has been strongly growing while the voice traffic decreases (fixed and mobile), This new reality pushes operators to invest in a new next generation of mobile network (Mobile Cloud Computing, 5G) to enhance their competitivity and provide more innovative marketing products and services to the end user. But they were facing a major obstacle: the computer networks management is too complex and difficult. The research community proposes Software Defined Mobile Networks (SDMNs) as a solution to provide more flexibility and to ease the management of the next-generation mobile networks especially Mobile Cloud Computing (MCC). This new solution offers a huge advantage to the mobile operators and enables innovation through network programmability. SDMN provides several benefits including, network and service customized, improved operations and better performance, but there are some security issues that need to be taken care of. This paper describes the emergence of SDMN as an important new networking technology, discusses the different problems related to security issue. We propose a framework to secure the different levels in SDMN architecture with an implementation of our framework. A simulation has been done of some main threats such as DDoS attack and malware infection.
Karim Zkik, Tarik Tachihante, Ghizlane Orhanou, Said El Hajji

Cloud Security Quantitative Assessment Based on Mobile Agent and Web Service Interaction

Abstract
Cloud security is very challenging and is becoming a research hot topic. Thus, the adoption of the security assessment would be the key to evaluate and to enhance the cloud security level. The security assessment can be quantitative or qualitative. This paper proposes a cloud security quantitative assessment (CSQA) model. This proposed model evaluates the security of any cloud service (XaaS) exposed to attacks and vulnerabilities affecting its quality and specially its availability. It is based on mobile agent and web service interaction framework.
Abir Khaldi, Kamel Karoui, Henda Ben Ghezala

A Middleware to Allow Fine-Grained Access Control of Twitter Applications

Abstract
Mobile applications security is nowadays one of the most important topics in the field of information security, due to their pervasivity in the people’s life. Among mobile applications, those that interact with social network profiles, have a great potential for development, as they intercept another powerful asset of the today cyberspace. However, one of the problems that can limit the diffusion of social network applications is the lack of fine-grained control when an application use the APIs of a social network to access a profile. For instance, in Twitter, the supported access control policy is basically on/off, so that if a (third party) application needs the right to write in a user profile, the user is enforced to grant this right with no restriction in the entire profile. This enables a large set of security threats and can make (even inexpert) users reluctant to run these applications. To overcome this problem, we propose an effective solution working for Android Twitter applications based on a middleware approach. The proposed solution enables other possible benefits, as anomaly-based malware detection leveraging API-call patterns, and it can be extended to a multiple social network scenario.
Francesco Buccafurri, Gianluca Lax, Serena Nicolazzo, Antonino Nocera

AndroPatchApp: Taming Rogue Ads in Android

Abstract
Mobile applications have drastically changed the way that we use our mobile devices. The different sensors that are embedded allow novel user interaction and make them context-aware. However, the operating system of most mobile devices allows limited user configuration; the user does not have full access, in order to make them more secure. Despite this measure, the overall security and privacy of users cannot be considered adequate. While there are many tools for “rooted” devices, the choices for “out of the stock” devices are not that many, and more importantly, they are not that effective.
To address these shortcomings, AndroPatchApp takes a different approach. Instead of installing monitoring and detection apps in the operating system, AndroPatchApp embeds some security and privacy controls before installation, by generating a “sanitized” version of the app.
Vasilis Tsiakos, Constantinos Patsakis

Creating an Easy to Use and High Performance Parallel Platform on Multi-cores Networks

Abstract
How to easily exploit the performance of network using multi-core processors nodes is the purpose of many researches including CAPE (Checkpointing Aided Parallel Execution). CAPE uses the checkpointing technique to bring the simplicity and high performance of OpenMP – a high performance and easy-to-use standard of parallel programming API on shared-memory architecture – onto distributed-memory architectures. Theoretical analysis and experimental results have proved that CAPE has ability of providing a high performance and complete compatibility with OpenMP standard. This article aims at introducing how to use multiple processes on calculating nodes to increase performance of CAPE with the initial results.
Viet Hai Ha, Xuan Huyen Do, Van Long Tran, Éric Renault

Performance Evaluation of Peer-to-Peer Structured Overlays over Mobile Ad Hoc Networks Having Low Dynamism

Abstract
To exploit the synergy between Mobile Ad hoc Networks (MANETs) and structured Peer-to-Peer (P2P) overlays, three different approaches, namely cross-layered, integrated, and layered have been proposed for their integration. In the cross-layered approach, information from the lower layers is made available at the application layer or vice versa. The integrated approach implements peer-to-peer routing algorithms at the network layer or MAC layer, whereas the layered approach utilizes application layer virtual links to construct P2P overlay on top of the MANET routing layer. It has been observed that cross-layered approach and integrated approach perform relatively better in situations where both node mobility and churn rate are high, but these approaches require changes in the lower layers of the protocol stack. On the other hand, the layered approach does not require any change in the protocol stack at lower levels, thus facilitating easy implementation. However, under highly dynamic scenarios this approach fails to achieve satisfactory performance. This paper targets to analyze the performance of layered approach under low dynamism. We have evaluated the performance of two topologically different structured overlays utilizing the layered approach in scenarios where, mobility of nodes is minimal, churn rate is low and network size is limited. The performance evaluation has been done using different network sizes, mobility speeds and lifetimes of nodes. Further, the frequency of execution of overlay maintenance procedures is also varied according to the dynamics of the MANET. The simulation results are gathered and compared with respect to packet delivery ratio, latency and maintenance overhead. The results obtained establish the applicability of layered approach for implementation of structured overlays over MANETs having low dynamism.
Anurag Sewak, Mayank Pandey, Manoj Madhava Gore

Backmatter

Weitere Informationen

Premium Partner

    Bildnachweise