Abstract
Sink-centric traffic pattern is common in wireless sensor networks (WSN), which typically causes higher energy consumption of the sensor nodes near the sink node (called ‘hot spot’ problem). Clustering combined with careful traffic flow control can alleviate a hot spot by dispersing the energy burden concentration. Existing clustering schemes treat each clusters as an entity for energy efficiency optimization. We propose to group a set of clusters into ‘cluster-rings’, which is a chain of clusters that are equal distance away from the sink, and conduct energy efficiency optimization at the cluster-ring level. More specifically, we first present a novel method to compose a cluster structure. Next, we present an algorithm that gradually optimizes the traffic flow control at the cluster-ring level by using a multi-agent reinforcement learning technique. Then, we present an algorithm that makes cluster-level traffic routing decision on the basis of cluster-ring level traffic flow control results. Via simulations, it is shown that the proposed scheme result near-optimal performance and can adapt to dynamic changes of network-wide traffic generation.
| Original language | English |
|---|---|
| Pages (from-to) | 12-25 |
| Number of pages | 14 |
| Journal | Computer Communications |
| Volume | 101 |
| DOIs | |
| Publication status | Published - 2017 Mar 15 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Cite this
}
Energy efficient data collection in sink-centric wireless sensor networks : A cluster-ring approach. / Moon, Soo Hoon; Park, Sunju; Han, Seungjae.
In: Computer Communications, Vol. 101, 15.03.2017, p. 12-25.Research output: Contribution to journal › Article
TY - JOUR
T1 - Energy efficient data collection in sink-centric wireless sensor networks
T2 - A cluster-ring approach
AU - Moon, Soo Hoon
AU - Park, Sunju
AU - Han, Seungjae
PY - 2017/3/15
Y1 - 2017/3/15
N2 - Sink-centric traffic pattern is common in wireless sensor networks (WSN), which typically causes higher energy consumption of the sensor nodes near the sink node (called ‘hot spot’ problem). Clustering combined with careful traffic flow control can alleviate a hot spot by dispersing the energy burden concentration. Existing clustering schemes treat each clusters as an entity for energy efficiency optimization. We propose to group a set of clusters into ‘cluster-rings’, which is a chain of clusters that are equal distance away from the sink, and conduct energy efficiency optimization at the cluster-ring level. More specifically, we first present a novel method to compose a cluster structure. Next, we present an algorithm that gradually optimizes the traffic flow control at the cluster-ring level by using a multi-agent reinforcement learning technique. Then, we present an algorithm that makes cluster-level traffic routing decision on the basis of cluster-ring level traffic flow control results. Via simulations, it is shown that the proposed scheme result near-optimal performance and can adapt to dynamic changes of network-wide traffic generation.
AB - Sink-centric traffic pattern is common in wireless sensor networks (WSN), which typically causes higher energy consumption of the sensor nodes near the sink node (called ‘hot spot’ problem). Clustering combined with careful traffic flow control can alleviate a hot spot by dispersing the energy burden concentration. Existing clustering schemes treat each clusters as an entity for energy efficiency optimization. We propose to group a set of clusters into ‘cluster-rings’, which is a chain of clusters that are equal distance away from the sink, and conduct energy efficiency optimization at the cluster-ring level. More specifically, we first present a novel method to compose a cluster structure. Next, we present an algorithm that gradually optimizes the traffic flow control at the cluster-ring level by using a multi-agent reinforcement learning technique. Then, we present an algorithm that makes cluster-level traffic routing decision on the basis of cluster-ring level traffic flow control results. Via simulations, it is shown that the proposed scheme result near-optimal performance and can adapt to dynamic changes of network-wide traffic generation.
UR - http://www.scopus.com/inward/record.url?scp=85002875314&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85002875314&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2016.07.001
DO - 10.1016/j.comcom.2016.07.001
M3 - Article
AN - SCOPUS:85002875314
VL - 101
SP - 12
EP - 25
JO - Computer Communications
JF - Computer Communications
SN - 0140-3664
ER -