Clustering with One-Time Setup for Reduced Energy Consumption and Prolonged Lifetime in Wireless Sensor Networks

Shin, Heewook; Moh, Sangman; Chung, Ilyong

doi:10.1155/2013/301869

Cited by 10 publications

(8 citation statements)

References 12 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In cluster-based networks, more energy is consumed by CH nodes than the normal SNs (which can also be regarded as cluster members). It is obvious because more computing and communication loads are assigned to CHs [31]. The variation in the energy consumed by nodes being CHs and CMs may cause unexpected early death of some nodes.…”

Section: Egr Protocolmentioning

confidence: 99%

Robust Evolutionary-Game-Based Routing for Wireless Multimedia Sensor Networks

Habib

Moh

2019

Sensors

Self Cite

View full text Add to dashboard Cite

Nowadays, wireless multimedia sensor networks (WMSNs) are used in various applications. An energy-efficient and robust routing protocol is essential for WMSNs because the quality of service is important for traffic-intensive multimedia data, such as images and videos. A WMSN with multiple sinks allows cluster heads (CHs) to deliver the collected data to the nearest sink, thereby mitigating the delivery overhead. In this study, we propose a novel evolutionary-game-based routing (EGR) protocol for WMSNs with multiple sinks, in which the evolutionary game theory is exploited for selecting CHs. In EGR, an algorithm to mitigate data redundancy, based on the overlapping field of views of the multimedia sensor nodes, is also presented. This algorithm decreases the number of redundant transmissions, thereby increasing energy efficiency and network performance. According to the performance evaluation results of this study, the proposed EGR significantly outperforms the state-of-art protocols in terms of energy efficiency, end-to-end delay, packet delivery ratio, cluster formation time, and network lifetime.

show abstract

Section: Egr Protocolmentioning

confidence: 99%

Robust Evolutionary-Game-Based Routing for Wireless Multimedia Sensor Networks

Habib

Moh

2019

Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

“…The extra energy and time are consumed to reform clusters at the setup phase of every round. This side effect is worse as the number of clusters increases [6]. The clustering time, CH selection period, CH tenure adds up to the sensor network time.…”

Section: Clustering In Wireless Sensor Networkmentioning

confidence: 99%

“…Many researchers have been doing studies in the past many years exploring the LEACH protocol to improve performance. However, there has been no work to address energy consumption during the cluster-reforming process [6]. LEACH with Deterministic cluster-head selection is one of LEACH's variations, in which cluster heads are elected by reducing the threshold.…”

Section: Related Workmentioning

confidence: 99%

“…This is because more computing and communication loads are assigned to the CHs. This non-uniformity of energy consumption among nodes results in some nodes dying earlier than others [6]. This imbalance of energy among the nodes has motivated us to design the proposed re-clustering algorithm which concentrates mainly on efficiently balancing the energy among sensor nodes in a cluster.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Energy-Efficient Re-Clustering and Data Reporting Algorithm for Energy Constrained Wireless Sensor Network

Hemappa¹,

Manjaiah²,

Bera³

et al. 2014

IJCA

View full text Add to dashboard Cite

Wireless sensor networks consist of tiny sensors powered by low power battery and in most of the applications sensors are deployed to monitor the unattended areas. As sensor nodes are energy constrained in the network, energy efficiency is an important factor and should be considered during the protocol design phase. In this article we propose a robust, poweraware in-network clustering protocol to increase the network lifetime, which is based on parameters like residual energy, distance to the base station and proximity of the base station. The proposed cluster head selection protocol offers an efficient way of balancing the energy among member nodes of the cluster with considerably lesser energy consumption. Proposed novel algorithm is experimented in Matlab simulator and results shows significant improvements when compared to LEACH algorithm. The performance is evaluated by considering the impact of energy balancing among the nodes and network lifetime efficiency in WSN. General TermsCluster Head Selection, Re-clustering, Wireless sensor network.

show abstract

“…Clustering is a well-known strategy in WSNs, where nearby nodes form a group called a cluster, and divide their data transmission activities into intra-cluster and inter-cluster transmissions [ 2 ]. The clustering technique helps to minimize routing activities, conserve bandwidth, stabilize the network topology, and preserve energy [ 3 ]. The sensor nodes are usually battery-powered, which makes their energy resources very limited.…”

Section: Introductionmentioning

confidence: 99%

An Energy-Efficient and Compact Clustering Scheme with Temporary Support Nodes for Cognitive Radio Sensor Networks

Salim

Moh

Choi

et al. 2014

Sensors

Self Cite

View full text Add to dashboard Cite

A cognitive radio sensor network (CRSN) is a wireless sensor network whose sensor nodes are equipped with cognitive radio capability. Clustering is one of the most challenging issues in CRSNs, as all sensor nodes, including the cluster head, have to use the same frequency band in order to form a cluster. However, due to the nature of heterogeneous channels in cognitive radio, it is difficult for sensor nodes to find a cluster head. This paper proposes a novel energy-efficient and compact clustering scheme named clustering with temporary support nodes (CENTRE). CENTRE efficiently achieves a compact cluster formation by adopting two-phase cluster formation with fixed duration. By introducing a novel concept of temporary support nodes to improve the cluster formation, the proposed scheme enables sensor nodes in a network to find a cluster head efficiently. The performance study shows that not only is the clustering process efficient and compact but it also results in remarkable energy savings that prolong the overall network lifetime. In addition, the proposed scheme decreases both the clustering overhead and the average distance between cluster heads and their members.

show abstract

Clustering with One-Time Setup for Reduced Energy Consumption and Prolonged Lifetime in Wireless Sensor Networks

Cited by 10 publications

References 12 publications

Robust Evolutionary-Game-Based Routing for Wireless Multimedia Sensor Networks

Robust Evolutionary-Game-Based Routing for Wireless Multimedia Sensor Networks

An Energy-Efficient Re-Clustering and Data Reporting Algorithm for Energy Constrained Wireless Sensor Network

An Energy-Efficient and Compact Clustering Scheme with Temporary Support Nodes for Cognitive Radio Sensor Networks

Contact Info

Product

Resources

About