A Survey: Wireless Sensor Network and its Routing Protocol

Chandra, Nilesh; Kumar, Awadhesh; Yadav, Ravi

doi:10.5120/ijca2015907160

Cited by 3 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It effect the aggregation and fusion of data to reduce the number of messages transmitted to the BS. There are a great number of studies about routing procedures in WSNs, and there are several ways to classify the algorithms of clustering: depending on whether the deployed nodes are homogeneous or heterogeneous, that intracluster communication is in one or k‐hop, according to the criteria for determining the CHs: a first possibility is that this decision stems from an elective process and another strategy is that it is the nature of the node which defines the CH. Several approaches exist to create clusters, namely, K‐Medoids and Fuzzy C‐Means .…”

Section: Related Workmentioning

confidence: 99%

Energy‐efficient routing protocol to improve energy consumption in wireless sensors networks

Elkamel

Cherif

2017

Int J Communication

View full text Add to dashboard Cite

Summary The energy consumption is considered to be the major challenge in wireless sensor networks. In this paper, we shed light on a new approach to overcome the energy consumption problems. The objective of this work is to integrate an improved algorithm which is the K‐means to create a balanced energy on clusters and to use the Gaussian elimination algorithm during the election of cluster head that will guarantee the distribution of energy consumption. To address the problem of the optimal number of groups, we use Davies Bouldin index to increase the network lifetime. The simulation result shows that the proposed protocol extends the network lifetime compared to Leach, iMod‐Leach, leach‐C, and CELRP.

show abstract