Cover Image

An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points

A recent trend in wireless sensor network (WSN) research is the deployment of a mobile element (ME) for transporting data from sensor nodes to the base station (BS). This helps to achieve significant energy savings as it minimizes the communications required among nodes. However, a major problem is...

Full description

Saved in:
Bibliographic Details
Main Authors: Ghaleb, Mukhtar, K. Subramaniam, Shamala, Ghaleb, Safwan Mahmood Yahya
Format: Article
Language:English
Published: MDPI 2019
Online Access:http://psasir.upm.edu.my/id/eprint/38228/1/38228.pdf
http://psasir.upm.edu.my/id/eprint/38228/
https://www.mdpi.com/2073-8994/11/11/1326
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.38228
record_format eprints
spelling my.upm.eprints.382282020-05-04T16:07:09Z http://psasir.upm.edu.my/id/eprint/38228/ An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points Ghaleb, Mukhtar K. Subramaniam, Shamala Ghaleb, Safwan Mahmood Yahya A recent trend in wireless sensor network (WSN) research is the deployment of a mobile element (ME) for transporting data from sensor nodes to the base station (BS). This helps to achieve significant energy savings as it minimizes the communications required among nodes. However, a major problem is the large data gathering latency. To address this issue, the ME (i.e., vehicle) should visit certain rendezvous points (i.e., nodes) to collect data before it returns to the BS to minimize the data gathering latency. In view of this, we propose a rendezvous-based approach where some certain nodes serve as rendezvous points (RPs). The RPs gather data using data compression techniques from nearby sources (i.e., affiliated nodes) and transfer them to a mobile element when the ME traverses their paths. This minimizes the number of nodes to be visited, thereby reducing data gathering latency. Furthermore, we propose a minimal constrained rendezvous point (MCRP) algorithm, which ensures the aggregated data are relayed to the RPs based on three constraints: (i) bounded relay hop, (ii) the number of affiliation nodes, and (iii) location of the RP. The algorithm is designed to consider the ME’s tour length and the shortest path tree (SPT) jointly. The effectiveness of the algorithm is validated through extensive simulations against four existing algorithms. Results show that the MCRP algorithm outperforms the compared schemes in terms of the ME’s tour length, data gathering latency, and the number of rendezvous nodes. MCRP exhibits a relatively close performance to other algorithms with respect to power algorithms. MDPI 2019 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/38228/1/38228.pdf Ghaleb, Mukhtar and K. Subramaniam, Shamala and Ghaleb, Safwan Mahmood Yahya (2019) An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points. Symmetry, 11 (11). art. no. 1326. pp. 1-17. ISSN 2073-8994 https://www.mdpi.com/2073-8994/11/11/1326 10.3390/sym11111326
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description A recent trend in wireless sensor network (WSN) research is the deployment of a mobile element (ME) for transporting data from sensor nodes to the base station (BS). This helps to achieve significant energy savings as it minimizes the communications required among nodes. However, a major problem is the large data gathering latency. To address this issue, the ME (i.e., vehicle) should visit certain rendezvous points (i.e., nodes) to collect data before it returns to the BS to minimize the data gathering latency. In view of this, we propose a rendezvous-based approach where some certain nodes serve as rendezvous points (RPs). The RPs gather data using data compression techniques from nearby sources (i.e., affiliated nodes) and transfer them to a mobile element when the ME traverses their paths. This minimizes the number of nodes to be visited, thereby reducing data gathering latency. Furthermore, we propose a minimal constrained rendezvous point (MCRP) algorithm, which ensures the aggregated data are relayed to the RPs based on three constraints: (i) bounded relay hop, (ii) the number of affiliation nodes, and (iii) location of the RP. The algorithm is designed to consider the ME’s tour length and the shortest path tree (SPT) jointly. The effectiveness of the algorithm is validated through extensive simulations against four existing algorithms. Results show that the MCRP algorithm outperforms the compared schemes in terms of the ME’s tour length, data gathering latency, and the number of rendezvous nodes. MCRP exhibits a relatively close performance to other algorithms with respect to power algorithms.
format Article
author Ghaleb, Mukhtar
K. Subramaniam, Shamala
Ghaleb, Safwan Mahmood Yahya
spellingShingle Ghaleb, Mukhtar
K. Subramaniam, Shamala
Ghaleb, Safwan Mahmood Yahya
An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points
author_facet Ghaleb, Mukhtar
K. Subramaniam, Shamala
Ghaleb, Safwan Mahmood Yahya
author_sort Ghaleb, Mukhtar
title An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points
title_short An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points
title_full An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points
title_fullStr An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points
title_full_unstemmed An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points
title_sort adaptive data gathering algorithm for minimum travel route planning in wsns based on rendezvous points
publisher MDPI
publishDate 2019
url http://psasir.upm.edu.my/id/eprint/38228/1/38228.pdf
http://psasir.upm.edu.my/id/eprint/38228/
https://www.mdpi.com/2073-8994/11/11/1326
_version_ 1665895966030430208
score 13.211869

Similar Items