The KIPS Transactions:PartC (정보처리학회논문지C)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

An Proxy Trajectory Based Storage in Sensor Networks

센서네트워크에서의 프록시 트라젝토리 기반 데이터 저장 기법

  • 임화정 (강원대학교 컴퓨터정보통신공학과) ;
  • 이헌길 (강원대학교 컴퓨터학부)
  • Published : 2008.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Efficient data dissemination is one of the important subjects for sensor networks. High accessibility of the sensed data can be kept by deploying the data centric storage approach in which data is stored over the nodes in the sensor network itself rather than external storages or systems. The advantage of this approach is its direct accessibility in a real-time without the severe burden on delay and power dissipation on the data path to the external storages or systems. However, if the queries from many users are concentrated to the few nodes with data, then the response time could be increased and it could lead to the reduction of network life time by rapid energy dissipation caused by concentrated network load. In this paper, we propose a adaptive data centric storage scheme based on proxy trajectory (APT) mechanism. We highlight the data centric storage mechanism by taking account of supporting large number of users, and make it feasible to provide high-performance accessibility when a non-uniform traffic pattern is offered. Storing data around the localized users by considering spatial data-access locality, the proxy trajectory of APT provides fast response for the users. The trajectory, furthermore, may help the mobile users to roams freely within the area they dwell.

센서네트워크에서 데이터를 효율적으로 전송하는 것은 매우 중요한 문제이다. 수집된 데이터를 외부의 저장소나 시스템에 저장하기보다는 센서네트워크 내에 있는 노드들에 직접 저장하는 데이터 중심 저장소 기법은 높은 접근성을 제공할 수 있다. 센서네트워크에서 사용되는 데이터 저장소 기법을 사용하면 데이터를 외부 저장소로 전송하기 위한 지연시간과 에너지 낭비없이 실시간으로 수집된 데이터에 접근할 수 있다는 것이다. 그러나 데이터를 저장하는 일부 노드에 질의가 집중될 경우 질의에 대한 응답시간이 길어질 수 있으며, 부하집중으로 노드의 에너지가 빠르게 고갈되어 네트워크 수명이 단축될 수 있다. 본 논문에서는 질의를 처리하는 저장소 노드에 발생하는 부하를 주위의 여러 노드들로 분산시켜 질의에 대한 응답지연시간을 줄이고, 사용자의 이동성을 지원하는 프록시개념의 프록시 트라젝토리를 형성하는 프록시 트라젝토리 저장기법(APT)기법을 제안한다. 시뮬레이션을 통하여 제안기법의 노드별 질의 응답시간의 단축과 응답 홉 수의 감소를 검증하였다.

Keywords

References

  1. H. Henn, S. Hepper, K. Rindtorff, T. Schack and J. Burkhardt (Editor), “Pervasive Computing: Technology and Architecture of Mobile Internet Applications,” Addison-Wesley Professional; 1st edition Jan., 15, 2002
  2. D. Niculescu, “Communication Paradigms for Sensor Networks,” Communications Magazine, IEEE, Vol.43, pp.116-122, Mar., 2005 https://doi.org/10.1109/MCOM.2005.1404605
  3. K. Seada, A. Helmy, “Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Networks,” Proceedings of WMAN 2004
  4. J. B. Tchakarov and N. H. Vaidya, “Efficient Content Location in Wireless Ad Hoc Networks,” Proceedings of IEEE International Conference on Mobile Data Management (MDM'04), pp.74, 2004 https://doi.org/10.1109/MDM.2004.1263044
  5. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan and S. Shenker, “GHT: A Geographic Hash-table for Data centric Storage In Sensor nets,” Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), pp.78-87, Sept., 2002 https://doi.org/10.1145/570738.570750
  6. Brad Karp and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proceedings of International Conference on Mobile Computing and Networking (MOBICOM'00), 2000
  7. D. Niculescu and B. Nath, “Trajectory based forwarding and its applications,” in Proceedings of the MobiCom'03, ACM/IEEE, San Diego (2003), pp.260-272. 2003 https://doi.org/10.1145/938985.939012
  8. A. Capone, L. Pizziniaco and I. Filippini, A. Capone, L. Pizziniaco and I. Filippini, “A SiFT: an efficient method for trajectory based forwarding,” In Proceedings of wireless Communication Systems, 2005, 2nd International Symposium on, pp.135-139, Sept., 2005 https://doi.org/10.1109/ISWCS.2005.1547672
  9. Yeonghwan Tscha, Mehmet Ufuk C and aglayan, “Query slipping prevention for trajectory-based publishing and subscribing in wireless sensor networks,” pp.1979-1991, Computer Communications, 29, 2006 https://doi.org/10.1016/j.comcom.2005.12.010
  10. W. Zhang, G. Cao and T. La Porta, “Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks,” ACM/Springer Wireless Networks Journal, 13:5, Oct., 2007 https://doi.org/10.1007/s11276-006-6254-6
  11. Y.Y. Lim, M. Messina, F. Kargl, L. Ganguli, M. Fischer and T. Tsang, “SNMP-Proxy For Wireless Sensor Network,” Proceedings of ITNG 2008, 7-9, Apr., 2008 https://doi.org/10.1109/ITNG.2008.121