AN EXTENSIVE SURVEY ON CLUSTERING TECHNIQUES IN …ijaema.com/gallery/156-ijaema-march-3616.pdf · AN EXTENSIVE SURVEY ON CLUSTERING TECHNIQUES IN WIRELESS SENSOR NETWORKS 1Mrs. A

AN EXTENSIVE SURVEY ON CLUSTERING TECHNIQUES IN

WIRELESS SENSOR NETWORKS

1Mrs. A. Sarkunavathi, 2P. Agilan, 2S. Aravindhan, 2R. Mohanakrishnan

1Associate Professor, Department of Information Technology, Sri Manakula Vinayagar Engineering College,

2Department of Information Technology, Sri Manakula Vinayagar Engineering College, Pondicherry

Email: [email protected]

Abstract

Wireless sensor networks (WSN) is assumed to be more important models as it has different

applications like health care observation, smart mobiles, armed forces, disaster controlling,

and alternate observing techniques. Sensor nodes are often installed in massive numbers to

perform autonomously in harsh regions. As there are limited resources, lower battery power,

and wireless nodes are gathered as clusters for energy effective communication. In clustering

hierarchical models, it is attained with maximum attention to reduce the power application.

Hierarchical approach is comprised with cluster-based models. In cluster-based techniques,

nodes are collected as a cluster, which has effective sensors named as cluster head (CH). This

paper points the major issues for cluster-based models, and the vital cluster formation

measures, as well as classifying hierarchical clustering protocols. Therefore, previous cluster-

based methodologies are estimated by assuming the metrics to guide the users for selecting

desired model. Hence, a brief summary of such protocols are proposed with merits, demerits

and adoptability in specific cases.

Keywords: Cluster Head, Hierarchical, Base Station, LEACH.

1. Introduction

Generally, WSN is defined as the group of wireless nodes which are used in a random

manner mostly in hostile regions. WSN is capable of sensing, process, and transmit data to

the adjacent nodes as well as Base Station (BS). Furthermore, the tiny devices are comprised

with reduced abilities like less storage, reduced processing, and minimum power unit. The

sensors are distributed across a wider area with massive number of nodes to observe the

target region. Since the sensed information should be transmitted to BS, the routing process

becomes more vital in transferring data from one node to another effectively. WSN has been

referred as most important method. A small, cheaper device that has sensors linked using

wireless connections, by Internet to manage and observe the platforms, homes, offices, cities,

etc [1]. The sensors are installed in marine, underwater, on bodies (WBAN—Wireless Body

The International journal of analytical and experimental modal analysis

Volume XII, Issue III, March/2020

ISSN NO:0886-9367

Page No:1378

Area Network), air, such as buildings, vehicles (VANETs—Vehicular Ad Hoc Networks).

Several experiments are carried out in building WSN communication abilities that use

sensors in several methods like IEEE 802.11, personal digital assistants (PDA), VANETs,

smart mobile, and Internet of Things (IoT).

WSN effectively use the resources such as battery, diverse hierarchical models are presented.

The main aim of WSN is to attain energy efficiency and to improve the network lifespan. In

case of hierarchical routing, clustering has been widely employed to accomplish the desired

functions. Clustering techniques are used to remove the repeated messages in effective

clusters as well as smart selection of CH. In this work, a developer has projected different

clustering models, also the problems like optimal power and load balancing. Therefore,

developing a topology is assumed to be more significant in sharing nodes from the even

clusters for grid-relied techniques to develop an resourceful network. The regular creation of

clusters as well as re-election of CH tends to additional power utilization which tends to

ineffective network performance.

Routing in WSN is a promising issue when compared with MANET since WSN has limited

resource [2]. In order to resolve the problems involved, novel routing techniques are

deployed. As the frequent topological variation occurs in a network, retaining the routes are

assumed to be main problem as if it is not operated. For reducing the power utilization and to

enhance the network lifespan, diverse routing models are established. Moreover, it is

classified as 4 categories: network structure, topology based, reliable routing method, as well

as communication model [3]. Every class is divided again as provided in Fig. 1. Additionally,

the network structure has been segmented as flat as well as hierarchical protocols. In case of

flat networks, every sensors works together by multi-hop routing where every node has

similar role. But, it is impossible to contain identifier (ID) as the data-centric routing has been

