Journal of KIISE:Information Networking (한국정보과학회논문지:정보통신)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

A Data Gathering Protocol for Multihop Transmission for Large Sensor Networks

대형 센서네트워크에서 멀티홉 전송을 이용한 데이터 수집 프로토콜

  • 박장수 (영남대학교 대학원 컴퓨터공학과) ;
  • 안병철 (영남대학교 전자정보공학과)
  • Published : 2010.02.15
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes a data gathering method by adapting the mobile sink to prolong the whole operation time of large WSNs. After partitioning a network into several clusters, a mobile sink visits each cluster and collects data from it. An efficient protocol improves the energy efficiency by delivering messages from the mobile sink to the cluster head as well as reduces the data gathering delay, which is the disadvantage of the mobile sink. For the scalability of sensor network, the network architecture should support the multihop transmission in the duster rather than the single hop transmission. The process for the data aggregation linked to the travelling path is proposed to improve the energy consumption of intermediate nodes. The experiment results show that the proposed model is more efficient than legacy methods in the energy consumption and the data gathering time.

이 논문은 대규모 무선 센서 네트워크의 전체 운영 시간을 늘이기 위해 모바일 싱크를 이용한 효율적인 데이터 수집 방법을 제안한다. 클러스터링을 통해 센서 네트워크를 나눈 다음 모바일 싱크가 각 클러스터를 방문하여 데이터를 수집한다. 모바일 싱크와 클러스터 헤드 사이의 메시지 전달을 통해 에너지 소비 효율은 높이며 모바일 싱크의 단점인 데이터 수집 시간을 최소화할 수 있는 프로토콜을 제안한다. 네트워크 확장성을 위해 센서 네트워크 구조는 클러스터내에서 싱글 홉 전송보다는 멀티홉 전송을 지원해야 한다. 멀티홉 전송시 발생하는 중간 노드의 과도한 에너지 소비를 개선하기 위해 주행 경로와 연계된 데이터 병합 과정을 제안한다. 실험결과는 제안 모델이 기존 방법들보다 에너지 소비 및 데이터 수집 시간 측면에서 효율적임을 보여준다.

Keywords

References

  1. W. Heinzelman, "Application-Specific Protocol Architectures for Wireless Networks," Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, June 2000.
  2. R. C. Shah, S. Roy, S. Jain, and W. Brunette, "Data mules: Modeling a three-tier architecture for sparse sensor networks," In IEEE Workshop on Sensor Network Protocols and Applications (SNPA), 2003.
  3. Somasundara A.A., Ramamoorthy A., Srivastava M.B., "Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines," In: RTSS, pp.296.305, 2004.
  4. A. Kansal, A. Somasundara, D. Jea, M. Srivastava, and D. Estrin, "Intelligent uid infrastructure for embedded networks," In 2nd ACM/USENIX International Conference on Mobile Systems, Applications, and Services (MobiSys04), 2004.
  5. C. Cano, B. Bellalta, P. Villalonga, J. Perello Multihop, "Cluster-based Architecture for Sparse Wireless Sensor Networks," European Wireless 2008, 22-25 June 2008.
  6. H. Luo, F. Ye, J. Cheng, S. Lu, and L. Zhang, "TTDD: Two-tier data dissemination in largescale wireless sensor networks," ACM Journal of Mobile Networks and Applications (MONET), Special Issue on ACM MOBICOM (2003), 2003.
  7. J. H. Shin, J. Kim, K. Park, and D. Park, "Railroad: virtual infrastructure for data dissemination in wireless sensor networks," Proceedings of the 2nd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN'05), pp.168-174, Oct. 2005.
  8. E. B. Hamida and G. Chelius, "A line-based data dissemination protocol for wireless sensor networks with mobile sink," in Proceedings of the IEEE International Conference on Communications (ICC 2008), Beijing, China, May 2008.
  9. J.-L. Lu and F. Valois, "On the data dissemination in wsns," in 3rd International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), New-York, USA, October 2007.
  10. C.-J. Lin, P.-L. Chou, and C.-F. Chou, "Hcdd: hierarchical clusterbased data dissemination in wireless sensor networks with mobile sink," in IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing. New York, NY, USA: ACM, pp. 1189-1194, 2006.
  11. C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diusion: A scalable and robust communication paradigm for sensor networks," In 6th ACM/IEEE Annual International Conf. on Mobile Computing (MOBICOM 2000), pp.56-67, 2000.
  12. Kruskal, J. B., "On the shortest spanning tree of a graph and the travelling salesman problem," In: Proceedings of the American Mathematical Society, vol.7, no.1, pp.48-50, 1956. https://doi.org/10.1090/S0002-9939-1956-0078686-7
  13. M. Ettus, "System capacity, latency, and power consumption in multihop-routed SS-CDMA wireless networks," in Proc. Radio and Wireless Conf. (RAWCON), Colorado Springs, CO, pp.55-58, August 1998.
  14. T. Rappaport, "Wireless Communications: Principles & Practice," Englewood Cliffs, NJ: Prentice-Hall, 1996.
  15. Sugihara, R., Gupta, R.K., "Data mule scheduling in sensor networks: Scheduling under location and time constraints," UCSD Tech. Rep. CS2007-0911, 2007.