Wireless Sensor Network Clustering Approaches for Improved Clustering Method

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 9, Issue 10, October 2019)

Wireless Sensor Network Clustering Approaches for

Improved Clustering Method

Kamini Mishra

, Harendra Singh

, Dr. Rachana Dubey

M. Tech. Scholar, Department of Computer Engineering, Laxmi Narayan College of Technology Excellance, Bhopal, India

2_{Asst. Prof. , Department of Computer Engineering , Laxmi Narayan College of Technology Excellance, Bhopal, India} 3_{HOD, Department of Computer Engineering , Laxmi Narayan College of Technology Excellance, Bhopal, India}

Abstract—This paper portrays the idea of energy gaps in

sensor networks, their impacts on system lifetime and different techniques to evade them. The life expectancy of sensor networks completes in brief length because of the nearness of battery consumption. A relative investigation of strength and weakness of different techniques for battling energy openings issue. This paper analysis various existing approaches introduce to improve lifetime of WSN. On basis of this study this work proposes sleep awake scheduling algorithm for sensor network to improve overall lifetime of network.

Keywords— wireless sensor networks; sleep awake;

Receive signal strength; clustering; power optimization.

I. INTRODUCTION

In order to detect environmental or physical conditions such as heat, light, sound, pressure, vibration, electro-magnetic field over an area of interest, wireless sensor net-works (WSNs) with a large number of sensor nodes are used. Sensor nodes are typically equipped with one or many sensors, a wireless communication device such as a radio transceiver, a processing unit and a battery as a power source [1].

Since its introduction, WSNs are considered as an active research area as they can provide a large number of WSN applications in different areas. The starting idea of a WSN was to build military applications such as battlefield surveillance but it quickly spread into a vast number of applications including healthcare, habitat monitoring, environmental monitoring, traffic control, home automation, disaster relief and smart cities [2].

Especially for monitoring applications, a large number of sensor nodes are deployed over an area so that a certain event (heat, light, sound, etc.) can be detected. The event detected by the sensor node is reported to the base station afterwards. The base stations are the gateways between the end users and the sensor nodes and they are considered as distinguished components of WSNs. Compared to sensor nodes, they have more communication resources, computational power, energy supplies [3].

The power consumption constraint of the sensor nodes has a major impact on the lifetime of a sensor network. Typically, the power source of each sensor node is limited and the nodes consume energy during data sensing, processing and communication.

The sensing and processing parts consume relatively low energy compared to the communication part.

Fig. 1. Sample WSN architecture

WSNs do not use specialized routers for path discovery and traffic routing develops the wireless backbone architecture. This means that certain nodes must be selected to communication [4]. One of the general approaches to build up self-organize them is cluster based network architecture. This is achieved by partitioning ad hoc networks into clusters. Certain nodes, known as cluster-heads, would be responsible for the formation of cluster and maintenance of the topology of the network, and also for the resource allocation to all the nodes belonging to their clusters.

The mobile ad hoc network consists of nodes that move freely and communicate with each other. One way to support efficient communication between nodes is to partition ad hoc networks into clusters. Many clustering schemes have been proposed to form clusters. The WCA has improved performance compared with other previous clustering algorithms [5]. However, the high mobility of nodes will lead to high frequency of re-affiliation which will increase the network overhead.

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 9, Issue 10, October 2019)

81  Limited energy limit

 Sensor areas

 Limited equipment assets

 Massive and arbitrary hub organization

 Network characteristics and questionable condition:  Data Aggregation

 Diverse detecting application necessities  Scalability.

II. WSNS CHARACTERISTICS AND OBJECTIVES

The characteristics of WSNs and requirements have a important impact on the WSNs plan objectives for network capabilities and network performance [6].

The characteristics of WSNs and necessities importantly affect the WSNs plan goals for system capacities and system execution [6].

A. WSNs Characteristics

As customary wireless networks such as versatile impromptu system (MANET) and cell correspondence frameworks, WSNs have the accompanying characteristics-

Thickness of Network: Sensor nodes are regularly thickly conveyed and can be a few requests of higher than a MANET.

