|
Titre :
|
Cross-layer routing protocols in wireless sensor networks
|
|
Auteurs :
|
Riad Aouabed, Auteur ;
Fouzi Semchedine, Directeur de thèse
|
|
Type de document :
|
document électronique
|
|
Editeur :
|
Sétif : Universite ferhat abbas faculté des sciences département d’informatique, 2023
|
|
ISBN/ISSN/EAN :
|
E-TH/2112
|
|
Format :
|
1vol.(109 f.) / ill.en coul
|
|
Langues:
|
Anglais
|
|
Catégories :
|
Thèses (en français - en anglais) > Document électronique
|
|
Mots-clés:
|
Wireless sensor network
;
Clustering Multi-Hop Cross-Layer
|
|
Résumé :
|
Wireless sensor networks(WSNs)are considered to be one of the main technologies that are heavily resource-constrained,in constant demand for energy-efficient and effective routing techniques . The so-called hierarchical or equivalently cluster-based routing approaches have shown substantial improvements of the WSNs performance as compared to traditional duty-cycled Medium Access Control(MAC)protocols due to the aggregation process.In addition,the use of the cross-layer approach,based on the cooperation of several layers has proven to be effective in routing data with drastic reduction in energy consumption within WSNs.However,the operation of routing data from the Cluster Heads(CHs)to the Sink remains one of the major sources of wasted node energy.As a remedy,MAC protocols using a wake-up radio(WuR)have been used to address this issue. Based on the idea of letting the CHs and other nodes in the network on a sleep mode for the longest possible period, this thesis proposes the so-called Clustering Multi-Hop Cross-Layer Protocol(CMH-CLP).The various simulation results of the proposed protocol on the basis of some standard network performance metrics show that the proposed protocol improves the WSN performance as compared with some well-known recent protocols.
|
|
Côte titre :
|
E-TH/2112
|
|
En ligne :
|
http://dspace.univ-setif.dz:8888/jspui/bitstream/123456789/4081/1/thesis%20_Aouabed_Doctorat_2023.pdf
|
Exemplaires (1)
|
| E-TH/2112 | Thèse | Bibliothèque centrale | Disponible |
Accueil
