Professional Documents
Culture Documents
Important IJCNIS-V8-N6-5
Important IJCNIS-V8-N6-5
Important IJCNIS-V8-N6-5
Abstract—Increased demand of Wireless Sensor Sensor networks work in a wide range of applications
Networks (WSN) in various applications has made it a like military, surveillance, health monitoring etc.
hot research area. Several challenges imposed which Depending upon the application, they can be deployed in
include energy conservation, scalability, limited network deterministic or a random manner. Some applications are
resources etc. with energy conservation being the most used in hostile environments and nodes are deployed in
important. Clustering improves the energy efficiency by these environments in an uncontrolled manner and it is
making high power nodes as cluster heads (CHs) which not possible to change the battery of nodes in these
reduces the chance of energy depletion of nodes. environments. So in case of random deployment nodes
Scalability, fault tolerance, data aggregation, energy have to reconfigure themselves and large number of
efficiency are some of the main objectives of clustering. nodes may be deployed to overcome battery issues. In
This paper discusses various challenges associated with other applications where deterministic deployment is
clustering and different methods or techniques developed possible, position and placement of nodes is determined
to overcome these challenges. Various clustering prior to deployment in a controlled manner. Node
approaches have been summarized and few prominent placement is a very important step and proper node
Quality of service (QoS) based clustering routing placement can result in more energy efficient solutions.
protocols for WSN have been identified. Comparison of Different strategies for node placement are discussed in
these approaches and protocols is discussed based on [1]. After deployment, coverage and connectivity are
some parameters. important issues to be considered, so proper coverage
depending upon the application should be maximized and
Index Terms—Wireless sensor networks (WSN), Quality connectivity should be maintained. Different methods and
of service (QoS), Clustering, Routing protocols. issues related to coverage are discussed in [2, 3]. As a
sensor network is used in hostile environment, energy
conservation becomes an important issue and scalability
I. INTRODUCTION problem also arises. Use of clustering overcomes these
issues by incorporating network aggregation and
The ability of Wireless Sensor Networks (WSN) to processing which further reduces amount of data to be
detect and observe any physical phenomenon has made sent and overcomes several challenges related to resource
them very popular in today’s era. The low power devices constrained nature of WSN.
called sensor nodes collaborate to perform any given task WSN suffers from many challenges that include
and constitute a network called a sensor network. The resource constraints, operation in harsh environments,
nodes are equipped with sensing and processing data redundancy, scalability, energy conservation,
capabilities and they sense any physical phenomenon wireless channel, lack of global identification, node
such as temperature, pressure etc. and send this data to a failures, in-network processing, fault tolerance etc.
base station (BS) or sink using single hop or multi hop Efficient use of resources can overcome the problem of
communication. Multi hop communication is preferred resource constraints. In harsh environments it is not
over single hop as it reduces energy consumption. WSN possible to change the battery of nodes. Energy
is quite different from traditional adhoc and wired conservation becomes important issue that can be
networks in terms of low energy, limited resources and overcome by adaptive network operation. Large amount
their applications. The protocols and algorithms of data is involved in WSN as nodes sense same physical
developed for these networks cannot be directly applied phenomenon in same region that leads to huge
to WSN. Researchers need to consider energy and redundancy that can be minimized by in-network
resource constrained nature of WSN while designing processing, data aggregation and data fusion techniques.
protocols. This in-network processing requires efficient hardware
and algorithms designed considering constrained nature
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
Clustering in Wireless Sensor Networks- A Survey 39
of WSNs. Design of different processing and (BLE) overcomes the limitations of Bluetooth for WSN
compression algorithms for WSN is an important area of in terms of reduced power consumption, long battery life
research in multimedia sensor networks. Sensor networks and reduced cost but maintains a similar communication
consist of large number of nodes where it is not possible range.
to assign the global identification (GID). Positioning It finds its applications in healthcare, sports and fitness,
system consisting of GPS can be used to provide location security, and home entertainment, etc. For residential,
of nodes but this further increases cost, so data centric light commercial environments and home automation
algorithms need to be used. Scalability is also of applications, Z-WAVE is the promising technology. For
important consideration in large scale network home automation, it can be used for fire alarms,
application and as number of nodes increases; network controlling light, detecting gas and flood [2]. WAVENIS
should maintain its performance. is ultra-low power, long range communication technology
Low power, low data rate, and low-cost wireless sensor developed by coronis systems. It has long battery life and
communication is handled by different technologies. provides reliable transmissions. It is used in
Choice of particular technology depends upon application. environmental, agriculture, industry, building, biological,
IEEE 802.15.4 is used for applications requiring short chemical and healthcare applications. EnOcean is an
range communication. Zigbee, 6LoWPAN, Wireless emerging WSN technology that is promoted by EnOcean
HART are different standards of 802.15.4 for WSN. Alliance [53]. It uses energy harvesting wireless
Zigbee [51] is typically used in low data rate applications technology that draws energy from surroundings and uses
that require long battery life and secure networking that that energy electrically. It is best used in buildings and
provides reliability and interoperability. 6LoWPAN [50] industrial automation.
refers to IPv6 over Low power Wireless Personal Area The rest of the paper is organized as follows. Section II
Networks and enables IPv6 communication over IEEE explains the clustering process in WSN followed by
802.15.4 links and assures interoperability with other IP literature survey. Different clustering algorithms
devices. Wireless HART operates in 2.4GHz ISM band categorized on basis clustering parameters are discussed
using IEEE 802.15.4 standard radios and is used for in Section IV along with the comparative analysis of
industrial and control applications and provides reliability, different algorithms. Section V discussed various
security, energy efficiency and also provides Clustering based QoS routing protocols and a comparison
compatibility with existing devices. Bluetooth low energy has been made based on these parameters.
Power
Frequency Data rate Range Applications
consumption
Wireless 2400-2483.5
250 Kbps 1-100 m Low Industry automation
HART MHz
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
40 Clustering in Wireless Sensor Networks- A Survey
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
Clustering in Wireless Sensor Networks- A Survey 41
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
42 Clustering in Wireless Sensor Networks- A Survey
algorithms. Centralized clustering is performed by one themselves and based on that information, the cluster
single authority, sink or BS but in case of distributed each head selection decision is taken. This decision can be
and every node has capability to select a CH. based on several parameters like a weighted metric is
used which may include residual energy, SNR or several
B.1 Centralized Method
other parameters. Nodes exchange these parameters and
A centralized method evolves the sink or CH to acquire one having maximum value is selected as CH. Distributed
global information and the decisions regarding any approach is considered more efficient then centralized as
change in network is taken by CH or sink. The clustering amount of information transfers that takes place between
process is controlled by the central authority, base station sink and nodes are reduced and as nodes themselves take
(BS) or sink. Information regarding nodes is sent to BS decision regarding clustering approach, scalability is
and based on that information clusters are formed. This enhanced.
central authority is high energy device which performs Low Energy Adaptive Clustering Hierarchy (LEACH)
energy intensive tasks. Some of algorithms belonging to [10] is the first clustering protocol developed for WSNs.
this category are discussed below: It is a hierarchical protocol where communication is done
LEACH-C [5] is similar to LEACH [10] in set-up and at one hop and CH is responsible for data aggregation and
steady-phase but differs in choosing a CH. In LEACH-C, routing process. Algorithm proceeds in two steps i.e.
during steady phase all the nodes send their energy setup phase and steady phase. During setup phase, node
information to BS and based on that information CH is decides whether to become a cluster head or not based on
selected. Load balancing is also taken into account in the two conditions viz. how many times a node has been
clustering process. After finding cluster heads, sink selected as CH and number of CHs. For CH selection
broadcast cluster ID’s. Nodes compare their ID with the each node chooses a random number between 0 and 1. A
ID obtained, if it does not match then node determine its node is chosen as CH if number is less than the following
TDMA slot and go to sleep mode until its next threshold:
transmission. This approach leads to more energy
consumption as most of the energy is consumed on Base
Station. ( ) { ( ) (1)
Energy Efficiency Load-Balancing clustering (EELBC)
[6] provides both energy efficiency and load balancing.
Sensor nodes are assumed to know their position via P is the desired percentage of CHs, r is the current
gateway by broadcasting their IDs and location to the round, and G is the set of nodes that have not been
gateways and based on that, the distance from node to elected CHs in the last 1/P rounds. After a node is
gateway is calculated. Sink is responsible for overall elected a CH it broadcasts its status to other nodes. Nodes
operation and assign sensor nodes to their respective determine to which CH they should attach themselves
gateways. Min-heap is used on the number of allotted based on distance criteria. CH waits for join request
sensor nodes to the gateway. Root node of min heap is messages and after nodes join, it sends a TDMA schedule
gateway and the nearest node to gateway is assigned first. to Cluster members and data transmission takes place.
Min-heap is adjusted so that minimum loaded gateway is Energy efficient heterogeneous clustered scheme for
at root. Comparison has been carried out with Gateway wireless sensor networks is used for heterogeneous nodes
Load Balancing Protocol (GLBP) and Load Balancing where sensor nodes are divided into two categories, one
Cluster (LBC) and EELBC shows better results than having high energy and other with limited energy called
GLBP and LBC in terms of Energy consumption, Load normal nodes. As in LEACH based on probability
balancing and execution time. function any node can become CH which will lead to
Centralized approaches are not well suited for a large faster depletion of energy, in EEHC nodes having more
scale network. Moreover, nodes near the central authority energy are selected as CH’s. Decision is based on weight
will deplete their energy faster as huge amount of data which is obtained by dividing initial energy of each node
transfer takes place between nodes and sink. Unequal by initial energy of normal node. Weighted probabilities
clustering should be preferred in this approach; size of are found and based on that CH’s are elected. Compared
clusters near the BS should be small so that energy can be to LEACH it improves the lifetime and performance of
conserved. the network [12].
Linked Cluster Algorithm (LCA) [13] developed for a
Other protocols include “A Regional Centralized wired network is also applicable for WSN. To acquire
Clustering Routing Algorithm for Wireless Sensor information about all nodes in the network, 2n time slots
Networks” [7],“Multiple Sink Network design problem in are required where n is number of nodes in the network.
large scale wireless sensor networks (MSNDP)” [8] and Nodes exchange information with each other and based
“Energy efficient Dynamic Clustering (EEDC)” [11]. on that information, CH is chosen if it has highest ID
number or if node does not find any CH within its range.
Communication is done using TDMA scheduling to avoid
B.2 Distributed Algorithms collisions. LCA was designed for small scale networks
Distributed algorithms aims at assigning each node in and delay was within acceptable range but if used for
the network capability to select a CH based on several large networks it imposes more delay.
parameters. Nodes exchange information among
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
Clustering in Wireless Sensor Networks- A Survey 43
Power-efficient and adaptive clustering hierarchy node broadcast CH-search process to elect new CH.
protocol for wireless sensor networks (PEACH) is a Compared with LEACH this protocol gives better results
distributed protocol that consists of homogeneous nodes in terms of end-to-end delay, packet delivery ratio and
having various transmission power levels. It supports energy consumption. This protocol works well for large
both location aware and location unaware protocols for scale wireless sensor networks [19].
WSNs. Cluster formation process is different from other Random Competition based Clustering (RCC) [20] was
protocols as it does not include overhead of announcing earlier developed for mobile ad-hoc networks but later on
CHs, joining clusters, scheduling intra-cluster applied to WSN. This is based on First Declaration Wins
communication [43]. Cluster set is chosen from node set rule in which node broadcast itself as CH. If it is the first
and chosen CH waits to gather multiple packets from node to broadcast, neighbor nodes join that node and
other nodes in cluster set. After, CH transmits the declare it as their CH. But conflict arises when number of
aggregated packet to next hop. Compared to other nodes broadcast at same time. To avoid this situation, a
protocols it has improved energy consumption and better timer is employed or node having lower ID is chosen
network lifetime. during conflict.
Energy Efficient Hybrid multi-hop Clustering
Other examples of distributed protocols include an algorithm in wireless sensor networks (EEHMCS) [21]
“Energy-efficient multi-level clustering algorithm for follows centralized approach for all CH set-up decisions
large-scale wireless sensor networks (EEMC)” [14], that are executed at the BS. Other decisions such as
“Time controlled Clustering algorithm (TCCA)” cluster formation relay node selection and data
[15],“Hybrid Energy Efficient Distributed Clustering” transmission are taken by sensors following distributed
[16], “Distributed Weight-based Energy-efficient approach. If the BS lies within sensing range, then single
Hierarchical Clustering protocol (DWEHC)” [17], hop communication is used, otherwise multi-hop
“Algorithm for cluster establishment (ACE)” [18]. communication is used to reach to the BS. After CH is
selected, it broadcasts an advertisement message to all its
neighbors and nodes join particular cluster based on the
B.3 Hybrid Algorithms
signal power received. A TDMA schedule is created for
Hybrid algorithms use combination of distributed and nodes and data is transmitted. This protocol uses both
centralized approaches. Some of the hybrid algorithms centralized and distributed approach which increases its
developed for clustering in WSN is discussed below: efficiency. Compared with LEACH, A-LEACH,
Grid-clustering Routing Protocol for Wireless Sensor LEACH-C, EEHC and EEHMCS show better
Networks (GROUP) is a hybrid protocol that includes performance in terms of network lifetime.
grid based structure build dynamically and randomly by
sink and CH selection process is done by small number of Other protocols belonging to this category are
sensor nodes. This protocol is designed for query based “Hybrid Clustering Technique using Quantitative and
applications, like forest monitoring. Queries generated by Qualitative data for Wireless Sensor Networks” [24], “A
sink are forwarded to nodes via CH’s and the node which Hybrid Cluster based target tracking protocol for
has data matching to the query route back to sink via Wireless Sensor Networks(HCTT)” [25], “HCMTT:
CH’s. Protocol works in four phases, Cluster Grid Hybrid Clustering for Multi-Target Tracking in Wireless
construction, Query forwarding, Data forwarding and Sensor Networks” [42].
Failure recovery. In cluster grid construction one sink that
is located in centre of Grid is selected as Primary Sink
C. Algorithm Type
(PS). PS elects one node as Grid Seed (GS) by initiating
the clustering process by sending GS-electing command Algorithm type describes the method of clustering
within its range. All nodes which receive this command process. It can be probabilistic or non-probabilistic. In
compare their distance with PS and if found appropriate probabilistic, CH selection process takes place based on
send GS-reply packet to PS. PS then based on residual some probability value assigned to sensor nodes. Non-
energy select one node as CH having maximum value of probabilistic approaches select CH based on the
residual energy. GS is located at one crossing point of information received from other nodes. The details of
cluster grid structure and the node which is located near some of algorithms based on algorithm type are discussed
this point is elected as CH. CH election is initiated by GS below:
by broadcasting CH-election packet to its neighbor and
C.1 Probabilistic (Random or Hybrid) Clustering
based on distance criteria one node is selected as CH.
Algorithms
Query forwarding is done by broadcast and unicast
communication. Location unaware queries are forwarded In case of probabilistic algorithm, a probability value is
to the closest neighbor of sink which then broadcasts it assigned before clustering process takes place. Each node
and location aware queries are forwarded using unicast assigns its role by itself and based on some probability
communication. criterion a CH is selected. Other criteria like selecting a
After receiving query, if it matches with sensor data it CH based on some metric like residual energy,
is forwarded to sink via CH’s. If any CH fails which can communication cost is also considered in these methods.
impact the query and data forwarding process, sensor Some use combination of metrics known as combined
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
44 Clustering in Wireless Sensor Networks- A Survey
weight criteria for efficient selection of CH. These selected as Primary CH and secondary CH, after
criteria lead us to faster execution time and reduced receiving a message from the sink node compare its ID
volume of exchanged messages. Probabilistic algorithms with the ID in message, if matched they discover
or protocols aim at achieving high energy efficiency and themselves as CH and send invitation messages within
prolonged network lifetime. A survey of different their own radius so that nodes within their range associate
probabilistic protocols is presented below: with that CH. TDMA schedule is determined by CH and
Hybrid Energy-Efficient Distributed Clustering (HEED) data is sent using multi-hop communication. Compared to
is a clustering protocol that overcomes the drawbacks of LEACH and HEED, EEHCA performs better in terms of
LEACH. It considers residual energy of nodes for network lifetime.
selection of CH which overcomes the possibility of
selecting low energy node as CH. Along with residual Some other examples of probabilistic algorithm are
energy it also considers intra cluster communication cost LEACH [10], “A Configurable Time-Controlled
which result in even distribution of nodes in the network. Clustering Algorithm for Wireless Sensor Networks” [44],
Probability that two nearby nodes become a CH is very and “Energy Residue Aware (ERA)”, “Clustering
small in HEED. For choosing a CH probability is Algorithm for Leach-based Wireless Sensor Networks”
calculated as [28].
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
Clustering in Wireless Sensor Networks- A Survey 45
Node sends two clustering packets with power high and ∑ (3)
power low. Power low signal for normal nodes and power
high for participating nodes, after receiving signal it adds
sender ID to its neighboring list. If both lists contain same is residual energy in node s, is initial
ID they are already connected otherwise node waits for energy of all nodes, R is the cluster range and d is the
some time and become a CH. A Mesh tree is created for distance from node s to neighboring node u. It forms a
routing. Packet is broadcast from sink node, and route fix multi-level hierarchy. A node having highest weight
packets are used for routing which identifies next hop and becomes CH and all other nodes become member nodes.
the previous hop from where data is received. CHs are Member nodes operate at level one and communicate
classified into relay nodes, end nodes and adjoin nodes. directly with CH. Nodes evaluate whether it reaches to
Relay node transfer data from source to destination. CH in one hop or it can traverse multiple hops that can
When a node receives route packet from a node not result in energy efficiency. If it can go through multi hops
intended to be its source it changes its parent to the same it become h-level member otherwise stays at 1 level.
node and end node is which does not receive any flooding Member nodes should stay in particular range of CH and
packet during a specified time interval. Transmission send their data to parent node which performs data
timing control is achieved by using packet high for inter- aggregation and sending the data to CH using TDMA
cluster communication and packet low for intra-cluster scheme. CH transmits data to BS in single hop [17].
communication. CH receives and binds the data packet Simulation results for HEED and GC (Generic Clustering
and makes large packets. In round two, relay nodes send based on residual energy) show better performance in
data only when it exceeds buffer length. A Graph-Center terms of throughput and network lifetime [31].
Based Scheme for Energy-Efficient Data Collection in Weight Based Clustering in Heterogeneous wireless
Wireless Sensor Networks approach is based on concept sensor Networks (WBCHN) [45] protocol selects CH
of center of graph. Network is modeled as a graph and based on residual energy, number of alive neighbors of
link (u, v) belongs to E only if u, v are in range of each sensor node and its distance to BS. Residual energy is
other. Isolated sensors are not considered in this approach calculated based on average energy of nodes. If energy
to maintain connectivity. Eccentricities and centers are falls below certain threshold, CH selection process starts
calculated and node at center is chosen to be BS as this again. After end of each round, nodes send alive
node is equidistant to all other nodes. CH's are selected messages that determines number of alive neighbors.
that collects data from sensor nodes and transmit it to Compared to HEED and GC, WBCHN utilizes better
central node (BS). As network scales more number of BS heterogeneity in energy and has improved stability period.
can be added in the network. This approach requires more In Distributed Weight-based Clustering Algorithm for
enhancement as it does not include issue of energy WSNs, a sensor node selects itself as a cluster head based
balancing and a simple communication model is used in on the its’ own resource, such as residual energy level,
this approach [48]. degree and local resource, such as neighbors’ energy
level, the sum of the distances between itself and each
Some other algorithms belonging to this category are neighbor and the distance to the BS [47]. Based on
GROUP [19], “A Formal Graph-Based Model Applied to received signal strength, node finds its distance to BS and
Cluster Communication in Wireless Sensor Networks” finds neighboring nodes within its transmission range.
[49]. Based on information received from other nodes,
weighted metric of above parameters is computed and
nodes with minimum weight are selected as CH. CDMA
b) Weight based Clustering
based communication is used in this protocol. Compared
These involve combination of metrics like residual with LEACH and LEACH-C in terms of energy
energy, transmission range, SNR, etc. known as weighted consumption during CH formation, this algorithm
metrics. Node having high cost is selected as CH. consumes more energy than LEACH but less energy than
Combining these metrics improves performance and LEACH-C.
increases energy efficiency like selecting residual energy
leads to a CH with more energy than member nodes and Some other weight based protocols include, “QoS
will not lead to depletion of energy. Weight based Based and Energy Aware and Multi-path Hierarchical
schemes increase throughput by electing better CH’s in a (QEMH”) [35], “Energy Aware QoS routing protocol
proficient manner. Some weight based metrics use (EAQoS)” [36], “Stable Election Protocol (SEP”),
centralized and some use distributed approach. Some of "Multi-weight Based Clustering Algorithm (MWBCA)”
the algorithms are discussed below: [46].
Distributed Weight-based Energy-efficient
Hierarchical Clustering protocol (DWEHC) is a
c) Biologically Inspired Clustering Approaches
distributed clustering algorithm similar to HEED. It also
considers residual energy as in HEED but differs in These approaches are based on design paradigms
cluster sizes and uses location awareness in intra cluster developed from biologically inspired phenomena. Several
topology. Each node calculates its weight as follows: biologically inspired approaches have been proposed.
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
46 Clustering in Wireless Sensor Networks- A Survey
One of them is Ant Colony optimization. In this approach ants deposit their pheromone when they search for food.
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
Clustering in Wireless Sensor Networks- A Survey 47
application requirements, QoS parameters are chosen and Energy Aware and Multi-path Hierarchical protocol
network is designed such that it satisfies QoS (QEMH) is energy aware clustering based protocol that
requirements. considers residual energy and node’s distance to sink for
Quality of Service is mainly required in real time choosing cluster heads. Current Energy (CE) is obtained
applications and these applications employ several by following equation
challenges at network and MAC layer, they consist of
real and non-real time data so traffic differentiation is ( )
very important to achieve better performance. In some (4)
()
( ( ))
cases real time data utilize most of the bandwidth leaving
non real time with a very few resources. So efficient
utilization of bandwidth should be provided to both types ( ) is the current residual energy of node j and
of data with priority given to real time data. Depending
upon the application, criticality of packet is identified and distance (j) is calculated as
priority is assigned so that QoS mechanisms should
differentiate packet importance and set up priority () (∑(| () ( )|) ) (5)
structure. In [23] authors proposed a protocol in which
least cost delay constrained path is found for real time Here, is node distance to sink. We also assume
traffic and throughput is maximized for non-real time that number of bits, k = 1 and Transmission power, tp = 1.
traffic. A Queuing model is employed which separates Node having maximum value of and parameters is chosen
real and non-real time, and performance is evaluated as cluster head. Based on link cost metric which is a
based on end to end delay. Simulation results show that combination of energy factor, available buffer and link
protocol performs well with respect to average lifetime of performance factor, cluster head chooses next hop and
node, average delay per packet and network throughput. node disjoint paths are chosen that increases robustness,
But this protocol simulation does not include comparison throughput and balance load among nodes. Queuing
with any other protocol. Queuing model is employed in model is used that differentiate real and non-real time
many protocols in literature but if we differentiate this traffic with r paths chosen for real time and n for non-real
traffic by using queuing model and traffic is sent on time. Queuing model is presented in Fig.2.
single path that will lead to huge delay and decrease the Alternative paths are found in this way and path having
performance. For that reason multi-path routing is the lower delay is chosen for real time traffic to avoid delay.
most efficient method. In [39], authors proposed QoS and To improve reliability correction codes are added using
Energy aware multi-path routing algorithm for real-time XoR based correction method.
applications in wireless sensor networks (QEMPAR). It is
a QoS aware protocol that increases the lifetime of
network by considering energy consumption as an
important parameter. Node disjoint paths are found and
packets are transmitted over these paths by breaking them
into smaller parts and attaching a sequence. Protocol
shows better performance in terms of end to end delay
and average energy consumption but does not consider
traffic differentiation. Multimedia applications and
performance critical applications have different delay
requirements. Hard real time delay guarantees become
difficult to achieve because of the limited resource and
energy issues of WSN. Multimedia data requires high
bandwidth and low delay and these applications require
predefined QoS to achieve required performance.
Another multi-path routing algorithm for improving
QoS in wireless sensor network Clustering based
Multipath routing algorithm to improving QoS in wireless
sensor networks (CMQ) [37]. CMQ is a multi-path Fig.2. Queuing model of QEMH [35]
clustering algorithm which provides better energy
consumption and required QoS in terms of minimum end Comparison is done with multi constrained QoS multi-
to end delay and maximizing packet delivery ratio. As path routing (MCMP)[40] and Energy-Aware Routing
discussed in above sections the advantages of clustering Protocol (EAP) [41] protocols and it achieves more
and incorporating clustering approaches in QoS based energy saving, low average end to end delay, more
routing can enhance scalability, improve network lifetime and high packet delivery ratio [35].
performance and help in load balancing. Some of the QoS
based routing protocols that incorporate clustering are
discussed below:
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
48 Clustering in Wireless Sensor Networks- A Survey
QoS Enhanced Base Station Controlled Dynamic of traffic and service rate is calculated. Candidate paths
Clustering Protocol (QBCDCP) consists of homogeneous are found and using Dijkastra algorithm, least cost paths
nodes and achieves QoS by including delay and are found. Cost function is calculated for each link which
bandwidth details while selecting a route. Considering includes communication cost ( ( ) ) , Energy
some limitations of Leach protocol enhancements has stock ( ( )) , energy consumption rate ( ) ,
been made to the CH selection threshold equation of
LEACH. It increases threshold for some node that has not Sensing cost ( ) , Relaying cost ( ) , Maximum
been selected as CH for previous rounds. Based on connections per delay( ), error rate ( ( )).
following equation decision is taken
∑ ( ) ( )
( )
(
( ) (7)
[ ( )( )] (6)
Based on above function, cost is found and then
Where, is the current energy, maximum Dijkastra algorithm is run to find least cost paths.
energy is given by represents rounds in which Bandwidth (r) values are calculated for found paths and if
node has not been selected as CH. TDMA is used as value is not between 0 and 1 then extended Dijkastra are
MAC protocol where one slot is fixed for control run to find more paths.
messages and other slots segmented to send and receive If no r value is found, connection of the node to
messages. Base Station sets up a QoS based route Q gateway is simply rejected. Performance of the protocol
between itself and a CH based on a metric that includes is calculated based on end to end delay that is sum of
bandwidth delay and transmission energy. Left out queuing and propagation delay. Simulation results show
energy is considered by BS while selecting CH so that that protocol performs well with respect to average
CHs never deplete their energy. Slot assignment or lifetime of node, average delay per packet and network
Communication scheduling is carried out after selecting throughput. Simulation does not include comparison with
QoS route by BS. Whole process takes place from base any other protocol [36].
station [38] Clustering based Multipath routing algorithm to
improving QoS in wireless sensor network (CMQ) [37] is
multi-path clustering algorithm which provides better
energy consumption and required QoS in terms of
minimum end to end delay and maximizing packet
delivery ratio. It considers all nodes to have equal energy
and can calculate packet sending and receiving
probability. Protocol has three phases viz. cluster head
announcement, cluster formation and data transmission.
Cluster head announcement phase process is similar to
HEED but differs when nodes calculate their probability
of CH election by:
( ) ( ) ( ) (8)
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
Clustering in Wireless Sensor Networks- A Survey 49
sent over these paths. Compared to Energy Efficient and clustering improves scalability, reduces redundancy;
QoS aware multipath routing protocol (EQSR) [36] it incorporating efficient clustering method will enhance the
gives better results in terms of end to end delay, average performance of QoS based routing protocols.
energy consumption and average packet delivery ratio. Comparison of these protocols based on several QoS
QoS based routing protocols developed so far are parameters viz. energy efficiency, Clustering process, CH
mainly location based; a little work has been done on selection, QoS support, Reliability, Multi-path,
clustering based QoS protocols. As we have discussed Timeliness presented in Table 4.
Energy Clustering
Protocol CH election QoS Support Reliability Multi-path Timeliness
efficiency Process
Weight
QEMH[35] High Distributed Yes Yes Yes Yes
based
QBCDCP[3 Weight
Medium Centralized Yes No No Yes
8] based
Weight
EAQoS[36] Medium Distributed Yes Yes Yes Yes
based
CMQ[37] High Distributed Probabilistic Yes Yes Yes Yes
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
50 Clustering in Wireless Sensor Networks- A Survey
[21] A. Patra, S. Chouhan, ―Energy Efficient Hybrid multihop Controlled Dynamic Clustering Protocol for Wireless
clustering algorithm in wireless sensor networks‖, Sensor Networks‖, IEEE transactions on wireless
COMNETSAT, pp.59-63, 2013. communications, 2009.
[22] Bhaskar Bhuyan, Hiren Kumar Deva Sarma, Nityananda [39] S. Prakash T, K.B. Raja, ―Real-Time Link Reliability
Sarma, Avijit Kar, Rajib Mall, ―Quality of Service (QoS) Routing for QoS in Wireless Sensor Networks‖, pp. 05-16,
Provisions in Wireless Sensor Networks and Related 2014.
Challenges‖, Wireless Sensor Network Journal , pp. 861- [40] X. Huang and Y. Fang, ―Multiconstrained QoS Mutlipath
868, 2012. Routing in Wireless Sensor Networks‖, Wireless Net-
[23] J. Othman, B. Yahya, ―Energy efficient and QoS based works, pp. 465-478,2008.
routing protocol for wireless sensor networks”, Journal of [41] M. Liu, J.-N. Cao, G.-H. Chen and X.-M. Wang, ―An
Parallel and Distributed Computing, pp. 849-857, August, Energy-Aware Routing Protocol in Wireless Sensor Net-
2010. works,‖ Sensors, pp. 445-462, 2009.
[24] J. Zhu, C.H.Lung,V. Srivastave, ―Hybrid Clustering [42] Faezeh Hajiaghajani, Marjan Naderan,Hossein Pedram,
Technique using Quantitative and Qualitative data for Mehdi Dehgha, ―HCMTT: Hybrid Clustering for Multi-
Wireless Sensor Networks‖, Elsevier, Ad-hoc networks, Target Tracking in Wireless Sensor Networks‖, 4th
volume 25, pp-38-53, 2015 International Workshop on Sensor Networks and Ambient
[25] Z.Wang, W. Lou, Z. Wang, J. Ma, and H. Chen ―A Intelligence, 2012.
Hybrid Cluster based target tracking protocol for Wireless [43] Xuxun Liu, ―A Survey on Clustering Routing Protocols in
Sensor Networks (HCTT)‖, International Journal of Wireless Sensor Networks‖, Sensors, 2012.
Distributed Sensor Networks, Article id 494863, 2013. [44] K. Akkaya and M. Younis, ―A Survey on Routing
[26] Ossama Younis, Sonia Fahmy, "HEED: A Hybrid, Protocols for Wireless Sensor Networks‖, Ad Hoc
Energy-Efficient, Distributed Clustering Approach for Ad Networks, pp. 325-349, 2005.
Hoc Sensor Networks", IEEE Transactions on Mobile [45] D. Goyal, M.R. Tripathy, ―Routing protocols in wireless
Computing, vol.3, no. 4, pp. 366-379, October 2004. sensor networks: A Survey‖, Advanced Computing &
[27] H. Huang, J.Wu, "A Probabilistic Clustering Algorithm in Communication Technologies (ACCT), pp.474 – 480,
Wireless Sensor Networks", IEEE, 2005. 2012.
[28] S. Bandyopadhyay and E. J. Coyle, ―An Energy Efficient [46] Zhang/RFID and Sensor Networks, Chapter 12,
Hierarchical Clustering Algorithm for Wireless Sensor ―Clustering in Wireless Sensor Networks‖, pp.335, 2009.
Networks‖, INFOCOM, 2003. [47] Luis Javier, García Villalba, Ana Lucila Sandoval Orozco,
[29] S. Banerjee and S. Khuller, ―A clustering scheme for Alicia Triviño Cabrera and Cláudia Jacy Barenco Abbas,
hierarchical control in multi-hop wireless networks”, in ―Routing Protocols in Wireless Sensor Network‖, Sensors,
Proceedings of 20th Joint Conference of the IEEE 2009.
Computer and Communications Societies (INFOCOMŠ [48] A. Joshi, M. Priya Lakshmi, ―A Survey of Hierarchical
01), Anchorage, AK, April 2001. Routing Protocols in Wireless Sensor Network‖, 2011.
[30] Z. Yanagihara, J. Taketsugu, ―EACLE: Energy-Aware [49] Boyinbode, O.; Le, H.; Mbogho, A.; Takizawa, M; Poliah,
Clustering Scheme with Transmission Power Control for R., ―A Survey on Clustering Algorithms for Wireless
Sensor Networks‖, Wireless Personal Communications, Sensor Networks‖ , In Proceedings of 2010 13th
pp. 401-415, 2007. International Conference on Network-Based Information
[31] R. Tandon, B. Dey and S. Nandi, ―Weight based Systems, Takayama, pp. 358–364,2010.
clustering in wireless sensor networks‖, Communications [50] www.6lowpan.org/
(NCC), 2013. [51] http://www.zigbee.org/
[32] D. Turgut, S. K. Das, R. Elmasri, and B. Turgut, [52] http://www.z-wave.com/
"Optimizing clustering algorithm in mobile ad hoc [53] https://www.enocean.com/en/home
networks using genetic algorithmic approach," IEEE
Global Telecommunications Conference, pp. 62-66, 2002.
[33] S. Selvakennedy, S. Sinnappan, ―A biologically-inspired
clustering protocol for wireless sensor networks‖, Journal Authors’ Profiles
Computer Communications, pp. 2786-2801, 2007.
[34] I. Wokoma, L. L.Shum, L.Sacks, I.Marshall, ―A Sukhkirandeep Kaur is a research scholar
Biologically-Inspired Clustering Algorithm Dependent on in the Department of Computer Science &
Spatial Data in Sensor Networks‖, proceedings of the Engineering at NIT Srinagar, INDIA. She
Second European Workshop on Wireless Sensor Networks, received her B.Tech in Computer Science &
2005. Engineering from Punjabi University,
[35] M. Mazaheri, B. Homayounfar and S. Mazinani, ―QoS Patiala(India) in 2010 and M.Tech in
Based and Energy Aware Multi-Path Hierarchical Routing Computer Science & Engineering from
Algorithm in WSNs‖, Wireless Sensor Network, pp. 31-39, Lovely Professional University, Jalandhar(India) in 2012. Her
2012. research interests include Routing and Clustering in Wireless
[36] J. Othman, B. Yahya, ―Energy efficient and QoS based Sensor Networks.
routing protocol for wireless sensor networks‖, Journal of
Parallel and Distributed Computing, pp.849-857, August,
2010. Roohie N Mir is a professor in the
[37] A. R. Rezaie and M. Mirnia, ―CMQ: Clustering based Department of Computer Science &
Multipath routing algorithm to improving QoS in wireless Engineering at NIT Srinagar, INDIA. She
sensor networks‖, IJCSI International Journal of received B.E. (Hons) in Electrical
Computer Science , Vol. 9, Issue 3, No 1, May 2012. Engineering from University of Kashmir
[38] A.O. Fapojuwo, A. C.Tinoco, ―Energy Consumption and (India) in 1985, M.E. in Computer Science &
Message Delay Analysis of QoS Enhanced Base Station Engineering from IISc Bangalore (India) in
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51
Clustering in Wireless Sensor Networks- A Survey 51
Copyright © 2016 MECS I.J. Computer Network and Information Security, 2016, 6, 38-51