Battery-intensity of sensor nodes: Sensor nodes are commonly fueled by battery and are situated in a surprising area and it's hard to change or recharge their batteries control.

Restricted energy, calculation, and capacity: Sensors nodes are having very constrained assets as power energy, calculation speed, and extra room capacities.

Self-configurable: Sensor nodes are sent arbitrarily and consequently compose themselves into a correspondence arrange.

Shakiness: Since sensor nodes need to convey in extraordinary conditions so they may physical annihilate or disappointments.

Information excess: Sensor nodes arrange nearly sent thickly separate separation between nodes. Henceforth, the information detected by closest sensor nodes normally have an excess.

Explicit Task: A sensor system is intended for a particular to perform extraordinary assignment. The establishment necessities of a sensor system change with its application.

Many-to-one traffic design: Nearly all sensor networks, the information gathered by nodes from numerous source sensor nodes sends to a specific base station, such a large number of to-one traffic example follows in WSNs.

Dynamic topology: Network topology changes consistently if any hub get fizzles, harm, include, energy lost, or channel separated.

B. WSNs Objectives

Following major WSNs plan destinations

Little hub measure: little hub estimate nodes are anything but difficult to hub sending in a domain. On the off chance that size is little it likewise lessens the power spend and cost of sensor nodes.

Low hub cost: In numerous cases sensor nodes remain not any more reusable, so decreasing expense of sensor nodes is basic and in this way entire system cost could be diminished.

Low power utilization: As known sensor nodes are utilized by their battery power and it is troublesome or difficult to recharge their batteries, it's imperative to spare the power devoured by sensor nodes so life expectancy of nodes, just as the entire system can be broadened.

Adaptability: The number sensor nodes in WSNs need of tens, hundreds, or thousands, as indicated by use of system necessities, so sensor networks ought to be versatile for various system sizes.

Unwavering quality: WSNs must give blunder control and remedy to guarantee steady information conveyance in nearness of uproarious, mistake and so forth.

Self-configurability: WSNs once introduce, sensor nodes ought to have the option to in parallel compose themselves to shape arrange and oversee them self occasion of topology changes of hub slammed.

Flexibility: In sensor networks, a hub may crash, join, or move away, which would result dynamic hub thickness and topology. Thus WSN ought to be versatile in nature to deal with such changes or issue.

Channel use: WSNs have restricted data transmission or assets so WSNs ought to competently to utilize transfer speed in such way to legitimate channel usage.

Adaptation to internal failure: Sensor nodes may flops as vital conditions situations. Along these lines, sensor nodes ought to be oversee shortcoming and must have capacity of self testing, self-fixing and self-recouping.

Security: A sensor system ought to have security techniques to forestall the information data in the system or a sensor hub from unapproved access or assaults.

III. RELATED WORK

In paper [17], anticipated CLUBS, partner degree decide that structures clusters through local communicate and join in an exceedingly time corresponding to the local thickness of nodes. Essentially, cluster development in CLUBS depends on the ensuing 3 characteristics:

• Each hub inside the system ought to be associated with a cluster.

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 9, Issue 10, October 2019) • Clusters should bolster the intra-cluster

correspondence, which proposes nodes in an exceedingly cluster ought to have the option to speak with each others.

In contrast to the majority of the uncovered schemes, the objective of Banerjee and Khuller is to make a multi-level positioned clustering [21]. Assortment of cluster's properties like cluster estimate and accordingly the level of cover, that square measure supportive for the administration and quantifibility of the hierarchy, are contemplated while gathering the nodes. Inside the anticipated subject, any hub inside the WSN will start the cluster arrangement strategy. Pioneer with least hub ID can outweigh everything else, if numerous nodes began cluster development technique at a comparable time. The standard yield in 2 stages: Tree revelation and Cluster arrangement.

Despite the fact that RCC [16] is intended for versatile unplanned networks, it's conjointly appropriate to WSNs. RCC chiefly centers at cluster security in order to help portable nodes. The RCC standard applies the essential Declaration Wins rule, inside which any hub will ''oversee'' the rest of the nodes in its radio inclusion if it's the essential to state being a CH. A CH in adaptative clustering surrenders its job once it hears a hub with a lower ID, while, a CH in RCC exclusively offers up its position once another CH moves pretty much it

