Minimum latency multiple data MULE trajectory planning in wireless sensor networks

IEEE Transactions on Mobile Computing

Volumn 13, Issue 4, 2014, Pages 838-851

  Kim, Donghyun ^a   Uma, R N ^a   Abay, Baraki H ^a   Wu, Weili ^b   Wang, Wei ^c   Tokuta, Alade O ^a  

^a NORTH CAROLINA CENTRAL UNIVERSITY   (United States)

^b The University of Texas at Dallas   (United States)

^c XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

approximation algorithm; data mules; traveling salesperson problem with neighborhood; Wireless sensor network

Indexed keywords

CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DATA COLLECTION LATENCIES; DATA MULES; MULTIPLE DATA; OPTIMAL TRAJECTORIES; PATH COVER; TRAJECTORY PLANNING; TRAVELING SALESPERSON PROBLEM WITH NEIGHBORHOODS;

HEURISTIC ALGORITHMS; TRAVELING SALESMAN PROBLEM; WIRELESS SENSOR NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 84897904263     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2013.69     Document Type: Article

References (21)

1. D. Kim, B.H. Abay, R.N. Uma, W. Wu, W. Wang, and A.O. Tokuta, "Minimizing Data Collection Latency in Wireless Sensor Network with Multiple Mobile Elements," Proc. 31st IEEE Int'l Conf. Computer Comm. (INFOCOM '12), pp. 504-512, Mar. 2012.
2. S.A. Punjab, F.F. Punjab, and S.S. Punjab, "Power Consumption in Wireless Sensor Networks," Proc. Seventh Int'l Conf. Frontiers of Information Technology, 2009.
3. M. Todd, D. Mascarenas, E. Flynn, T. Rosing, B. Lee, D. Musiani, S. Dasgupta, S. Kpotufe, D. Hsu, R. Gupta, G. Park, T. Overly, M. Nothnagel, and C. Farrar, "A Different Approach to Sensor Networking for SHM: Remote Powering and Interrogation with Unmanned Aerial Vehicles," Proc. Sixth Int'l Workshop Structural Health Monitoring, 2007.
4. R. Sugihara and R.K. Gupta, "Speed Control and Scheduling of Data Mules in Sensor Networks," ACM Trans. Sensor Networks, vol. 7, no. 1, article 4, Aug. 2010.
5. R. Shah, S. Roy, S. Jain, and W. Brunette, "Data MULEs: Modeling a Three-Tier Architecture for Sparse Sensor Networks," Proc. First IEEE Int'l Workshop Sensor Network Protocols and Applications (SNPA '03), 2003.
6. A. Chakrabarti, A. Sabharwal, and B. Aazhang, "Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks," Proc. ACM/IEEE Int'l Conf. Information Processing in Sensor Networks, vol. 2634, pp. 552-568, 2003.
7. M. Ma and Y. Yang, "SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 10, pp. 1476-1488, Oct. 2007. (Pubitemid 47456010)
8. B. Yuan, M. Orlowska, and S. Sadiq, "On the Optimal Robot Routing Problem in Wireless Sensor Networks," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 9, pp. 1252-1261, Sept. 2007. (Pubitemid 47273592)
9. D. Ciullo, G.D. Celik, and Eytan Modiano, "Minimizing Transmission Energy in Sensor Networks via Trajectory Control," Proc. Eight Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), pp. 132-141, May/June 2010.
10. O. Tekdas, V. Isler, J. Lim, and A. Terzis, "Using Mobile Robots to Harvest Data from Sensor Fields," IEEE Wireless Comm., vol. 16, no. 1, pp. 22-28, Feb. 2009.
11. "NEPTUNE Canada," http://www.neptunecanada.ca, 2014.
12. "Underwater Robots Track Oil and Ocean Life," http://spectrum. ieee.org/podcast/robotics/industrial-robots/underwater-robotstrack-oil-and- ocean-life, 2012.
13. A. Dumitrescu and J.S.B. Mitchell, "Approximation Algorithms for TSP with Neighborhoods in the Plane," Proc. 12th Ann. ACMSIAM Symp. Discrete Algorithms (SODA '01), Jan. 2001.
14. G.N. Frederickson, M.S. Hecht, and C.E. Kim, "Approximation Algorithms for Some Routing Problems," SIAM J. Computing, vol. 7, pp. 178-193, 1978.
15. G. Even, N. Garg, J. Konemann, R. Ravi, and A. Sinha, "Min-Max Tree Covers of Graphs," Operations Research Letters, vol. 32, no. 4, pp. 309-315, 2004.
16. N. Guttmann-Beck and R. Hassin, "Approximation Algorithms for Min-Max Tree Partition," J. Algorithms, vol. 24, pp. 266-286, 1997. (Pubitemid 127451220)
17. E.M. Arkin, R. Hassin, and A. Levin, "Approximations for Min-Max Vehicle Routing Problems," J. Algorithms, vol. 59, no. 1, Apr. 2006.
18. Y. Yang, M. Lin, J. Xu, and Y. Xie, "Minimum Spanning Tree with Neighborhoods," Proc. Third Int'l Conf. Algorithmic Aspects in Information and Management (AAIM '07), June 2007.
19. N. Christofides, "Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem," Research Report 388, Graduate School of Industrial Administration, Carnegie-Mellon Univ., 1976.
20. C.H. Papadimitriou, "The Euclidean Traveling Salesman Problem is NP-Complete," Theoretical Computer Science, vol. 4, no. 3, pp. 237-244, 1977.
21. J.S.B. Mitchell, "A Constant-Factor Approximation Algorithm for TSP with Pairwise-Disjoint Connected Neighborhoods in the Plane," Proc. Ann. Symp. Computational Geometry (SoCG '10), June 2010.