Data Gathering with Tour Length-Constrained

Article ID

CSTNWSW7177

Data Gathering with Tour Length-Constrained

Mohammad A. Almahameed
Mohammad A. Almahameed Al Hussein Bin Talal University
Mohammed Aalsalem
Mohammed Aalsalem
khaled Almiani
khaled Almiani
Ghazi Al-Naymat
Ghazi Al-Naymat
DOI

Abstract

In this paper, given a single mobile element and a time deadline, we investigate the problem of designing the mobile element tour to visit subset of nodes, such that the length of this tour is bounded by the time deadline and the communication cost between nodes outside and inside the tour is minimized. The nodes that the mobile element tour visits, works as cache points that store the data of the other nodes. Several algorithms in the literature have tackled this problem by separating two phases; the construction of the mobile element tour from the computation of the forwarding trees to the cache points. In this paper, we propose algorithmic solutions that alternate between these phases and iteratively improves the outcome of each phase based on the result of the other. We compare the resulting performance of our solutions with that of previous work.

Data Gathering with Tour Length-Constrained

In this paper, given a single mobile element and a time deadline, we investigate the problem of designing the mobile element tour to visit subset of nodes, such that the length of this tour is bounded by the time deadline and the communication cost between nodes outside and inside the tour is minimized. The nodes that the mobile element tour visits, works as cache points that store the data of the other nodes. Several algorithms in the literature have tackled this problem by separating two phases; the construction of the mobile element tour from the computation of the forwarding trees to the cache points. In this paper, we propose algorithmic solutions that alternate between these phases and iteratively improves the outcome of each phase based on the result of the other. We compare the resulting performance of our solutions with that of previous work.

Mohammad A. Almahameed
Mohammad A. Almahameed Al Hussein Bin Talal University
Mohammed Aalsalem
Mohammed Aalsalem
khaled Almiani
khaled Almiani
Ghazi Al-Naymat
Ghazi Al-Naymat

No Figures found in article.

Mohammad A. Almahameed. 2013. “. Global Journal of Computer Science and Technology – E: Network, Web & Security GJCST-E Volume 13 (GJCST Volume 13 Issue E11): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Issue Cover
GJCST Volume 13 Issue E11
Pg. 41- 50
Classification
Not Found
Article Matrices
Total Views: 9433
Total Downloads: 2382
2026 Trends
Research Identity (RIN)
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Data Gathering with Tour Length-Constrained

Mohammad A. Almahameed
Mohammad A. Almahameed Al Hussein Bin Talal University
Mohammed Aalsalem
Mohammed Aalsalem
khaled Almiani
khaled Almiani
Ghazi Al-Naymat
Ghazi Al-Naymat

Research Journals