Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2008.15-C.6.513

An Proxy Trajectory Based Storage in Sensor Networks  

Lim, Hwa-Jung (강원대학교 컴퓨터정보통신공학과)
Lee, Heon-Guil (강원대학교 컴퓨터학부)
Publication Information
The KIPS Transactions:PartC / v.15C, no.6, 2008 , pp. 513-522 More about this Journal
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.
Keywords
Sensor Network; Proxy; Trajectory;
Citations & Related Records
연도 인용수 순위
  • Reference
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   DOI   ScienceOn
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 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   DOI
5 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   DOI
6 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   DOI
7 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   DOI
8 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
9 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   DOI
10 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   DOI
11 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   DOI   ScienceOn