Distributed Clustering Algorithm for Energy Efficient Routing in Wireless Sensor Networks
- 1Anna University Chennai, Lord Jegannath College of Engineering, Tamil Nadu, India, IN
- 2Anna University Chennai, Lord Jegannath College of Engineering, Tamil Nadu, India, IN
Wireless Sensor network has emerged as a promising technique that revolutionizes the way of sensing information. Dense deployed sensor nodes at a specific region are likely to transfer redundant data to the base station. This increase the communicational overhead and affects network lifetime. The objective of this paper is to achieve prolonged network lifetime with overall energy efficiency in Wireless Sensor Networks (WSNs) through controlled utilization of limited energy. In wireless sensor networks most of the energy spent is consumed in routing the sensed data from cluster head to base station. Back up heads are introduced to avoid frequent re-clustering in each cluster. A modification to existing clustering technique in the LEACH is done by implementing Distributed Clustering Algorithm (DCA) in LEACH protocol. The use of hierarchical or cluster-based routing helps in conserving more energy and setting of the other group members in the same cluster to a sleep mode reduces energy consumption of the WSN. This results in overall energy efficiency with prolonged network lifetime. Based on the study, the future research areas and issues to be focused are Security, Energy conservation, query processing, communication & uncertainty in sensor reading.
Conclusion
Overall energy efficiency of the network with prolonged network lifetime is achieved by Distributed Clustering Algorithm. In this approach, the overall energy of the networks is used efficiently by selecting the maximum residual energy node as the cluster head. This is clear from the simulation that results in the existence of more alive nodes in the Wireless Sensor Network. Further studies can be done, by allowing routing only through creation of the secondary membership heads which in turn results in the reduction of the energy wastage. The assigning of the secondary membership head eliminates the redundancy of forwarding the same data packet by more than one received cluster head. Routing is carried out only through the secondary membership heads so as to reduce the traffic in the network while the assigning of the secondary membership heads is a onetime task, thus ensuring conservation of the energy that is spent in redundant transmission.
References
- I. Akyldiz, W.Su, Y. Sankarasubramanian and E. Cayirci, “A survey on sensor networks,” IEEE Communication Mag., vol. 40, no. 8, Aug. 2002, pp. 102-14.
- C. Shen, C. Srisathapornphat, and C. Jaikaeo, “Sensor information networking architecture and applications,” IEEE Personnel Communications, Aug. 2001, pp.52-59
- W.R. Heinzelman “Application - Specific Protocol architectures for Wireless Networks,” Ph.D. thesis, Massachusetts Institute ofTechnology, June 2000.
- R. Rajagopalan and P. Varshney, “Data-Aggregation Techniques in Sensor Networks: A Survey,” IEEE Comm. Surveys Tutorials, vol. 8, no. 4, pp. 48-63, Oct.-Nov. 2006.
- S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, “TAG: A Tiny AGgregation Service for Ad-Hoc Sensor Networks,” Proc. Fifth Symp. Operating Systems Design and Implementation, 2002.
- J.-Y. Chen, G. Pandurangan, and D. Xu, “Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis,” IEEE Trans. Parallel Distributed Systems, vol. 17, no. 9, pp. 987-1000, Sept. 2006.
- Chien-Ming Chen, Yue-Hsun Lin, Ya-Ching Lin, and Hung-Min Sun , “RCDA: Recoverable Concealed Data Aggregation for Data Integrity in Wireless Sensor Networks” IEEE Transactions on parallel and distributed systems, vol. 23, no. 4, april 2012.
- S. Tilak, N. Abhu-Gazhaleh, W. R. Heinzelman, “A taxanomy of wireless micro-sensor network models,” ACM SIGMOBILE Mobile Comp. Commun. Rev. , vol. 6, no. 2, Apr. 2002, pp. 28- 36.
- S.W. Arms, C.P. Townsend, D.L. Churchill, J.H. Galbreath, S.W. Mundell , “Power Management for Energy Harvesting Wireless Sensors ” SPIE Int’l Symposium on Smart Structures & Smart Materials.
- S.S. Pradhan, K. Ramchandran, “Distributed Source Coding: Symmetric rates and applications to sensor networks”, in proceeding of the data compressions conference 2000,pp.363-372.
- JyotirmoyKarjee, H.S Jamadagni, “Data Accuracy Estimation for Spatially Correlated Data in Wireless Sensor Networks under Distributed Clustering”
- Olivier Dousse, PetteriMannersalo, Patrick Thiran “Latency of Wireless Sensor Networks with Uncoordinated Power Saving Mechanisms” MobiHoc’04, May 24–26, 2004, Roppongi, Japan.
- Huseyin Ozgur Tan and Ibrahim Korpeoglu, “Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks”
- Yunxia Chen, Student Member, IEEE, and Qing Zhao, Member, IEEE “On the Lifetime of Wireless Sensor Networks ” IEEE Communications Letters, VOL. 9, NO. 11, November 2005.
- Mohamed Watfa, William Daher and Hisham Al Azar , “ A Sensor Network Data Aggregation Technique ”, International Journal of Computer Theory and Engineering, Vol. 1, No. 1, April 2009.
- S. Madden et al., “TAG: a Tiny Aggregation Service for Ad- hoc Sensor Networks,” OSDI 2002, Boston, MA, Dec. 2002.
- M. Lee and V.W.S. Wong, “An Energy-aware Spanning Tree Algorithm for Data Aggregation in Wireless Sensor Networks,” IEEE PacRrim 2005, Victoria, BC, Canada, Aug. 2005.
- K. Dasgupta, K. Kalpakis, and P. Namjoshi, “An Efficient Clustering-based Heuristic for Data Gathering and Aggregation in Sensor Networks”, IEEE 2003.
- L. Gatani, G. Lo Re, and M. Ortolani, “Robust and Efficient Data Gathering for Wireless Sensor Networks”, in Proceeding of the 39th Hawaii International Conference on System Sciences – 2006.
- NoritakaShigei, Hiromi Miyajima, Hiroki Morishita, Michiharu Maeda “Centralized and Distributed Clustering Methods for Energy Efficient Wireless Sensor Networks ”Proceedings of the International Multi Conference of Engineers and Computer Scientists 2009 Vol I IMECS 2009, March 18 - 20, 2009, Hong Kong.
- Haowen Chan, Adrian Perrig. "Efficient Security Primitives from a Secure Aggregation Algorithm."In Proceedings of the Proceedings of the ACM Conference on Computer and Communications Security (CCS)2008.
- A Heinzelman, W.; Chandrakasan, A.; Balakrishnan, H. Energy–efficient communication protocol for wireless micro sensor networks. In Proceedings of the 33rd Annual Hawaii International Conference on System Sciences(HICSS), Big Island, HI, USA, January 2000; pp. 3005-3014.
- Manjeswar, A.; Agrawal, D.P. TEEN: A protocol for enhanced efficiency in wireless sensor networks. In Proceedings of 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, San Francisco, CA, USA, 2001; p. 189.
- Lindsey, S.; Raghavendra, C.S. PEGASIS: Power Efficient gathering in sensor information systems. In Proceedings of IEEE Aerospace Conference, Big Sky, MT, USA, March 2002.
- Martorosyan, A.; Boukerche, A.; NelemPazzi, R.W. A taxonomy of cluster-based routingprotocols for wireless sensor networks. In International Symposium on Parallel Architectures, Algorithms, and Networks, Sydney, NSW, Australia, May 7–9, 2008; pp. 247-253.
- Jamal, N.; E. Kamal, A.-K.A. Routing techniques in wireless sensor networks: A survey. IEEE Wirel. Commun. 2004, 11, 6-28.
- Braginsky, D.; Estrin, D. Rumor routing algorithm for sensor networks. In Proceedings of theFirst Workshop on Sensor Networks and Applications (WSNA), Atlanta, GA, USA, October 2002.
- Akkaya, K.; Younis, M. A survey on routing protocols for wireless sensor networks. J. Ad HocNetw. 2005, 3, 325-349.
Keywords: Wireless Sensor Network, Distributed Clustering Algorithm, Network topologies
Citation: Renjith*, Renjith, Renjith, Renjith ( 2013), Distributed Clustering Algorithm for Energy Efficient Routing in Wireless Sensor Networks. , 1(1): 1-9
Received: 31/05/2024; Accepted: 31/05/2024;
Published: 01/06/2024
Edited by:
Mr.ERES JOURNALS

