Energy-Balanced Edge-Based Clustering Algorithm for

Wireless Sensor Networks∗

Muni Venkateswarlu Ka, A Kandasamyb, K Chandrasekaranc

aDepartment of Computer Science, Ben-Gurion University of the Negev, Beer Sheva 84105 Israel,Contact: muni@cs.bgu.ac.il

bDepartment of Mathematical and Computational Sciences, National Institute of TechnologyKarnataka, Surathkal 575 025 India.

cDepartment of Computer Science and Engineering, National Institute of Technology Karnataka,Surathkal 575 025 India.

In employing clustering algorithm in multi-hop data transmission model, Hot-spot problem arises due touneven energy consumption among cluster heads. Unequal clustering mechanism balances energy consump-tion among inter cluster communications but not in intra-cluster communication and will introduce severalother problems into the network. To overcome these problems, an Energy-balanced Edge-based ClusteringAlgorithm (EECA) is proposed for wireless sensor networks. The primary goal of the proposed algorithm isto avoid hot-spot problem with uniform energy dissipation among cluster heads. For this, it creates unequalsize clusters across different levels, which promotes invariable energy dissipation among cluster heads acrossdifferent levels. Data communication is one of the heavy energy consuming operations observed in sensornetworks. To balance network load among different data forwarding routes, a multi-hop routing mechanismis proposed. In this model, source node chooses a relay cluster head which has forwarded less numberof data packets and greater residual energy with minimum hop-count to base station in the downstream.Simulation results witness that the proposed unequal clustering algorithm avoids hot-spot problem withuniform energy dissipation among clusters and elevates network lifetime.

Keywords : Edge-Base Station, Energy-Balanced, Network Lifetime, Unequal Clustering Mechanism,Wireless Sensor Network.

1. INTRODUCTION

Wireless sensor networks are distributed collec-tion of small embedded devices, each with sens-ing, computation and communication capabil-ities. Sensor nodes are constrained in term ofprocessing power, communication bandwidth,and storage space. Energy has been an im-portant issue when designing any wireless sen-sor network application. Sensor nodes are of-ten grouped to create individual disjoint setscalled, Clusters. Clustering techniques activelysupport network scalability, resource sharing

∗A preliminary version of this paper, titled “AnEnergy-Efficient Clustering Algorithm for Edge-BasedWireless Sensor Networks”, appeared in the proceed-ings of the ICCN 2016 conference [1].

and efficient use of constrained network re-sources. Cluster formation is generally basedon energy reserves of sensors and sensor’s prox-imity to the Cluster Head. Clustering is one ofthe prominent techniques to save energy con-sumption in wireless sensor networks. Cluster-ing schemes offer reduced communication over-heads, efficient resource allocation with low in-terference among sensor nodes [2].

Wireless sensor networks are very large scalenetworks where clustering can simplify themulti-hop route discovery process compared toflat, location based and other non-clusteringmethods. Although formation and mainte-nance of clusters introduces addition cost ofcontrol messages, clustering structure of net-

98

International Journal of Information Processing, 10(3), 98-116, 2016ISSN : 0973-8215IK International Publishing House Pvt. Ltd., New Delhi, India

Energy-Balanced Edge-Based Clustering Algorithm for Wireless Sensor Networks 113

10500

11500

12500

13500

14500

15500

16500

1 10 19 28 37 46 55 64 73 82 91 100

Sen

sor

Nod

e L

ifeti

me

in N

um

ber

of

Rou

nd

s

Sensor Node Id

EECA

EEUC

(a) 100 Node Network

10500

11500

12500

13500

14500

15500

16500

17500

18500

19500

1 20 39 58 77 96 115 134 153 172 191

Sen

oso

r N

od

e L

ifeti

me

in N

um

ber

of

Ro

un

ds

Senosr Node Id

EECA

EEUC

(b) 200 Node Network

10500

11500

12500

13500

14500

15500

16500

17500

18500

19500

20500

1 25 49 73 97 121 145 169 193 217 241 265 289 313 337 361 385

Sen

sor

Nod

e L

ifeti

me

in N

um

ber

of

Rou

nd

s

Sensor Node Id

