Skip to Main content Skip to Navigation
Conference papers

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

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01513759
Contributor : Hal Ifip <>
Submitted on : Tuesday, April 25, 2017 - 2:33:26 PM
Last modification on : Tuesday, April 25, 2017 - 2:35:50 PM
Long-term archiving on: : Wednesday, July 26, 2017 - 2:09:46 PM

File

978-3-642-40820-5_28_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

109

Files downloads

177