Work in [19], gift associate degree rule, called GS3, for self-configuring a wireless network into a cellular polygon structure. The authors argue that ignoring the geographical boundary of clusters will be unwise; particularly for terribly giant network. They outline the radius of the circle that contains all nodes within the cluster as a live for the geometric size. An outsized cluster radius is alleged to extend energy consumption and responsibility for intra-cell communication and limit the spacial reprocess of radio frequencies within the network. the method is recurrent till no additional cells can be more.

Paper [20] anticipated EEHC; a circulated, sporadic clustering rule for WSNs with the objective of expanding the system life. CHs gathered the sensors' readings in their individual clusters partner degreed send a mass report back to the base-station. Their technique depends on 2 phases; starting and expanded. Inside the underlying stage, conjointly alluded to as single-level bunch, each gadget hub reports itself as a CH with chance p to the neighboring nodes at interims its correspondence differs.

LEACH is one in all the chief elegant clustering calculations for WSNs [21]. It structures clusters upheld the got sign quality and utilizations the CH nodes as switches to the base-station. All the data procedure like information combination and total square measure local to the cluster. LEACH structures clusters by utilizing a dispersed guideline, any place nodes manufacture self-ruling choices with none unified administration.

The turn is performed by acquiring each hub to choose an arbitrary range ''T'' somewhere in the range of zero and one.

FLOC [22] could be an appropriated technique that produces about equivalent measured clusters with least over-lap. The expected radio model groups nodes bolstered their nearness to the CH into inward (I-band) and external (o-band). I-band nodes can endure little impedance act with the CH, while message from o-band nodes could likewise be lost.

HEED [23] is a disseminated clustering scheme in which CH nodes are picked from the sent sensors. Regard considers a half breed of energy and correspondence cost when choosing CHs. In contrast to LEACH, it doesn't choose cell-head nodes arbitrarily. Just sensors that have a high remaining energy can progress toward becoming cell-head nodes. Regard has three principle characteristics:

• The likelihood that two nodes inside each other's transmission range getting to be CHs is little. Dissimilar to LEACH, this implies CHs are all around disseminated in the system.

• Energy utilization isn't thought to be uniform for every one of the nodes.

• For a given sensor's transmission extend, the likelihood of CH determination can be changed in accordance with guarantee between CH networks Paper [24] specifies DWEHC technique to beat disadvantages of HEED calculation. This technique makes a balance cluster measure for best intra clustering arrangement. DEHC work in conveyed conditions with steady time multifaceted nature. This technique performs clustering inside steady time unpredictability. Each hub checks its direct associated hub by utilizing this data it infers its weight for current state

The paper [25] proposed an energy-aware multi-hop routing (EAMR) protocol for WSNs. The EAMR protocol, the cluster heads also assume the responsibility of a relay node. The performance analysis indicates that overhead reduction significantly improves the lifetime as energy consumption in the sensor nodes can be reduced through an energy efficient protocol.

IV. PROPOSED WORK

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 9, Issue 10, October 2019)

83 In next round when the quantity of nodes in sleep position is more prominent NS> 11 than the hub which is in second position of the sleeper position moves towards the dynamic position, etc. At the point when the quantity of sleep modes NS < 10 then the hub whose energy level is less then edge energy level moves towards sleep position. In this situation, the all out hub in the sleep position is again equivalent to NS = 10. Flowchart depicts the sleep and awake mechanism. We execute our scheme in the cluster based conventions L ACH, TEEN, DEEC and SEP. Nodes choose their cluster head based on predefined likelihood. The cluster heads communicate their status that each hub can decide to which cluster head it needs to partner to expend least energy for information transmission. After affiliation, each cluster head makes a schedule to the nodes in its cluster. Sink allocates TDMA openings to each hub. Nodes just transmit their information during their alloted TDMA openings. This is to spare energy for the nodes that are in sleep mode aside from during transmission.

A. Sensor Node Sleep Scheduling

Before playing out the sleep schedule, we look at the energy level of each hub as per their separation from the sink and the accompanying advances.

