KSII Transactions on Internet and Information Systems (TIIS)

  • 제7권10호
  • /
  • Pages.2357-2375
  • /
  • 2013
  • /
  • 1976-7277(pISSN)
  • /
  • 1976-7277(eISSN)
한국인터넷정보학회 (Korean Society for Internet Information)
권호 표지
DOI QR코드

DOI QR Code

Closed Walk Ferry Route Design for Wireless Sensor Networks

  • Dou, Qiang (College of Computer, National University of Defense Technology) ;
  • Wang, Yong (College of Computer, National University of Defense Technology) ;
  • Peng, Wei (College of Computer, National University of Defense Technology) ;
  • Gong, Zhenghu (College of Computer, National University of Defense Technology)
  • 투고 : 2013.03.06
  • 심사 : 2013.09.21
  • 발행 : 2013.10.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Message ferry is a controllable mobile node with large capacity and rechargeable energy to collect information from the sensors to the sink in wireless sensor networks. In the existing works, route of the message ferry is often designed from the solutions of the Traveling Salesman Problem (TSP) and its variants. In such solutions, the ferry route is often a simple cycle, which starts from the sink, access all the sensors exactly once and moves back to the sink. In this paper, we consider a different case, where the ferry route is a closed walk that contains more than one simple cycle. This problem is defined as the Closed Walk Ferry Route Design (CWFRD) problem in this paper, which is an optimization problem aiming to minimize the average weighted delay. The CWFRD problem is proved to be NP-hard, and the Integer Linear Programming (ILP) formulation is given. Furthermore, a heuristic scheme, namely the Initialization-Split-Optimization (ISO) scheme is proposed to construct closed walk routes for the ferry. The experimental results show that the ISO algorithm proposed in this paper can effectively reduce the average weighted delay compared to the existing simple cycle based scheme.

키워드

참고문헌

  1. A. S. Arun, R. Aditya, and B. S. Mani, "Mobile element scheduling with dynamic deadlines," Mobile Computing, IEEE Transactions on, vol. 6, no. 4, pp. 395-410, 2007. https://doi.org/10.1109/TMC.2007.57
  2. P. Juang, H. Oki, Y. Wang, M. Martonosi, L. S. Peh, and D. Rubenstein, "Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet," SIGOPS Oper. Syst. Rev., vol. 36, no. 5, pp. 96-107, 2002. https://doi.org/10.1145/635508.605408
  3. R. Szewczyk, E. Osterweil, J. Polastre, M. Hamilton, A. Mainwaring, and D. Estrin, "Habitat monitoring with sensor networks," Commun. ACM, vol. 47, pp. 34-40, June 2004.
  4. A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks," tech. rep., Duke University, 2000.
  5. W. Zhao and M. Ammar, "Message ferrying: Proactive routing in highly-parititioned wireless ad hoc networks," in Proc. of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems, (Puerto Rico), pp. 308-314, 2003.
  6. W. Zhao, M. Ammar, and E. Zegura, "A message ferrying approach for data delivery in sparse mobile ad hoc networks," in Proc. of the 5th ACM international symposium on Mobile ad hoc networking and computing, (Roppongi Hills, Tokyo, Japan), pp. 187-198, ACM, 2004.
  7. W. Zhao, M. Ammar, and E. Zegura, "Controlling the mobility of multiple data transport ferries in a delay-tolerant network," in Proc. of INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 2, pp. 1407- 1418, 2005.
  8. P. Wei, Z. Baokang, Y. Wanrong, W. Chunqing, and Y. Xiaorong, "Ferry route design with delay bounds in delay-tolerant networks," in Proc. of Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on, pp. 281-288, 2010.
  9. W. Xiaoyang, C. Yingwen, X. Ming, and P. Wei, "Tafr: A ttl-aware message ferry scheme in dtn," in Proc. of Computational and Information Sciences (ICCIS), 2012 Fourth International Conference on, pp. 1380-1383, 2012.
  10. R. C. Shah, S. Roy, S. Jain, and W. Brunette, "Data mules: modeling a three-tier architecture for sparse sensor networks," in Proc. of Sensor Network Protocols and Applications, Proceedings of the First IEEE., pp. 30- 41, 2003.
  11. Y. Gu, D. Bozdag, E. Ekici, F. Ozguner, and C.-G. Lee, "Partitioning based mobile element scheduling in wireless sensor networks," in Proc. of Sensor and Ad Hoc Communications and Networks (SECON), Second Annual IEEE Communications Society Conference on, pp. 386 - 395, sept., 2005.
  12. L. Tong, Q. Zhao, and S. Adireddy, "Sensor networks with mobile agents," in Proc. of 2003 Military Communications Intl Symp, pp. 688-693, 2003.
  13. J. Chen, Y. Chen, L. Zhou, and Y. Du, "A data gathering approach for wireless sensor network with quadrotor-based mobile sink node," KSII Transactions on Internet and Information Systems, vol. 6, no. 10, pp. 2529-2547, 2012.
  14. M. M. B. Tariq, M. A. Zegura, and E. Zegura, "Message ferry route design for sparse ad hoc networks with mobile nodes," 2006.
  15. A. A. Somasundara, A. Ramamoorthy, and M. B. Srivastava, "Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines," in Proc. of Real-Time Systems Symposium, 2004. Proceedings. 25th IEEE International, Real-Time Systems Symposium, 2004. Proceedings. 25th IEEE International, pp. 296- 305, 2004.
  16. T. Wang and C. P. Low, "The general message ferry route (mfr*) problem and the an-improved-route (air) scheme," Comput. Netw., vol. 56, no. 4, pp. 1442-1457, 2012. https://doi.org/10.1016/j.comnet.2012.01.002
  17. J. L. Bentley, "Fast algorithms for geometric traveling salesman problems," Informs Journal on Computing, vol. 4, pp. 387-411, 1992. https://doi.org/10.1287/ijoc.4.4.387
  18. S. Arora, "Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems," J. ACM, vol. 45, pp. 753-782, Sept. 1998. https://doi.org/10.1145/290179.290180
  19. R. Diestel, Graph Theory, vol. 173 of Graduate Texts in Mathematics. Springer-Verlag, Heidelberg, third ed., 2005.
  20. E. Lawler, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley-Interscience series in discrete mathematics, Wiley, 1987.
  21. CPLEX.http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/. 2013.
  22. LONGO.http://www.lindo.com/products/lingo/. 2013.
  23. C. E. Miller, A. W. Tucker, and R. A. Zemlin, "Integer programming formulation of traveling salesman problems," J. ACM, vol. 7, no. 4, pp. 326-329, 1960. https://doi.org/10.1145/321043.321046
  24. LKH.http://www.akira.ruc.dk/-keld/research/LKH/.
  25. T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to algorithms. The MIT press, 2009.