This document describes the LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol for wireless microsensor networks. LEACH utilizes randomized rotation of cluster heads to distribute the energy load evenly among the sensors and achieves longer system lifetime. It uses localized coordination and control for data transfers to reduce global network communication. LEACH allows adaptive clustering and uses data aggregation in the clusters to reduce global data transmission and improve system scalability and energy efficiency. Simulation results show that LEACH distributes energy load evenly and outperforms other routing protocols by achieving up to a factor of 4 times increase in system lifetime.
Low-energy adaptive clustering hierarchy ("LEACH") is a TDMA-based MAC protocol which is integrated with clustering and a simple routing protocol in wireless sensor networks (WSNs)
TIME SYNCHRONIZATION IN WIRELESS SENSOR NETWORKS: A SURVEYijujournal
Time synchronization is a critical piece of infrastructure for any distributed system. Wireless sensor networks have emerged as an important and promising research area in the recent years. Time synchronization is important for many sensor network applications that require very precise mapping of gathered sensor data with the time of the events, for example, in tracking and vehicular surveillance. It also plays an important role in energy conservation in MAC layer protocols. The paper studies different existing methods, protocols, significant time parameters (clock drift, clock speed, synchronization errors, and topologies) to achieve accurate synchronization in a sensor network. The studied Synchronization protocols include conventional time sync protocols (RBS, Timing-sync Protocol for Sensor Networks -TPSN, FTSP), and other application specific
approaches such as all node-based approach, a diffusion-based method and group sync approaches aiming at providing network-wide time. The goal for writing this paper is to study most common existing time synchronization approaches and stress the need of a new class of secure-time synchronization protocol that is scalable, topology independent, fast convergent, energy efficient, less latent and less application dependent in a heterogeneous hostile environment. Our survey provides a valuable framework by which protocol designers can compare new and
existing synchronization protocols from various metric discussed in the paper. So, we are hopeful that this paper will serve a complete one-stop investigation to study the characteristics of existing time synchronization protocols and its implementation mechanism in a Sensor network environment.
How to put these nodes together to form a meaningful network.
How a network should function at high-level application scenarios .
On the basis of these scenarios and optimization goals, the design of networking protocols in wireless sensor networks are derived
A proper service interface is required and integration of WSNs into larger network contexts.
Low-energy adaptive clustering hierarchy ("LEACH") is a TDMA-based MAC protocol which is integrated with clustering and a simple routing protocol in wireless sensor networks (WSNs)
TIME SYNCHRONIZATION IN WIRELESS SENSOR NETWORKS: A SURVEYijujournal
Time synchronization is a critical piece of infrastructure for any distributed system. Wireless sensor networks have emerged as an important and promising research area in the recent years. Time synchronization is important for many sensor network applications that require very precise mapping of gathered sensor data with the time of the events, for example, in tracking and vehicular surveillance. It also plays an important role in energy conservation in MAC layer protocols. The paper studies different existing methods, protocols, significant time parameters (clock drift, clock speed, synchronization errors, and topologies) to achieve accurate synchronization in a sensor network. The studied Synchronization protocols include conventional time sync protocols (RBS, Timing-sync Protocol for Sensor Networks -TPSN, FTSP), and other application specific
approaches such as all node-based approach, a diffusion-based method and group sync approaches aiming at providing network-wide time. The goal for writing this paper is to study most common existing time synchronization approaches and stress the need of a new class of secure-time synchronization protocol that is scalable, topology independent, fast convergent, energy efficient, less latent and less application dependent in a heterogeneous hostile environment. Our survey provides a valuable framework by which protocol designers can compare new and
existing synchronization protocols from various metric discussed in the paper. So, we are hopeful that this paper will serve a complete one-stop investigation to study the characteristics of existing time synchronization protocols and its implementation mechanism in a Sensor network environment.
How to put these nodes together to form a meaningful network.
How a network should function at high-level application scenarios .
On the basis of these scenarios and optimization goals, the design of networking protocols in wireless sensor networks are derived
A proper service interface is required and integration of WSNs into larger network contexts.
Design Issues and Challenges in Wireless Sensor NetworksKhushbooGupta145
Wireless Sensor Networks (WSNs) are composed self-organized wireless ad hoc networks which comprise of a large number of resource constrained sensor nodes. The major areas of research in WSN is going on hardware, and operating system of WSN, deployment, architecture, localization, synchronization, programming models, data aggregation and dissemination, database querying, architecture, middleware, quality of service and security. This paper study highlights ongoing research activities and issues that affect the design and performance of Wireless Sensor Network.
Fisheye State Routing (FSR) - Protocol OverviewYoav Francis
Overview of the Fisheye State Routing (FSR) for cellular networks, IDC 2012
By Yoav Francis and Nir Solomon
(Part of a performance comparison of various routing algorithms in cellular networks)
Distributed Operation
Synchronization
Hidden Terminals
Exposed terminals
Throughput
Access delay
Fairness
Real-time Traffic support
Resource reservation
Ability to measure resource availability
Capability for power control
Adaptive rate control
Use of directional antennas
Minimize energy per packet (or per bit)
Maximize network lifetime
Routing considering available battery energy
Maximum Total Available Battery Capacity
Minimum Battery Cost Routing (MBCR)
Min– Max Battery Cost Routing (MMBCR)
Conditional Max – Min Battery Capacity Routing (CMMBCR)
Minimize variance in power levels
Minimum Total Transmission Power Routing (MTPR)
The cougar approach to in-network query processing in sensor networksDilini Muthumala
These slides presents the research paper: "The cougar approach to in-network query processing in sensor networks" by Yong Yao and Johannes Gehrke. This presentation was done in a research seminar at the University of Colombo, School of Computing by the uploader.
This ppt describes about the Different protocols of Ad-Hoc Network .It is a pure survey report which will make clarification about each protocols used in ad-hoc network and helps to future generation to make more publishing of recent trends of ad-hoc networks.
Design Issues and Challenges in Wireless Sensor NetworksKhushbooGupta145
Wireless Sensor Networks (WSNs) are composed self-organized wireless ad hoc networks which comprise of a large number of resource constrained sensor nodes. The major areas of research in WSN is going on hardware, and operating system of WSN, deployment, architecture, localization, synchronization, programming models, data aggregation and dissemination, database querying, architecture, middleware, quality of service and security. This paper study highlights ongoing research activities and issues that affect the design and performance of Wireless Sensor Network.
Fisheye State Routing (FSR) - Protocol OverviewYoav Francis
Overview of the Fisheye State Routing (FSR) for cellular networks, IDC 2012
By Yoav Francis and Nir Solomon
(Part of a performance comparison of various routing algorithms in cellular networks)
Distributed Operation
Synchronization
Hidden Terminals
Exposed terminals
Throughput
Access delay
Fairness
Real-time Traffic support
Resource reservation
Ability to measure resource availability
Capability for power control
Adaptive rate control
Use of directional antennas
Minimize energy per packet (or per bit)
Maximize network lifetime
Routing considering available battery energy
Maximum Total Available Battery Capacity
Minimum Battery Cost Routing (MBCR)
Min– Max Battery Cost Routing (MMBCR)
Conditional Max – Min Battery Capacity Routing (CMMBCR)
Minimize variance in power levels
Minimum Total Transmission Power Routing (MTPR)
The cougar approach to in-network query processing in sensor networksDilini Muthumala
These slides presents the research paper: "The cougar approach to in-network query processing in sensor networks" by Yong Yao and Johannes Gehrke. This presentation was done in a research seminar at the University of Colombo, School of Computing by the uploader.
This ppt describes about the Different protocols of Ad-Hoc Network .It is a pure survey report which will make clarification about each protocols used in ad-hoc network and helps to future generation to make more publishing of recent trends of ad-hoc networks.
Based on Heterogeneity and Electing Probability of Nodes Improvement in LEACHijsrd.com
In heterogeneous sensor networks, certain nodes become cluster heads which aggregate the data of their cluster nodes and transfer it to the sink. An Improved Energy leach protocol for cluster head selection in a hierarchically clustered heterogeneous network to reorganize the network topology efficiently is proposed in this research work. The proposed algorithm will use thresholding to improve the cluster head selection. The presented algorithm considers the sensor nodes in wireless network and randomly distributed in the heterogeneous network. The coordinates of the sink and the dimensions of the sensor field are known in prior.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
IMPROVEMENT OF LEACH AND ITS VARIANTS IN WIRELESS SENSOR NETWORKIAEME Publication
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. A data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. Since wireless communications consume significant amounts of battery power, sensor nodes should spend as little energy as possible receiving and transmitting data.
Improved Performance of LEACH for WSN Using Precise Number of Cluster-Head an...ijsrd.com
Wireless microsensor systems will facilitate the reliable monitoring of a variety of environments for several applications like as civil and military. In this paper, we look at modified LEACH protocol. This paper presents a new approach to clustering wireless sensor networks and determining cluster heads. LEACH is a hierarchical cluster algorithm in which Cluster-Heads are randomly selected from the nodes. Here, I apply new approach for selection of Cluster-Head according to their initial and residual energy of all the nodes and according to their initial and residual energy nodes are eligible for cluster head in the next round. Results of new approach of LEACH protocol compared with Conventional routing protocol.
Maximizing Network Lifetime by Using Smart Cluster Head Selectioniosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
WALEACH: WEIGHT BASED ENERGY EFFICIENT ADVANCED LEACH ALGORITHMcscpconf
Designing a protocol stack for wireless sensor network (WSN) is a challenging task due to
energy, computational, communication and storage constraints. Energy spent for
communication between sensor nodes dominates the energy spent for the computation [1].
Multi-hop short range communication between wireless sensor nodes is energy efficient
compared to single-hop long range communication. Hierarchical clustering is one of the
possible solutions to save energy of wireless sensor nodes. LEACH and Advanced LEACH
(ALEACH) are energy efficient hierarchical clustering routing protocols. In this paper we
presented Weight based Advanced LEACH routing protocol - WALEACH. WALEACH selects
Cluster Head by assigning importance (weight) to different parameters used to select Cluster
Head, which makes the routing protocol energy efficient and improves life time of a wireless
sensor network. Simulation results shown here verify that WALEACH not only improves network life time compared to LEACH and ALEACH algorithms but Packet Reception Rate (PRR) too.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
40. Probability for each node i to be a cluster-head at time t(2) Ci(t) = it determines whether node i has been a cluster head in most recent (r mod(N/k))rounds. 10
41. Cluster Head Selection Algorithms (cont.) (3) = total no. of nodes eligible to be a cluster-head at time t. This ensures energy at each node to be approx. equal after every N/k rounds. Using (2) and (3), expected #of Cluster Heads per round is, 11