Each hub decides its energy level before information transmission If energy level of any hub is not as much as edge energy, it advances toward sleep mode When number of sleep nodes n > 10, the main sleep hub transform into dynamic mode.

Case 1 E0 > Eth: When remaining energy is more noteworthy than the edge energy, the hub is in dynamic mode.

Case 2 E0 < Eth: When remaining energy is not exactly the edge energy, the hub transforms into sleep mode.

In Fig. 3 we figure the estimation of limit energy of each hub for sleep and awake mechanism. Sink chooses the hub to put into sleep position haphazardly. Each hub sets the sleeping scheduling as per the limit energy.

To ascertain the threshold energy, we utilize the following equation.

Eth=((ETX+EDA)*D)+(Eamp*D*d4) eq. 1 Where Eth is threshold energy, D is the length of the information bundle and d is the separation between most extreme separation hub and sink. Sink ascertains the edge energy for sleep and awake mechanism. CH2 is the more removed hub and devours more energy for transmission. We ascertain the limit energy of this hub as indicated by the given recipe.

Fig. 2. Flow Chart of Proposed method

B. Cluster Formation

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 9, Issue 10, October 2019)

V. SIMULATION AND RESULT

This section gives result comparison of proposed method with traditional DEEC and LEACH. This work involved heterogeneity in LEACH, as all parameters are considered same to DEEC algorithm. The goals of this work are as follow to check the constancy time of LEACH, SEP and proposed work. This work also inspects the throughput of LEACH, DEEC and proposed work.

Figure 3 illustrate outcome to compare numbers of alive nodes for LEACH with proposed scheme. According to this setting network have total 100 nodes participate in clustering method. Figure 3 obviously gives result that proposed work improved as compare to LEACH methods in requisites of constancy. Figure 4 gives result comparison with DEEC protocol it clears that proposed work improved network lifetime as compare to DEEC methods

Fig. 3 Alive nodes in LEACH and proposed method.

Fig. 4 Alive nodes in DEEC and proposed method.

The known that LEACH is not good for heterogeneity conditions so nodes are dead at a higher dead rate. DEEC achieve good results compared to LEACH for network heterogenic in nature, apart this DEEC consist heterogeneous network scheme for selecting cluster head and it form cluster. Proposed scheme shows improved results in compare to all other techniques LEACH and DEEC.

Fig. 5 Throughput of LEACH and proposed scheme.

Fig. 6 Throughput of DEEC and proposed method.

Figure 5 illustrate outcome to compare numbers of total packets transmit to base station for LEACH with proposed scheme. According to this setting network have total 100 nodes participate in clustering method. Figure 5 obviously gives result that proposed work improved as compare to LEACH methods in requisites of constancy. Figure 6 gives result comparison with DEEC protocol it clears that proposed work improved number of packets transmitted as compare to DEEC methods.

VI. CONCLUSION

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 9, Issue 10, October 2019)

85 REFERENCES

[1] M. Kuorilehto,M. Kohvakka, J. Suhonen, P. Hämäläinen,M. Hännikäinen, and T. D. Hämäläinen, Ultra-Low Energy Wireless Sensor Networks in Practice: Theory, Realization andDeployment, 1st ed. Hoboken, NJ, USA: Wiley, 2007. [2] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci,

``Wireless sensor networks: A survey,'' Comput. Netw., vol. 38, no. 4, pp. 393422, 2002.

[3] J. N. Al-Karaki and A. E. Kamal, ``Routing techniques in wireless sensor networks: A survey,'' IEEE Wireless Commun., vol. 11, no. 6, pp. 628, Dec. 2004.

T. Rault, A. Bouabdallah, and Y. Challal, ``Energy efciency in wireless sensor networks: A top-down survey,'' Comput. Netw., vol. 67, pp. 104122, Jul. 2014.

[4] A. M. S. Saleh, B. M. Ali, M. F. A. Rasid, and A. Ismail, ``A survey on energy awareness mechanisms in routing protocols for wireless sensor net-works using optimizationmethods,'' Trans. Emerg. Telecommun. Technol., vol. 25, no. 12, pp. 11841207, Dec. 2014

