Accepted paper

  • PERFORMANCE EVALUATION OF MOBILITY AND ROUTING PROTOCOLS FOR VEHICULAR AD HOC NETWORKS USING NS-2 AND VANET MOBISIM
    Fatma Baccar and Kais Mnif National School of Electronics and Telecommunications, NTS'Com , Sfax, Tunisia
    ABSTRACT

    In this paper, we will focus on the performance evaluation of a vehicular mobility scenario graph. Indeed, we will analyze the performance metrics (throughput, packets loss and end to end delay) using the IEEE 802.11p standard of the proposed mobility graph. In addition, we examine the impact of the packet length, vehicle speed and routing protocols (Ad-Hoc On-demand Distance Vector "AODV", Destination Sequenced Distance Vector "DSDV" and DumbAgent). Our simulations are based on the networks simulator "NS-2" and the mobility simulator "VanetMobisim" to evaluate the performance of the vehicular ad hoc network.

  • A FASTER ALGORITHM FOR CONNECTED DOMI-NATING SET IN DENSE NETWORK
    Sadia Sharmin1, Fatima Farin Haque2, and Taufiq Islam Protick3,1Department of Computer Science & Engineering, Bangladesh University of Engineering & Technology, Dhaka, Bangladesh2Department of Computer Science & Engineering, Bangladesh University of Engineering & Technology, Dhaka, Bangladesh3Department of Computer Science & Engineering, Bangladesh University of Engineering & Technology, Dhaka, Bangladesh
    ABSTRACT

    For many reasons it might be pivotal to find a set of nodes in a Graph that can dominate the other vertices so that every node can be reached from one another via this set or backbone connected network.. That is where the application of Minimum Connected Dominating Set lies. There has been plenty of research on how to find such a set of nodes. We propose a Breadth First Search (BFS) based polynomial time heuristic which would help us to find the Connected Dominating Set (CDS) of a network given the Graph- a set of nodes & its edges. Finding the minimum connected dominating set (MCDS) is an NP-complete problem. Our approach might not find the minimum CDS but it gives a suboptimal result & runs fast enough for bigger set of nodes with higher edge density. We compare the results of our proposed algorithm with one of the most popular algorithm for finding CDS- Guha-Khuller's Algorithm. The quantitative results show that our approach is better suited for dense networks and some special Graphs in terms of the size of CDS. Moreover, in terms of practical running time, our algorithm outperforms the Guha-Khuller's one in most of the cases.

  • NOVEL SYBIL DEFENSE SCHEME FOR PEER-TO-PEER APPLICATIONS
    Fuad Shamieh and Roa Alharbi Department of Electrical and Computer Engineering, University of Western Ontario London, Ontario
  • ABSTRACT

    The importance of peer-to-peer(P2P) network overlays produced enormous interest in the research community due to their robustness, scalability, and data availability. P2P networks are overlays of logically connected hosts and other nodes including servers. Since P2P networks are largely constructed of end-hosts, they are susceptible to malicious activity, such as sybil attacks. Impostors perform it by assigning nodes multiple addresses, as opposed to a single address to degrade network quality. Sybil nodes will spread malicious data and provide bogus responses to requests. To prevent that, a novel defense mechanism is proposed. The DHT key-space is treated in a similar manner to radio frequency allocation incensing. An overlay of trusted nodes is used to detect and handle sybil nodes with the aid of source-destination pairs reporting on each other. The simulation results show that this scheme detects sybil nodes in large sized networks with thousands of interactions.

  • Risk based Access Control model for e-Health Cloud Computing Systems
    Wided Ben Daoud,Amel Meddeb-Makhlouf,Faouzi Zarai(NTS'Com) Research Unit,University of Sfax, Tunisia
  • ABSTRACT

    In the era of the Internet of things, e-Healthcare Cloud Computing becomes an active domain which enables the development and the growth of e-healthcare systems. In recent times, controlling access to electronic health cloud from illegal access and data breaches are still challenges for healthcare establishments. The security and the privacy of data are the strong requirements in the medical sector. This paper focuses on all these matters and offers a secure and flexible access control strategy based on risk and role based dynamic access control. Therefore, we introduce an adaptable architecture for e-health cloud, where the main enhancement of the proposed procedure is that access decision is mainly based on the resources available in the e-health cloud service providers.

  • XACML-BASED MODEL FOR A DISTRIBUTED NETWORK POLICY IN CLOUD COMPUTING
    Ferdaous Kamoun Abid, Amel Meddeb-Makhlouf,Faouzi Zarai New Technologies and Telecommunications Systems (NTS'Com) Research Unit, ENET'COM, University of Sfax, Sfax
  • ABSTRACT

    The distribution's feature of cloud computing and the increasing threat of attacks and malicious activities make necessary the use of distributed firewalls to control access to networks. Network-based access management and control is an essential research challenge to enhance the security of the cloud network. We propose, in this paper the use of risk-based access decisions in a distributed firewall topology. The proposed model is based on a combination of eXtensible Access Control Markup Language (XACML) decisions and risk analysis. For validation, we use a cloud implementation based on the Openstack platform.

Copyright © GRAPH-HOC - 2017