An Energy Efficient Clustering Algorithm for Event-Driven Wireless Sensor Networks (EECED)

Buyanjargal, Otgonchimeg; Kwon, Youngmi

doi:10.1109/ncm.2009.220

Cited by 13 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A cluster-head is selected in each cluster to report the cluster decision to the FC. A low energy adaptive clustering hierarchy is proposed [7], in which a pre-elector cluster-head will broadcasts its energy, if there no any other node's energy is bigger than its own energy, then it is selected as the cluster-head of this cluster. But [8] will broadcast all nodes' energies by the base station, and then each node sets a time to start advertising itself to form clusters based on the broadcasting information.…”

Section: Cooperative Sensing With Proposed Weighted Methodsmentioning

confidence: 99%

A Novel Weighted-Cooperative Spectrum Sensing Scheme Using Clustering

Liu

Chen

2012

AMM

View full text Add to dashboard Cite

This paper proposes a novel weighted-cooperative spectrum sensing scheme using clustering for cognitive radio system. We firstly classify the secondary users into a few clusters according to several existent methods, and then use cluster-head to collect the observation results come from different secondary users in the same cluster and make a cluster-decision. Considering the different distances between the clusters and the fusion center, different weightings are used to weight the cluster-decisions before combining. The simulation results show that our proposed method improve the probability of detection and reduce the probability of error.

show abstract

Section: Cooperative Sensing With Proposed Weighted Methodsmentioning

confidence: 99%

A Novel Weighted-Cooperative Spectrum Sensing Scheme Using Clustering

Liu

Chen

2012

AMM

View full text Add to dashboard Cite

show abstract

“…In energy‐efficient clustering algorithm for event driven, EECED, all nodes considered to be stationary. Residual energy is an operating condition factor in CH selection.…”

Section: Related Workmentioning

confidence: 99%

A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

Al-Baz

El‐Sayed

2017

Int J Communication

157

View full text Add to dashboard Cite

SummaryIn wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering-based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked-LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols. KEYWORDScluster head selection, clustering-based protocols, LEACH protocols, wireless sensor networks | INTRODUCTIONWireless sensor networks (WSNs) consider a base station (BS) that communicates with countless of wireless sensor nodes by means of a radio channel. Data transmission and reception process are the major operations that consume power in WSN. Elimination of redundant data is important issue in WSN, because multiple nodes may sense the same overlapped area. This action will reduce the overall power consumption and use the bandwidth usage.Routing protocols in WSNs can be divided according to network structure into 3 categories: location based, data centric, and hierarchical protocols. 1,2 Location-based protocol: location information for all nodes is a major cornerstone during data communication. Energy consumption during data transmission depends on the target position distance. Data are sent not only to the target area but also to whole sensors network, which is known as flooding. Residual energy is not considered for each node, so many nodes will run out of energy, which leads at the end to an accumulative data transmission failure. [3][4][5] Data-centric protocol 6 : data transmission from sensor node to the BS through intermediate nodes. The intermediate node may not have interest in the data it receives-it is known as relay node in this case. This process reduces the number of packet sent from source to the sink, which leads to reduce the power consumption.

show abstract