Relay Hop Constrained Rendezvous Algorithm for Mobile Data Gathering in Wireless Sensor Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Relay Hop Constrained Rendezvous Algorithm for Mobile Data Gathering in Wireless Sensor Networks

(1) , (1) , (1) , (1)
1

Abstract

Recent research shows that significant energy saving can be achieved in wireless sensor networks (WSNs) by introducing mobile collector (MC). One obvious bottleneck of such approach is the large data collection latency due to low mobile speed of MC. In this paper, we propose an efficient rendezvous based mobile data gathering protocol for WSNs, in which the aggregated data will be relayed to Rendezvous Node (RN) within bounded hop d. The algorithm design in the protocol jointly considers MC tour and data routing routes in aggregation trees. The effectiveness of the approach is validated through both theoretical analysis and extensive simulations.
Fichier principal
Vignette du fichier
978-3-642-40820-5_28_Chapter.pdf (310.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01513759 , version 1 (25-04-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Wenjun Liu, Jianxi Fan, Shukui Zhang, Xi Wang. Relay Hop Constrained Rendezvous Algorithm for Mobile Data Gathering in Wireless Sensor Networks. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. pp.332-343, ⟨10.1007/978-3-642-40820-5_28⟩. ⟨hal-01513759⟩
55 View
60 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More