[5] Jun Zheng and Abbas Jamalipour, “Wireless Sensor Networks: A Networking Perspective”, a book published by A John & Sons, Inc, and IEEEE, 2009.

[6] K. Cengiz and T. Dag, ``A reviewon the recent energy-efcient approaches for the Internet protocol stack,'' EURASIP J. Wireless Commun. Netw., vol. 2015, p. 108, Dec. 2015.

[7] N. Wang and J. Zeng, ``All-direction random routing for source-location privacy protecting against parasitic sensor networks,'' Sensors, vol. 17, no. 3, p. 614, 2017.

[8] Y. Liu, M. Dong, K. Ota, and A. Liu, ``ActiveTrust: Secure and trustable routing in wireless sensor networks,'' IEEE Trans. Inf. Forensics Security, vol. 11, no. 9, pp. 20132027, Sep. 2016. [9] H. Huang, H. Yin, G. Min, X. Zhang, W. Zhu, and Y. Wu,

``Coordinate-assisted routing approach to bypass routing holes in wireless sensor net-works,'' IEEE Commun. Mag., vol. 55, no. 7, pp. 180-185, Jul. 2017.

[10] J. So and H. Byun, ``Load-balanced opportunistic routing for duty-cycled wireless sensor networks,'' IEEE Trans. Mobile Comput., vol. 16, no. 7, pp. 19401955, Jul. 2017.

[11] M. K. Khan, M. Shiraz, K. Z. Ghafoor, S. Khan, A. S. Sadiq, and G. Ahmed, “EE-MRP: Energy-EfcientMultistageRoutingPro-tocol for Wireless Sensor Networks,”Wireless Communications andMobile Computing,vol.2018,2018.

[12] S. Dhankhar and E. S. Singh, “Performance Comparison of LEACH &amp; HEED Clustering Protocols in WSN using MATLAB-A Review,”International Journal of Technical Research,vol.5,no.1,pp.167–170,2016.

[13] M. Aslam, E. U. Munir, M. M. Rafque, and X. Hu, “Adaptive energy-efcient clustering path planning routing protocols for heterogeneous wireless sensor networks,”Sustainable Comput-ing,vol.12,pp. 57–71, 2016.

[14] A. A. Babayo, M. H. Anisi, and I. Ali, “A Review on energy management schemes in energy harvesting wireless sensor networks,”Renewable&Sustainable Energy Reviews,vol.76,pp. 1176–1184, 2017.

[15] K. Xu, M. Gerla, A heterogeneous routing protocol based on a new stable clustering scheme, in: Proceeding of IEEE Military Communications Conference (MILCOM 2002), Anaheim, CA, October 2002.

[16] R. Nagpal, D. Coore, An algorithm for group formation in an amorphous computer, in: Proceedings of the 10th International Conference on Parallel and Distributed Systems (PDCS’98), Las Vegas, NV, October 1998.

[17] S. Banerjee, S. Khuller, A clustering scheme for hierarchical control in multi-hop wireless networks, in: Proceedings of 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’ 01), Anchorage, AK, April 2001

[18] H. Zhang, A. Arora, GS3: scalable configuration and self-healing in wireless networks’’, in: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, CA, July 2002.

[19] S. Bandyopadhyay, E. Coyle, An energy efficient hierarchical clustering algorithm for wireless sensor networks, in: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), San Francisco, California, April 2003.

[20] W.B. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, Application specific protocol architecture for wireless microsensor networks, IEEE Transactions on Wireless Networking (2002).

[21] M. Demirbas, A. Arora, V. Mittal, FLOC: a fast local clustering service for wireless sensor networks, in: Proceedings of Workshop on Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks (DIWANS’04), Palazzo dei Congressi, Florence, Italy, June 2004.

[22] O. Younis, S. Fahmy, HEED: A Hybrid, Energy-Efficient, Distributed clustering approach for Ad Hoc sensor networks, IEEE Transactions on Mobile Computing 3 (4) (2004) 366–379. [23] P. Ding, J. Holliday, A. Celik, Distributed energy efficient

hierarchical clustering for wireless sensor networks, in: Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS’05), Marina Del Rey, CA, June 2005.