Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Lalem, Farid"

Filter results by typing the first few letters
Now showing 1 - 7 of 7
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    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)
  • No Thumbnail Available
    Item
    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
  • No Thumbnail Available
    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.
  • No Thumbnail Available
    Item
    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
  • No Thumbnail Available
    Item
    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
  • No Thumbnail Available
    Item
    A revised BROGO algorithm for leader election in wireless sensor and IoT networks
    (IEEE, 2017) Bounceur, Ahcène; Bezoui, Madani; Euler, Reinhardt; Lalem, Farid; Lounis, Massinissa
  • No Thumbnail Available
    Item
    A wait-Before-Starting algorithm for fast, fault-Tolerant and low energy leader election in WSNs dedicated to Smart-Cities and IoT
    (IEEE, 2017) Bounceur, Ahcène; Bezoui, Madani; Euler, Reinhardt; Lalem, Farid

DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify