Browsing by Author "Bouabdallah, Abdelmadjid"

Now showing 1 - 14 of 14
  • 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 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
    Efficient QoS-aware Heterogeneous Architecture for Energy-Delay Constrained Connected Objects
    (CERIST, 2016) Doudou, Messaoud; Rault, Tifenn; Bouabdallah, Abdelmadjid
    Connected objects such as smart phones and wireless sensors becomes very attractive for our assisted daily life applications, because it offers continuous monitoring capability of both personal and environmental parameters. However, these systems still face a major energy issue that prevent their wide adoption. Indeed, continuous sampling and communication tasks quickly deplete sensors and gateways battery reserves, and frequent battery replacement are not convenient. One solution to address such a challenge consists in minimizing the activation of radio interfaces and switching between them in order to achieve very low duty cycle. In this paper, we propose a new efficient communication architecture for patient supervision in the context of healthcare application making use of dual radio. At runtime, our solution determines the optimal interval parameters of switching on/off each radio interfaces in order to minimize the energy consumption of both sensors and mobile phones while satisfying the QoS requirements. The proposed solution is adequately analyzed and numerically compared against a solution without QoS. The results show that our proposed architecture exhibits better duty-cycle reduction while satisfying the delay constraints.
  • Thumbnail Image
    Item
    Efficient QoS-aware Heterogeneous Architecture for Energy-Delay Constrained Connected Objects
    (IFIP, 2016-07-11) Doudou, Messaoud; Rault, Tifenn; Bouabdallah, Abdelmadjid
    Connected objects such as smart phones and wireless sensors becomes very attractive for our assisted daily life applications, because it offers continuous monitoring capability of both personal and environmental parameters. However, these systems still face a major energy issue that prevent their wide adoption. Indeed, continuous sampling and communication tasks quickly deplete sensors and gateways battery reserves, and frequent battery replacement are not convenient. One solution to address such a challenge consists in minimizing the activation of radio interfaces and switching between them in order to achieve very low duty-cycle. In this paper, we propose a new efficient communication architecture for patient supervision in the context of healthcare application making use of dual radio. At runtime, our solution determines the optimal interval parameters of switching on/off each radio interfaces in order to minimize the energy consumption of both sensors and mobile phones while satisfying the QoS requirements. The proposed solution is adequately analyzed and numerically compared against a solution without QoS. The results show that our proposed architecture exhibits better duty-cycle reduction while satisfying the delay constraints.
  • Thumbnail Image
    Item
    Game Theory Framework for MAC Parameter Optimization in Energy-Delay Constrained Sensor Networks
    (ACM, 2016-05-15) Doudou, Messaoud; M. Barcelo-Ordinas, Jose; Djenouri, Djamel; Garcia-Vidal, Jorge; Bouabdallah, Abdelmadjid; Badache, Nadjib
    Optimizing energy consumption and end-to-end (e2e) packet delay in energy-constrained, delay-sensitive wireless sensor networks is a conflicting multi-objective optimization problem. We investigate the problem from a game theory perspective, where the two optimization objectives are considered as game players. The cost model of each player is mapped through a generalized optimization framework onto protocol specific MAC parameters. From the optimization framework, a game is first defined by the Nash Bargaining Solution (NBS) to assure energy-consumption and e2e delay balancing. Secondly, the Kalai-Smorodinsky Bargaining Solution (KSBS) is used to find equal proportion of gain between players. Both methods offer a bargaining solution to the duty-cycle MAC protocol under different axioms. As a result, given the two performance requirements, i.e., the maximum latency tolerated by the application and the initial energy budget of nodes, the proposed framework allows to set tunable system parameters to reach a fair equilibrium point which dually minimizes the system latency and energy consumption. For illustration, this formulation is applied to six state-of-the-art Wireless Sensor Network (WSN) MAC protocols; B-MAC, X-MAC, RI-MAC, SMAC, DMAC, and LMAC. The paper shows the effectiveness and scalability of such framework in optimizing protocol parameters that achieve a fair energy-delay performance trade-off under the application requirements.
  • Thumbnail Image
    Item
    Gestion de clés et sécurité multipoint: étude et perspectives
    (Springer-Verlag, 2003) Seba, Hamida; Bouabdallah, Abdelmadjid; Badache, Nadjib; Bettahar, Hatem; Tandjaoui, Djamel
    La communication multipoint (ou communication de groupe) est un moyen efficace pour envoyer des données aux membres d’un groupe. Plusieurs types d’applications utilisant les communications multipoint nécessitent un certain niveau de sécurité: authentification, intégrité, confidentialité et contrôle d’accès. Comme les techniques implémentant ces services dans les communications point-à-point ne peuvent être appliquées telles quelles aux communications de groupe, la sécurité des communications de groupe a fait l’objet de plusieurs travaux. La gestion de clés qui constitue la brique de base des services de sécurité a été largement étudiée et a donné lieu à plusieurs publications. Dans cet article, nous décrivons les différentes approches existantes pour gérer et distribuer les clés dans un groupe. Nous discutons les avantages et les inconvénients des protocoles proposés dans la littérature et présentons une classification et une étude comparative de ces protocoles. Nous terminons cet article par quelques critiques et perspectives.
  • Thumbnail Image
    Item
    MSR : Minimum-Stop Recharging Scheme for Wireless Rechargeable Sensor Networks
    (CERIST, 2014-07-02) Khelladi, Lyes; Djenouri, Djamel; Badache, Nadjib; Bouabdallah, Abdelmadjid; Lasla, Noureddine
    This paper deals with simultaneous energy transfer to multiple nodes for scalable wireless recharging in wireless sensor networks. All existing recharging schemes rely on the use of a mobile charger that roves the network and drops by some locations for nodes recharging. However, they focus on the efficiency of energy transfer and neglect the energy engendered by the charger movement. This is tackled in this paper, where the wireless charging is modeled as a path optimization problem for the mobile charger, with objective function to minimizing the number of stop locations in the path. Due to the NP-harness of the problem, we propose a simple but efficient heuristic. It is based on clique partitioning to find the minimum number of locations allowing the mobile charger to replenish all the node’s batteries in the network. Evaluation results demonstrate that the proposed approach significantly reduces the total energy consumption of the mobile charger, while using a low-complexity techniques that permit scalability to a higher number of nodes.
  • Thumbnail Image
    Item
    Performance Analysis of Binding Update in Mobile IP during Handoff
    (Springer Berlin Heidelberg, 2004) Tandjaoui, Djamel; Badache, Nadjib; Bouabdallah, Abdelmadjid
    Mobile IP protocol was proposed to handle users mobility on Internet. However, Mobile IP suffers from many drawbacks especially handoff latency. In this paper, we investigate the loss of successive binding update requests and their impact on handoff latency. We show that handoff latency increases in case of successive binding update requests loss. We propose an enhancement of binding update in Mobile IP. It consists on reducing the timeout to half just after the loss of the first binding update. So, the mobile node sends two binding update requests within a timeout. By doing so, we increase the probability that one binding update request reach the home agent. We present an analytical model of handoff latency based on packets loss probability. The simulation shows that our solution reduces considerably the additional handoff latency induced by successive binding update requests loss.
  • Thumbnail Image
    Item
    Securing Distance Vector Routing Protocols for Hybrid Wireless Mish Networks
    (CERIST, 2010-04) Babakhouya, Abdelaziz; Challal, Yacine; Bouabdallah, Abdelmadjid; Gharout, Said
    Hybrid Wireless Mesh Networks (HWMNs) are currently emerging as a promising technology for a wide range of applications such as public safety, emergency response, and disaster recovery operations. HWMNs combine the concepts of mesh networks and ad hoc networks to maintain network connectivity. Routing is essential for HWMN in order to discover the network topology and built routes. The problem of all the current ad hoc routing protocols is that they trust all nodes and assume that they behave properly; therefore they are more vulnerable to nodes misbehavior. Misbehaving nodes can advertise incorrect routing information and disturb the topology building process. This attack is difficult to detect in distance vector routing protocols since nodes have no information regarding the network topology beyond the immediate neighbors. In this paper we propose a Consistency Check protocol for Distance Vector routing in HWMN environment. Our Consistency Check protocol can detect and reject false routes under the assumption that some mesh routers are trusted and do not cheat. Trough security analysis and simulation, we show that our approach is resilient to false accusation attacks while inducing an acceptable routing overhead.
  • Thumbnail Image
    Item
    Sécurité de routage
    (Université Abderrahmane Mira de Béjaia, 2005) Babakhouya, Abdelaziz; Bouabdallah, Abdelmadjid
    Les protocoles de routage assurent la connectivité du réseau et maintiennement des routes afin que les données envoyées par une source puissent atteindre leurs destinations. Les protocoles de routage utilisés actuellement dans l'internet, comme BGP, OSPF et RIP sont conçus pour opérer dans un environnement sain sans routeurs malicieux. Cependant, avec la croissance importante de l'internet, un nombre important d'entreprises et services publics sont devenus dépendants de bon fonctionnement de ces protocoles. De ce fair, la sécurisation des protocoles de routage revête d'une importance primordiale
  • Thumbnail Image
    Item
    Slotted Contention-Based Energy-Efficient MAC Protocols in Delay-Sensitive Wireless Sensor Networks
    (2012-07-01) Doudou, Messaoud; Djenouri, Djamel; Badache, Nadjib; Bouabdallah, Abdelmadjid
    This paper considers slotted duty-cycled medium access control (MAC) protocols, where sensor nodes periodically and synchronously alternate their operations between active and sleep modes to save energy. Communications can occur only when nodes are in active mode. The synchronous feature makes these protocols more appropriate for delay-sensitive applications than asynchronous protocols. With asynchronous protocols, additional delay is needed for the sender to meet the receiver's active period. This is eliminated with synchronous approaches, where nodes sleep and wake up all together. Moreover, the contention-based feature makes the protocols --considered in this paper-- conceptually distributed and more dynamic compared to TDMA protocols. Duty cycling allows obtaining significant energy saving vs. full duty cycle (sleepless) protocols. However, it may result in significant latency. Forwarding a packet over multiple hops often requires multiple operational cycles (sleep latency), i.e. nodes have to wait for the next cycle to forward data at each hop. Timeliness issues of slotted contention-based MAC protocols are dealt with in this paper, where a comprehensive review and taxonomy is provided. The main contribution is to study and classify the protocols from the delay-efficiency perspective.
  • Thumbnail Image
    Item
    Synchronous Contention-Based MAC Protocols for Delay-Sensitive Wireless Sensor Networks: A Review and Taxonomy
    (2013-04-06) Doudou, Messaoud; Djenouri, Djamel; Badache, Nadjib; Bouabdallah, Abdelmadjid
    Duty cycling allows obtaining significant energy saving compared to full duty cycle (sleepless) random access MAC protocols. However, it may result in significant latency. In slotted duty-cycled medium access control (MAC) protocols, sensor nodes periodically and synchronously alternate their operations between active and sleep modes. The sleep mode allows a sensor node to completely turn off its radio and save energy. In order to transmit data from one node to another, both nodes must be in active mode. The synchronous feature makes the protocols more appropriate for delay-sensitive applications compared to asynchronous protocols. The latter involve additional delay for the sender to meet the receiver's active period, which is eliminated with synchronous approach where nodes sleep and wake up all together. Despite the possible increase of contention by grouping active periods, the delay due to packets retransmissions after collisions is less significant compared to the waiting time of asynchronous protocols. Furthermore, contention-based feature makes the protocol conceptually distributed and more dynamic compared to TDMA-based. This manuscript deals with timeliness issues of slotted contention-based WSN MAC protocols. It provides a comprehensive review and taxonomy of state-of-the-art synchronous MAC protocols. The performance objective considered in the proposed taxonomy is the latency, in the context of energy-limited WSN, where energy is considered as a constraint for the MAC protocol that yields the need of duty-cycling the radio. The main contribution is to study and classify these protocols from the delay efficiency perspective. The protocols are divided into two main categories: static schedule and adaptive schedule. Adaptive schedule are split up into four subclasses: adaptive grouped schedule, adaptive repeated schedule, staggered schedule, and reservation schedule. Several state-of-the-art protocols are described following the proposed classification, with comprehensive discussions and comparisons with respect to their latency.