On the traversals of multiple mobile sinks in sensor networks

Proceeding - 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, ICT-MICC 2007

Volumn , Issue , 2007, Pages 432-437

  Nesamony, Sudarsanan ^a   Vairamuthu, Madhan Karky ^a   Orlowska, Maria E ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

K TSP; Minmax objective; Mobile sink; Sensor network

Indexed keywords

EXPERIMENTS; HEURISTIC METHODS; RESEARCH; SENSOR NETWORKS; SENSORS; TELECOMMUNICATION EQUIPMENT; TELECOMMUNICATION SYSTEMS;

HEURISTIC APPROACHES; INTERNATIONAL CONFERENCES; K-TSP; MALAYSIA; MINIMUM-TIME; MINMAX OBJECTIVE; MOBILE SINK; MOBILE SINKS; MULTIPLE MOBILE SINKS; SENSOR DATA; SENSOR NETWORK; SENSOR NODE;

WIRELESS SENSOR NETWORKS;

EID: 48349115075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTMICC.2007.4448675     Document Type: Conference Paper

References (25)

1. N. Rao, S. Kareti, W. Shi and S. Iyenagar "Robot Navigation in Unknown Terrains: Introductory Survey of Non-Heuristic Algorithms" Oak Ridge National Laboratory Technical Report, ORNL/TM-12410:1-58, July 1993
2. S. Rathinam and R. Sengupta "Lower and Upper Bounds for a Symmetric Multiple Depot, Multiple Travelling Salesman Problem" Institute of Transportation Studies. Research Reports. Paper UCB-ITSRR-2006-2. March 21, 2006
3. S. Nesamony, M.K.Vairamuthu, M.E. Orlowska and S.W. Shazia "On Optimal route computation of mobile sink in a wireless sensor network" Technical Report No: 465, School of ITEE, The University of Queensland, December 2006 http://www.itee.uq.edu.au/A∼sense/TR 465.PDF
4. C. E. Miller, A. W. Tucker, and R. A. Zemlin "Integer programming formulation of traveling salesman problems" Journal of the ACM, 7(4):326-329, October 1960
5. M. Bellmore and S.Hong "Transformation of multisalesman problem to the standard traveling salesman problem" Journal of the ACM, 21(3):500-504, July 1974
6. M. R. Rao "A note on the multiple traveling salesmen problem" Operations Research 28: 628-632, 1980
7. G.N. Fredrickson, M.S. Hecht and C.E. Kim "Approximation algorithms for some routing problems" SIAM Journal on Computing 7: 178-193, 1978
8. S. Sahni and T. Gonzalez "P-complete approximation problems" Journal of the ACM, 23(3):555-565, July 1976
9. I. Averbakh and O. Berman "A Heuristic with Worst-Case Analysis for Minimax Routing of Two Traveling Salesmen on a Tree" Discrete Applied Mathematics 68:17-32, 1996
10. I. Averbakh and O. Berman "(p-l)/(p+l)-approximate algorithms for p-Traveling Salesmen problems on a tree with minmax objective" Discrete Applied Mathematics 75:201-216, 1997
11. I. Averbakh and O. Berman " Minmax p-Traveling Salesmen Location problems on a Tree" Annals of Operations Research 110:55-68, 2002
12. M. Dynia, M. Korzeniowski and C. Schindelhauer "Power-Aware Collective Tree Exploration" In Proceedings of ARCS'06, LNCS 3894: 341-351, Springer Verlag, 2006
13. M. Dynia, J. Kutylowski, F. Meyer auf der Heide and C. Schindelhauer "Smart Robot Teams Exploring Sparse Trees" In Proceedings of MFCS'06, LNCS 4162:327-338, Springer Verlag, 2006
14. S. Somhom, A. Modares and T. Enkawa "Competition-based neural network for the multiple traveling salesmen problem with minmax objective" Computers and Operations Research 26:395-407, 1999
15. S. Rathinam and R. Sengupta "Matroid Intersection and its application to a Multiple Depot, Multiple TSP" Institute of Transportation Studies. Research Reports. Paper UCB-ITS-RR-2006-3, May 1, 2006
16. Y. GuoXing "Transformation of multidepot multisalesmen problem to the standard traveling salesmen problem" European Journal of Operational Research 81:557-560, 1995
17. B. Dantzig and J. H. Ramser "The truck dispatching problem" Management Science, 6:80-91, 1959
18. J.-F. Cordeau, G. Laporte, M.W.P. Savelsbergh and D. Vigo "Vehicle Routing" Handbooks in Operations Research and Management Science, C. Barnhart and G. Laporte (eds.), Elsevier, Amsterdam, 2005
19. B. L. Golden, G. Laporte, E. D. Taillard "An adaptive memory heuristic for a class of vehicle routing problems with minmax objective" Computers and Operations Research 24:445-52, 1997
20. D. Applegate, W. Cook, S. Dash and A. Rohe "Solution of a min-max Vehicle Routing Problem" INFORMS Journal on Computing, 14(2):132-143,2002
21. C. Bazgan, R. Hassin and J. Monnot "Approximation Algorithms for Some Vehicle Routing Problems" Discrete applied mathematics 146:27-42, 2005
22. E. M. Arkin, R. Hassin and A. Levin " Approximations for minimum and min-max vehicle routing problems" Journal of Algorithms 59:1-18, 2006
23. J. Carlsson, D. Ge, A. Subramaniam, A. Wu and Y. Ye "Solving Min-Max Multi-Depot Vehicle Routing Problem" manuscript, 2006
24. S. S. Skiena "The Algorithm Design Manual", ISBN 0-387-94860-0, page 321, Springer Verlag, 1998
25. http://www.itee.uq.edu.au/∼sense/ (accessed on 29th January 2007)