The distributed mechanism of LEACH
algorithm is used for cluster formation and cluster head
selection, it may result in poor cluster structure in which
some clusters contain a much larger number of nodes than
others do. Furthermore, randomly choosing CHs lead to
the fact that there is a high chance for one node to be a CH
during several rounds of operation, this node consumes
more energy and may die out within a short period of
time.COTSis an improvement of LEACH is used by
removing the cluster-reforming process and adding a
rescheduling slot to the end of every round, energy is
significantly saved.A novel routing protocol adapting
Minimum Spanning Tree (MST), is formed using Prims
algorithm to maximize network life time and reduce
network delay. The results were analyzed based on the
overall improvement and performance of the network.
S.Koteswararao : graduated in Electronics
Communication Engineering from
Dr.S.G.I.E.T and post graduated in
instrumentation and Control Systems
from JNTUK, Kakinada and pursuing his
PhD from JNTUK, Kakinada and research
interests includes optimal routing
protocols in Wireless sensor networks
and Digital communication.
Dr.M.Sailaja : obtained B.E in Electronics
&CommunicationEngineering.She has
completed M.S in USA and PhD from
JNTUH.Presently; she is working as
professor in ECE Department in JNTUK
Kakinada. Her Research interests include
Parallel Processing and Computer
Networks.
Dr. Tenneti Madhu : obtained his
B.E.Degree from University of Madras,
M.Tech from REC, Kurukshetra in 1994
and PhD from Osmania University in
2004.His research interests include GPS
Data Analysis, Image Processing, Nano
Technology and VLSI design and also
published more no.of good journals.
Leach
COTS
MST
An evaluation in made to improve the performance
of LEACH, COTS and MST. In LEACH, an idea of
dynamic clustering brings an extra overhead which
decreases the gain in energy consumption but local
compression is done for reducing the global
communication. MST are useful in constructing
networks, by describing the way to connect a set of
sites using the smallest total amount of wire. The
proposed COTS significantly reduces energy
consumption incurred by the setup phase of every
round by realizing novel clustering without repeated
setup, resulting in improved performance and
prolonged network lifetime. Results show that MST
performs better in cluster formation, average packet
delivery ratio, lifetime computation and nodes
remaining energy consumption but decreases in
average end to end delay calculation than LEACH
and COTS.
[1] Sahni, S., & Xu, X. (2005). Algorithms for
wireless sensor networks. International journal of
distributed sensor networks, 1(1), 35-56.
[2] Anupama, M., & Sathyanarayana, B. (2011).
Survey of Cluster Based Routing Protocols in
Mobile Ad hoc Networks. International Journal of
Computer Theory and Engineering, 3(6), 806-815.
[3] Hong, X., Xu, K., & Gerla, M. (2002). Scalable
routing protocols for mobile ad hoc
networks. Network, IEEE, 16(4), 11-21.
[4] Heinzelman, W. R., Chandrakasan, A., &
Balakrishnan, H. (2000, January). Energy-efficient
communication protocol for wireless micro sensor
networks. In System sciences, 2000. Proceedings of
the 33rd annual Hawaii international conference on
(pp. 10-pp). IEEE.
[5] Singh, S. K., Singh, M. P., & Singh, D. K. (2010).
A survey of energy-efficient hierarchical clusterbased
routing in wireless sensor networks.
International Journal of Advanced Networking and
Application (IJANA), 2(02), 570-580.
[6] Abad, M. F. K., & Jamali, M. A. J. (2011). Modify
LEACH algorithm for wireless sensor network.
IJCSI International Journal of Computer Science
Issues, 8(5).
[7] Shin, H., Moh, S., & Chung, I. (2013). Clustering
with One-Time Setup for Reduced Energy
Consumption and Prolonged Lifetime in Wireless
Sensor Networks. International Journal of
Distributed Sensor Networks, 2013.
[8] Heewook S, Sangman M, and Chung, I. (2013).
Clustering with One-Time Setup for Reduced
Energy Consumption and Prolonged Lifetime in
Wireless Sensor Networks. International Journal of
Distributed Sensor Networks, 2013.
[9] Wu, B. Y., & Chao, K. M. (2004). Spanning trees
and optimization problems. CRC Press..
[10] Huang, G., Li, X., & He, J. (2006, May). Dyna mic
minimal spanning tree routing protocol for large
wireless sensor networks. In Industrial Electronics
and Applications, 2006 1ST IEEE Conference on
(pp. 1-5). IEEE.
[11] Wan, P. J., Calinescu, G., Li, X. Y., &
Frieder,O.(2002).Minimum-energy broadcasting in
adhoc wireless networks. Wireless Networks, 8(6),
607-617.
[12] Clementi, A. E., Crescenzi, P., Penna, P., Rossi,
G., & Vocca, P. (2001). On the complexity of
computing minimum energy consumption
broadcast sub graphs. In STACS 2001 (pp.121-
131).Springer,Berlin Heidelberg.
[13] Ambühl, C. (2005). An optimal bound for the MST
algorithm to compute energy efficient broadcast trees
in wireless networks. In Automata, Languages and
Programming (pp. 1139-1150). Springer Berlin
Heidelberg.
[14] RamakrishnamRaju.BHVS.,Valli Kumari.V
Comparison of Parameter Free MST Clustering
Algorithm with Hierarchical Agglomerative
Clustering Algorithms, International Journal of
Computer Applications (0975 – 8887) Volume 34–
No.4, November 2011.