EECA

EEUC

(c) 400 Node Network

Figure 18. Lifetime of Sensor Nodes in the Net-work

0

25000

50000

75000

100000

125000

150000

100 200 300 400 500 600 700 800 900 1000

Aver

age

Lif

etim

e of

CH

s in

nu

mb

er o

f ro

un

ds

Round Number

EECA

EEUC

(a) 100 Node Network

0

20000

40000

60000

80000

100000

120000

140000

160000

100 200 300 400 500 600 700 800 900 1000

Av

era

ge

Lif

etim

e o

f C

Hs

in N

um

ber

of

Ro

un

ds

Round Number

EECA

EEUC

(b) 200 Node Network

0

30000

60000

90000

120000

150000

180000

100 200 300 400 500 600 700 800 900 1000

Aver

age

Lif

etim

e of

CH

S i

n N

um

ber

of

Rou

nd

s

Round Number

EECA

EEUC

(c) 400 Node Network

Figure 17. Average Lifetime of Cluster headsin the Network

7. CONCLUSIONS

In multi-hop data routing model, hot-spotproblem arises when employing clusteringmechanism. Unequal clustering methodologyhas been proposed to overcome hot-spot prob-lem in the literature. But, it generates hugenumber of clusters in various sizes at different

114 Muni Venkateswarlu K, et al.,

levels to achieve it. Though unequal clusteringavoids hot-spot problem, it increases hop-countbetween source and destination, which leads toenergy wastage. Also, irregular size clusterscauses imbalance in energy dissipation amongsensor nodes and degrades network lifetime. Toovercome these issues a novel Energy-efficientclustering algorithm is proposed for edge-basedwireless sensor networks in this paper. It cre-ates unequal clusters at each level, where clus-ter size rises as the distance with base sta-tion increases. This constructs small size clus-ters near base station to preserve some en-ergy for inter-cluster communication. This bal-ances energy consumption among cluster headsand avoids hot-spot problem. Also, the pro-posed inter cluster multi-hop routing proto-col distributes network load uniformly amongall data forwarding routes. The intelligent re-lay node selection process assists cluster headsto choose a relay node to forward data to-wards base station. Simulation results provethat the proposed clustering technique enableshot-spot free network by balancing energy con-sumption among uniformly distributed clusterheads. The proposed multi-hop routing schemeshares network load uniformly among all dataforwarding routes and prolongs network life-time.

REFERENCES

1. Muni Venkateswarlu K, A Kandasamy andK Chandrasekaran. An Energy-Efficient Clus-tering Algorithm for Edge-based Wireless Sen-sor Networks. Procedia Computer Science, 89:7– 16, 2016. Twelfth International Conferenceon Communication Networks, {ICCN} 2016,August 19 21, 2016, Bangalore, India TwelfthInternational Conference on Data Mining andWarehousing, {ICDMW} 2016, August 19-21,2016, Bangalore, India Twelfth InternationalConference on Image and Signal Processing,{ICISP} 2016, August 19-21, 2016, Bangalore,India.

2. Vinay Kumar, Sanjeev Jain and Sudarshan Ti-wari. Energy Efficient clustering Algorithmsin Wireless Sensor Networks: A Survey. In-ternational Journal of Computer Science, 8(2),September 2011.

3. Marziah Veyseh. Energy Efficient Clusteringand Routing Protocols for Wireless Sensor Net-works. Master’s thesis, San Jose State Univer-

sity, San Jose, CA, May 2005.4. Tao Liu, Qingrui Li and Ping Liang. An

Energy-Balancing Clustering Approach forGradient-based Routing in Wireless Sen-sor Networks. Computer Communications,35(17):2150–2161, 2012.

5. Sungryoul Lee, Han Choe, Byoungchang Park,Yukyoung Song and Chong-kwon Kim. Luca:An Energy-Efficient Unequal Clustering Algo-rithm using Location Information for WirelessSensor Networks. Wireless Personal Commu-nications, 56(4):715–731, 2011.

