Browsing by Author "Bounceur, Ahcène"

Now showing 1 - 20 of 28

Boundaries and Hulls of Euclidean Graphs: From Theory to Practice
(Chapman and Hall/CRC/ Taylor & Francis, 2018) Bounceur, Ahcène; Bezoui, Madani; Euler, Reinhardt
Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs. It also includes some implementations, determining and comparing their complexities. Since the implementation is application-dependent, either centralized or distributed, some basic concepts of the centralized and distributed versions are reviewed. Theoreticians will find a presentation of different algorithms together with an evaluation of their complexity and their utilities, as well as their field of application. Practitioners will find some practical and real-world situations in which the presented algorithms can be used
BROGO : a new low energy consumption algorithm for leader election in WSNs
(2017) Bounceur, Ahcène; Bezoui, Madani; Euler, Reinhardt; Kadjouh, Nabil; Lalem, Farid
The Leader Election in Wireless Sensor Networks depends on the nature of the application domain, the use case and the energy consumption. In the case of real time applications, the choice will be based on the speed of the election, and in the case where time is not important, the choice will be based on the energy consumption. The classical algorithm allowing to elect such a node is called the Minimum Finding Algorithm. In this algorithm, each node sends its value in a broadcast mode each time a better value is received. This process is very energy consuming and not reliable since it is subject to an important number of collisions and lost messages. In this paper, we propose a new algorithm called BROGO (Branch Optima to Global Optimum) where after finding a spanning tree of a WSN, each leaf will route a message through its branch to the root in order to find the leader in that branch. The root will then elect the global leader from the received branch leaders. This process is more reliable since there is a small number of broadcast messages and a reduced number of nodes that send broadcast messages at the same time. The obtained results show that the proposed algorithm reduces the energy consumption with rates that can exceed 95% when compared with the classical Minimum Finding Algorithm. Its message and time complexity is equal to O(n)
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
D-LPCN : a distributed least polar-angle connected node algorithm for finding the boundary of a wireless sensor network
(Elsevier, 2017) Saoudi, Massinissa; Lalem, Farid; Bounceur, Ahcène; Euler, Reinhardt; Kechadi, M-Tahar; Laouid, Abdelkader; Bezoui, Madani; Sevaux, Marc
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
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
Distributed algorithm for finding boundaries of connected components of a Euclidean graph
(2017) Bezoui, Madani; Bounceur, Ahcène; Euler, Reinhardt; Moulai, Mustapha
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.
A Dominating Tree Based Leader Election Algorithm for Smart Cities IoT Infrastructure
(Springer link, 2020) Kadjouh, Nabil; Bounceur, Ahcène; Bezoui, Madani; Khanouche, Mohamed Essaid
In wireless sensor and IoT networks dedicated to smart-cities, a leader node performs critical tasks such as generating encryption/decryption keys. In this paper, the leader is the node situated at the extreme left of the network. It is the node which starts the algorithm of searching the boundary nodes. These nodes will be used to monitor any sensitive, dangerous or inaccessible site. For this type of application, the used algorithm must be robust and fault-tolerant because it is difficult or even impossible to intervene in the presence of node failures. If this node is the leader, such a situation can be catastrophic. In this article, we present a new algorithm called DoTRo, which is based on a tree routing protocol. It starts with local leaders which will launch the flooding process to determine a spanning tree. During this process, their values will be forwarded. If two spanning trees meet, the tree that routes the best value continues its process while the other tree stops. The remaining tree root will be the leader. This algorithm is low energy consuming with reduction rates that can exceed 85% with respect to the classical minium finding algorithm. It is efficient and fault-tolerant since it works even in the presence of node failures and communication disconnectivity. Additionally, the energy consumption is well balanced between nodes. Finally, the complexity and the proof of convergence of the proposed algorithm is presented
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
An empirical study to find the optimal number of security in portfolio selection problem
(2016) Bezoui, Madani; Moulai, Mustapha; Bounceur, Ahcène
Exact method for solving bi-objective cardinality constrained portfolio selection problem
(2016) Bezoui, Madani; Moulai, Mustapha; Bounceur, Ahcène
Finding the boundary Nodes of a Wireless sensor network without conditions on the starting node
(2016) Bounceur, Ahcène; Bezoui, Madani; Euler, Reinhardt; Sevaux, Marc
Finding the Boundary Nodes of a Wireless Sensor Network Without Conditions on the Starting Node
(2016) Bounceur, Ahcène; Bezoui, Madani; Euler, Reinhardt; Sevaux, Marc
Finding the polygon hull of a network without conditions on the starting vertex
(Wiley, 2019) Bounceur, Ahcène; Bezoui, Madani; Hammoudeh, Mohammad; Lagadec, Loïc
Many real‐life problems arising within the fields of wireless communication, image processing, combinatorial optimization, etc, can be modeled by means of Euclidean graphs. In the case of wireless sensor networks, the overall topology of the graph is not known because sensor nodes are often randomly deployed. One of the significant problems in this field is the search for boundary nodes. This problem is important in cases such as the surveillance of an area of interest, image contour reconstruction, graph matching problems, routing or clustering data, etc. In the literature, many algorithms are proposed to solve this problem, a recent one of which is the least polar‐angle connected node (LPCN) algorithm and its distributed version D‐LPCN, which are both based on the concept of a polar angle visit. An inconvenience of these algorithms is the determination of the starting vertex. In effect, the point with the minimum x‐coordinate is a possible starting point, but it has to be known at the beginning, which considerably increases the algorithms' complexity. In this article, we propose a new method called RRLPCN (reset and restart with least polar‐angle connected node), which is based on the LPCN algorithm to find the boundary vertices of a Euclidean graph. The main idea is to start the LPCN algorithm from an arbitrary vertex, and whenever it finds a vertex with an x‐coordinate smaller than that of the starting one, LPCN is reset and restarted from this new vertex. The algorithm stops as soon as it visits the same edge for the second time in the same direction. In addition to finding the boundary vertices, RRLPCN also finds the vertex with minimum x‐coordinate, which is the last starting point of our algorithm. The distributed version of the proposed algorithm, called D‐RRLPCN, is then applied to boundary node detection in the wireless sensor network. It has been implemented using real sensor nodes (Arduino/XBee and TelosB). The simulation results have shown our algorithm to be very effective in comparison to other algorithms
A game theory approach to solve linear bi-objective programming problems
(2017) Bezoui, Madani; Bounceur, Ahcène; Euler, Reinhardt; Moulaï, Mustapha; Djeddi, Youcef
A game theory approach to solve linear bi-objective programming problems : application to data collection in WSNs
(2017) Bezoui, Madani; Bounceur, Ahcène; Euler, Reinhardt; Moulai, Mustapha
An iterative method for solving a bi-objective constrained portfolio optimization problem
(Springer, 2018) Bezoui, Madani; Moulaï, Mustapha; Bounceur, Ahcène; Euler, Reinhardt
LOGO : a new distributed leader election algorithm in WSNs with low energy consumption
(2017) Bounceur, Ahcène; Bezoui, Madani; Noreen, Umber; Euler, Reinhardt; Lalem, Farid; Hammoudeh, Mohammad; Jabbar, Sohail
LPCN : least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph
(Elsevier, 2017) Lalem, Farid; Bounceur, Ahcène; Bezoui, Madani; Saoudi, Massinissa; Euler, Reinhardt; Kechadi, Tahar; Sevaux, Marc