Energy-efficiency clustering protocol in wireless sensor networks

Liu, Jain-Shing; Lin, Chun-Hung Richard

doi:10.1016/j.adhoc.2003.09.012

Cited by 78 publications

(36 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proposed protocols can be classified into data-centric, hierarchical, location-based, network flow and QoS-aware routing [6]. Many energy-efficient (hierarchical) clustering algorithms have been proposed to prolong the network lifetime [4,[7][8][9][10][11][12]. We review some of the most relevant papers.…”

Section: Related Workmentioning

confidence: 99%

An unequal cluster-based routing protocol in wireless sensor networks

et al. 2007

View full text Add to dashboard Cite

Clustering provides an effective method for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spot problem in multihop sensor networks. When cluster heads cooperate with each other to forward their data to the base station, the cluster heads closer to the base station are burdened with heavier relay traffic and tend to die much faster, leaving areas of the network uncovered and causing network partitions. To mitigate the hot spot problem, we propose an Unequal Cluster-based Routing (UCR) protocol. It groups the nodes into clusters of unequal sizes. Cluster heads closer to the base station have smaller cluster sizes than those farther from the base station, thus they can preserve some energy for the inter-cluster data forwarding. A greedy geographic and energy-aware routing protocol is designed for the inter-cluster communication, which considers the tradeoff between the energy cost of relay paths and the residual energy of relay nodes. Simulation results show that UCR mitigates the hot spot problem and achieves an obvious improvement on the network lifetime.

show abstract

Section: Related Workmentioning

confidence: 99%

An unequal cluster-based routing protocol in wireless sensor networks

et al. 2007

View full text Add to dashboard Cite

show abstract

“…Otherwise, the multipath model ( mp = 0.0013 pJ/bit/m 4 ) is applied. The energy required to aggregate data in CHs is 5 nJ/bit/signal [14].…”

Section: Methodsmentioning

confidence: 99%

“…Clustering scheme gives rise to the following uneven energy consumption problem: why some nodes deplete their energy and die much faster than others. This occurs because the formation of clusters of unequal size or different geographical conditions put uneven loads on sensor nodes in the network [4,[13][14][15]. In addition, some nodes are burdened with heavier loads, leading to the so-called "hot spot problem" [16].…”

Section: Introductionmentioning

confidence: 99%

CAPNet: An Enhanced Load Balancing Clustering Algorithm for Prolonging Network Lifetime in WSNs

Kim

Seo

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

A wireless sensor network consisting of resources, size, and cost-limited sensors is used in many military and civil applications. This paper proposes an energy-efficient clustering algorithm that extends the lifetime of sensor networks. The proposed clustering algorithm is an extended hierarchical clustering protocol that minimizes the overall amount of consumed energy in the network. The proposed approach dynamically updates clusters and distributes the load on the heavily loaded cluster heads among different nodes. It also balances the remaining energy on nodes in the network, which leads to prolonged network lifetime. The performance is evaluated in terms of network lifetime, average energy consumption, and standard deviation of residual energy.

show abstract

“…The energy model used here is similar to that used by most existing energy-efficient clusteing model [21][22][23] ( ) (1) where ET and ER are the energy consumptions of transmitting and receiving data items respectively. The energy dissipated in operating the transmitter radio, transmitter amplifier and receiver radio are expressed by e t , e amp and r e respectively.…”

Section: Analysis Of the Energy Consumptionmentioning

confidence: 99%

An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks

Bomgni¹,

Myoupo²

2010

View full text Add to dashboard Cite

This paper proposes an energy-efficient geocast algorithm for wireless sensor networks with guaranteed delivery of packets from the sink to all nodes located in several geocast regions. Our approach is different from those existing in the literature. We first propose a hybrid clustering scheme: in the first phase we partition the network in cliques using an existing energy-efficient clustering protocol. Next the set of clusterheads of cliques are in their turn partitioned using an energy-efficient hierarchical clustering. Our approach to consume less energy falls into the category of energy-efficient clustering algorithm in which the clusterhead is located in the central area of the cluster. Since each cluster is a clique, each sensor is at one hop to the cluster head. This contributes to use less energy for transmission to and from the clusterhead, comparatively to multi hop clustering. Moreover we use the strategy of asleep-awake to minimize energy consumption during extra clique broadcasts.

show abstract

Energy-efficiency clustering protocol in wireless sensor networks

Cited by 78 publications

References 30 publications

An unequal cluster-based routing protocol in wireless sensor networks

An unequal cluster-based routing protocol in wireless sensor networks

CAPNet: An Enhanced Load Balancing Clustering Algorithm for Prolonging Network Lifetime in WSNs

An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks

Contact Info

Product

Resources

About