University Sétif 1 FERHAT ABBAS Faculty of Sciences
Détail de l'auteur
Auteur Wassim Bekhouche |
Documents disponibles écrits par cet auteur
Ajouter le résultat dans votre panier Affiner la rechercheEnergy efficiency routing protocol based on optimization of trajectory mobile sink in hierarchical wireless sensor networks / Wassim Bekhouche
Titre : Energy efficiency routing protocol based on optimization of trajectory mobile sink in hierarchical wireless sensor networks Type de document : texte imprimé Auteurs : Wassim Bekhouche, Auteur ; Ibrahim el Khallil Haddad ; Riad Aouabed, Directeur de thèse Editeur : Setif:UFA Année de publication : 2024 Importance : 1 vol (54 f .) Format : 29 cm Langues : Anglais (eng) Catégories : Thèses & Mémoires:Informatique Mots-clés : Wireless sensor network
Hot-Spot
Mobile sink
Center of Gravity
Rendezvous Points
Ant colony optimization.Index. décimale : 004 - Informatique Résumé :
This research addresses the problem of energy efficiency in hierarchical wireless sensor networks (WSNs) with a mobile base station (sink). It focuses on optimizing the trajectory of the mobile sink to ensure better network coverage. After an introduction to wireless networks and their applications, we present in detail the mobile sinks, their different types of mobility, and the various path optimization techniques used in this type of protocols. Based on these studies, a routing protocol has been proposed that is based on optimized Rendezvous Points, and the use of the ACO (Ant Colony Optimization) algorithm to generate the path followed by the mobile sink. Simulation scenarios have been conducted to confirm the efficiency and validity of our protocol.Note de contenu : Sommaire
List of tables XII General Introduction 1
Chapter 1 Introduction to Wireless Sensors Networks 2
1 Introduction .............................................................................................................. 2
2 Sensor Node .............................................................................................................. 4
2.1 Components of a Sensor Node ..................................................................... 4
2.2 Methods for placing sensor nodes in WSN .................................................. 5
2.2.1 Random placement .......................................................................... 5
2.2.2 Deterministic placement .................................................................. 5
3 WSNs Architecture .................................................................................................... 5
3.1 Protocol stack for wireless sensor networks ............................................... 5
3.1.1 Physical layer..................................................................................... 6
3.1.2 Data Link layer .................................................................................. 6
3.1.3 Network layer ................................................................................... 7
3.1.4 Transport layer .................................................................................. 7
3.1.5 Application layer ............................................................................... 7
3.1.6 Management Planes Across Each Layer ........................................... 8
4 Application of Wireless Sensor Networks.................................................................. 9
4.1 Military Applications ..................................................................................... 9
4.2 Environmental monitoring ............................................................................ 10
4.3 Healthcare and Medical Applications ........................................................... 11
4.4 Home Applications ........................................................................................ 12
5 Network Topology ..................................................................................................... 12
5.1 Flat Architecture ............................................................................................ 12
5.2 Clustering Approach ..................................................................................... 13
6 Cluster Head Selection Algorithms ............................................................................ 14
6.1 Lowest ID Clustering Algorithm ..................................................................... 14
6.2 Highest Connectivity Clustering Algorithm ................................................... 14
6.3 Weighted Clustering Algorithm ..................................................................... 14
7 Intra-cluster routing ................................................................................................... 15
8 Inter-Cluster Routing ................................................................................................. 15
9 Classification Of Routing Protocols ............................................................................ 16
10 Hierarchical Routing Protocols ................................................................................ 17
10.1 LEACH Protocol ............................................................................................ 17
10.2 Advantages of LEACH .................................................................................. 19
10.3 Disadvantages of LEACH .............................................................................. 20
11 Conclusion ................................................................................................................ 21
Chapter 2 Mobile Sink in WSNs 22
1 Introduction ............................................................................................................... 22
2 The Hot-Spot Problem in Static Sink .......................................................................... 22
2.1 Causes of The Hot-Spot Problem .................................................................. 22
2.2 Impacts of The Hot-Spot problem on network performance ....................... 23
3 Mobile Sink vs Static Sink ........................................................................................... 24
4 Mobile Sink ................................................................................................................ 25
4.1 Random Mobility ........................................................................................... 25
4.2 Fixed Mobility ................................................................................................ 26
4.3 Controlled Mobility ....................................................................................... 27
5 Advantages of Mobile Sinks ....................................................................................... 27
6 Challenges of using Mobile sinks ............................................................................... 28
7 Mobile Sink Path Optimization Techniques .................................................................... 28
7.1 Bio-inspired Techniques ...................................................................................... 28
7.1.1 Ant Colony Optimization ......................................................................... 28
7.1.2 Fireefly Algorithm .................................................................................... 29
7.1.3 Genetic Algorithms (GA) ......................................................................... 29
7.1.4 Particle Swarm Optimization (PSO) ....................................................... 29
7.2 Cluster-based Protocol.......................................................................................... 29
7.2.1 Energy-Efficient Mobile Sink Routing Algorithm (EEMSRA) ............. 29
7.2.2 Advantages of EEMSRA ..................................................................... 29
7.2.3 Drawbacks of EEMSRA ...................................................................... 30
7.3 Area-based Protocol ...................................................................................... 30
7.3.1 Line-based Data Dissemination (LBDD) ............................................ 30
7.3.2 Advantages of LBDD .......................................................................... 31
7.3.3 Drawbacks of LBDD ........................................................................... 31
7.4 Tree-Based Protocol ...................................................................................... 31
7.4.1 SPT-DGA Algorithm ........................................................................... 32
7.4.2 Advantages and Drawbacks of SPT-DGA .......................................... 32
8 Conclusion ................................................................................................................... 32
Chapter 3 Rendezvouz Points Optimization Protocol (OPT_RDV) 33
1 Introduction .............................................................................................................. 33
2 Overall description ..................................................................................................... 33
2.1 Assumptions .................................................................................................. 33
2.2 Initialization ................................................................................................... 33
2.3 Routing data to the Sink ....................................................................................... 38
2.3.1 Intra-cluster routing ................................................................................ 39
2.3.2 Inter-cluster routing ................................................................................ 39
2.3.3 Energy Consumption Model ................................................................... 41
3 Simulation And Results ....................................................................................................... 42
3.1 The distance traveled by mobile sink .................................................. 43
3.2 Network latency ................................................................................... 43
3.3 Energy Efficiency .................................................................................. 44
3.4 Successfully delivered packets (Throughput) ...................................... 45
4 Conclusion.................................................................................................................... 47Côte titre : MAI/0839 Energy efficiency routing protocol based on optimization of trajectory mobile sink in hierarchical wireless sensor networks [texte imprimé] / Wassim Bekhouche, Auteur ; Ibrahim el Khallil Haddad ; Riad Aouabed, Directeur de thèse . - [S.l.] : Setif:UFA, 2024 . - 1 vol (54 f .) ; 29 cm.
Langues : Anglais (eng)
Catégories : Thèses & Mémoires:Informatique Mots-clés : Wireless sensor network
Hot-Spot
Mobile sink
Center of Gravity
Rendezvous Points
Ant colony optimization.Index. décimale : 004 - Informatique Résumé :
This research addresses the problem of energy efficiency in hierarchical wireless sensor networks (WSNs) with a mobile base station (sink). It focuses on optimizing the trajectory of the mobile sink to ensure better network coverage. After an introduction to wireless networks and their applications, we present in detail the mobile sinks, their different types of mobility, and the various path optimization techniques used in this type of protocols. Based on these studies, a routing protocol has been proposed that is based on optimized Rendezvous Points, and the use of the ACO (Ant Colony Optimization) algorithm to generate the path followed by the mobile sink. Simulation scenarios have been conducted to confirm the efficiency and validity of our protocol.Note de contenu : Sommaire
List of tables XII General Introduction 1
Chapter 1 Introduction to Wireless Sensors Networks 2
1 Introduction .............................................................................................................. 2
2 Sensor Node .............................................................................................................. 4
2.1 Components of a Sensor Node ..................................................................... 4
2.2 Methods for placing sensor nodes in WSN .................................................. 5
2.2.1 Random placement .......................................................................... 5
2.2.2 Deterministic placement .................................................................. 5
3 WSNs Architecture .................................................................................................... 5
3.1 Protocol stack for wireless sensor networks ............................................... 5
3.1.1 Physical layer..................................................................................... 6
3.1.2 Data Link layer .................................................................................. 6
3.1.3 Network layer ................................................................................... 7
3.1.4 Transport layer .................................................................................. 7
3.1.5 Application layer ............................................................................... 7
3.1.6 Management Planes Across Each Layer ........................................... 8
4 Application of Wireless Sensor Networks.................................................................. 9
4.1 Military Applications ..................................................................................... 9
4.2 Environmental monitoring ............................................................................ 10
4.3 Healthcare and Medical Applications ........................................................... 11
4.4 Home Applications ........................................................................................ 12
5 Network Topology ..................................................................................................... 12
5.1 Flat Architecture ............................................................................................ 12
5.2 Clustering Approach ..................................................................................... 13
6 Cluster Head Selection Algorithms ............................................................................ 14
6.1 Lowest ID Clustering Algorithm ..................................................................... 14
6.2 Highest Connectivity Clustering Algorithm ................................................... 14
6.3 Weighted Clustering Algorithm ..................................................................... 14
7 Intra-cluster routing ................................................................................................... 15
8 Inter-Cluster Routing ................................................................................................. 15
9 Classification Of Routing Protocols ............................................................................ 16
10 Hierarchical Routing Protocols ................................................................................ 17
10.1 LEACH Protocol ............................................................................................ 17
10.2 Advantages of LEACH .................................................................................. 19
10.3 Disadvantages of LEACH .............................................................................. 20
11 Conclusion ................................................................................................................ 21
Chapter 2 Mobile Sink in WSNs 22
1 Introduction ............................................................................................................... 22
2 The Hot-Spot Problem in Static Sink .......................................................................... 22
2.1 Causes of The Hot-Spot Problem .................................................................. 22
2.2 Impacts of The Hot-Spot problem on network performance ....................... 23
3 Mobile Sink vs Static Sink ........................................................................................... 24
4 Mobile Sink ................................................................................................................ 25
4.1 Random Mobility ........................................................................................... 25
4.2 Fixed Mobility ................................................................................................ 26
4.3 Controlled Mobility ....................................................................................... 27
5 Advantages of Mobile Sinks ....................................................................................... 27
6 Challenges of using Mobile sinks ............................................................................... 28
7 Mobile Sink Path Optimization Techniques .................................................................... 28
7.1 Bio-inspired Techniques ...................................................................................... 28
7.1.1 Ant Colony Optimization ......................................................................... 28
7.1.2 Fireefly Algorithm .................................................................................... 29
7.1.3 Genetic Algorithms (GA) ......................................................................... 29
7.1.4 Particle Swarm Optimization (PSO) ....................................................... 29
7.2 Cluster-based Protocol.......................................................................................... 29
7.2.1 Energy-Efficient Mobile Sink Routing Algorithm (EEMSRA) ............. 29
7.2.2 Advantages of EEMSRA ..................................................................... 29
7.2.3 Drawbacks of EEMSRA ...................................................................... 30
7.3 Area-based Protocol ...................................................................................... 30
7.3.1 Line-based Data Dissemination (LBDD) ............................................ 30
7.3.2 Advantages of LBDD .......................................................................... 31
7.3.3 Drawbacks of LBDD ........................................................................... 31
7.4 Tree-Based Protocol ...................................................................................... 31
7.4.1 SPT-DGA Algorithm ........................................................................... 32
7.4.2 Advantages and Drawbacks of SPT-DGA .......................................... 32
8 Conclusion ................................................................................................................... 32
Chapter 3 Rendezvouz Points Optimization Protocol (OPT_RDV) 33
1 Introduction .............................................................................................................. 33
2 Overall description ..................................................................................................... 33
2.1 Assumptions .................................................................................................. 33
2.2 Initialization ................................................................................................... 33
2.3 Routing data to the Sink ....................................................................................... 38
2.3.1 Intra-cluster routing ................................................................................ 39
2.3.2 Inter-cluster routing ................................................................................ 39
2.3.3 Energy Consumption Model ................................................................... 41
3 Simulation And Results ....................................................................................................... 42
3.1 The distance traveled by mobile sink .................................................. 43
3.2 Network latency ................................................................................... 43
3.3 Energy Efficiency .................................................................................. 44
3.4 Successfully delivered packets (Throughput) ...................................... 45
4 Conclusion.................................................................................................................... 47Côte titre : MAI/0839 Exemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité MAI/0839 MAI/0839 Mémoire Bibliothéque des sciences Anglais Disponible
Disponible