used for flat routing where BS requests from sensors. This method has few benefits like no

requirement of managing the topology and offers the superior links from source to

destination. But, flat networks apply flooding that is more cost with respect to energy

application. Furthermore, flat network leads to maximum bandwidth utilization as it is

comprised with repeated messages and non-uniform power employment with maximum

latency [4].

In hierarchical methodologies, nodes are bunched into gatherings, and, by certain criteria, a

group head is chosen that is answerable for steering. In hierarchical directing, normally two-



ISSN NO:0886-9367

Page No:1379

layer approach is utilized, where one layer is utilized for detecting the physical condition and

the other is utilized for steering. The low vitality nodes are utilized for detecting while high

vitality nodes are frequently utilized for gathering, totalling, and sending information [5].

Clustering approach is the most broadly utilized procedure for vitality productivity to

accomplish versatility and successful correspondence. Group based hierarchical

methodologies have a few favourable circumstances, for example, expanding adaptability;

proficient information total and channel data transfer capacity are effectively used. The

primary issue of clustering is non-uniform clustering which prompts high vitality

dissemination of sensor hub, complete vitality utilization increments, and system availability

not being ensured. The focal point of this work is on hierarchical clustering plans.

Fig. 1. Classification of routing protocols in WSN

This paper points the major issues for cluster-based models, and the vital cluster formation





2. Hierarchical Clustering Approaches

In writing quantities of various techniques are proposed for the advancement of hierarchical

clustering conventions dependent on application prerequisites. The conventions are planned

keeping in see some significant factors such as vitality proficiency and generally arrange



ISSN NO:0886-9367

Page No:1380

lifetime. In writing, there are different reviews on various routing conventions in WSN, be

that as it may, right now; centre is around various hierarchical clustering approaches.

Additionally, parameters such as the arrangement of groups and CH choice are considered.

Moreover, the distinctions are featured alongside points of interest and detriments. The

hierarchical clustering is additionally isolated into bunch based and framework based

approaches which may fall in to at least one of the above-examined characterization and these

techniques are additionally clarified underneath.

Fig. 2. Cluster-based communication



ISSN NO:0886-9367

Page No:1381

2.1. Cluster-Based Hierarchical Approaches

Clustering approaches are utilized to streamline the hub the executives, to diminish vitality

utilization, to achieve adaptability, and to improve load adjusting and power and information

total. Nodes are gathered to shape groups. A hub that is known as a group head (CH) is made

answerable for social event information from part nodes (MN), totals it, and afterward

advances to the BS straightforwardly or through some middle of the road CH as appeared in

Fig. 2. Rather than sending information of all sensor nodes in a group, CH just sends the

accumulated information, which thusly limits the quantity of bundles transmitted in a system

and limit vitality utilization. The information got from a CH hub is additionally prepared at

the base station, where end clients get to it. The situation of BS can be inside a field or can be

put outside the system region. As a rule, BS is put outside and a ways off from the sensor

nodes. The information detected by sensor hub is sent through a gateway (CH) to the BS. The

staggered clustering hierarchy can have more than one BS in the system (if necessary). In

writing, different endeavors have been made to improve the vitality proficiency through

various clustering techniques by tending to the issues of effective bunch development, even

circulation of burden, CH choice and reselection, and group reconstruction; not many of them

are examined here.

Low Energy Adaptive Clustering Hierarchy

Low energy adaptive clustering hierarchy (LEACH) was proposed by [6], which was one of

the principal energy proficient routing conventions is as yet utilized as a condition of-heart

convention in WSN. The essential thought of LEACH was to choose CH among various

nodes by turn with the goal that energy scattering from correspondence can be spread to all

nodes in a system. The activity is partitioned into two stages, the arrangement stage and

consistent state stage. In the arrangement stage, each hub concludes whether to turn into a CH

or not for the current round which relies upon the CHs rate proposed and various occasions a

hub has been CH. An irregular number is chosen from 0 to 1; if the number is not as much as

edge, the hub turns into a group head as appeared in

