Wireless Sensor Networks (WSNs) are highly integrated technologies applying sensors, microcontrollers and wireless networks technologies. Wireless sensor networks (WSNs) is a promising technology that has a large spectrum of applications such as, battlefield reconnaissance, border protection and security surveillance, preparing forecasts, severe environment detection, volcano monitoring, disaster management. WSNs operate unattended in harsh environments with limited energy supplies that can’t be practically changed or recharged. Thus energy efficiency is a critical design issue which must be addressed.
Clustering plays an effective role in judicious use of dwindling energy resources of the deployed sensor nodes. Nodes are grouped into clusters and a specific designated node, called the cluster head is responsible for collecting data from the nodes in its cluster, aggregating them and sending to the BS, where data can be retrieved later. Besides energy efficiency, clustering has many other advantages like reduced routing overhead, conservation of communication bandwidth, stabilized network topology, network stability etc
In this research, we study the energy efficiency of two clustering algorithms, S-Web and LEACH and compare them for network lifetime. Simulation results show that the S-Web clustering mechanism achieves a noticeable improvement in the network lifetime.
Inhaltsverzeichnis
- Abstract
- Acknowledgement
- Glossary
- CHAPTER 1
- INTRODUCTION
- CHAPTER 2
- LITERATURE SURVEY
- 2.1 Clustering ad hoc networks
- 2.2 Advantages of Clustering
- 2.3 Challenges for Clustering Algorithms
- Limited Energy:
- Constrained resources:
- Secure Communication:
- Cluster formation and CH selection:
- Load balancing:
- Minimal cluster count:
- Synchronization:
- Data Aggregation:
- Fault-tolerance:
- Quality of Service (QoS):
- 2.4 Clustering Schemes for Sensor Networks
- 2.4.1 Optimizing Cluster Organization
- 2.4.2 Averaging Power Consumption
- 2.4.3 Scheduling Active and Non-Active Nodes
- 2.5 Clustering Algorithms
- 2.5.1 Low-Energy Adaptive Clustering Hierarchy (LEACH):
- 2.5.2 Sensor Web or S-WEB:
- 2.5.3 Energy Efficient Clustering Scheme (EECS):
- 2.5.4 Hybrid Energy Efficient Distributed Clustering (HEED):
- 2.5.5 Energy-efficient unequal clustering (EEUC):
- 2.5.6 Power-efficient and adaptive clustering hierarchy (PEACH):
- CHAPTER 3
- Problem Definition and Implementation
- 3.1 Problem Definition
- 3.2 Implementation
- CHAPTER 4
- Results
- 4.1 First scenario (Normal Node to Normal Node)
- 4.2 Second scenario (Normal Node to Cluster Head)
- 4.3 Third scenario (Cluster Head to Normal Node)
- 4.4 Fourth scenario (Cluster Head to Cluster Head)
- 4.5 Fifth scenario (Random)
- CHAPTER 5
- Conclusion and Future Work
- References
Zielsetzung und Themenschwerpunkte
This thesis aims to evaluate the energy efficiency of two clustering algorithms, S-Web and LEACH, in the context of Wireless Sensor Networks (WSNs). The study focuses on comparing the network lifetime achieved by these algorithms, ultimately aiming to identify the most energy-efficient approach for WSNs.
- Energy efficiency in WSNs
- Clustering algorithms for WSNs
- Performance evaluation of S-Web and LEACH algorithms
- Network lifetime as a performance metric
- Comparison of energy consumption patterns
Zusammenfassung der Kapitel
Chapter 1 provides an introduction to Wireless Sensor Networks (WSNs) and highlights the importance of energy efficiency in these networks. It establishes the context for the research by discussing the challenges and opportunities associated with WSNs, particularly in relation to energy constraints. The chapter also introduces the concept of clustering as a key strategy for enhancing energy efficiency in WSNs.
Chapter 2 delves into the existing literature on clustering algorithms for WSNs. It explores various clustering schemes and their advantages, including the optimization of cluster organization, averaging power consumption, and scheduling active and non-active nodes. The chapter also examines the challenges associated with clustering algorithms, such as limited energy, constrained resources, secure communication, cluster formation, load balancing, minimal cluster count, synchronization, data aggregation, fault-tolerance, and quality of service (QoS). The chapter concludes by providing a detailed overview of several prominent clustering algorithms, including LEACH, S-WEB, EECS, HEED, EEUC, and PEACH.
Chapter 3 focuses on the problem definition and implementation of the research. It outlines the specific objectives of the study, which involve evaluating the energy efficiency of S-Web and LEACH algorithms. The chapter also describes the implementation methodology, including the simulation environment and the metrics used to assess performance.
Chapter 4 presents the results of the simulation experiments conducted to compare the energy efficiency of S-Web and LEACH algorithms. The chapter analyzes the performance of the algorithms under different scenarios, including normal node to normal node communication, normal node to cluster head communication, cluster head to normal node communication, cluster head to cluster head communication, and random communication. The chapter provides a detailed analysis of the energy consumption patterns and network lifetime achieved by each algorithm.
Schlüsselwörter
The key terms and focus themes of the text include clustering, energy efficiency, SWEB, Wireless Sensor Networks, LEACH, and network lifetime. The research investigates the energy efficiency of two clustering algorithms, S-Web and LEACH, in the context of WSNs, with a particular emphasis on comparing their impact on network lifetime. The study aims to contribute to the understanding of energy-efficient clustering strategies for WSNs.
- Arbeit zitieren
- Sahil Sholla (Autor:in), 2013, Performance Evaluation of Clustering Algorithms in Wireless Sensor Networks (WSN). Energy Efficiency of S-Web and LEACH, München, GRIN Verlag, https://www.grin.com/document/293888
-
Laden Sie Ihre eigenen Arbeiten hoch! Geld verdienen und iPhone X gewinnen. -
Laden Sie Ihre eigenen Arbeiten hoch! Geld verdienen und iPhone X gewinnen. -
Laden Sie Ihre eigenen Arbeiten hoch! Geld verdienen und iPhone X gewinnen. -
Laden Sie Ihre eigenen Arbeiten hoch! Geld verdienen und iPhone X gewinnen. -
Laden Sie Ihre eigenen Arbeiten hoch! Geld verdienen und iPhone X gewinnen. -
Laden Sie Ihre eigenen Arbeiten hoch! Geld verdienen und iPhone X gewinnen. -
Laden Sie Ihre eigenen Arbeiten hoch! Geld verdienen und iPhone X gewinnen. -
Laden Sie Ihre eigenen Arbeiten hoch! Geld verdienen und iPhone X gewinnen.