You are on page 1of 1

Energy-Aware Receiver-Driven Medium Access Control Protocol for

Wireless Energy-Harvesting Sensor Networks with Multiple Gateways


Minh D. Nguyen1, Cong Tran1, Tatsuhiro Kawaguchi2, Ryo Tanabe2, Masaru Oinaga2, Ryuhei Takahashi2,

Koji Ishibashi2, and Won-Yong Shin1

1Dankook Univ. (Republic of Korea), 2Univ. of Electro-Communications (Japan)

Abstract
We extend the prior energy-aware receiver-driven medium access control (MAC) protocol for wireless energy-harvesting sensor networks to
the case of multiple gateways. We formulate the problem of selecting the optimal locations for multiple gateways in terms of minimizing the
total Euclidean distance from sensor nodes to the gateways and numerically show its solution.

Introduction Experimental Results


 Energy-efficient medium access control (MAC) protocol:  Experiment setup: 140 sensor nodes, 2 gateways.
o Based on intermittent receiver-driven data transmission [1]  Proposed method:
o Assumes only one gateway o Gateways at their optimal positions (found via clustering)
High traffics load near gateway  Baseline methods:
o Gateways at random positions
o Single gateway

Package Loss Rate


0.6

0.5

0.4

 In our work:
0.3
o Deploy multiple gateways
o Clustering approach to placing gateways 0.2

Minimize the Euclidean distance


0.1
Decrease the package loss rate and transmitting energy
0
Methodology Gateways at optimal Gateways at random Single gateway
positions positions
 Consider a network:
o m sensor nodes (SNs) in ℝ2 ~ non-uniform distribution in
inhomogeneous Poisson Point Process.
Average current per node (mA/node)
0.195
o Observation area: toroidal space 0.19
0.185
o n gateways (GWs), where there locations to be optimized
0.18
o 𝑴𝒋 ∈ ℕ layers around a gateway with inter-layer interval 𝑳 0.175
0.17
o 𝑷𝒎𝒆𝒎𝒊𝒋 represents the membership probability that a node i
0.165
belongs to a gateway 𝑮𝑾𝒋 0.16
0.155
0.15
0.145
Gateways at optimal Gateways at random Single gateway
positions positions

 Proposed method has:


Lower package loss rate
▫ Lower average current per node
Lower system energy consumption
▫ Compared to the two baseline methods

o Aims to minimize:
𝒎 𝒏 References
𝐚𝐫𝐠 𝐦𝐢𝐧 ෍ ෍ 𝑷𝒎𝒆𝒎𝒊𝒋 𝑫(𝑵𝒊 , 𝑮𝑾𝒋 ) , [1] T. Hatauchi, Y. Fukuyama, M. Ishii, and T. Shikura, “A power
𝑮𝑾
𝒊=𝟏 𝒋=𝟏 efficient access method by polling for wireless mesh networks,”
where 𝑫(𝑵𝒊 , 𝑮𝑾𝒋 ) = distance between a node 𝑵𝒊 and a gateway IEEJ Trans. Electron. Inform. Syst., vol. 128, no. 12, pp. 1761-
𝑮𝑾𝒋 1766, Dec. 2008.

You might also like