Skip to Main content Skip to Navigation

Gestion de la topologie dans les réseaux de capteurs sans fil

Abstract : Wireless sensor networking is ingratiating itself into almost every area of human endeavors. Its drivers include its usages, improvements in microelectronics and manufacturing techniques. The network is made up of multiple tiny sensor nodes deployed in the area to be sensed, with nodes having processing, communicating, and sensing capabilities that enable them to perform their function collaboratively. Nodes sense events and transmit their data to the sink directly or through intermediate nodes acting as relay.Despite all the tremendous advances that have been made on this technology over the past few years, energy has not kept pace. This is based mostly on the fact that battery is its main source of energy. Furthermore, some applications of the network may preclude batteries from either being recharged or changed after deployment.A renowned solution to energy efficiency is duty cycling. This is the periodic or aperiodic placing of a node in an active and an inactive state. This introduces network performance issues of availability, latency, and packet delivery ratio, all linked to the fact that once a node is inactive or off, it is unavailable to communicate. It is therefore important to look for means of still applying duty cycling yet not losing out in availability, latency, and packet delivery ratio.In this dissertation we employ duty cycle on topology management to extend the network lifetime. We propose five algorithms to build various topologies that we divide into two classes. The first class enables nodes to arrange themselves into repetitive and interleaving sets. That is, nodes in the same set repeat themselves on the ground such that a set spans the entire area to be sensed. The second class of algorithms arranges nodes in continuous successive sets with members of a set covering a transmission range. We demonstrate the set formation experimentally.Building on the continuous set formation we propose two algorithms that build disjoint virtual backbone networks, with the disjointedness used for activity scheduling. We then measure the performances of the algorithms notably the approximation ratio and find it quite low (in the order of 3.5) compared to what is obtained in the literature.Finally, we propose a sleep and relay protocol that works on these topologies. Nodes sleep in sets and the activeness is relayed between sets. We evaluate the performance of this protocol and confirm that it actually leads to increase energy savings while not deteriorating other network performance metrics, like latency and packet delivery ratio.
Document type :
Complete list of metadatas
Contributor : Abes Star :  Contact
Submitted on : Tuesday, January 19, 2021 - 12:52:24 PM
Last modification on : Thursday, January 21, 2021 - 8:36:07 AM


Version validated by the jury (STAR)


  • HAL Id : tel-03114995, version 1


Simon Obenofunde. Gestion de la topologie dans les réseaux de capteurs sans fil. Autre [cs.OH]. Université Bourgogne Franche-Comté, 2020. Français. ⟨NNT : 2020UBFCK025⟩. ⟨tel-03114995⟩



Record views


Files downloads