Publications Scientifiques
Permanent URI for this communityhttps://dspace.univ-boumerdes.dz/handle/123456789/10
Browse
19 results
Search Results
Item A game theory approach to solve linear bi-objective programming problems(2017) Bezoui, Madani; Bounceur, Ahcène; Euler, Reinhardt; Moulaï, Mustapha; Djeddi, YoucefItem CupCarbon-Lab: An IoT emulator(IEEE, 2018) Bounceur, Ahcène; Olivier, Marc; Lounis, Massinissa; Soler, Julien; Combeau, Pierre; Lagadec, Loïc; Euler, Reinhardt; Bezoui, MadaniIn 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 conditionsItem A Dominating Tree Based Leader Election Algorithm for Smart Cities IoT Infrastructure(Springer link, 2020) Kadjouh, Nabil; Bounceur, Ahcène; Bezoui, Madani; Khanouche, Mohamed EssaidIn 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 presentedItem 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, MohammadItem An iterative method for solving a bi-objective constrained portfolio optimization problem(Springer, 2018) Bezoui, Madani; Moulaï, Mustapha; Bounceur, Ahcène; Euler, ReinhardtItem Exact method for solving bi-objective cardinality constrained portfolio selection problem(2016) Bezoui, Madani; Moulai, Mustapha; Bounceur, AhcèneItem An empirical study to find the optimal number of security in portfolio selection problem(2016) Bezoui, Madani; Moulai, Mustapha; Bounceur, AhcèneItem Finding the boundary Nodes of a Wireless sensor network without conditions on the starting node(2016) Bounceur, Ahcène; Bezoui, Madani; Euler, Reinhardt; Sevaux, MarcItem Finding the Boundary Nodes of a Wireless Sensor Network Without Conditions on the Starting Node(2016) Bounceur, Ahcène; Bezoui, Madani; Euler, Reinhardt; Sevaux, MarcItem Distributed algorithm for finding boundaries of connected components of a Euclidean graph(2017) Bezoui, Madani; Bounceur, Ahcène; Euler, Reinhardt; Moulai, Mustapha