The document discusses clustering routing protocols for wireless sensor networks. It provides an overview of clustering techniques which group sensor nodes into clusters with elected cluster heads that aggregate and transmit data to the base station. This approach provides benefits like improved scalability, reduced energy consumption and load compared to flat routing protocols. The document also outlines various objectives of clustering like data aggregation, load balancing, fault tolerance and connectivity. It reviews several popular clustering protocols and notes that no single technique performs best in all areas, leaving room for future improvements to address these issues.
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Data gathering in wireless sensor networks using mobile elementsijwmn
In this paper, we investigate the problem of designing the minimum number of required mobile elements
tours such that each sensor node is either on the tour or one hop away from the tour, and the length of the
tour to be bounded by pre-determined value L. To address this problem, we propose heuristic-based
solution. This solution works by directing the mobile element tour towards the highly dense area in the
network. The experiment results show that our scheme outperform the benchmark scheme by 10% in most
scenarios.
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
ENERGY OPTIMISATION SCHEMES FOR WIRELESS SENSOR NETWORKcscpconf
A sensor network is composed of a large number of sensor nodes, which are densely
deployed either inside the phenomenon or very close to it. Sensor nodes have
sensing, processing and transmitting capability . They however have limited energy
and measures need to be taken to make op- timum usage of their energy and save
them from task of only receiving and transmitting data without processing. Various
techniques for energy utilization optimisation have been proposed Ma jor players are
however clustering and relay node placement. In the research related to relay node
placement, it has been proposed to deploy some relay nodes such that the sensors
can transmit the sensed data to a nearby relay node, which in turn delivers the data
to the base stations. In general, the relay node placement problems aim to meet
certain connectivity and/or survivabil- ity requirements of the network by deploying a
minimum number of relay nodes. The other approach is grouping sensor nodes into
clusters with each cluster having a cluster head (CH). The CH nodes aggregate the
data and transmit them to the base station (BS). These two approaches has been
widely adopted by the research community to satisfy the scala- bility objective and generally achieve high energy efficiency and prolong network lifetime in large-scale WSN environments and hence are discussed here along with single hop and multi hop characteristic of sensor node
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Data gathering in wireless sensor networks using mobile elementsijwmn
In this paper, we investigate the problem of designing the minimum number of required mobile elements
tours such that each sensor node is either on the tour or one hop away from the tour, and the length of the
tour to be bounded by pre-determined value L. To address this problem, we propose heuristic-based
solution. This solution works by directing the mobile element tour towards the highly dense area in the
network. The experiment results show that our scheme outperform the benchmark scheme by 10% in most
scenarios.
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
ENERGY OPTIMISATION SCHEMES FOR WIRELESS SENSOR NETWORKcscpconf
A sensor network is composed of a large number of sensor nodes, which are densely
deployed either inside the phenomenon or very close to it. Sensor nodes have
sensing, processing and transmitting capability . They however have limited energy
and measures need to be taken to make op- timum usage of their energy and save
them from task of only receiving and transmitting data without processing. Various
techniques for energy utilization optimisation have been proposed Ma jor players are
however clustering and relay node placement. In the research related to relay node
placement, it has been proposed to deploy some relay nodes such that the sensors
can transmit the sensed data to a nearby relay node, which in turn delivers the data
to the base stations. In general, the relay node placement problems aim to meet
certain connectivity and/or survivabil- ity requirements of the network by deploying a
minimum number of relay nodes. The other approach is grouping sensor nodes into
clusters with each cluster having a cluster head (CH). The CH nodes aggregate the
data and transmit them to the base station (BS). These two approaches has been
widely adopted by the research community to satisfy the scala- bility objective and generally achieve high energy efficiency and prolong network lifetime in large-scale WSN environments and hence are discussed here along with single hop and multi hop characteristic of sensor node
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
Simulation Issues in Wireless Sensor Networks: A SurveyM H
This paper presents a survey of simulation tools and systems for wireless sensor networks. Wireless sensor network modelling and simulation methodologies are presented for each system alongside judgments concerning their relative ease of use and accuracy. Finally, we propose a mixed-mode simulation methodology that integrates a simulated environment with real wireless sensor network testbed hardware in order to improve both the accuracy and scalability of results when evaluating different prototype designs and systems.
An Overview of Information Extraction from Mobile Wireless Sensor NetworksM H
Information Extraction (IE) is a key research area within the field of Wireless Sensor Networks (WSNs). It has been characterised in a variety of ways, ranging from the description of its purposes, to reasonably abstract models of its processes and components. There has been only a handful of papers addressing IE over mobile WSNs directly, these dealt with individual mobility related problems as the need arises. This paper is presented as a tutorial that takes the reader from the point of identifying data about a dynamic (mobile) real world problem, relating the data back to the world from which it was collected, and finally discovering what is in the data. It covers the entire process with special emphasis on how to exploit mobility in maximising information return from a mobile WSN. We present some challenges introduced by mobility on the IE process as well as its effects on the quality of the extracted information. Finally, we identify future research directions facing the development of efficient IE approaches for WSNs in the presence of mobility.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
Data aggregation in wireless sensor network based on dynamic fuzzy clusteringcsandit
Wireless Sensor Networks (WSN) use a plurality of s
ensor nodes that unceasingly collected and
sent data from a specific area to a base station. C
luster based data aggregation is one of the
popular protocols in WSN. Clustering is an importan
t procedure for extending the network
lifetime in WSNs. Cluster Heads (CH) aggregate data
from relevant cluster nodes and send it to
the base station. A main challenge in WSNs is to se
lect suitable CHs. In another communication
protocol based on a tree construction, energy consu
mption is low because there are short paths
between the sensors. In this paper, we propose Dyna
mic Fuzzy Clustering (DFC) data
aggregation. The proposed method first uses fuzzy d
ecision making approach for the selection
of CHs and then a minimum spanning tree is construc
ted based on CHs. CHs are selected
efficiently and accurately. The combining clusterin
g and tree structure is reclaiming the
advantages of the previous structures. Our method i
s compared to Low Energy Adaptive
Clustering Hierarchy (LEACH), Cluster and Tree Dara
Aggregation (CTDA), Modified Cluster
based and Tree based Data Aggregation (MCTDA) and C
luster based and Tree based Power
Efficient Data Collection and Aggregation (CTPEDCA)
.Our method decreases energy
consumption of each node. In DFC data aggregation,
the node lifetime is increased and the
survival of the WSN is improved.
The novel applications of sensor networks impose some requirements in wireless sensor network design. With the energy efficiency and lifetime awareness, the throughput and network delayalso required to support emerging applications of sensor networks. In this paper, we propose
throughput and network delay aware intra-cluster routing protocol. We introduce the back-up links in the intra-cluster communication path. The link throughput, communication delay, packet loss ratio, interference, residual energy and node distance are the considered factors in finding efficient path of data communication among the sensor nodes within the cluster. The
simulation result shows the higher throughput and lower average packet delay rate for the proposed routing protocol than the existing benchmarks. The proposed routing protocol also shows energy efficiency and lifetime awareness with better connectivity rate.
FUZZY-CLUSTERING BASED DATA GATHERING IN WIRELESS SENSOR NETWORK ijsc
Wireless Sensor Networks (WSN) is spatially distributed, collection of sensor nodes for the purpose of
monitoring physical or environmental conditions, such as temperature, sound, pressure, etc. and to
cooperatively pass their data through the network to a base station. The critical challenge is to minimize
the energy consumption in data gathering and forwarding from sensor nodes to the sink. Cluster based
data aggregation is one of the most popular communication protocols in this field. Clustering is an
important procedure for extending the network lifetime in wireless sensor networks. Cluster Heads (CH)
aggregate data from relevant cluster nodes and send it to the base station. A main challenge in WSNs is to
select suitable CHs. Another communication protocol is based on a tree construction. In this protocol,
energy consumption is low because there are short paths between the sensors. In this paper, Dynamic
Fuzzy Clustering data aggregation is introduced. This approach is based on clustering and minimum
spanning tree. The proposed method initially uses fuzzy decision making approach for the selection of CHs.
Afterward a minimum spanning tree is constructed based on CHs. CHs are selected efficiently and
accurately. The combining clustering and tree structure is reclaiming the advantages of the previous
structures. Our method is compared to the well-known data aggregation methods, in terms of energy
consumption and the amount of energy residuary in each sensor network lifetime. Our method decreases
energy consumption of each node. When the best CHs selected and the minimum spanning tree is formed by
the best CHs, the remaining energy of the nodes will be preserved. Node lifetime has an important role in
WSN. Using our proposed data aggregation algorithm, survival of the network is improved
ENERGY EFFICIENT HIERARCHICAL CLUSTER HEAD ELECTION USING EXPONENTIAL DECAY F...ijwmn
In the recent years, wireless sensor network (WSN) have witnessed increased interest in information gathering in applications such as combat field reconnaissance, security surveillance, environmental monitoring, patient health monitoring and so on. Thus, there is a need for scalable and energy-efficient routing, data gathering and aggregation protocols in these WSN environments. Various hierarchical
clustering Protocols have been proposed by authors for WSN to improve system stability, lifetime, and energy efficiency. Clustering involves grouping nodes into disjoint and non-overlapping clusters. In this paper we motivate the need for clustering. Secondly, we present general classification of published clustering schemes. Thirdly, we review some existing clustering algorithms proposed for WSNs; highlighting their objectives, features, and so on. Finally, we develop an Average Energy (AvE) prediction algorithm using exponential decay function y=Ae-ax+B. We then combine this function with the
probabilistic distributed LEACH of algorithm to determine suitable CHs. The combined algorithm was implemented on MATLAB simulator and tested for homogenous network. The result gathered from the simulation shows that the extended algorithm in homogenous network mode is able to achieve 39%
stability, 11% Average energy Dissipation per round and 40% Lifespan better than LEACH-Homo. This paper proposes a new direction in improving energy efficiency of WSN routing protocol, which is desirable in some critical WSN applications. .
Information Extraction from Wireless Sensor Networks: System and ApproachesM H
Recent advances in wireless communication have made it possible to develop low-cost, and low power Wireless Sensor Networks (WSN). The WSN can be used for several application areas (e.g., habitat monitoring, forest fire detection, and health care). WSN Information Extraction (IE) techniques can be classified into four categories depending on the factors that drive data acquisition: event-driven, time-driven, query-based, and hybrid. This paper presents a survey of the state-of-the-art IE techniques in WSNs. The benefits and shortcomings of different IE approaches are presented as motivation for future work into automatic hybridization and adaptation of IE mechanisms.
A Review of Atypical Hierarchical Routing Protocols for Wireless Sensor Networksiosrjce
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.
Moving from Traditional to Connected Support: Delivering Better Customer Expe...Support.com
Self-service and changes in customer behavior
How self-service is impacting the demand on support agents
How we’ve seen companies adapting their approach to support
Webinar – From Product Fixes to Customer Success – The Key is Connected SupportSupport.com
Attend this webinar to learn:
- How the shift in focus from troubleshooting to customer success is changing the technology support landscape
- How to effectively address the growing demand for self-service support as consumers become more independent
- How combining in-app or web-based self-service with easy escalation to assisted channels is reducing customer effort
- How we’ve seen Upclick and other customers adapt their traditional approaches to support
A CLUSTER-BASED ROUTING PROTOCOL AND FAULT DETECTION FOR WIRELESS SENSOR NETWORKIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be
deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a
consequence, the main goal is to reduce the overall energy consumption using clustering protocols which
have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and
routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend
the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices
and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated
widely and the results are compared with related works. The experimental results show that the proposed
algorithm provides an effective improvement in terms of energy consumption, data accuracy and network
lifetime
Simulation Issues in Wireless Sensor Networks: A SurveyM H
This paper presents a survey of simulation tools and systems for wireless sensor networks. Wireless sensor network modelling and simulation methodologies are presented for each system alongside judgments concerning their relative ease of use and accuracy. Finally, we propose a mixed-mode simulation methodology that integrates a simulated environment with real wireless sensor network testbed hardware in order to improve both the accuracy and scalability of results when evaluating different prototype designs and systems.
An Overview of Information Extraction from Mobile Wireless Sensor NetworksM H
Information Extraction (IE) is a key research area within the field of Wireless Sensor Networks (WSNs). It has been characterised in a variety of ways, ranging from the description of its purposes, to reasonably abstract models of its processes and components. There has been only a handful of papers addressing IE over mobile WSNs directly, these dealt with individual mobility related problems as the need arises. This paper is presented as a tutorial that takes the reader from the point of identifying data about a dynamic (mobile) real world problem, relating the data back to the world from which it was collected, and finally discovering what is in the data. It covers the entire process with special emphasis on how to exploit mobility in maximising information return from a mobile WSN. We present some challenges introduced by mobility on the IE process as well as its effects on the quality of the extracted information. Finally, we identify future research directions facing the development of efficient IE approaches for WSNs in the presence of mobility.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
Data aggregation in wireless sensor network based on dynamic fuzzy clusteringcsandit
Wireless Sensor Networks (WSN) use a plurality of s
ensor nodes that unceasingly collected and
sent data from a specific area to a base station. C
luster based data aggregation is one of the
popular protocols in WSN. Clustering is an importan
t procedure for extending the network
lifetime in WSNs. Cluster Heads (CH) aggregate data
from relevant cluster nodes and send it to
the base station. A main challenge in WSNs is to se
lect suitable CHs. In another communication
protocol based on a tree construction, energy consu
mption is low because there are short paths
between the sensors. In this paper, we propose Dyna
mic Fuzzy Clustering (DFC) data
aggregation. The proposed method first uses fuzzy d
ecision making approach for the selection
of CHs and then a minimum spanning tree is construc
ted based on CHs. CHs are selected
efficiently and accurately. The combining clusterin
g and tree structure is reclaiming the
advantages of the previous structures. Our method i
s compared to Low Energy Adaptive
Clustering Hierarchy (LEACH), Cluster and Tree Dara
Aggregation (CTDA), Modified Cluster
based and Tree based Data Aggregation (MCTDA) and C
luster based and Tree based Power
Efficient Data Collection and Aggregation (CTPEDCA)
.Our method decreases energy
consumption of each node. In DFC data aggregation,
the node lifetime is increased and the
survival of the WSN is improved.
The novel applications of sensor networks impose some requirements in wireless sensor network design. With the energy efficiency and lifetime awareness, the throughput and network delayalso required to support emerging applications of sensor networks. In this paper, we propose
throughput and network delay aware intra-cluster routing protocol. We introduce the back-up links in the intra-cluster communication path. The link throughput, communication delay, packet loss ratio, interference, residual energy and node distance are the considered factors in finding efficient path of data communication among the sensor nodes within the cluster. The
simulation result shows the higher throughput and lower average packet delay rate for the proposed routing protocol than the existing benchmarks. The proposed routing protocol also shows energy efficiency and lifetime awareness with better connectivity rate.
FUZZY-CLUSTERING BASED DATA GATHERING IN WIRELESS SENSOR NETWORK ijsc
Wireless Sensor Networks (WSN) is spatially distributed, collection of sensor nodes for the purpose of
monitoring physical or environmental conditions, such as temperature, sound, pressure, etc. and to
cooperatively pass their data through the network to a base station. The critical challenge is to minimize
the energy consumption in data gathering and forwarding from sensor nodes to the sink. Cluster based
data aggregation is one of the most popular communication protocols in this field. Clustering is an
important procedure for extending the network lifetime in wireless sensor networks. Cluster Heads (CH)
aggregate data from relevant cluster nodes and send it to the base station. A main challenge in WSNs is to
select suitable CHs. Another communication protocol is based on a tree construction. In this protocol,
energy consumption is low because there are short paths between the sensors. In this paper, Dynamic
Fuzzy Clustering data aggregation is introduced. This approach is based on clustering and minimum
spanning tree. The proposed method initially uses fuzzy decision making approach for the selection of CHs.
Afterward a minimum spanning tree is constructed based on CHs. CHs are selected efficiently and
accurately. The combining clustering and tree structure is reclaiming the advantages of the previous
structures. Our method is compared to the well-known data aggregation methods, in terms of energy
consumption and the amount of energy residuary in each sensor network lifetime. Our method decreases
energy consumption of each node. When the best CHs selected and the minimum spanning tree is formed by
the best CHs, the remaining energy of the nodes will be preserved. Node lifetime has an important role in
WSN. Using our proposed data aggregation algorithm, survival of the network is improved
ENERGY EFFICIENT HIERARCHICAL CLUSTER HEAD ELECTION USING EXPONENTIAL DECAY F...ijwmn
In the recent years, wireless sensor network (WSN) have witnessed increased interest in information gathering in applications such as combat field reconnaissance, security surveillance, environmental monitoring, patient health monitoring and so on. Thus, there is a need for scalable and energy-efficient routing, data gathering and aggregation protocols in these WSN environments. Various hierarchical
clustering Protocols have been proposed by authors for WSN to improve system stability, lifetime, and energy efficiency. Clustering involves grouping nodes into disjoint and non-overlapping clusters. In this paper we motivate the need for clustering. Secondly, we present general classification of published clustering schemes. Thirdly, we review some existing clustering algorithms proposed for WSNs; highlighting their objectives, features, and so on. Finally, we develop an Average Energy (AvE) prediction algorithm using exponential decay function y=Ae-ax+B. We then combine this function with the
probabilistic distributed LEACH of algorithm to determine suitable CHs. The combined algorithm was implemented on MATLAB simulator and tested for homogenous network. The result gathered from the simulation shows that the extended algorithm in homogenous network mode is able to achieve 39%
stability, 11% Average energy Dissipation per round and 40% Lifespan better than LEACH-Homo. This paper proposes a new direction in improving energy efficiency of WSN routing protocol, which is desirable in some critical WSN applications. .
Information Extraction from Wireless Sensor Networks: System and ApproachesM H
Recent advances in wireless communication have made it possible to develop low-cost, and low power Wireless Sensor Networks (WSN). The WSN can be used for several application areas (e.g., habitat monitoring, forest fire detection, and health care). WSN Information Extraction (IE) techniques can be classified into four categories depending on the factors that drive data acquisition: event-driven, time-driven, query-based, and hybrid. This paper presents a survey of the state-of-the-art IE techniques in WSNs. The benefits and shortcomings of different IE approaches are presented as motivation for future work into automatic hybridization and adaptation of IE mechanisms.
A Review of Atypical Hierarchical Routing Protocols for Wireless Sensor Networksiosrjce
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.
Moving from Traditional to Connected Support: Delivering Better Customer Expe...Support.com
Self-service and changes in customer behavior
How self-service is impacting the demand on support agents
How we’ve seen companies adapting their approach to support
Webinar – From Product Fixes to Customer Success – The Key is Connected SupportSupport.com
Attend this webinar to learn:
- How the shift in focus from troubleshooting to customer success is changing the technology support landscape
- How to effectively address the growing demand for self-service support as consumers become more independent
- How combining in-app or web-based self-service with easy escalation to assisted channels is reducing customer effort
- How we’ve seen Upclick and other customers adapt their traditional approaches to support
A CLUSTER-BASED ROUTING PROTOCOL AND FAULT DETECTION FOR WIRELESS SENSOR NETWORKIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be
deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a
consequence, the main goal is to reduce the overall energy consumption using clustering protocols which
have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and
routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend
the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices
and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated
widely and the results are compared with related works. The experimental results show that the proposed
algorithm provides an effective improvement in terms of energy consumption, data accuracy and network
lifetime
The Energy hole problem is a major problem of
data collection in wireless sensor networks. The sensors near the
static sink serve as relays for remote sensors, which reduce their
energy rapidly, causing energy holes in the sensor field. This
project has proposed a customizable mobile sink based adaptive
protected energy efficient clustering protocol (MSAPEEP) for
improvement of the problem of energy holes along with that we
also characterize and made comparison with the previous
existing protocols. A MSAPEEP uses the adaptive protected
method (APM) to discover the best possible number of cluster
heads (CHs) to get better life span and constancy time of the
network. The effectiveness of MSAPEEP is compared with
previous protocols; specifically, low energy adaptive clustering
hierarchy (LEACH) and mobile sink enhanced energy efficient
PEGASIS based routing protocol using network simulator(NS2).
Examples of simulation result show that MSAPEEP is more
reliable and removes the potential of energy hole and enhances
the stability and life span of the wireless sensor network(WSN).
Fuzzy-Clustering Based Data Gathering in Wireless Sensor Network ijsc
Wireless Sensor Networks (WSN) is spatially distributed, collection of sensor nodes for the purpose of monitoring physical or environmental conditions, such as temperature, sound, pressure, etc. and to cooperatively pass their data through the network to a base station. The critical challenge is to minimize the energy consumption in data gathering and forwarding from sensor nodes to the sink. Cluster based data aggregation is one of the most popular communication protocols in this field. Clustering is an important procedure for extending the network lifetime in wireless sensor networks. Cluster Heads (CH) aggregate data from relevant cluster nodes and send it to the base station. A main challenge in WSNs is to select suitable CHs. Another communication protocol is based on a tree construction. In this protocol, energy consumption is low because there are short paths between the sensors. In this paper, Dynamic Fuzzy Clustering data aggregation is introduced. This approach is based on clustering and minimum spanning tree. The proposed method initially uses fuzzy decision making approach for the selection of CHs. Afterward a minimum spanning tree is constructed based on CHs. CHs are selected efficiently and accurately. The combining clustering and tree structure is reclaiming the advantages of the previous structures. Our method is compared to the well-known data aggregation methods, in terms of energy consumption and the amount of energy residuary in each sensor network lifetime. Our method decreases energy consumption of each node. When the best CHs selected and the minimum spanning tree is formed by the best CHs, the remaining energy of the nodes will be preserved. Node lifetime has an important role in WSN. Using our proposed data aggregation algorithm, survival of the network is improved.
In most efficient clustering technique for WSN has been proved as a congestion control and hierarchical
based cluster head selection process. The cluster head reduces the energy wastage and additionally that improves
the receiving of data and collection of data from their member sensor nodes. Also transmitting the collected data
to the base station (BS). In proposed method hybrid cluster based congestion aware (HCBCA) is mostly focused
on traffic that affects the continuous flow of data, Arrival of data from the source to destination delay time,
Avoid packet losses and energy consumption process. Mainly congestion happens in the intra cluster to do the
process of transmitting the destination of packets in many to one manner form sensor node to CH. The main
reason for occurrence of congestion is communication path, nodes energy level and nodes buffer size. When
these above it are successful done the congestion, does not exist or otherwise congestion will occur. The purpose
of WSN congestion control is to improve the packet delivery ratio and energy consumption.
Review on Clustering and Data Aggregation in Wireless Sensor NetworkEditor IJCATR
Wireless Sensor Network is a collection of various sensor nodes with sensing and communication capabilities. Clustering is the
process of grouping the set of objects so that the objects in the same group are similar to each other and different to objects in the other
group. The main goal of Data Aggregation is to collect and aggregate the data by maintaining the energy efficiency so that the network
lifetime can be increased. In this paper, I have presented a comprehensive review of various clustering routing protocols for WSN, their
advantages and limitation of clustering in WSN. A brief survey of Data Aggregation Algorithm is also outlined in this paper. Finally, I
summarize and conclude the paper with some future directions
Wireless sensor network consists of several distributed sensor nodes. It is used for several environmental applications, military applications and health related applications. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Most of the research in energy efficient data gathering in data centric applications of wireless sensor networks is motivated by LEACH (Low Energy Adaptive Clustering Hierarchy) scheme. It allows the rotation of cluster head role among the sensor nodes and tries to distribute the energy consumption over the network. Selection of sensor node for such role rotations greatly affects the energy efficiency of the network. Some of the routing protocol has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster head. We have surveyed several existing methods for selecting energy efficient cluster head in wireless sensor networks. We have proposed an energy efficient cluster head selection method in which the cluster head selection and replacement cost is reduced and ultimately the network lifetime is increased. Using our proposed method, network life time is increased compared to existing methods. Keywords: WSN, CH, BS, LEACH, LEACH-B, LEACH-F
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksCSCJournals
A wireless sensor network (WSN) consists of large number of sensor nodes where each node operates by a finite battery for sensing, computing, and performing wireless communication tasks. Energy aware routing and MAC protocols were proposed to prolong the lifetime of WSNs. MAC protocols reduce energy consumption by putting the nodes into sleep mode for a relatively longer period of time; thereby minimizing collisions and idle listening time. On the other hand, efficient energy aware routing is achieved by finding the best path from the sensor nodes to the Base Sta-tion (BS) where energy consumption is minimal. In almost all solutions there is always a tradeoff between power consumption and delay reduction. This paper presents an improved hierarchical coordination for data gathering (HCDG) routing schema for WSNs based on multi-level chains formation with data aggregation. Also, this paper provides an analytical model for energy consumption in WSN to compare the performance of our proposed HCDG schema with the near optimal energy reduction methodology, PEGASIS. Our results demonstrate that the proposed routing schema provides relatively lower energy consumption with minimum delay for large scale WSNs.
Energy Aware Talented Clustering with Compressive Sensing (TCCS) for Wireless...IJCNCJournal
Wireless sensor networks (WSNs) are networks of sensor nodes that interact wirelessly to gather information about the surrounding environment. Nodes are often low-powered and dispersed in an ad hoc, decentralized manner. Although WSNs have gained in popularity, they still have several serious shortcomings, like limited battery life and bandwidth. In this paper, the cluster head (CH) selection, the Compressive Sensing (CS) theory, the Connection-based Decentralized Clustering (CDC), the relay node selection, and the Multi Objective Genetic Algorithm (MOGA)are all taken into account The initial stage provided a theoretical revision to the concepts of network construction, compressive sensing, and MOGA, which impacted the improvement of network lifetime. In the second stage developed a novel model such as Energy Aware Talented Clustering with Compressive Sensing (TCCS) for the sensor network. This approach considers increasing longevity but also raises the network's overall quality of service (QoS). In the analysis, the TCCS model is applied to both the centralized and distributed networks and compared with the existing methods. When compared to the previous methods, the simulation results show that the proposed work performs better in terms of the calculation of maximum packet delivery ratio of 93.93 percent, minimum energy consumption of 8.04J, maximum energy efficiency of 91.04 percent, maximum network throughput of 465.51kbps, minimum packet loss of 282 packets, and minimum delay of 63.82 msec.
ENERGY AWARE TALENTED CLUSTERING WITH COMPRESSIVE SENSING (TCCS) FOR WIRELESS...IJCNCJournal
Wireless sensor networks (WSNs) are networks of sensor nodes that interact wirelessly to gather
information about the surrounding environment. Nodes are often low-powered and dispersed in an ad hoc,
decentralized manner. Although WSNs have gained in popularity, they still have several serious
shortcomings, like limited battery life and bandwidth. In this paper, the cluster head (CH) selection, the
Compressive Sensing (CS) theory, the Connection-based Decentralized Clustering (CDC), the relay node
selection, and the Multi Objective Genetic Algorithm (MOGA)are all taken into account The initial stage
provided a theoretical revision to the concepts of network construction, compressive sensing, and MOGA,
which impacted the improvement of network lifetime. In the second stage developed a novel model such as
Energy Aware Talented Clustering with Compressive Sensing (TCCS) for the sensor network. This
approach considers increasing longevity but also raises the network's overall quality of service (QoS). In
the analysis, the TCCS model is applied to both the centralized and distributed networks and compared
with the existing methods. When compared to the previous methods, the simulation results show that the
proposed work performs better in terms of the calculation of maximum packet delivery ratio of 93.93
percent, minimum energy consumption of 8.04J, maximum energy efficiency of 91.04 percent, maximum
network throughput of 465.51kbps, minimum packet loss of 282 packets, and minimum delay of 63.82 msec.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
OPTIMIZED CLUSTER ESTABLISHMENT AND CLUSTER-HEAD SELECTION APPROACH IN WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical issue that degrades the network performance. Recharging and providing security to the sensor devices is very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an important and suitable approach to increase energy efficiency and transmitting secured data which in turn enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC) works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all the cluster heads are formed at a time and selected on rotation based on considering the highest energy of the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access (CSMA), a contention window based protocol is used at the MAC layer for collision detection and to provide channel access prioritization to HWSN of different traffic classes with reduction in End to End delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the cluster head for transmission without depleting the energy. Simulation parameters of the proposed system such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing system.
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical
issue that degrades the network performance. Recharging and providing security to the sensor devices is
very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an
important and suitable approach to increase energy efficiency and transmitting secured data which in turn
enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC)
works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the
rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the
network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on
the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all
the cluster heads are formed at a time and selected on rotation based on considering the highest energy of
the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum
flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access
(CSMA), a contention window based protocol is used at the MAC layer for collision detection and to
provide channel access prioritization to HWSN of different traffic classes with reduction in End to End
delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the
cluster head for transmission without depleting the energy. Simulation parameters of the proposed system
such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing
system.
CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
CFMS: A Cluster-based Convergecast Framework for Dense Multi-Sink Wireless Se...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
CFMS: A Cluster-based Convergecast Framework for Dense Multi-Sink Wireless Se...
pxc3903794
1. International Journal of Computer Applications (0975 – 8887)
Volume 119 – No.9, June 2015
17
A Study of Congestion Control Protocols for
Wireless Sensor Networks
Harpreet Singh
M.Tech Research Scholar
Amritsar College of Engg. and Tech
Tanu Preet Singh, PhD
Professor and HOD
Amritsar College of Engg. and Tech
ABSTRACT
Within the last couple of years a comparatively large
amount of clustering routing protocols have already been
developed for WSNs. This paper is an effort to
comprehensively review and critically discuss the absolute
most prominent clustering routing algorithms which have
been developed for WSNs. The goals with this survey are
to produce a large audience conscious of the existence and
of the usually good performance of numerous clustering
routing protocols in WSNs. From the survey, it has been
discovered that none of technique performs effectively in
most fields. Therefore the paper ends with the future scope
to overcome these issues.
Keywords
WSNs, CLUSTERING PROTOCOLS, LEACH, PASCCC
1. INTRODUCTION
Clustering techniques in wireless sensor networks aims at
gathering data among categories of nodes, which elect
leaders among themselves. The leader or cluster-heads has
got the role of aggregating the information and reporting
the information to the BS. The advantages with this
scheme is so it reduces energy usage of every node and
communication cost. The clustering algorithms which are
made is dependent on homogeneity and heterogeneity of
nodes. Among the earliest work proposing this method in
WSNs is LEACH. Recently, there have been a lot of other
clustering techniques which are generally variants of
LEACH protocol with slight improvement and different
application scenarios. DEEC (Design of a distributed
energy-efficient clustering), EDACH (Energy-Driven
Adaptive Clustering Hierarchy) and EEUC (An Energy-
Efficient Unequal Clustering Mechanism) are typical
clustering techniques proposed with the goal of
minimizing energy usage, while extending network life
time. Clustered sensor network could be classified into two
main types: homogeneous and heterogeneous sensor
network. While energy efficiency in WSNs remains a
function of uniform distribution of energy among sensor
nodes, classifying clustering techniques is dependent upon
the objectives in mind. The Optimal clustering technique
may be the technique for the heterogeneity nodes.
2. ADVANTGES AND OBJECTIVES
OF CLUSTERING
In contrast to flat routing protocols in WSNs, clustering
routing protocols have a number of advantages, such as for
instance more scalability, less load, less energy
consumption and more robustness. In this section, we
summarize these advantages in addition to the objectives
of WSN clustering the following: More Scalability: In
clustering routing scheme, sensor nodes are divided in too
many different clusters with various assignment levels.
The CHs are in charge of data aggregation, information
dissemination and network management, and the MNs for
events sensing and information collecting within their
surroundings. Clustering topology can localize the route
create within the cluster and thus reduce the size of the
routing table stored at the individual sensor nodes. In
contrast to a flat topology, this sort of network topology is
simpler to handle, and more scalable to respond to events
in the environment.
Data Aggregation/Fusion: Data aggregation/fusion,
which can be the procedure of aggregating the information
from multiple nodes to get rid of redundant transmission
and provide fused data to the BS, is definitely an effectual
technique for WSNs to save lots of energy. The most used
data aggregation/fusion method is clustering data
aggregation, where each CH aggregates the collected data
and transmits the fused data to the BS. Usually CHs are
formed a tree structure to transmit aggregated data by
multi hopping through other CHs which results in
significant energy savings.
Less Load: Since sensors might generate significant
redundant data, data aggregation or fusion has emerged
being an important tenet and objective in WSNs. The key
concept of data aggregation or fusion is to mix data from
different sources to get rid of redundant data transmissions,
and provide an abundant and multi-dimensional view of
the targets being monitored. Many clustering routing
schemes with data aggregation capabilities require careful
selection for clustering approach. For clustering topology,
all cluster members only send data to CHs, and data
aggregation is conducted at the CHs, that really help to
dramatically reduce transmission data and save energy.
Additionally, the routes are setup within the clusters which
thus reduce the size of the routing table stored at the
individual sensor nodes.
Less Energy Consumption: In clustering routing scheme,
data aggregation really helps to dramatically reduce
transmission data and save energy. Moreover, clustering
with intra-cluster and inter-cluster communications can
reduce the amount of sensor nodes performing the job of
long-distance communications, thus allowing less energy
consumption for the whole network. Additionally only
CHs perform the job of data transmission in clustering
routing scheme, which could save a lot of energy
consumption.
2. International Journal of Computer Applications (0975 – 8887)
Volume 119 – No.9, June 2015
18
More Robustness: Clustering routing scheme causes it to
be easier for network topology control and responding to
network changes comprising node increasing, node
mobility and unpredicted failures, etc. A clustering routing
scheme only needs to manage with one of these changes
within individual clusters, thus the whole network is better
quality and easier for management. To be able to share the
CH responsibility, CHs are usually rotated among most of
the sensor nodes to prevent the single point of failure in
clustering routing algorithms.
Collision Avoidance: In the multi-hop flat model, the
wireless medium is shared and managed by individual
nodes, thus this model can lead to low efficiency in the
resource usage. On another hand, in the multi-hop
clustering model, a WSN is divided in to clusters and data
communications between sensor nodes comprise two
modes, i.e., intra-cluster and inter-cluster, respectively for
data collection and for data transmissions. Accordingly,
resources could be allocated orthogonally to each cluster to
lessen collisions between clusters and be reused cluster by
cluster. Consequently, the multi-hop clustering model is
suitable for large-scale WSNs.
Latency Reduction: Whenever a WSN is divided in to
clusters, only CHs perform the job of data transmissions
from the cluster. The mode of data transmissions only
from the cluster helps avoiding collisions involving the
nodes. Accordingly latency is reduced. Furthermore, data
transmission is conducted hop by hop usually using the
shape of flooding in flat routing scheme, but only CHs
perform the job of data transmission in clustering routing
scheme, which could decrease hops from data source to the
BS, accordingly decrease latency.
Load Balancing: Load balancing is a vital consideration
aiming at prolonging the network lifetime in WSNs. Even
distribution of sensor nodes one of the clusters is generally
considered for cluster construction where CHs perform the
job of data processing and intra-cluster management.
Generally constructing equal-sized clusters is adopted for
prolonging the network lifetime because it prevents the
premature energy exhaustion of CHs. Besides, multi-path
routing is a technique to accomplish load balancing.
Fault-Tolerance: Because of the applicability of WSNs in
an excellent many dynamic scenarios, sensor nodes may
suffer with energy depletion, transmission errors, hardware
malfunction, and malicious attacks and so on. With
applications such as for instance hurricane modeling and
tracking envisioned started using a large quantity of small
sensor nodes, the cost of each sensor node is constrained.
Owing to significant constraints on the cost, and therefore
on the quality of sensor motes, and the often hostile
environments by which they're deployed, sensor networks
are vulnerable to failure. Thus, fault-tolerance is an
essential challenge in WSNs. To be able to avoid the
increasing loss of significant data from key sensor nodes,
fault tolerance of CHs is generally required in this sort of
applications, thus effective fault-tolerant approaches
should be designed in WSNs. Re-clustering is the absolute
most intuitive method to recover from a bunch failure,
though it always disarranges the on-going operation.
Assignment of CH backup is a practical scheme for
recovery from the CH failure.
Guarantee of Connectivity: Sensor nodes usually
transmit data to a number of BSs using a single-hop or
multi-hop routing in WSNs, thus whether the information
is successfully sent to the BS is principally determined by
the connectivity of every node to its next hop node across
the path. Furthermore, sensor nodes that cannot keep in
touch with every other sensor node can get isolated and
their data cannot be transmitted to the BS. Therefore,
guarantee of connectivity is an important goal of clustering
routing protocols in WSNs. An essential example is when
some information concerning most of the sensor nodes
must be collected by way of a designated fusion node in
clustering routing protocols.
Energy Hole Avoidance: Generally, multi-hop routing
can be used to provide the collected data to a drain or
perhaps a BS. In those networks, the traffic transmitted by
each node includes both self-generated and relayed traffic.
Aside from MAC protocols, the sensor nodes nearer to the
BS need certainly to transmit more packets than those far
away from the BS. Consequently, the nodes nearer to the
BS to deplete their energy first, leaving a gap close to the
BS, partitioning the entire network, and avoiding the
outside nodes from sending information to the BS, while
many remaining nodes still have a lots of energy. This
phenomenon is known as energy hole. Mechanisms of
energy whole avoidance, i.e., energy consumption
balancing, could be classified into three groups: node
deployment, load balancing, along with energy mapping
and assigning. Especially, uneven clustering is one of
many ways of load balancing. In this process, an inferior
cluster radius close to the sink and a more substantial
cluster radius from the sink are defined respectively, so the
power use of processing data in inter-cluster is less for
cluster with smaller radius, and thus more energy may be
used to relay data from remote nodes. On another hand, it's
challenging to analyze the optimization of cluster radius
theoretically.
Maximizing of the Network Lifetime: Network lifetime
is definitely an inevitable consideration in WSNs, because
sensor nodes are constrained in power, processing
capability and transmission bandwidth, specifically for
applications of harsh environments. Usually it's
indispensable to minimize the power consumption for
intra-cluster communication by CHs which are richer in
resources than ONs. Besides, sensor nodes which can be
near to all of the sensor nodes in the clusters must certainly
be vulnerable to be CHs. Additionally, the goal of energy-
aware idea is to choose those routes which are likely to
prolong the network lifetime in inter-cluster
communications, and the routes made up of nodes with
higher energy resources must certainly be preferred.
Quality of Service: The network applications and the
functionalities of WSNs prompt the necessity of quality of
service (QoS). Usually, effective sample, less delay and
temporary precision are required. It's difficult for the
routing protocols to satisfy all certain requirements of
QoS, because some demands may breach a number of
protocol principles. Existing clustering routing approaches
in WSNs mainly concentrate on increasing energy efficient
as opposed to QoS support. QoS metrics must be studied
into consideration real-time applications, such as for
instance battle-target tracking, emergent-event monitoring,
and etc.
3. International Journal of Computer Applications (0975 – 8887)
Volume 119 – No.9, June 2015
19
3. VARIOUS CLUSTERING
PROTOCOLS
3.1 Low Energy Adaptive Clustering
Hierarchy (LEACH)
WSNs are micro sensor systems which are spatially
distributed. WSN is just a power constrained system whilst
the sensor nodes have limited battery life that shortens the
network lifetime. Maximizing the network lifetime is
determined by an efficient communication protocol.
Energy consumption is, therefore, a crucial design issue in
WSN. A cluster-based technique is the fundamental
method to improve the scalability, performance, efficiency
and duration of the network.
LEACH, a hierarchical clustering routing protocol, was
proposed by Chandrakasan, Heinzelman and Balakrishnan,
in MIT. Leach is really a protocol that is effectivein
homogenous networks. In a homogenous network, all
nodes have equal quantity of initial energy. Basically there
are two kinds of routing protocols in WSNs: Flat routing
protocols are those in which the routing condition of every
node in the network may be the same. There are no special
nodes in network and each node has equal status. So, the
network traffic is distributed equally among all nodes.
Comparatively, hierarchical routing protocols take
advantage of the idea of clusters that divides all nodes into
groups or clusters. Nodes in this kind of network have
different levels. A CH is selected among all of the nodes
and different hierarchical routing protocols may use
different ways of selecting CHs.
LEACH is really a low energy protocol which could adapt
clustering. It is just a cluster-based protocol that utilizes
the idea of randomized rotation of local cluster-heads and
distributes the power load evenly among most of the
sensor nodes in the sensing field of the network.
3.2 Stable Cluster Head Election (SCHE)
Protocol
It is dependent on LEACH architecture that uses clustering
technique. Its goal is to lessen the power consumption of
every sensor node and thus minimizing the entire energy
dissipation of the network. SCHE is really a source driven
protocol centered on timely reporting. Therefore the sensor
node will always possess some data to transmit to the Base
station. Additionally, it utilizes data aggregation to prevent
information overload.
It gives an analytical framework to attain the stable
probability for a node to be always a cluster-head to
minimize energy consumption. It's necessary to use
suitable CH election mechanism to minimize energy
consumption of every sensor node that ultimately results in
reduced energy dissipation. SCHE was proposed where
this mechanism was applied by acquiring the optimum
value of probability for a node becoming a CH and
consumes considerably less energy in comparison to
LEACH. In addition, it reduces consumption by
minimizing distance between CH and BS.
3.3 Stable Election Protocol (SEP)
There are several drawbacks connected with LEACH such
as for instance: single hop routing can be used where each
node can transmit straight to CH and sink. CHs are elected
randomly. Therefore there's possible that most CHs is
likely to be concentrated in exactly the same area. The idea
of dynamic clustering can be used that leads to
unnecessary overhead as a result of cluster changes. The
protocol also assumes that nodes have quantity of energy
for every node.
But recent protocols like SEP have been opposite to that
particular LEACH because it considers energy
heterogeneity where in actuality the factors mentioned are
simply a possibility. WSNs have assumed homogenous
nodes for all of the time. But these nodes also differ in
initial quantity of energy and also in depletion rate. This
results in the heterogeneous networks where they
considered several kinds of nodes. SEP is proposed for
two-level heterogeneous networks that are two kinds of
nodes according for their initial energy. The nodes which
have higher quantity of energy compared to other nodes
are called advance nodes and other nodes are the standard
nodes.
In SEP the election probabilities of nodes are weighted by
the original energy of each node to end up being the
cluster-head in accordance with other nodes in a network.
This prolongs the timeframe prior to the death of first node
in the system. SEP approach makes sure CH election is
performed randomly and is distributed on the basis of the
energy of every node assuring the uniform usage of the
nodes energy. SEP contains advance nodes that carry more
energy compared to the normal nodes at the start so that it
enhances the stability amount of the network.
3.4 Extended Stable Election Protocol
(ESEP)
It's an altered SEP protocol. Rather than two kinds of
nodes, it considers three nodes based on the energy levels.
These nodes are: normal, moderate and advance nodes.
The target of ESEP is to attain a WSN that maximizes the
network lifetime and stability period. And yes it must
reduce steadily the communication cost and deployment
cost. The operation becoming a CH is just like in SEP by
generating a random number and then comparing it with
the threshold. In ESEP the moderate or intermediate nodes
are selected in two ways either by the relative distance of
advance nodes on track nodes or by the threshold of
vitality between advance nodes and normal nodes.
The weighted election probabilities are given by:
And the total initial energy of heterogeneous network is
given by:
The outcomes reveal that ESEP outperforms SEP and
LEACH when it comes to stability due to three degrees of
heterogeneity. However, a additional energy factor
between advance and normal nodes and b additional
energy factor between advance, normal and moderate
nodes because of three kinds of nodes in ESEP, it's
different energy levels.
4. International Journal of Computer Applications (0975 – 8887)
Volume 119 – No.9, June 2015
20
3.5 Threshold-Sensitive Stable Election
Protocol (TSEP)
The first protocols SEP and ESEP were heterogeneity-
aware protocols that enhance the stability period and
network lifetime but a significant drawback of
heterogeneity is that the increased throughput eventually
decreases the network lifetime. Therefore, to manage the
trade-off involving the efficiency, accuracy and network
lifetime, a new protocol TSEP was proposed. It is just a
reactive routing protocol that senses data continuously
within the network but transmits only when there is a
drastic change in the worthiness of sensed attributes. The
transmission happens only whenever a specific degree of
threshold is reached. It uses three degrees of heterogeneity
by considering three kinds of nodes: normal, intermediate
and advance nodes. The greatest energy nodes are advance
nodes followed closely by intermediate and normal nodes.
The intermediate nodes are selected using a fraction b of
intermediate nodes. The power of intermediate nodes is
assumed to be µtimes significantly more than that of
normal nodes
3.6 Hierarchical Based Stable Election
Protocol (HSEP)
It's the following level protocol that has been proposed
after ESEP. The increasing the distance involving the CH
and the BS results in increasing the transmission energy
because all of the energy is consumed in the transmission
process. HSEP is proposed which aims at reducing the
transmission energy involving the CH and BS. It brings
into account the clustering hierarchy which lowers the
transmission cost and hence the energy. In this kind of
clustering used two kinds of cluster-heads: primary CHs
and secondary CHs.
The secondary CHs could be selected from the principal
CHs and are elected on the foundation of probability from
those nodes which had already end up being the primary
CHs. The principal CHs only can decide the secondary
CHs. They check distance between one another and those
that are in minimum distance from their website are
selected the secondary CHs. Additionally uses advance
nodes and normal nodes. The procedure of selecting the
principal CH is just like in Sep by generating a rando0m
number between 0 and 1 and then comparing it with the
threshold value. These primary CHs then aggregate data
collected from other nodes and transmit it to the secondary
CHs which further send it to the BS. Thus, minimizing the
transmission distance involving the secondary CHs and the
BS results in less use of energy.
Thus HSEP outperforms other protocols since it is
dependent on clustering hierarchy by which CHs are of
two levels. This hierarchical clustering reduces the
transmission distance and hence results in less power
dissipation. Also the stability amount of HSEP is higher
when compared with others.
Thus, energy heterogeneity must certainly be among the
key factors to be viewed when designing a strong protocol
for WSN. The target is to create an altered protocol that's
better quality and can ensure longer network lifetime while
taking performance measures into consideration.
4. PASCCC: PRIORITY-BASED
APPLICATION-SPECIFIC
CONGESTION CONTROL
CLUSTERING PROTOCOL
In this section, reveal description of distributed cluster-
based routing protocol is given. To the most truly effective
of knowledge, PASCCC is the initial protocol of its kind to
consider mobility, heterogeneity, and congestion detection
and mitigation utilizing a bunch hierarchy. Many studies
have addressed congestion detection and mitigation, but
they're either generic or specifically associated with the
transport layer. Following assumptions in regards to the
PASCCC are made:-
1. Nodes are deployed randomly in the field with an
alternative number of energy values.
2. Nodes are designed for adjusting their transmission
capacity to have the ability to reach an extremely distant
CH on top of a specific round.
3. The positioning of a BS isn't fixed and it might be either
within or away from sensor field.
4. Nodes are designed for moving throughout the field to
cover vacant spaces utilizing the random waypoint
mobility model with an interest rate V, where the
worthiness of V ranges between Vmin and Vmax. Hence,
complete coverage of the sensor field is guaranteed.
In PASCCC, the nodes are designed for moving over the
field if necessary to have the ability to cover vacant
regions. Mobility ensures complete coverage and
connectivity at all times. Hence, it's not as likely that a
generated event is going unreported. In PASCCC, 10% of
the nodes are advanced. These nodes have higher energy in
contrast to normal nodes, thereby developing a
heterogeneous amount of nodes in the network. PASCCC
is definitely an application-specific protocol. In scheme,
two application parameters are thought using PASCCC:
temperature and humidity. PASCCC acts as a reactive
protocol for temperature monitoring and as a proactive
protocol for humidity. In reactive routing protocols, the
nodes react immediately to sudden and drastic changes in
the values of sensed events, and they're suitable for time-
critical applications. In proactive routing protocols, the
nodes switch on their transmitters, sense environmental
surroundings, and report captured data periodically to the
BS. These protocols are worthy of applications that need
periodic data transmission.
5. LITERATURE SURVEY
Yi, Sangho et al. [1] proposed a PEACH protocol, which is
really a power-efficient and adaptive clustering hierarchy
protocol for wireless sensor networks. By utilizing
overhearing characteristics of wireless communication,
PEACH forms clusters without additional overhead and
supports adaptive multi-level clustering. Additionally,
PEACH may be used for both location-unaware and
location-aware wireless sensor networks. The simulation
results demonstrate that PEACH significantly minimizes
energy consumption of every node and extends the
network lifetime, in contrast to existing clustering
protocols. The performance of PEACH is less suffering
from the distribution of sensor nodes than other clustering
protocols. Jiang, Chang-Jiang et al. [2] proposed an
energy-balanced unequal clustering (EBUC) protocol.
Utilizing the particle swarm optimization (PSO) algorithm,
5. International Journal of Computer Applications (0975 – 8887)
Volume 119 – No.9, June 2015
21
EBUC partitions all nodes into clusters of unequal size, in
that the clusters nearer to the base station have smaller
size. The cluster heads of those clusters can preserve even
more energy for the inter-cluster relay traffic and the ‘hot-
spots ‘problem could be avoided. For inter-cluster
communication, EBUC adopts an energy-aware multihop
routing to lessen the power use of the cluster heads.
Simulation results demonstrate that the protocol can
efficiently decrease the dead speed of the nodes and
prolong the network lifetime. Bajaber, Fuad, and
IrfanAwan [3] introduced an adaptive clustering protocol
for wireless sensor networks, that is called Adaptive
Decentralized Re-Clustering Protocol (ADRP) for
Wireless Sensor Networks. In ADRP, the cluster heads and
next heads are elected centered on residual energy of every
node and the average energy of every cluster. The
simulation results reveal that ADRP achieves longer
lifetime and more data messages transmissions than
current important clustering protocol in wireless sensor
networks. Khalil, Enan A., and A. AtteaBara'a [4]
reformulated the style of the most crucial characteristic of
the EA in order to obtain a routing protocol that may
provide better quality results than the present heuristic and
meta-heuristic protocols when it comes to network stability
period, lifetime, and energy consumption. An
evolutionary-based routing protocol is proposed, which
could guarantee better tradeoff involving the lifespan and
the stability amount of the network with efficient energy
utilization. To aid this claim, extensive simulations on 90
homogeneous and heterogeneous WSN models are
evaluated and compared from the LEACH, SEP, and one
of many existing evolutionary-based routing protocols,
hierarchical clustering-algorithm-based genetic algorithm
(HCR). Wang, Bang [5] provided a computation method
for the perfect cluster size to minimize the average energy
consumption rate per unit area. In the proposed coverage-
aware clustering protocol, they defined a cost metric that
favors those nodes being more energy-redundantly covered
as better candidates for cluster heads and select active
nodes in ways that tries to emulate the absolute most
efficient tessellation for area coverage. Their simulation
results validate computation and show the significant
improvement of the network coverage lifetime. Robert,
Jean-Marc [6] proposed a novel clustering algorithm and a
relay node selection algorithm on the basis of the residual
vitality and connectivity index of the nodes. This hybrid
model is described as H-OLSR. The OLSR messages are
adapted to deal with the cluster heads election and the
MPR nodes selection algorithms. These algorithms are
made to cope with selfish nodes which are getting
advantages of others without cooperating with them.
Hence, they proposed an incentive compatible mechanism
that motivates nodes to behave truthfully during the choice
and election processes. Incentive retributions raise the
trustworthiness of the nodes. Since network services are
granted based on nodes' accumulated reputation, the nodes
should cooperate. Finally, centered on nodes' reputation,
the absolute most trusted forwarding paths are determined.
This reputation-based hybrid model is known as RH-
OLSR. Simulation results reveal that the novel H-OLSR
model centered on energy and connectivity can efficiently
prolong the network lifetime, as the RH-OLSR model
improves the trustworthiness of the network through the
choice of the very trusted paths centered on nodes'
reputations. They are both different processes used to
define the reputation-based clustering OLSR (RBC-OLSR)
routing protocol. Taheri, Hoda et al. [7] proposed an
energy-aware distributed dynamic clustering protocol
(ECPF) which applies three techniques: non-probabilistic
cluster head (CH) elections, fuzzy logic, and on demand
clustering. The residual energy of the nodes is the
principal parameter for electing tentative CHs using a non-
probabilistic fashion. A non-probabilistic CH election is
implemented by introducing a delay inversely proportional
to the rest of the energy of every node. Therefore, tentative
CHs are selected based on the remaining energy.
Additionally, fuzzy logic is employed to evaluate the
fitness (cost) of a node to be able to choose a final CH
from the group of neighboring tentative CHs. On another
hand, every regular (non CH) node elects for connecting to
the CH with the smallest amount of fuzzy cost in its
neighborhood. Besides, in ECPF, CH elections are
performed sporadically (in contrast to performing it every
round). Simulation results demonstrate that their approach
performs a lot better than well-known protocols (LEACH,
HEED, and CHEF) when it comes to extending network
lifetime and saving energy. Tyagi, Sudhanshu, and Neeraj
Kumar [8] provided the taxonomy of numerous clustering
and routing techniques in WSNs based on metrics such as
for instance power management, energy management,
network lifetime, optimal cluster head selection, multihop
data transmission etc. An extensive discussion is provided
in the text highlighting the relative advantages and
disadvantages of most of the prominent proposals in this
category which supports the designers to choose} a
specific proposal based on its merits within the others.
Wang, Sheng-Shih, and Yi-Shiun Lin [9] proposed an
inactive clustering aided routing protocol, named
PassCAR, to improve routing performance in the one-way
multi-lane highway scenario. The key goal of PassCAR is
to find out suitable participants for constructing a well-
balanced and reliable cluster structure throughout the route
discovery phase. Each candidate node self-determines its
priority to compete for a participant utilizing the proposed
multi-metric election strategy centered on metrics such as
for instance node degree, expected transmission count, and
link lifetime. Simulation results reveal that, in contrast to
the initial PC mechanism, PassCAR not just advances the
successful possibility of route discovery, but additionally
selects more desirable nodes to take part in the created
cluster structure. This well-constructed cluster structure
significantly improves the packet delivery ratio and
achieves an increased network throughput because of its
preference for reliable, stable, and durable routing paths.
Gu, Xin et al. [10] proposed the ECDC (Energy and
Coverage-aware Distributed Clustering Protocol), a built-
in protocol involving both energy and coverage, which can
be distinctive from previous clustering protocols. For
different practical applications, they designed
corresponding coverage importance metrics and introduce
them in to the clustering algorithm. Theoretical analysis
and simulation results reveal that their protocol works well
in improving network coverage performance, reducing
nodes energy dissipation and extending the network
lifetime. Akkari, Nadine et al. [11] proposed a new
dynamic protocol for clustering the nodes considering the
possible changes occurring in a cellular network.
Specifically, the Dynamic Clustering Protocol (DCP)
adapts the network configuration with the variable
mobiles׳ requirements and the various network events.
This can reduce steadily the needed time and signaling and
offers better service quality for the clustered users. After
presenting the different network events, the handover
scenarios and signaling for the Dynamic
6. International Journal of Computer Applications (0975 – 8887)
Volume 119 – No.9, June 2015
22
Clustering Protocol, the performance of the proposed
protocol is studied. This is accomplished by modeling
different network scenarios and computing the necessary
quantity of handovers as a function of user mobility,
available network resources and data rate requirements for
confirmed clustered nodes configuration. Xia, Feng et al.
[12] proposed a new clustering protocol, namely BeeCup,
to truly save the power of cellular devices while
guaranteeing the quality of learning. The BeeCup protocol
takes benefit of biologically-inspired computation, with
concentrate on improving the power efficiency of mobile
devices. It first estimates how many cluster heads (CHs)
adaptively based on the network scale, and then selects the
CHs by employing the ABC algorithm. Just in case some
CHs consume energy excessively, clusters will soon be
dynamically updated to help keep energy consumption
balanced within the complete network. Simulation results
demonstrated the effectiveness and superiority of the
proposed protocol Mirsadeghi, Maryam et al. [13]
proposed a new distributed clustering approach using
fuzzy logic. It uses Fuzzy logic to assign CH selection
opportunity to network nodes to be able to choose tentative
and final CHs. simulation results demonstrate that their
approach reachs to higher network lifetime, energy
efficiency and network coverage when comparing to
UCFIA, GCA, and SCP. Jan, Mian Ahmad et al.
[14] proposed a priority-based application-specific
congestion control clustering (PASCCC) protocol, which
integrates the mobility and heterogeneity of the nodes to
detect congestion in a network. PASCCC decreases the
work cycle of every node by maintaining threshold levels
for various applications. The transmitter of a sensor node
is triggered once the reading of a particular captured event
exceeds a particular threshold level. Time-critical packets
are prioritized during congestion to be able to maintain
their timeliness requirements. Within their proposed
approach, CHs ensure coverage fidelity by prioritizing the
packets of distant nodes over those of nearby nodes. A
novel queue scheduling mechanism is proposed for CHs to
accomplish coverage fidelity, which ensures that the
additional resources consumed by distant nodes are
utilized effectively. The potency of PASCCC was
evaluated centered on comparisons with existing clustering
protocols. The experimental results demonstrated that
PASCCC achieved better performance when it comes to
the network lifetime, energy consumption, data
transmission, and other QoS metrics in contrast to existing
approaches. Elhabyan, Riham SY, and Mustapha CE
Yagoub [15] presented two Linear Programming (LP)
formulations to the issues of clustering and routing
followed closely by two proposed algorithms for exactly
the same centered on Particle Swarm Optimization (PSO).
The clustering algorithm finds the perfect group of CHs
that maximize the energy efficiency, cluster quality and
network coverage. The routing algorithm is developed
with a novel particle encoding scheme and fitness function
to obtain the optimal routing tree that connects these CHs
to the BS. Those two algorithms are then combined right
into a two-tier protocol to supply an entire and practical
clustering model. The aftereffect of employing a realistic
network and energy consumption model in cluster-based
communication for WSN is likely to be investigated.
Extensive simulations on 50 homogeneous and
heterogeneous WSN models are evaluated and compared
against well-known cluster-based sensor network
protocols. The outcomes demonstrate that the proposed
protocol performs much better than such protocols when it
comes to various performance metrics such as for instance
scalability, Packet Delivery Rate (PDR) at the CHs and
delivery of total data packets to the BS. Sert, Seyyit et al.
[16] introduced a new clustering approach that will be not
just energy-efficient but additionally distribution-
independent for wireless sensor networks (WSNs).
Clustering can be used as a method of efficient data
gathering technique with regards to energy consumption.
In clustered networks, each node transmits acquired data to
a cluster-head which the nodes belong to. Following a
cluster-head collects all the information from all member
nodes, it transmits the information to the base station
(sink) either in a compressed or uncompressed manner.
This data transmission occurs via other cluster-heads in a
multi-hop network environment. Consequently of this
case, cluster-heads near to the sink have a tendency to die
earlier due to the heavy inter-cluster relay. This issue is
named because the hotspots problem. To resolve this issue,
some unequal clustering approaches have previously been
introduced in the literature. Unequal clustering techniques
generate clusters in smaller sizes when approaching the
sink to be able to decrease intra-cluster relay. Along with
the hotspots problem, the energy hole problem might also
occur due to the changes in the node deployment locations.
Although numerous previous studies have centered on
energy-efficiency in clustering, to the very best of
knowledge, none considers both problems in uniformly
and non-uniformly distributed networks. Therefore, they
proposed a multi-objective solution for these problems. In
this study, they introduced a multi-objective fuzzy
clustering algorithm (MOFCA) that addresses both
hotspots and energy hole problems in stationary and
evolving networks. Performance analysis and evaluations
are completed with popular clustering algorithms and
obtained experimental results reveal that MOFCA
outperforms the present algorithms in exactly the same
setup when it comes to efficiency metrics, which are First
Node Dies (FND), half the Nodes Alive (HNA), and Total
Remaining Energy (TRE) employed for estimating the
duration of the WSNs and efficiency of protocols. Peng,
Shuai et al. [17] proposed distributive Energy Neutral
Clustering (ENC) protocol to group the network into
several clusters, with the target of providing perpetual
network operation. ENC employs a novel Cluster Head
Group (CHG) mechanism which allows a cluster to utilize
multiple cluster heads to generally share heavy traffic
load. This CHG mechanism will help reduce steadily the
frequency of cluster re-formations, which reduces the
control message overhead. The optimum quantity of
clusters that maximizes the quantity of information
gathered from the network is mathematically derived using
convex optimization techniques. Based with this optimum
quantity of clusters, an expansion to ENC is proposed to
group the network into equal sized clusters to ensure that
maximized network information gathering may be
achieved. Extensive empirical studies reveal that their
proposed protocol can successfully prevent sensors from
turning off because of the excessive usage of energy,
which provides perpetual network operation with
consistent data delivery. Substantial improvements on the
quantity of information gathered from the network may
also be attained by utilizing their proposed protocol when
compared with traditional clustering protocols. Zhu, Jiang
et al. [18] proposed a hybrid clustering protocol – Hybrid
Distributed Hierarchical Agglomerative Clustering (H-
DHAC) – which uses both quantitative location data and
binary qualitative connectivity data in clustering for
7. International Journal of Computer Applications (0975 – 8887)
Volume 119 – No.9, June 2015
23
WSNs. Their simulation results demonstrate that H-DHAC
only includes a slightly lower percentage of compromise in
performance when it comes to network lifetime and total
transmitted data in comparison to similar approaches that
use complete location data. However, H-DHAC still
outperforms the well-known clustering protocols, e.g.,
LEACH and LEACH-C. On another hand, the cost of H-
DHAC could be significantly lower compared to those
approaches that use complete quantitative location data, as
GPS isn't required for several sensor nodes. Additionally,
H-DHAC still could be operational in the clear presence of
GPS failures. Gielow, Fernando et al. [19] proposed
architecture for dynamic and distributed data-aware
clustering, and the Dynamic Data-aware Firefly-based
Clustering (DDFC) protocol to deal with spatial similarity
between node readings. The DDFC operation takes into
consideration the biological principles of fireflies to make
sure distributed synchronization of the clusters' similar
readings aggregations. DDFC was in comparison to other
protocols and the outcomes demonstrated its convenience
of maintaining synchronized cluster readings aggregations,
thereby enabling nodes to be dynamically clustered
according with their readings.
6. CONCLUSION AND FUTURE
SCOPE
In this study, we present an extensive survey of different
clustering routing protocols proposed in recent years.
Clustering is a great technique to lessen energy
consumption and to supply stability in wireless sensor
networks. From the survey it's been figured none of the
technique performs effectively in most fields. Therefore in
for seeable future, improvement can be carried out to boost
the results.
7. REFERENCES
[1] Yi, Sangho, JunyoungHeo, Yookun Cho, and Jiman
Hong. "PEACH: Power-efficient and adaptive
clustering hierarchy protocol for wireless sensor
networks." Computer communications 30, no. 14
(2007): 2842-2852.
[2] Jiang, Chang-Jiang, Wei-Ren Shi, and Xian-lun
TANG. "Energy-balanced unequal clustering protocol
for wireless sensor networks." The Journal of China
Universities of Posts and Telecommunications 17, no.
4 (2010): 94-99.
[3] Bajaber, Fuad, and IrfanAwan. "Adaptive
decentralized re-clustering protocol for wireless
sensor networks." Journal of Computer and System
Sciences 77, no. 2 (2011): 282-292.
[4] Khalil, Enan A., and A. AtteaBara’a. "Energy-aware
evolutionary routing protocol for dynamic clustering
of wireless sensor networks." Swarm and
Evolutionary Computation 1, no. 4 (2011): 195-203.
[5] Wang, Bang, Hock Beng Lim, and Di Ma. "A
coverage-aware clustering protocol for wireless
sensor networks." Computer Networks 56, no. 5
(2012): 1599-1611.
[6] Robert, Jean-Marc, HadiOtrok, and
AbdelkarimChriqi. "RBC-OLSR: Reputation-based
clustering OLSR protocol for wireless ad hoc
networks."Computer Communications 35, no. 4
(2012): 487-499.
[7] Taheri, Hoda, PeymanNeamatollahi, Ossama
Mohamed Younis, ShahrzadNaghibzadeh, and
Mohammad HosseinYaghmaee. "An energy-aware
distributed clustering protocol in wireless sensor
networks using fuzzy logic." Ad Hoc Networks 10,
no. 7 (2012): 1469-1481.
[8] Tyagi, Sudhanshu, and Neeraj Kumar. "A systematic
review on clustering and routing techniques based
upon LEACH protocol for wireless sensor
networks."Journal of Network and Computer
Applications 36, no. 2 (2013): 623-645.
[9] Wang, Sheng-Shih, and Yi-Shiun Lin. "PassCAR: A
passive clustering aided routing protocol for vehicular
ad hoc networks." Computer Communications 36, no.
2 (2013): 170-179.
[10] Gu, Xin, Jiguo Yu, Dongxiao Yu, Guanghui Wang,
and Yuhua Lv. "ECDC: An energy and coverage-
aware distributed clustering protocol for wireless
sensor networks." Computers & Electrical
Engineering 40, no. 2 (2014): 384-398.
[11] Akkari, Nadine, GhadahAldabbagh, Michel Nahas,
and John Cioffi. "Dynamic Clustering Protocol for
coordinated tethering over cellular networks." Journal
of Network and Computer Applications 42 (2014): 92-
101.
[12] Xia, Feng, Xuhai Zhao, Jianhui Zhang, Jianhua Ma,
and Xiangjie Kong. "BeeCup: A bio-inspired energy-
efficient clustering protocol for mobile
learning."Future Generation Computer Systems 37
(2014): 449-460.
[13] Mirsadeghi, Maryam, Ali Mahani, and Maryam
Shojaee. "A Novel distributed Clustering Protocol
using fuzzy logic." Procedia Technology 17 (2014):
742-748.
[14] Jan, Mian Ahmad, Priyadarsi Nanda, Xiangjian He,
and Ren Ping Liu. "PASCCC: Priority-based
application-specific congestion control clustering
protocol." Computer Networks 74 (2014): 92-102.
[15] Elhabyan, Riham SY, and Mustapha CE Yagoub.
"Two-tier particle swarm optimization protocol for
clustering and routing in wireless sensor
network."Journal of Network and Computer
Applications 52 (2015): 116-128.
[16] Sert, SeyyitAlper, HakanBagci, and Adnan Yazici.
"MOFCA: Multi-objective fuzzy clustering algorithm
for wireless sensor networks." Applied Soft
Computing 30 (2015): 151-165.
[17] Peng, Shuai, T. Wang, and C. P. Low. "Energy
Neutral Clustering for Energy Harvesting Wireless
Sensors Networks." Ad Hoc Networks (2015).
[18] Zhu, Jiang, Chung-Horng Lung, and
VineetSrivastava. "A hybrid clustering technique
using quantitative and qualitative data for wireless
sensor networks."Ad Hoc Networks 25 (2015): 38-53.
[19] Gielow, Fernando, Gentian Jakllari, Michele
Nogueira, and Aldri Santos. "Data similarity aware
dynamic node clustering in wireless sensor
networks." Ad Hoc Networks 24 (2015): 29-45.
IJCATM : www.ijcaonline.org