6. Muni Venkateswarlu K, A Kandasamy and KChandrasekaran. Node - Link Disjoint Mul-tipath Routing Protocols for Wireless SensorNetworks - A Survey and Conceptual Model-ing. In Advanced Computing, Networking andSecurity - International Conference, ADCONS2011, Surathkal, India, 2011, Revised SelectedPapers, pages 405–414, 2011.

7. W B Heinzelman, A P Chandrakasan andH Balakrishnan. An Application-Specific Pro-tocol Architecture for Wireless MicrosensorNetworks. IEEE Transactions on WirelessCommunications, 1(4):660–670, Oct 2002.

8. S Lindsey and C S Raghavendra. PEGA-SIS: Power-Efficient Gathering in Sensor In-formation Systems. In Proceedings of IEEEAerospace Conference, number 3, pages 1125–1130, March 2002.

9. Ossama Younis and Sonia Fahmy. HEED:A Hybrid, Energy-efficient, Distributed Clus-tering Approach for Ad Hoc Sensor Net-works. IEEE Transactions on Mobile Comput-ing, 3(4):366–379, October 2004.

10. Xuxun Liu. A Survey on Clustering RoutingProtocols in Wireless Sensor Networks. Sen-sors, 12(8):1113–1153, 2012.

11. Chengfa Li, Mao Ye, Guihai Chen and Jie Wu.An Energy-Efficient Unequal Clustering Mech-anism for Wireless Sensor Networks. In IEEEInternational Conference on Mobile Adhoc andSensor Systems Conference, 2005, pages 604–611, Washington, DC, USA,, November 2005.

12. Sungju Lee, Jangsoo Lee, Hongjoong Sin, Se-unghwan Yoo, Sanghyuck Lee, Jaesik Lee,Yongjun Lee and Sungchun Kim. An Energy-Efficient Distributed Unequal Clustering Pro-tocol for Wireless Sensor Networks. WorldAcademy of Science, Engineering and Technol-ogy, 48:443–447, 2008.

13. Stanislava Soro and B Heinzelman, Wendi.

Energy-Balanced Edge-Based Clustering Algorithm for Wireless Sensor Networks 115

Prolonging the Lifetime of Wireless SensorNetworks via unequal clustering. In Pro-ceedings of the 19th IEEE International Par-allel and Distributed Processing Symposium(IPDPS’05) - Workshop 12, volume 13 ofIPDPS ’05, pages 236–243, Washington, DC,USA, April 2005. IEEE Computer Society.

14. Feng e Bai, Hui hui Mou and Jingfei Sun.Power-Efficient Zoning Clustering Algorithmfor Wireless Sensor Networks. In Interna-tional Conference on Information Engineeringand ComputerScience(ICIECS 2009), pages 1–4, 2009.

15. S Mao and Y T Hou. BeamStar: An Edge-based Approach to Routing in Wireless SensorNetworks. IEEE Transactions on Mobile Com-puting, 6(11):1284–1296, 2007.

16. Chen Kuong Ho, Huang Jyh Ming and HsiaoChieh Chuan. CHIRON: An Energy Effi-cient Chain-based Hierarchical Routing Proto-col in Wireless Sensor Networks. In WirelessTelecommunications Symposium (WTS 2009),pages 1–5, 2009.

17. Hao Li Wang and Yu Yang Chao. A Cluster-based Data Routing for Wireless Sensor Net-works. In Proceedings of ICA3PP, LNCS,Springer, volume 5574, pages 129–136, 2009.

18. Rajiv Kumar Tripathi. Base Station Position-ing, Nodes’ Localization and Clustering Algo-rithms for Wireless Sensor Networks. Ph.DThesis, Indian Institute of Technology Kanpur,India, October 2012.

19. Muni Venkateswarlu K, A Kandasamy and KChandrasekaran. Energy-Efficient Edge-basedNetwork Partitioning Scheme for Wireless Sen-sor Networks. In Proceedings of 2013 Interna-tional Conference on Advances in Computing,Communications and Informatics (ICACCI), ,pages 1017–1022, Aug 2013.

20. Muni Venkateswarlu K, A Kandasamy and KChandrasekaran. Analysis of Base Station As-sisted Novel Network Design Space for Edge-Based WSNs. International Journal of Com-puter Network and Information Security (IJC-NIS), 7(7):53, 2015.

