Browsing by Author "Djenouri, Djamel"

Now showing 1 - 20 of 128
  • Thumbnail Image
    Item
    A New Low Cost Sessions-Based Misbehaviour Detection Protocol (SMDP) for MANE
    (IEEE Computer Society, 2007-05) Djenouri, Djamel; Fahad, Tarek; Askwith, Robert; Merabti, Madjid
    There is a strong motivation for a node to deny packet forwarding to others and being selfish in MANET. Recently, some solutions have been proposed, but almost all of these solutions rely on the watchdog technique, which suffers from many drawbacks, particularly when using the power control technique. To overcome this problem with a moderate communication overhead, this paper introduces a new approach for detecting misbehaving nodes that drop data packets in MANET. It consists of two stages: (i) the monitoring stage in which each node monitors its direct neighbours with respect to forwarding data packets of a traffic session in the network, and (ii) the decision stage, in which direct neighbouring nodes decide whether the monitored node misbehaves or not. Our new approach is able to detect the misbehaviour in case of power control employment, with a low communication overhead compared to the existing approaches.
  • Thumbnail Image
    Item
    A Novel Approach for Selfish Nodes Detection in MANETs: Proposal and Petri Nets Based Modeling
    (IEEE, 2005-06) Djenouri, Djamel; Badache, Nadjib
    The 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.
  • Thumbnail Image
    Item
    A study of Wireless Sensor Network Architectures and Projects for Traffic Light Monitoring
    (CERIST, 2012) Kafi, Mohamed Amine; Badache, Nadjib; Challal, Yacine; Bouabdallah, Abdelmadjid; Djenouri, Djamel
    Vehicular 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.
  • Thumbnail Image
    Item
    A 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, Nadjib
    Vehicular 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.
  • Thumbnail Image
    Item
    A 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, Nadjib
    With 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.
  • Thumbnail Image
    Item
    A Study on the Energy Consumption Minimisation in Mobile Ad Hoc Networks
    (2003-12) Djenouri, Djamel; Badache, Nadjib
    The 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.
  • Thumbnail Image
    Item
    A survey on Wireless Sensor Networks for Urban Traffic Monitoring: Applications and Architectures
    (CERIST, 2012) Kafi, Mohamed Amine; Badache, Nadjib; Challal, Yacine; Bouabdallah, Abdelmadjid; Djenouri, Djamel
    Vehicular 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.
  • Thumbnail Image
    Item
    A Variant of Connected Dominating Set for Application in Communication Networks
    (CERIST, 2015-03-30) Djenouri, Djamel; Bagaa, Miloud
    This paper considers a variant of the connected dominating set (CDS) problem in a graph G = (V;E). The considered problem consists in minimizing the number of CDS vertices that belong to a subset V ′ in V . As far as we know, this problem has not been treated in the literature. Nevertheless, its resolution would be useful in many communication network applications, such as the selection of relay nodes in heterogenous wireless ad hoc networks where only a subset of powerful nodes (e.g., energy or memory rich nodes) may form the network backbone act as relays, or where it is preferable to select relays from these nodes and minimize the number of non-powerful nodes that act as relays. Replacement of non-powerful nodes might be necessary either at the initialization (after deployment), or during the network lifetime, which justifies the need to minimize their number. The problem is first modeled and reduced to the minimum weighted connected dominating set (WCDS) problem in a vertex weighted graph, and then it is resolved by taking advantage of the simple form of the weight function using integer linear programming (ILP). A heuristic is also proposed for large scale resolution. Simulation results confirms closeness of the proposed heuristic to the optimal solution obtained by the ILP, and scalability of the heuristic.
  • Thumbnail Image
    Item
    Ad hoc networks routing protocols and mobility
    (2006-04) Djenouri, Djamel; Derhab, Abdelouahid; Badache, Nadjib
    An 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.
  • Thumbnail Image
    Item
    ADABCAST: ADAptive BroadCAST Approach for Solar Energy Harvesting Wireless Sensor Networks
    (IEEE, 2017-04) Khiati, Mustapha; Djenouri, Djamel
    The problem of message broadcasting from the base station (BS) to sensor nodes (SNs) in solar energy harvesting wireless sensor networks (EHWSN) is considered in this paper. The aim is to ensure fast and reliable broadcasting without interfering with upstream communications (from SNs to BS), whilst taking into account energy harvesting constraints. An adaptive approach is proposed where the BS first selects the broadcast time slots, given a wake-up schedule for the SNs (the time slots where the SN are active and in receiving mode). Hence, the SNs adapt their schedules. This is then iterated seeking optimal selection of the broadcast time slots, so as to minimize broadcast overhead (transmitted messages) and latency. Our approach enables fast broadcast and eliminates the need for adding protocol overhead (redundancy), compared to the existing solutions. Hidden Markov Model (HMM) and Baum-Welch learning algorithm are used for this purpose. Numerical results confirm that our scheme performs the broadcast operation in less time, and by reducing the broadcast overhead, as compared to state-of-the-art approaches.
  • Thumbnail Image
    Item
    An Energy Efficient routing protocol for mobile ad hoc networks
    (IFIP, 2003-06) Djenouri, Djamel; Badache, Nadjib
    power 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.
  • Thumbnail Image
    Item
    An Oscillation-Based Algorithm for Reliable Vehicle Detection with Magnetic Sensors
    (CERIST, 2016-02-25) Djenouri, Djamel; Doudou, Messaoud; Kafi, Mohamed Amine
    Vehicle monitoring using a wireless sensor network is considered in this paper, where a new algorithm is proposed for vehicle detection with magnetic sensors. The proposed algorithm is based on processing the magnetic signal and thoroughly analyzing the number/direction of its oscillations. The main feature of the proposed algorithm over the state-of-the-art ones is its capability to detect vehicles with different shapes of signatures, while most state-of-the-art algorithms assume regular shapes of signatures. This makes the algorithm effective with all types of magnetic sensors. The proposed algorithm has been implemented on Micaz sensor motes and tested in real word scenarios. Results show reliability beyond 93% in all samples, and more than 95% in most of them.
  • Thumbnail Image
    Item
    An oscillation-based algorithm for reliable vehicle detection with magnetic sensors
    (IEEE, 2016-04) Djenouri, Djamel; Doudou, Messaoud; Kafi, Mohamed Amine
    Vehicle monitoring using a wireless sensor network is considered in this paper, where a new algorithm is proposed for vehicle detection with magnetic sensors. The proposed algorithm is based on processing the magnetic signal and thoroughly analyzing the number/direction of its oscillations. The main feature of the proposed algorithm over the state-of-the-art ones is its capability to detect vehicles with different shapes of signatures, while most state-of-the-art algorithms assume regular shapes of signatures. This makes the algorithm effective with all types of magnetic sensors. The proposed algorithm has been implemented on MICAz sensor motes and tested in real world scenarios. Results show reliability beyond 93% in all samples, and more than 95% in most of them.
  • Thumbnail Image
    Item
    BA: Game Theoretical Approach for Energy-Delay Balancing in Distributed Duty-Cycled MAC Protocols of Wireless Networks
    (ACM, 2014-07-14) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Djenouri, Djamel; Garcia-Vidal, Jorge; Badache, Nadjib
    Optimizing energy consumption and end-to-end (e2e) packet delay in energy constrained distributed wireless networks is a conflicting multi-objective optimization problem. This paper investigates this trade-off from a game-theoretic perspective, where the two optimization objectives are considered as virtual game players that attempt to optimize their utility values. The cost model of each player is mapped through a generalized optimization framework onto protocol specific MAC parameters. A cooperative game is then defined, in which the Nash Bargaining solution assures the balance between energy consumption and e2e packet delay. For illustration, this formulation is applied to three state-of-the-art wireless sensor network MAC protocols; X-MAC, DMAC, and LMAC as representatives of preamble sampling, slotted contention-based, and frame-based MAC categories, respectively. The paper shows the effectiveness of such framework in optimizing protocol parameters for achieving a fair energy-delay performance trade-off, under the application requirements in terms of initial energy budget and maximum e2e packet delay. The proposed framework is scalable with the increase in the number of nodes, as the players represent the optimization metrics instead of nodes.
  • Thumbnail Image
    Item
    BOD-LEACH: broadcasting over duty-cycled radio using LEACH clustering for delay/power efficient dissimilation in wireless sensor networks
    (John Wiley & Sons, Ltd, 2015-02) Khiati, Mustapha; Djenouri, Djamel
    Broadcasting delay-sensitive information over a duty-cycled wireless sensor network is considered, and a cluster-based protocol is proposed. The proposed protocol, namely Broadcast over Duty-Cycle and LEACH (BOD-LEACH), takes advantage of the LEACH’s energy-efficient clustering. This approach shifts the total burden of energy consumption of a single cluster head by rotating the cluster-head role among all nodes in the network. It also permits the ordinary (member) nodes in a cluster to turn off their radios whenever they enter inactive TDMA slots. However, LEACH does not consider broadcast messages, and the member nodes scheduling is established as a sequence of Time Division Multiple Access (TDMA) without any common active period. A broadcast message should then be postponed to the next TDMA schedule and transmitted in a sequence of unicast messages, which is inefficient in terms of latency, bandwidth occupation, and power consumption. The proposed protocol adds new common static and dynamic broadcast periods to support and accelerate broadcasting. The dynamic periods are scheduled following the past arrivals of messages and using a Markov chain model. To our knowledge, this work is the first that proposes the use of clustering to perform simultaneous local broadcasts at several clusters. This reduces broadcast latency and ensures scalability. The protocol has been simulated, numerically analyzed, and compared with LEACH. The results show clear improvement over LEACH with regard to broadcast latency, at a low energy cost.
  • Thumbnail Image
    Item
    Brief Announcement on MOGRIBA: Multi-Objective Geographical Routing for Biomedical Applications of Wireless Sensor Networks
    (LNCS, 2009-07) Djenouri, Djamel; Balasingham, Ilangko
    A new routing protocol for wireless sensor networks is proposed in this paper. The proposed protocol focuses on medical applications, by considering its traffic diversity and providing a differentiation routing using quality of service (QoS) metrics. The design is based on modular and scalable approach, where the protocol operates in a distributed, localized, computation and memory efficient way. The main contribution of this paper is data traffic based QoS with regard to all the considered QoS metrics, notably reliability, latency, and energy. To our best knowledge, this protocol is the first that makes use of the diversity in the data traffic while considering latency, reliability, residual energy in the sensor nodes, and transmission power between sensor nodes as QoS metrics of the multi-objective problem. Simulation study comparing the protocol with state-of-the QoS and geographical routing protocols shows that it outperforms all the compared protocols.
  • Thumbnail Image
    Item
    Car Park Management with Networked Wireless Sensors and Active RFID
    (CERIST, 2015-03-30) Djenouri, Djamel; Karbab, Elmouatezbillah; Boulkaboul, Sahar; Bagula, Antoine
    This paper considers automatic car park management, which becomes an inevitable option to rationalize traffic management in modern cities. Integration of networked sensor/ actuator and radio frequency identification (RFID) technologies is explored to enable sophisticated services via the Internet in the emerging internet of things (IoT) context. Based on this integration, we propose a scalable and low-cost car parking framework (CPF). A preliminary prototype implementation and experimentation of some modules of the proposed CFP has been performed. The clustering of sensors (sensing boards) into a single mote using the standard I2C protocol has been explored in the prototype, and experimental results demonstrate considerable reduction in cost and energy consumption.
  • Thumbnail Image
    Item
    Cluster-Based Fast Broadcast in Duty-Cycled Wireless Sensor Networks
    (CERIST, 2012) Djenouri, Djamel; Khiati, Mustapha
    This paper proposes a cluster-based broadcast protocol to disseminate delay-sensitive information throughout a wireless sensor network. The protocol considers the use of duty-cycling at the MAC layer, which is essential to reduce energy dissipation. LEACH’s energy-efficiency approach is used for cluster construction. This approach shifts the total burden of energy consumption of a single cluster-head by rotating the cluster-head function among all nodes in the network. It also permits to switch the ordinary (member) nodes in a cluster into the sleep mode whenever they enter inactive TDMA slots. However, LEACH does not consider broadcast messages, and the member nodes scheduling is established as a sequence of TDMA without any common active period. A broadcast message should then be postponed to next TDMA schedule and transmitted a sequence of unicasts, which is inefficient in terms of latency, bandwidth occupation, and power consumption. The proposed protocol adds new common static and dynamic broadcast periods to support and accelerate broadcasting. The dynamic periods are scheduled following the past arrivals of messages, and using a Markov-chain model. To our knowledge, this work is the first that proposes the use of clustering to reduce broadcast latency. Taking advantage of LEACH’s clustering mechanism allow for simultaneous local broadcasts at several clusters in the WSN, and it also ensures scalability with the increase of the network size. This parallelism minimizes the end to-end broadcast latency compared to the current flat-topology solutions, where the end-to-end broadcast latency and the number of messages required to make a broadcast (message-count) are proportional to the network size. The protocol has been simulated, numerically analyzed, and compared with LEACH. The results show clear improvement over LEACH with regard to the latency, at a low energy cost.
  • Thumbnail Image
    Item
    Cluster-Based Fast Broadcast in Duty-Cycled Wireless Sensor Networks
    (IEEE, 2012-08) Khiati, Mustapha; Djenouri, Djamel
    This paper proposes a cluster-based broadcast protocol to disseminate delay-sensitive information throughout a wireless sensor network (WSN). The protocol considers the use of duty-cycling at the MAC layer, which is essential to reduce energy dissipation. LEACH's energy-efficiency approach is used for cluster construction. The proposed protocol adds new common static and dynamic broadcast periods to support and accelerate broadcasting. The dynamic periods are scheduled following the past arrivals of messages, and using a Markov-chain model. To our knowledge, this work is the first that proposes the use of clustering to reduce broadcast latency. The clustering mechanism allows for simultaneous local broadcasts at several clusters in the WSN, and it also ensures scalability with the increase of the network size. The protocol has been simulated, numerically analyzed, and compared with LEACH. The results show clear improvement over LEACH with regard to the latency.
  • Thumbnail Image
    Item
    Congestion Control Protocols in Wireless Sensor Networks: A Survey
    (2014-03-05) Kafi, Mohamed Amine; Djenouri, Djamel; Ben Othman, Jalel; Badache, Nadjib
    The performance of wireless sensor networks (WSN) is affected by the lossy communication medium, application diversity, dense deployment, limited processing power and storage capacity, frequent topology change. All these limitations provide significant and unique design challenges to data transport control in wireless sensor networks. An effective transport protocol should consider reliable message delivery, energy-efficiency, quality of service and congestion control. The latter is vital for achieving a high throughput and a long network lifetime. Despite the huge number of protocols proposed in the literature, congestion control in WSN remains challenging. A review and taxonomy of the state-of-the-art protocols from the literature up to 2013 is provided in this paper. First, depending on the control policy, the protocols are divided into resource control vs. traffic control. Traffic control protocols are either reactive or preventive (avoiding). Reactive solutions are classified following the reaction scale, while preventive solutions are split up into buffer limitation vs. interference control. Resource control protocols are classified according to the type of resource to be tuned.