Communications Internationales

Permanent URI for this collectionhttps://dspace.univ-boumerdes.dz/handle/123456789/11

Browse

Search Results

Now showing 1 - 10 of 23
  • Item
    A distributed security protocol designed for the context of Internet of Things
    (Association for Computing Machinery, 2018) Laouid, Abdelkader; Muath, AlShaikh; Lalem, Farid; Bounceur, Ahcène; Euler, Reinhardt; Bezoui, Madani; Aissaoua, Habib; Tari, Abdelkamel
    In the field of Internet of Things (IoT), many encryption protocols for distributed wireless communication technology have been proposed for use in various applications such as monitoring, healthcare, product management, workplace, home support and surveillance [1]. An IoT system can be looked at as a highly dynamic distributed and networked system composed of a large number of smart devices. In fact, such connected devices suffer from the limitation of resources in terms of computing, energy, bandwidth and storage. Hence, IoT application scenarios require methods to adapt to highly diverse contexts with different available resources and possibly dynamic environments. In this paper, we address these issues by proposing an efficient technique for data protection in the context of IoT. A distributed network architecture is used, where each node is in charge to deliver and/or forward data. The aim is to use efficient operations to protect the exchanged data. The proposed technique ensures the exchanged data to be effectively and securely controlled with a low overhead compared to the classical approaches. The proposed protocol shows its efficiency in terms of overhead, speed, energy and security measurements.
  • Item
    A game theory approach to solve linear bi-objective programming problems
    (2017) Bezoui, Madani; Bounceur, Ahcène; Euler, Reinhardt; Moulaï, Mustapha; Djeddi, Youcef
  • Item
    CupCarbon-Lab: An IoT emulator
    (IEEE, 2018) Bounceur, Ahcène; Olivier, Marc; Lounis, Massinissa; Soler, Julien; Combeau, Pierre; Lagadec, Loïc; Euler, Reinhardt; Bezoui, Madani
    In the new generation of networks, not only computers are connected but also objects like cars, streets, buildings, or just, everything. In general, these things communicate by means of internet using gateways. Simulating these systems can help to validate specific algorithms and concepts. However, it cannot give any accurate information about reality when some problems arise such as delays, disconnectivity, attacks, insecurity, and especially in the case of large networks. Also, the real implementation of such networks is very complex, time consuming and can be impossible when the nodes are situated in different cities or countries. In this demo we propose a new platform called CupCarbon-Lab based on the existing simulator CupCarbon, where the codes used in simulation can be directly injected in real connected embedded cards like Raspberry Pi cards. This platform can automatically generate from the software a real IoT network even it is already deployed, which can be reconfigured without the need to go through each node. It also helps to test the feasibility and the scalability of an algorithm in real conditions
  • Item
    A new hybrid method to maximize the lifetime of coverage in IoT networks
    (2018) Bezoui, Madani; Bounceur, Ahcène; Euler, Reinhardt; Moulai, Mustapha
    In the field of Internet of things and wireless sensor networks, in particular, coverage is a very relevant issue. In this work, we consider the problem of maximizing the lifetime of a wireless sensor network that is required to cover some targets. The idea is to maximize the number of subfamilies that can efficiently cover all the targets. After that, we activate each subfamily alternately to extend the lifetime of the initial network. We then formulate this question as a binary bi-objective programming problem. Finally, we propose a hybrid method using a genetic algorithm and the Monte Carlo procedure based on the work of Bounceur et al. 2012
  • Item
    Detecting Gaps and Voids in WSNs and IoT Networks: the Angle-based Method
    (2018) Bezoui, Madani; Bounceur, Ahcène; Lagadec, Loïc; Euler, Reinhardt
    A random deployment of Wireless Sensor Networks (WSNs) is often the basic structure used in the context of fire forest detection, military applications or any situation where the zone-of-interest is not accessible by humans. The main problematic in this kind of deployment is the formation of gaps or voids, which represent a zone which is not covered in the network. This reduces significantly its Quality of Service and can lead to serious problems, like a non-detected starting fire, the presence of unexpected persons or attacks, etc. Therefore, detecting zones that are not covered by the WSN is of great importance. In this paper, we present a new method allowing to detect gaps and voids in WSNs or in IoT networks by using some characteristics of the angles of the polygon formed by the boundary as determined by the D-LPCN algorithm. These angles can be interior or exterior. Characterizing the angles of the polygon formed by these boundary nodes allows to specify whether this boundary is a gap or a void, in case where the obtained polygon is interior. Since D-LPCN is fault-tolerant, the simulation results show that it is possible to use it for the detection of faulty nodes and intrusion
  • Item
    Detecting Gaps and Voids in WSNs and IoT Networks: the Minimum x-Coordinate based Method
    (2019) Bounceur, Ahcène; Bezoui, Madani; Lagadec, Loïc; Euler, Reinhardt
    When we deal with the deployment structure of Wireless Sensor Networks (WSNs) used in applications where the zone-of-interest is not accessible by humans, like fire forest detection, military applications, etc., random deployment is often the main or even the only practical solution that can be chosen. One of the main issues in this deployment is that it can lead to a formation of gaps or voids, which represents non-covered zones in the network. This can be very problematic, since it is not possible to detect some serious and dangerous problems, like a starting fire, the presence of non-desired persons or cyber-security attacks, etc. Therefore, detecting that non covered zones is of high importance. In this paper, we present a new method that allows to detect gaps and voids in WSNs and IoT networks using some characteristics related to the value of the angle formed by the node of the gap having the minimum x-coordinate, after executing the D-LPCN algorithm
  • Item
    A New Leader Election Algorithm based on the WBS Algorithm Dedicated to Smart-cities
    (2019) Kadjouh, Nabil; Bounceur, Ahcène; Abdelkamel, A Kamel Tari; Lagadec, Loïc; Reinhardt, Euler; Bezoui, Madani
    One of the interesting techniques for leader election is used in the WBS (Wait Before Starting) algorithm, in which each node in the network will wait for a time corresponding to its value before starting to send the first message to neighbours. This means that the node with the smallest value becomes the leader and it also starts first. This approach is impracticable in the case of real values (case of GPS-coordinates). Also, if the values are very large, the waiting time becomes too long. In this paper, we propose a fast, fault-tolerant and low energy leader election algorithm dedicated to smart-cities, which is based on the technique of waiting before starting, with minimum complexity and in which every node sends one and only one message. Here, the leader is the node with the smallest x-coordinate and the total of sent and received messages is used to represent the global consumption in the network. We give a detailed description of the algorithm, prove its accuracy, discuss its complexity in terms of exchanged messages and evaluate its performance using the CupCarbon simulator. We show that our algorithm is well balanced in terms of energy consumption, it is efficient and adapts well to the increase of the nodes number in the network
  • Item
    DoTRo : a new dominating tree routing algorithm for efficient and Fault-Tolerant leader election in WSNs and IoT networks
    (IEEE, 2018) Bounceur, Ahcène; Bezoui, Madani; Lagadec, Loïc; Euler, Reinhardt; Laouid, Abdelkader; Hammoudeh, Mohammad
  • Item
    An exact method for multiple objective mixed-integer linear programming problem
    (2011) Amrouche, Salima; Bezoui, Madani; Moulai, Mustapha