21. Muni Venkateswarlu K, A Kandasamy and KChandrasekaran. Zone-based Routing Proto-col for Wireless Sensor Networks. Interna-tional Scholarly Research Notices, 2014, 2014.

22. Muni Venkateswarlu K, A Kandasamy andK Chandrasekaran. An Energy-Efficient Hy-brid Clustering Mechanism for Wireless SensorNetwork. Unmanned Systems, 3(02):109–125,

2015.23. Muni Venkateswarlu K, A Kandasamy and

K Chandrasekaran. Energy Efficient UnequalClustering Algorithm with Disjoint Multi-HopRouting Scheme for Wireless Sensor Networks.International Journal of Modern Educationand Computer Science (IJMECS), 7(5):24,2015.

24. Athanassios Boulis. Castalia. A Simulatorfor Wireless Sensor Networks and Body AreaNetworks. NICTA, Eveleigh, NSW, Australia,October 2013.

Muni Venkateswarlu

K received his Bachelor’sdegree in Electronics fromSri Venkateswara University,Tirupati, in 2006 and MastersDegree in Computer Applica-tions from Anna University,Chennai, in 2009 and Ph.D

Degree in Mathematical and Computational Sci-ences from National Institute of Technology Kar-nataka, Mangalore, India, in 2016. Since October2015, he is with Department of Computer Science,Ben-Gurion University of the Negav, Beer Sheva,Israel, where he is a Post Doctoral Fellow workingwith Prof. Shlomi Dolev. His current research in-terests include Secure Multi-Party Computation,Self-Stabilization, Nano Robotics and WirelessCommunications.

A Kandasamy is a Pro-fessor in the Department ofMathematical and Compu-tational Sciences of NationalInstitute of Technology Kar-nataka, Mangalore, India.He has done his DoctoralResearch at Indian Instituteof Technology, Bombay, India

and he is a Post-Doctoral Fellow of Chuo Uni-versity, Tokyo, Japan. His research interests areComputational Fluid Dynamics, Rheology, Tribol-ogy, Computational Techniques, Bio-Informaticsand Wireless Sensor Networks. He has publishedmore than 50 reviewed papers in the reputed in-ternational journals and international/nationalconference proceedings. He has given invited talks

116 Muni Venkateswarlu K, et al.,

in various conferences at national and interna-tional levels including the ones held at Russia,U.K., Singapore, Malaysia, Indonesia and HongKong. He has guided till now five students atDoctoral level research work, more than 25 stu-dents at Masters level project work. He is having23 years of teaching experience and 28 years ofresearch experience. He is Member of Board ofStudies of various universities and institutions,Reviewer for various International Journals of El-sevier, Springer, Taylor and Francis and otherreputed publications. He is a member of NationalBoard of Accreditation of India. He is the lifemember of various Professional Societies at Na-tional as well as International levels. At present,he holds the position of Dean of Faculty Welfareat NITK. Mangalore, India.

K Chandrasekaran iscurrently Professor in theDepartment of ComputerScience and Engineeringat the National Instituteof Technology Karnataka(NITK), Mangalore, India.He has 27 years of profes-sional experience at NITK

and has published more than 160 research papers

in various peer-reviewed International journalsand conferences. He serves as a member of variousprofessional societies including IEEE (Senior Mem-ber), ACM (Senior Member), CSI (Life Member),ISTE (Life Member) and Association of BritishScholars (ABS). He is also a member of IEEEComputer Society’s Cloud Computing STC (Spe-cial Technical Community). He is in the EditorialTeam of IEEE Transactions on Cloud Comput-ing. He has organized numerous Internationalconferences, International Simposiums. He was avisiting fellow at LMU Leeds, UK, in 1995; Vis-iting Professor at AIT, Bangkok, in 2007; Visitorat UF, USA, in 2008; and a Visitor at the Uni-versity of Melbourne, CLOUDS LAB, Australia,in 2012. He had also worked as Visiting (Profes-sor) at DoMS, IIT Madras in 2010. His areas ofinterest include: Computer Communication Net-works, Cyber Security and Distributed Computingand Business Computing and Information SystemsManagement.