Call for Paper

CAE solicits original research papers for the July 2021 Edition. Last date of manuscript submission is June 30, 2021.

Read More

DWEDDEEC: Distance Aware Waiting based EDDEEC Protocol for Hetrogeneous WSNS

Rajeev Kumar, Rajdeep Kaur, Reeta Bhardwaj. Published in Wireless.

Communications on Applied Electronics
Year of Publication: 2015
Publisher: Foundation of Computer Science (FCS), NY, USA
Authors: Rajeev Kumar, Rajdeep Kaur, Reeta Bhardwaj

Rajeev Kumar, Rajdeep Kaur and Reeta Bhardwaj. Article: DWEDDEEC: Distance Aware Waiting based EDDEEC Protocol for Hetrogeneous WSNS. Communications on Applied Electronics 2(6):50-57, August 2015. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

	author = {Rajeev Kumar and Rajdeep Kaur and Reeta Bhardwaj},
	title = {Article: DWEDDEEC: Distance Aware Waiting based EDDEEC Protocol for Hetrogeneous WSNS},
	journal = {Communications on Applied Electronics},
	year = {2015},
	volume = {2},
	number = {6},
	pages = {50-57},
	month = {August},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}


As Wireless Sensor Networks (WSNs) contain numerous sensor nodes containing limited battery power that collect and transmit the data collected from all the nodes towards the Base Station which needs much energy utilization. There are several routing protocols which are already proposed under this consideration attaining effectiveness of energy in heterogeneous circumstances. Although, every protocol is unsuitable for heterogeneous WSNs. Efficiency of WSNs declines as varying the heterogeneity of sensor nodes. Though EDDEEC has depicted quite considerable outcomes compared to already developed existing WSNs protocols but it has ignore the utilization of waiting time of node to become cluster heads (CHs). Therefore might a few nodes will not turn out to be CHs for a very long time still they contain more confidence to become CHs. Therefore to conquer this issue we have used a waiting counter called W_r (i). W_r (i) is then total number of waiting rounds for a given node to become CH. It will generate a +ve value that will constantly amplify the node to T (n) value for a specified node to become CH. So it will produce more optimized CHs. For getting the better results more we have used the minimum allowed distance (MDCH) between two CHs to cover the sensor field in the most proficient manner.


  1. I.F. Akyildiz, W. Su, Y. Sankara subramaniam, E. Cayirci, (2002) “Wireless sensor networks: a survey, Computer Networks”, 38 (4) 393-422.
  2. P. Krishna, N.H. Vaidya, M. Chatterjee, D. Pradhan, (1997) “A cluster-based approach for routing in dynamic networks, ACM SIGCOMM Computer Communication Review“, 27 (2) 49-65.
  3. B. McDonald, T. Znati, (2001) “Design and performance of a distributed dynamic clustering algorithm for Ad-Hoc networks”, in: Proceedings of the Annual Simulation Symposium.
  4. V. Mhatre, C. Rosenberg, D. Kofman, R. Mazumdar, N. Shroff, (2004) “Design of surveillance sensor grids with a lifetime constraint”, in: 1st European Workshop on Wireless Sensor Networks (EWSN), Berlin.
  5. W.R. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, (2000) “Energy efficient communication protocol for wireless micro sensor networks”, in: Proceedings of the 33rd Hawaii International Conference on System Sciences(HICSS-33).
  6. W.R. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, (2002) “An application specific protocol architecture for wireless microsensor networks”, IEEE Transactions on Wireless Communications 1 (4) 660-670.
  7. S. Lindsey, C.S. Raghavenda, (2002) PEGASIS: “power efficient gathering in sensor information systems”, in: Proceeding of the IEEE Aerospace Conference, Big Sky, Montana.
  8. O. Younis, S. Fahmy, HEED: (2004) “A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks”, IEEE Transactions on Mobile Computing 3, 660-669.
  9. G. Smaragdakis, I. Matta, A. Bestavros, (2004) “SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor network”, in: Second International Workshop on Sensor and Actor Network Protocols and Applications (SANPA 2004).
  10. L. Qing, Q. Zhu, M. Wang, (2006) “Design of a distributed energy-efficient clustering algorithm for heterogeneous wireless sensor network”, ELSEVIER, Computer Communications 29, pp 2230- 2237.
  11. Elbhiri, B., Saadane, R., El Fkihi, S.,Aboutajdine, D. (2010) “Developed Distributed Energy-Efficient Clustering (DDEEC) for heterogeneous wireless sensor networks”, in: 5th International Symposium on I/V Communications and Mobile Network (ISVC).
  12. Parul Saini, Ajay. K. Sharma, (2010) “E-DEEC- Enhanced Distributed Energy Efficient Clustering Scheme for heterogeneous WSN”, 1stInternational Conference on Parallel, Distributed and Grid Computing (PDGC).
  13. Parul Saini, Ajay.K.Sharma, (2010) “Energy Efficient Scheme for Clustering Protocol Prolonging the Lifetime of Heterogeneous Wireless Sensor Networks”, International Journal of Computer Applications (0975 8887), September.
  14. M. Y. Khan, N. Javaid, M. A. Khan, (2013) “Hybrid DEEC: Towards Efficient Energy Utilization in Wireless Sensor Networks”, Published in World Applied Science Journal (ISI Indexed).
  15. N. Javaid, T. N. Qureshi, A. H. Khan, A. Iqbal, E. Akhtar, M. Ishfaq, (2013) “EDDEEC: Enhanced Developed Distributed Energy-Efficient Clustering for Heterogeneous Wireless Sensor Networks”, ELSEVIER 4th International Conference on Ambient Systems, Networks & Technologies (ANT).
  16. A. A. Khan, N. Javaid, U. Qasim, Z. Lu, Z. A. Khan, (2012) “HSEP: Heterogeneity-aware Hierarchical Stable Election Protocol for WSNs”, IEEE Seventh International Conference on Broadband, Wireless Computing, Communication and Applications.
  17. M. M. Islam, M. A. Matin, T. K. Mondol, (2012) “Extended Stable Election Protocol (ESEP) for Threelevel Hierarchical Clustered Heterogeneous WSN”, IEEE Conference on Wireless Sensor Systems (WSS).


WSNs, DEEC, heterogeneity, super nodes, T-absolute