Browsing by Author "Badache, Nadjib"
Now showing 1 - 20 of 120
Results Per Page
Sort Options
- ItemA Novel Approach to Preserving Privacy in Social Network Data Publishing(CERIST, 2016-10-24) Bensimessaoud, Sihem; Benmeziane, Souad; Badache, Nadjib; Djellalbia, AminaToday, more and more social network data are published for data analysis. Although this analysis is important, these publications may be targeted by re-identification attacks i.e., where an attacker tries to recover the identities of some nodes that were removed during the anonymization process. Among these attacks, we distinguish "the neighborhood attacks" where an attacker can have background knowledge about the neighborhoods of target victims. Researchers have developed anonymization models similar to k-anonymity, based on edge adding, but can significantly alter the properties of the original graph. In this work, a new anonymization algorithm based on the addition of fake nodes is proposed, which ensures that the published graph preserves another important utility that is the average path length “APL”.
- ItemA causal multicast protocol for dynamic groups in cellular networks(ACM, 2008-09-10) Benzaid, Chafika; Badache, NadjibGroup communication is an abstraction which deals with multicasting a message from a source process to a group of processes. In Group Communication Systems (GCS), causal message ordering is an essential tool to ensure interaction among group members in a consistent way. In this paper, we propose a simple and optimal causal multicast protocol which copes with the dynamically changing groups in mobile environments. The protocol presents an optimal communication overhead without causing inhibition effect in the delivery of messages. The group membership management depends on a simple, yet powerful idea. This original idea consists in considering the join and leave requests as data messages, and then will be ordered with other messages. This makes no need to a coordination phase in the installation of a new view. Our protocol requires minimal resources on mobile hosts and wireless links and scales well with large groups.
- ItemA clustering technique to analyse anonymous systems(CERIST, 2014-07-20) Benmeziane, Souad; Badache, NadjibConcerns about privacy and anonymity have gained more and more attention in conjunction with the rapid growth of the Internet as a means of communication and information dissemination. A number of anonymous communication systems have been developed to protect the identity of communication participants. Nevertheless, it is important to provide ways to evaluate and measure the level of anonymity provided. We introduce in this report the use of hierarchical clustering technique to analyse anonymous systems. We propose a new measure to evaluate anonymous systems by introducing the concept of dominant cluster. We further show that using this measure will overcome the limitations of other existing measures.
- ItemA clustering technique to analyse anonymous users.(CPS, 2014-08-09) Benmeziane, Souad; Badache, NadjibConcerns about privacy and anonymity have gained more and more attention in conjunction with the rapid growth of the Internet as a means of communication and information dissemination. A number of anonymous communication systems have been developed to protect the identity of communication participants. Nevertheless, it is important to provide ways to evaluate and measure the level of anonymity provided. We introduce in this paper the use of hierarchical clustering technique to analyse anonymous systems. We propose a new measure to evaluate anonymous systems by introducing the concept of dominant cluster. We further show that using this measure will overcome the limitations of other existing measures.
- ItemA distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networks(Taylor et Francis, 2008-04-15) Derhab, Abdelouahid; Badache, NadjibIn this paper, we propose a new architecture to solve the problem of mutual exclusion in mobile ad hoc networks (MANET). The architecture is composed of two layers: (i) a middleware layer that contains a token-based distributed mutual exclusion algorithm (DMEA) and (ii) a network layer that includes two routing forwarding strategies: one to route request messages and the other to route the token message. We also propose a request ordering policy that ensures the usual mutual exclusion properties and reduces the number of hops traversed per critical section (CS) access. The paper also addresses the problem of network partitioning and unreachable nodes. The proposed mutual exclusion algorithm is further enhanced to provide fault tolerance by preventing the loss of the token and generating a new token if the token loss event occurs. The performance complexity as well as the experimental results show that the proposed algorithm experiences low number of hops per CS access.
- ItemA Novel Approach for Selfish Nodes Detection in MANETs: Proposal and Petri Nets Based Modeling(IEEE, 2005-06) Djenouri, Djamel; Badache, NadjibThe resource limitation of nodes used in selforganized ad hoc networks, along with the multi-hop nature of these networks, may cause a new behavioral phenomena which does not exist in traditional infrastructured environments. To save its energy, a node may behave sel shly, then it would not forward packets for other nodes while using their resources to forward its own packets. This deviation from the normal behavior is a potential threat against the service availability, one of the most important security requirements. Resolving this problem is challenging, due to the self-organization and the infrastructureless features of these networks. Recently, some solutions have been proposed, but almost all these solutions rely on the watchdog technique [1], which suffers from many problems. Especially when using the power control technique, employed by some new poweraware routing protocols following the watchdog's proposal. To overcome this problem, we propose in this paper a new approach we call two hops ACK (acknowledgment). Using petri nets we model and analyze our solution based on this novel approach.
- ItemA review on Privacy and Anonymity in electronic communications(Conference Procedings, 2006-10-25) Benmeziane, Souad; Badache, NadjibCurrent Internet networking protocols provide no support to ensure the privacy of communication endpoints. An adversary can determine which addresses have asked for which services. Anonymity is now increasingly important for networked applications. This paper overviews the concept of anonymity in electronic communications, vectors for a privacy invasion, and proposed solutions. Solutions are examined from the perspective of attacks which can be reasonably expected against these systems. Particular attention is paid to mobile agents systems and how to hide the itinerary of the agent.
- ItemA study of Wireless Sensor Network Architectures and Projects for Traffic Light Monitoring(CERIST, 2012) Kafi, Mohamed Amine; Badache, Nadjib; Challal, Yacine; Bouabdallah, Abdelmadjid; Djenouri, DjamelVehicular traffic is increasing around the world, especially in urban areas. This increase results in a huge traffic congestion, which has dramatic consequences on economy, human health, and environment. Traditional methods used for traffic management, surveillance and control become inefficient in terms of performance, cost, maintenance, and support, with the increased traffic. Wireless Sensor Networks (WSN) is an emergent technology with an effective potential to overcome these difficulties, and will have a great added value to intelligent transportation systems (ITS) overall. In this survey, we review traffic light projects and solutions. We discuss their architectural and engineering challenges, and shed some light on the future trends as well.
- ItemA study of Wireless Sensor Network Architectures and Projects for Traffic Light Monitoring(Elsevier, 2012-08-27) Kafi, Mohamed Amine; Challal, Yacine; Djenouri, Djamel; Bouabdallah, Abdelmadjid; Badache, NadjibVehicular traffic is increasing around the world, especially in urban areas. This increase results in a huge traffic congestion, which has dramatic consequences on economy, human health, and environment. Traditional methods used for traffic management, surveillance and control become inefficient in terms of performance, cost, maintenance, and support, with the increased traffic. Wireless Sensor Networks (WSN) is an emergent technology with an effective potential to overcome these difficulties, and will have a great added value to intelligent transportation systems (ITS) overall. In this survey, we review traffic light projects and solutions. We discuss their architectural and engineering challenges, and shed some light on the future trends as well.
- ItemA Study of Wireless Sensor Networks for Urban Traffic Monitoring: Applications and Architectures(Procedia Computer Science, Elsevier, 2013-06-26) Kafi, Mohamed Amine; Challal, Yacine; Djenouri, Djamel; Doudou, Messaoud; Bouabdallah, Abdelmadjid; Badache, NadjibWith the constant increasing of vehicular traffic around the world, especially in urban areas, existing traffic management solutions become inefficient. This can be clearly seen in our life through persistent traffic jam and rising number of accidents. Wireless sensor networks (WSN) based intelligent transportation systems (ITS) have emerged as a cost effective technology that bear a pivotal potential to overcome these difficulties. This technology enables a new broad range of smart city applications around urban sensing including traffic safety, traffic congestion control, road state monitoring, vehicular warning services, and parking management. This manuscript gives a comprehensive review on WSN based ITS solutions. The main contribution of this paper is to classify current WSNs based ITS projects from the application perspective, with discussions on the fulfillment of the application requirements.
- ItemA Study on the Energy Consumption Minimisation in Mobile Ad Hoc Networks(2003-12) Djenouri, Djamel; Badache, NadjibThe emergence of lightweight wireless mobile devices, like laptops, PDAs, and sensors makes mobile ad hoc networks (MANETs) an exciting and important research area in recent years. The MANET community have been concentrating on some problems related to the network layer, especially on the routing protocols. But regarding the MAC level, little has been done. No novel protocol has been proposed but traditional wireless MAC protocols have been largely adopted. Our contribution in this paper is the deep investigation of the mobility impacts on MAC protocols in MANETs, using the GloMoSim simulation tool. We think we are the first who consider nodes’ mobility when analyzing MAC protocols in MANETs.
- ItemA survey on Wireless Sensor Networks for Urban Traffic Monitoring: Applications and Architectures(CERIST, 2012) Kafi, Mohamed Amine; Badache, Nadjib; Challal, Yacine; Bouabdallah, Abdelmadjid; Djenouri, DjamelVehicular traffic is increasing around the world, especially in urban areas. This increase results in a huge traffic congestion, which has dramatic consequences on economy, human health, and environment. Traditional methods used for traffic management, surveillance and control become inefficient in terms of performance, cost, maintenance, and support, with the increased traffic. Wireless sensor networking (WSN) is an emergent technology with an effective potential to overcome these difficulties, which will have a great added value to intelligent transportation systems (ITS). This technology enables a new broad range of smart city applications around urban sensing. This includes a variety of applications such as traffic safety, traffic congestion control, road state monitoring, vehicular safety warning services, and parking lots management. In this survey, a review on traffic management projects and solutions is provided. The architectural and engineering challenges are discussed, and some future trends are highlighted.
- ItemAd hoc networks routing protocols and mobility(2006-04) Djenouri, Djamel; Derhab, Abdelouahid; Badache, NadjibAn ad hoc network is a temporary infrastructureless network, formed dynamically by mobile devices without turning to any existing centralized administration. To send packets to remote nodes, a node uses other intermediate nodes as relays, and ask them to forward its packets. For this purpose, a distributed routing protocol is required. Because the devices used are mobile, the network topology is unpredictable, and it may change at any time. These topology changes along with other intrinsic features related to mobile devices, such as the energy resource limitation, make ad hoc networks challenging to implement efficient routing protocols. In this paper, we drive a GloMoSim based simulation study, to investigate the mobility effects on the performance of several mobile ad hoc routing protocols.
- ItemAdaptive Fault Tolerant Checkpointing Algorithm for Cluster Based Mobile Ad Hoc Networks(Elsevier, 2015) Mansouri, Houssem; Badache, Nadjib; Aliouat, Makhlouf; Pathan, Al-Sakib KhanMobile Ad hoc NETwork (MANET) is a type of wireless network consisting of a set of self-configured mobile hosts that can communicate with each other using wireless links without the assistance of any fixed infrastructure. This has made possible to create a distributed mobile computing application and has also brought several new challenges in distributed algorithm design. Checkpointing is a well explored fault tolerance technique for the wired and cellular mobile networks. However, it is not directly applicable to MANET due to its dynamic topology, limited availability of stable storage, partitioning and the absence of fixed infrastructure. In this paper, we propose an adaptive, coordinated and non-blocking checkpointing algorithm to provide fault tolerance in cluster based MANET, where only minimum number of mobile hosts in the cluster should take checkpoints. The performance analysis and simulation results show that the proposed scheme performs well compared to works related.
- ItemAn Adaptive Anonymous Authentication for Cloud Environment(CERIST, 2015-04-28) Djellalbia, Amina; Benmeziane, Souad; Badache, Nadjib; Bensimessaoud, SihemPreserving identity privacy is a significant challenge for the security in cloud services. Indeed, an important barrier to the adoption of cloud services is user fear of privacy loss in the cloud. One interesting issue from a privacy perspective is to hide user’s usage behavior or meta-information which includes access patterns and frequencies when accessing services. Users may not want the cloud provider to learn which resources they access and how often they use a service by making them anonymous. In this paper, we will propose an adaptive and flexible approach to protect the identity privacy through an anonymous authentication scheme.
- ItemAn Adaptive Anonymous Authentication for Cloud Environment(IEEE Xplore Digital labrary, 2015-06-02) Djellalbia, Amina; Benmeziane, Souad; Badache, Nadjib; Bensimessaoud, SihemPreserving identity privacy is a significant challenge for the security in cloud services. Indeed, an important barrier to the adoption of cloud services is user fear of privacy loss in the cloud. One interesting issue from a privacy perspective is to hide user’s usage behavior or meta-information which includes access patterns and frequencies when accessing services. Users may not want the cloud provider to learn which resources they access and how often they use a service by making them anonymous. In this paper, we will propose an adaptive and flexible approach to protect the identity privacy through an anonymous authentication scheme.
- ItemAn Architectural Model for a Mobile Agents System Interoperability(Springer, 2007) Zeghache, Linda; Badache, Nadjib; El Maouhab, AouaoucheAn important goal in mobile agent technology is interoperability between various agent systems. A way of achieving this goal would be to envisage a standard to be imposed on these various “agents systems” in order to allow the inter-working of various architectures of mobile agents. During the past years, different scientific communities proposed to different standardization actions, such as the Foundation for Physical Intelligent Agents (FIPA) and the Object Management Group’s MASIF (Mobile Agent System Interoperability Facilities). Although, they finally share some major targets, the OMG and FIPA current results show their distinct origins, particularly for interoperability between or within distributed systems. In this paper, we first analyze the similarities and differences, advantages and disadvantages of the Object Management Group (OMG) mobile agent and the Foundations for Intelligent Physical Agents (FIPA) intelligent agent approaches. Based on this analysis, we try to integrate these two standards to propose an architectural model for mobile agents system interoperability
- ItemAn Energy Efficient routing protocol for mobile ad hoc networks(IFIP, 2003-06) Djenouri, Djamel; Badache, Nadjibpower consumed for routing data-packets in wireless ad hoc networks can be significantly reduced compared with the current min-hop max-power routing protocols. One of promising mechanisms proposed to reduce energy consumption is power control. Doshi & Timothy [7] have presented an implementation of this mechanism, and defined a new minimum energy routing scheme. We think that the aim of an efficient routing protocol is not only to minimize energy consumption to route packets, but also to ensure a long life to all nodes. In order to avoid the network partition as long as possible. In this paper, we define new metrics to resolve the tradeoff between: minimising energy consumption to route packets, on the one hand, and ensuring a long life to all nodes’ batteries, on the other hand. We also define a new technique which allows the distribution of the routing task over nodes then we modify DSR protocol, to improve it and to make a new power-aware and power efficient protocol.
- ItemAn Ω-Based Leader Election Algorithm for Mobile Ad Hoc Networks(Springer Berlin Heidelberg, 2012) Melit, Leila; Badache, NadjibLeader election is a fundamental control problem in both wired and wireless systems. The classical statement of the leader election problem in distributed systems is to eventually elect a unique leader from a fixed set of nodes. However, in MANETS, many complications may arise due to frequent and unpredictable topological changes. This paper presents a leader election algorithm based on the omega failures detector, where inter-node communication is allowed only among the neighboring nodes along with proofs of correctness. This algorithm ensures that every connected component of the mobile ad hoc network will eventually elect a unique leader, which is the node of the highest priority value from among all nodes within that connected component. The algorithm can tolerate intermittent failures, such as link failures, network partitions, and merging of connected network components.
- ItemAnonymous Authentication Scheme in e-Health Cloud environment(CERIST, 2016-10-20) Djellalbia, Amina; Benmeziane, Souad; Badache, Nadjib; Bensimessaoud, SihemThe adoption of an e-Health Cloud has different advantages especially allowing sharing and exchanging information between medical institutions, availability of information, reducing costs, etc. However, preserving identity privacy is a significant challenge of security in all environments, and constitutes particularly a very serious concern in Cloud environments. Indeed, an important barrier to the adoption of Cloud is user fear of privacy loss in the Cloud, particularly in an e-Health Cloud where users are Patients. Users may not want to disclose their identities to the Cloud Service Provider, a way to protect them is making them anonymous. In this paper, we will propose an adaptive and flexible approach to protect the identity privacy of Patients in an e-Health Cloud through an anonymous authentication scheme.