Data Gathering with Tour Length-Constrained

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

Send Message

To: Author

GJCST Volume 13 Issue E11

Article Fingerprint

ReserarchID

CSTNWSW7177

Data Gathering with Tour Length-Constrained Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

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.

31 Cites in Articles

References

  1. Anthony Lamarca,Waylon Brunette,David Koizumi,Matthew Lease,Stefan Sigurdsson,Kevin Sikorski,Dieter Fox,Gaetano Borriello (2002). Making Sensor Networks Practical with Robots.
  2. J Butler Robotics and ssMicroelectronics: Mobile Robots as Gateways into Wireless Sensor Networks.
  3. E Ekici,Y Gu,D Bozdag (2006). Mobility-based communication in wireless sensor networks.
  4. Khaled Almi'ani,Selvakennedy Selvadurai,Anastasios Viglas (2008). Periodic Mobile Multi-Gateway Scheduling.
  5. Y Gu,D Bozdag,E Ekici,F Ozguner,C Lee (2005). Partitioning based mobile element scheduling in wireless sensor networks.
  6. S Gandham,M Dawande,R Prakash,S Venkatesan (2003). Energy efficient schemes for wireless sensor networks with multiple mobile base stations.
  7. A Somasundara,A Ramamoorthy,M Srivastava (2007). Mobile element scheduling with dynamic deadlines.
  8. A Somasundara,A Ramamoorthy,B Srivastava (2004). Mobile Element Scheduling for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines.
  9. Zichuan Xu,Weifa Liang,Yinlong Xu (2012). Network Lifetime Maximization in Delay-Tolerant Sensor Networks with a Mobile Sink.
  10. Guoliang Xing,Tian Wang,Zhihui Xie,Weijia Jia (2007). Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks.
  11. G Xing,T Wang,W Jia,M Li (2008). Rendezvous design algorithms for wireless sensor networks with a mobile base station.
  12. G Xing,T Wang,Z Xie,W Jia (2008). Rendezvous planning in wireless sensor networks with mobile elements.
  13. K Almi'ani,A Viglas,L Libman (2010). Energyefficient data gathering with tour length-constrained mobile elements in wireless sensor networks.
  14. K Almi'ani,A Viglas,M Aalsalem (2011). Mobile Element Path Planning for Gathering Transit-Time Constrained Data.
  15. M Ma,Y Yang (2007). SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks.
  16. R Pon,M Batalin,J Gordon,A Kansal,Duo Liu,M Rahimi,L Shirachi,Yan Yu,M Hansen,W Kaiser,M Srivastava,G Sukhatme,D Estrin (2005). Networked infomechanical systems: a mobile embedded networked sensor platform.
  17. K Dantu,M Rahimi,H Shah,S Babel,A Dhariwal,G Sukhatme (2005). Robomote: enabling mobility in sensor networks.
  18. Z Wang,S Basagni,E Melachrinoudis,C Petrioli (2005). Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime.
  19. David Jea,Arun Somasundara,Mani Srivastava (1997). Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks.
  20. Y Xu,Zichuan Liang,Weifa Xu (2005). Network Lifetime Maximization in Delay-Tolerant Sensor Notes in.
  21. A Somasundara,A Kansal,D Jea,D Estrin,M Srivastava (2006). Controllably mobile infrastructure for low energy embedded networks.
  22. J Rao,S Biswas (2008). Joint routing and navigation protocols for data harvesting in sensor networks.
  23. E Bonabeau,M Dorigo,G Theraulaz (1999). Swarm Intelligence.
  24. Paolo Toth,Daniele Vigo (2001). Models, relaxations and exact approaches for the capacitated vehicle routing problem.
  25. M Solomon (2010). ALGORITHMS FOR AND SCHEDULING PROBLEMS THE VEHICLE ROUTING WITH TIME WINDOW CONSTRAINTSS.
  26. N Bansal,A Blum,S Chawla,A Meyerson (2004). Approximation algorithms for deadline-TSP and vehicle routing with time-windows.
  27. Bruce Golden,Larry Levy,Rakesh Vohra (2006). The orienteering problem.
  28. Joseph Mitchell (1998). Geometric Shortest Paths and Network Optimization.
  29. N Christofides (1976). Worst-case analysis of a new heuristic for the traveling salesman problem.
  30. J Hou,L Kung,N Li,H Zhang,W Chen,H Tyan,H Lim (2006). J-Sim: A Simulation and emulation environment for wireless sensor networks.
  31. J Hill,D Culler (2002). Mica: a wireless platform for deeply embedded networks.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Mohammad A. Almahameed. 2013. \u201cData Gathering with Tour Length-Constrained\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 13 (GJCST Volume 13 Issue E11): .

Download Citation

Issue Cover
GJCST Volume 13 Issue E11
Pg. 41- 50
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Classification
Not Found
Version of record

v1.2

Issue date

August 16, 2013

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 9455
Total Downloads: 2491
2026 Trends
Research Identity (RIN)
Related Research

Published Article

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.

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]
×

This Page is Under Development

We are currently updating this article page for a better experience.

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