𝑇(𝑛) = {

𝑃

1 − 𝑃(𝑟 𝑚𝑜𝑑(1/𝑃)), 𝑖𝑓 𝑛𝜖𝐺,

0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒,

(1)

where 𝑃 denotes the percentage of CHs, 𝑟 is a current round, and 𝐺 implies the member

nodes which is not chosen as CHs from 1/𝑃 rounds. Hence, the selected CH is advertised as



ISSN NO:0886-9367

Page No:1382

a message to alternate nodes depends upon the obtained signal strength, nodes choose which

cluster has to combine and forward membership message. To effectively use the energy, the

job of CH is turned. The subsequent stage is the consistent state stage, in which nodes detect

and transmit information to its CH which is then collected and sends to BS legitimately. So as

to evade crashes, TDMA/CDMA MAC is utilized.

Because of disseminated approach LEACH doesn't require any worldwide data. Different

alterations have been made to LEACH in writing such as MR-LEACH, LEACHB, ER-

LEACH, and ID-LEACH. LEACH has a few impediments such as probabilistic approach

utilizing irregular number for CH choice, which may bring about problematic CH hub in this

way bringing about high energy utilization. Moreover, the dynamic clustering overhead and

non-uniform conveyance of CH will devour more energy and lead to poor system execution.

Low Energy Adaptive Clustering Hierarchy Centralized

Low energy adaptive clustering hierarchy incorporated (LEACH-C) [7] is the adjusted

rendition of LEACH. In LEACH-C bunches are framed by base station while in LEACH

each hub self-configures them into group. The BS gets all the data in regards to the energy

and area of the considerable number of nodes conveyed in the system. Thusly, BS decides the

quantity of group head CH and masterminds organize into different bunches. In any case,

because of absence of coordination among nodes, the quantity of CHs shifts from round to

adjust. In LEACH-C the quantity of CHs in each round equivalents an ideal decided worth. A

brought together routing approach is one in which BS processes the normal energy of a

system for a lot of sensor nodes having energy level better than expected. A CH will be

chosen from the arrangement of nodes to guarantee that nodes chose ought to have adequate

energy to be a bunch head. The system is part into two sub-clusters and afterward they are

additionally separated into the ideal number of CHs. By along these lines, the nodes are

equitably conveyed to guarantee that heap is in the long run dispersed. The BS chooses

lowest energy routing ways and advances the data of clustering and CH to all nodes in the

system utilizing a base spreading over tree approach. In any case, because of concentrated

approach correspondence overhead will increment in the reselection of CH, in light of the

fact that reselection choice must be made by BS. Likewise, every bunch will send demand;

subsequently energy utilization will be high.



ISSN NO:0886-9367

Page No:1383

Cluster Chain Weighted Metrics

Group chain weighted measurements (CCWM) [8] achieve energy proficiency and increment

arranges execution dependent on weighted measurements. A lot of CHs is chosen relying

upon these measurements. Part nodes utilize direct correspondence for moving information

towards their separate CHs. A routing chain of chose CHs is built for inter-clusters

correspondence and each CH advances information to its neighbouring CH until it reaches

BS. The creators guarantee that CCWM improves in general system life expectancy. Be that

as it may, due to non-optimized CH political decision, the re-appointment of CH brings about

system overheads. Additionally, intra-cluster correspondence is immediate which prompts

lopsided energy utilization.

𝐾-Means Algorithm

The group head is chosen utilizing 𝐾-implies calculation to draw out by and large system life

expectancy [9]. Creators partitioned the entire procedure into three stages. LEACH

convention is utilized to decide starting CH determination. Further, the system is apportioned

into 𝑘 groups; in view of the Euclidean separation nodes join their closest CH. When the

nodes join the CH, focus of each bunch is resolved and each hub is appointed an ID

dependent on the good ways from centroid. Hub closer to the inside will have more modest

number. CH is pivoted and the following similar closer hub to the middle is chosen as new

CH. When contrasted with different schemes, it improves generally organize lifetime yet

occasional reconstruction of groups brings about extra system overhead and high energy

utilization. In addition, as bunches are framed in arbitrary way at first in this way it can bring

about imperfect groups and lopsided appropriation of burden.

Cluster Head Election Using Fuzzy Logic

Creators in [10] proposed group head political race approach utilizing fluffy rationale

(CHEF). In view of arbitrary number, provisional CHs are chosen in each round. The chosen

CH then uses two fluffy parameters which are neighborhood separation and energy level.

Nearby separation is fundamentally the whole of all good ways from neighboring nodes. By

utilizing fluffy on the off chance that runs, each CH decides its chance worth and afterward

promotes it. CH having more prominent chance worth will be chosen as CH and will promote

itself with the goal that part nodes can go along with it. CHEF improves arrange lifetime



ISSN NO:0886-9367

Page No:1384

when contrasted with before arrangements however because of intermittent messages it

includes organize overhead and pointless traffic load. Moreover, bunch head political

decision process is costly regarding energy utilization as it is acted in the whole system that

outcomes in high energy utilization.

Unequal Clustering Size Model (UCS)

A variable size clustering scheme called Unequal Clustering Size (UCS) for remote sensor

organize is proposed in [11]. It is accepted that detecting field is round and is separated into

two layers. Groups in layer one has a similar shape and size while layer two will have

distinctive shape and size. The issue of lopsided energy utilization is tended to in UCS model.

To keep the energy utilization least, the CH must be situated some place or close to the focal

point of a group. Zone secured by the groups can be adjusted in each layer by changing

sweep of a layer close to BS and subsequently will change thickness of a specific bunch. The

creators guaranteed that this model functions admirably in homogenous systems and gives

adjusted energy utilization through inconsistent clustering approach particularly for arrange

that manages huge measure of information. One of the confinements of this approach is the

quantity of nodes per group, as in WSN arrangement is regularly arbitrary and the quantity of

nodes per bunch may fluctuate as it were. Besides, the ideal number of CH per layer is

another worry as the approach manages different layers.

Non-uniform Deterministic Node Distribution

The shortcoming of uniform clustering is brought up in non-uniform deterministic hub

conveyance (NUDND) [12], where it can lead towards energy gap in the system. Another

model non-uniform deterministic hub dispersion is proposed, where hub thickness increments

towards sink hub. As nodes closer to BS will be utilized more than different nodes in the

system, a straightforward dispersed calculation is acquainted with load adjusted information

gathering. The proposed technique may function admirably in predefined hub positions

however in arbitrary organization nodes are regularly dissipated which can prompt energy

gap issue.



ISSN NO:0886-9367

Page No:1385

Energy-Aware Distributed Clustering (EADC)

Energy Aware Distributed Clustering (EADC) [13] is proposed for non-uniform arrangement

of sensor nodes to adjust the heap over the whole system. EADC develops inconsistent

bunches to take care of the issue of energy holes. Through routing calculation, the CHs

choose nodes with high energy alongside least jump check to part nodes to achieve load

adjusting in CHs. The group head is then chosen based on the proportion of normal residual

energy of close by nodes and the energy of hub itself. A portion of the sensor nodes were

excess, devouring additional energy which was overlooked in EADC. This issue was

comprehended; the repetitive nodes were killed dependent on the schedule. Moreover, the

general energy utilization was decreased by dodging pointless detecting and transmission.

LEACH-MAC

In [14], low energy adaptive clustering hierarchy-media get to control (LEACH-MAC) is

introduced to control the arbitrariness of bunch head include in LEACH convention. The

issue of LEACH is that it chooses the CH based on irregular number; nodes that produce the

arbitrary number not exactly the edge will become CH. Creators have tended to the issue of

irregularity by utilizing media get to control layer data. To achieve energy productivity,

LEACH-MAC chooses the CH dependent on uniform arbitrary interim to make the most of

the CH stable. Despite the fact that creators have achieved solidness as far as CH tally, the

choice of CH is fundamentally founded on limit esteem. In this way, significant parameters

are as yet disregarded in the choice procedure.

Energy-Aware Distributed Unequal Clustering

The issue of energy gap was tended to in energy-mindful circulated inconsistent clustering

(EADUC) [15] by thinking about inconsistent estimated bunches. Nodes having diverse

energy assets are considered and groups with inconsistent sizes are developed to take care of

the energy gap issue. Creators guarantee that got outcomes were better in examination with

LEACH in regards to energy productivity and augmenting system lifetime. EADUC achieves

energy effectiveness through inconsistent group development. Notwithstanding, the repetition

of information in thick region isn't considered in EADUC which prompts superfluous energy

utilization influencing system lifetime.



ISSN NO:0886-9367

Page No:1386



ISSN NO:0886-9367

Page No:1387

3. Conclusion

In this paper points the major issues for cluster-based models, and the vital cluster formation





References

[1] C. Chong and S. P. Kumar, “Sensor networks: evolution, opportunities, and

challenges,” Proceedings of the IEEE, vol. 91, no. 8, pp. 1247–1256, 2003.

[2] S. M. Zin, N. B. Anuar, M. L. M. Kiah, and A.-S. K. Pathan, “Routing protocol design

for secure WSN: review and open research issues,” Journal of Network and Computer

Applications, vol. 41, no. 1, pp. 517–530, 2014.



ISSN NO:0886-9367

Page No:1388

[3] N. A. Pantazis, S. A. Nikolidakis, and D. D. Vergados, “Energyefficient routing

protocols in wireless sensor networks: a survey,” IEEE Communications Surveys &

Tutorials, vol. 15, no. 2, pp. 551–591, 2013.

[4] Q. Mamun, “A qualitative comparison of different logical topologies for wireless sensor

networks,” Sensors, vol. 12, no. 11, pp. 14887–14913, 2012.

[5] D. Xu and J. Gao, “Comparison study to hierarchical routing protocols in wireless

sensor networks,” Procedia Environmental Sciences, vol. 10, pp. 595–600, 2011.

[6] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient

communication protocol for wireless microsensor networks,” in Proceedings of the 33rd

Annual Hawaii International Conference on System Siences (HICSS ’00), vol. 2, p. 10,

January 2000.

[7] W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “An application-specific

protocol architecture for wireless microsensor networks,” IEEE Transactions on

Wireless Communications, vol. 1, no. 4, pp. 660–670, 2002.

[8] S. Mahajan, J. Malhotra, and S. Sharma, “An energy balanced QoS based cluster head

selection strategy for WSN,” Egyptian Informatics Journal, vol. 15, no. 3, article 101,

pp. 189–199, 2014.

[9] G. Y. Park, H. Kim, H. W. Jeong, and H. Y. Youn, “A novel cluster head selection

method based on k-means algorithm for energy efficient wireless sensor network,” in

Proceedings of the 27th International Conference on Advanced Information Networking

and Applications Workshops (WAINA ’13), pp. 910– 915, Barcelona, Spain, March

2013.

[10] J.-M. Kim, S.-H. Park, Y.-J. Han, and T.-M. Chung, “CHEF: cluster Head Election

mechanism using Fuzzy logic in wireless sensor networks,” in Proceedings of the 10th

International Conference on Advanced Communication Technology (ICACT ’08), pp.

654–659, Gangwon-Do, Republic of Korea, February 2008.

[11] S. Soro and W. B. Heinzelman, “Prolonging the lifetime of wireless sensor networks via

unequal clustering,” in Proceedings of the 19th IEEE International Parallel and

Distributed Processing Symposium (IPDPS ’05), pp. 236–243, Washington, DC, USA,

April 2005.

[12] P. Chatterjee and N. Das, “Coverage constrained non-uniform node deployment in

wireless sensor networks for load balancing,” in Proceedings of the 1st International

Conference on Applications and Innovations in Mobile Computing (AIMoC ’14), pp.

126–132, Kolkata, India, February 2014.



ISSN NO:0886-9367

Page No:1389

[13] J. Yu, Y. Qi, G. Wang, and X. Gu, “A cluster-based routing protocol for wireless sensor

networks with nonuniform node distribution,” AEU-International Journal of Electronics

and Communications, vol. 66, no. 1, pp. 54–61, 2012.

[14] P. K. Batra and K. Kant, “LEACH-MAC: a new cluster head selection algorithm for

Wireless Sensor Networks,” Wireless Networks, vol. 22, no. 1, pp. 49–60, 2016.

[15] Y. Q. J. Yu, G. Wang, Q. Guo, and X. Gu, “An energy-aware distributed unequal

clustering protocol for wireless sensor networks,” International Journal of Distributed

Sensor Networks, vol. 2014, p. 8, 2014.



ISSN NO:0886-9367

Page No:1390

Documents

AN EXTENSIVE SURVEY ON CLUSTERING TECHNIQUES IN …ijaema.com/gallery/156-ijaema-march-3616.pdf · AN EXTENSIVE SURVEY ON CLUSTERING TECHNIQUES IN WIRELESS SENSOR NETWORKS 1Mrs. A