A progressive approach to reducing data collection latency in wireless sensor networks with mobile elements

IEEE Transactions on Mobile Computing

Volumn 12, Issue 7, 2013, Pages 1308-1320

  He, Liang ^a   Pan, Jianping ^b   Xu, Jingdong ^c  

^a SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN   (Singapore)

^b UNIVERSITY OF VICTORIA   (Canada)

^c NANKAI UNIVERSITY   (China)

Author keywords

data collection; latency; mobile elements; Wireless sensor networks

Indexed keywords

APPROXIMATION FACTOR; DATA COLLECTION; DATA COLLECTION LATENCIES; EXTENSIVE SIMULATIONS; LATENCY; MOBILE ELEMENTS; PROGRESSIVE OPTIMIZATION; WIRELESS COMMUNICATIONS;

ENERGY UTILIZATION; HEURISTIC ALGORITHMS; TRAVELING SALESMAN PROBLEM; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

DATA ACQUISITION;

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

References (56)

1. X. Xu, J. Luo, and Q. Zhang, "Delay Tolerant Event Collection in Sensor Networks with Mobile Sink," Proc. IEEE INFOCOM, 2010.
2. Y. Zhuang, J. Pan, and L. Cai, "Minimizing Energy Consumption with Probabilistic Distance Models in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2010.
3. S. Panichpapiboon, G. Ferrari, and O. Tonguz, "Optimal Transmit Power in Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 5, no. 10, pp. 1432-1447, Oct. 2006.
4. Y. Zhou, Y. Zhang, and Y. Fang, "Access Control in Wireless Sensor Networks," Ad Hoc Networks, vol. 5, no. 1, pp. 3-13, 2007. (Pubitemid 44573007)
5. W. Zeng, R. Sarkar, F. Luo, X. Gu, and J. Gao, "Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space," Proc. IEEE INFOCOM, 2010.
6. J. Luo and J. Hubaux, "Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2005.
7. W. Wang, V. Srinivasan, and K. Chua, "Extending the Lifetime of Wireless Sensor Networks through Mobile Relays," IEEE/ACM Trans. Networking, vol. 16, no. 5, pp. 1108-1120, Oct. 2008.
8. Z. Li, M. Li, J. Wang, and Z. Cao, "Ubiquitous Data Collection for Mobile Users in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2011.
9. "NEPTUNE Canada," http://www.neptunecanada.ca, 2013.
10. "Underwater Robots Track Oil and Ocean Life," http://spectrum.ieee.org/podcast/robotics/industrial-robots/under water-robots-track-oil-and-ocean-life, 2013.
11. M. Todd et al., "A Different Approach to Sensor Networking for SHM: Remote Powering and Interrogation with Unmanned Aerial Vehicles," Proc. Sixth Int'l Workshop Structural Health Monitoring (IWSHM '07), 2007.
12. J. Luo and J. Huabux, "Joint Sink Mobility and Routing to Maximize the Lifetime of Wireless Sensor Networks: The Case of Constrained Mobility," IEEE/ACM Trans. Networking, vol. 18, no. 3, pp. 871-884, June 2010.
13. G. Xing et al., "Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks," Proc. IEEE 28th Int'l Real-Time Symp. (RTSS '07), 2007.
14. G. Xing, T. Wang, W. Jia, and M. Li, "Rendezvous Design Algorithms for Wireless Sensor Networks with a Mobile Base Station," Proc. ACM MobiHoc, 2008.
15. A. Dumitrscu and J. Mitchell, "Approximation Algorithms for TSP with Neighborhoods in the Plane," J. Algorithms, vol. 48, no. 1, pp. 135-159, 2003.
16. E. Arkin and R. Hassin, "Approximation Algorithms for the Geometric Covering Salesman Problem," Discrete Applied Math., vol. 55, no. 3, pp. 197-218, 1994.
17. J. Gudmundsson and C. Levcopoulos, "A Fast Approximation Algorithm for TSP with Neighborhoods," Nordic J. Computing, vol. 6, no. 4, pp. 469-488, 1999.
18. R. Sugihara and R. Gupta, "Optimizing Energy-Latency Trade-Off in Sensor Networks with Controlled Mobility," Proc. IEEE INFOCOM, 2009.
19. 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)
20. Y. Yuan and Y. Peng, "RaceTrack: An Approximation Algorithm for the Mobile Sink Routing Problem," Proc. Ninth Int'l Conf. Ad-Hoc, Mobile and Wireless Networks (ADHOC-NOW '10), 2010.
21. Niranjan, S. Pandey, and A. Ganz, "Design and Evaluation of Multichannel Multirate Wireless Networks," Mobile Networks and Applications, vol. 11, no. 5, pp. 697-709, Oct. 2006. (Pubitemid 44048672)
22. R. Shah et al., "Data MULEs: Modeling a Three-Tier Architecture for Sparse Sensor Networks," Proc. IEEE First Int'l Workshop Sensor Network Protocols and Applications (SNPA Workshop '03), 2003.
23. M. Ma and Y. Yang, "SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks," IEEE Trans. Parallel and Distributed System, vol. 18, no. 10, pp. 1476-1488, Oct. 2007. (Pubitemid 47456010)
24. O. Tekdas et al., "Using Mobile Robots to Harvest Data from Sensor Fields," IEEE Wireless Comm., vol. 16, no. 1, pp. 22-28, Feb. 2009.
25. C. Papadimitriou and M. Yannakakis, "Optimization, Approximation and Complexity Classes," J. Computer and System Sciences, vol. 43, pp. 425-440, 1991.
26. J. Gudmundsson and C. Levcopoulos, "Hardness Result for TSP with Neighborhoods," Technical Report LU-CS-TR: 2000-216, Dept. of Computer Science, Lund Univ., 2000.
27. S. Safra and O. Schwartz, "On the Complexity of Approximating TSP with Neighborhoods and Related Problems," Computational Complexity, vol. 14, no. 4, pp. 281-307, 2006. (Pubitemid 43388467)
28. K. Elbassioni, A. Fishkin, and R. Sitters, "On Approximating the TSP with Intersecting Neighborhoods," Proc. 17th Int'l Conf. Algorithms and Computation (ISAAC '06), 2006.
29. A. Dumitrscu and J. Mitchell, "A PTAS for TSP with Neighborhoods among Fat Regions in the Plane," Proc. ACM-SIAM Symp. Discrete Algorithms, 2007.
30. W. Zhao and M. Ammar, "Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks," Proc. IEEE Ninth Workshop Future trends of Distributed Computing Systems (FTDCS '03), 2003.
31. A. Somasundara, A. Ramamoorthy, and M. Srivastava, "Mobile Element Scheduling for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines," Proc. IEEE 25th Int'l Real-Time Systems Symp. (RTSS '04), 2004.
32. L. Luo et al., "EnviroMic: Towards Cooperative Storage and Retrieval in Audio Sensor Networks," Proc. IEEE 27th Int'l Conf. Distributed Computing Systems (ICDCS '07), 2007.
33. P. Kulkarni et al., "SensEye: A Multi-Tier Camera Sensor Network," Proc. ACM 13th Ann. Int'l Conf. Multimedia (Multimedia '05), 2005.
34. D. Bhadauria, V. Isler, and O. Tekdas, "Efficient Data Collection from Wireless Nodes under Two-Ring Communication Model," Technical Report UM-CS-11-015, Univ. of Minnesota, 2011.
35. R. Sugihara and R. Gupta, "Speed Control and Scheduling of Data Mules in Sensor Networks," ACM Trans. Sensor Networks, vol. 7, no. 1, article 4, Aug. 2010.
36. R. Sugihara and R. Gupta, "Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks," IEEE Trans. Mobile Computing, vol. 9, no. 1, pp. 127-139, Jan. 2010.
37. O. Chipara et al., "Real-Time Power-Aware Routing in Sensor Networks," Proc. IEEE 14th Int'l Workshop Quality of Service (IWQoS '06), 2006.
38. J. Zhao and R. Govindan, "Understanding Packet Delivery Performance in Dense Wireless Sensor Networks," Proc. ACM First Int'l Conf. Embedded Networked Sensor Systems (Sensys '03), 2003.
39. D. Applegate et al., The Traveling Salesman Problem: A Computational Study. Princeton Univ., 2006.
40. S. Arora, "Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems," Proc. ACM 38th Ann. Symp. Foundations of Computer Science (FOCS '97), 1997.
41. "Concorde TSP Solver," http://www.tsp.gatech.edu/concorde. html, 2013.
42. E. Welzl, "Smallest Enclosing Disks (Balls and Ellipsoids)," New Results and New Trends in Computer Science, pp. 359-370, Springer, 1991.
43. C. Liao and S. Hu, "Polynomial Time Approximation Schemes for Minimum Disk Cover Problems," J. Combinatorial Optimization, vol. 20, no. 4, pp. 399-412, Nov. 2010.
44. D. Hochbaum and W. Maass, "Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI," J. ACM, vol. 32, no. 1, pp. 130-136, 1985. (Pubitemid 15599048)
45. D. Johnson, "The NP-Completeness Column: An Ongoing Guide," J. Algorithms, vol. 7, no. 2, pp. 289-305, 1986.
46. E. Lawler, J. Lenstra, A. Kan, and D. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley Series in Discrete Math. and Optimization. John Wiley & Sons, 1985.
47. D. Johnson, Presented at the Talk Mathematical Programming Sympposium, Tokyo, 1988.
48. J. Beardwood, J. Halton, and J. Hammersley, "The Shortest Path through Many Points," Math. Proc. Cambridge Philosophical Soc., vol. 55, no. 04, pp. 299-327, 1959.
49. "PowerBot," http://robots.mobilerobots.com, 2013.
50. D. Applegate et al., "On the Solution of Traveling Salesman Problems," Documenta Mathematica, vol. ICM-III, pp. 645-656, 1998.
51. T. Rappaport, Wireless Communications Principles and Practices. Prentice-Hall, 2002.
52. D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge Univ., 2005.
53. A. Kansal et al., "Intelligent Fluid Infrastructure for Embedded Networks," Proc. ACM MobiSys, 2004.
54. M. Steyaert et al., Analog Circuit Design, pp. 395-414. Springer, 2010.
55. "CC2591 RF Front-End," http://www.ti.com, 2013.
56. M. Chang and S. Lee, "Performance Analysis of Cooperative Communication System with Hierarchical Modulation over Rayleigh Fading Channel," IEEE Trans. Wireless Comm., vol. 8, no. 6, pp. 2848-2852, June 2009.