Journal of Internet Computing and Services (인터넷정보학회논문지)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지

Energy-Efficient Index Scheme in Mobile P2P Environments

모바일 P2P 환경에서의 에너지 효율을 고려한 인덱스 기법

  • 박광진 (원광대학교 전기전자및정보공학부)
  • Published : 2009.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose an energy efficient index scheme for Nearest Neighbor queries, specially designed for mobile P2P environments. we propose a PMBR (P2P Minimum Boundary Rectangle) index that provides the client with the ability of selective contacting and tuning from other nodes. The mobile client is able to identify whether or not the neighbor nodes have the desired information by accessing PMBR. Thus, the client immediately switches to change to another node's broadcast channel if the index does not contain the desired information. Furthermore, the client is able to predict the arrival time of the desired data items and only needs to tune into the broadcast channel when the requested data items arrives, by first accessing PMBR. Thus, the mobile client can stay in power save mode most of time, and tune into the broadcast channel only when the requested data items arrive. Experiments are conducted to evaluate the performance of the proposed scheme. Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.

본 논문은 모바일 P2P 환경에서 최근접 질의 처리를 위한 에너지 효율적인 인덱스 기법을 제안한다. 제안한 PMBR (P2P Minimum Boundary Rectangle) 인덱스는 질의처리를 위한 클라이언트의 선별적인 정보 청취를 지원한다. 모바일 클라이언트는 PMBR 정보를 통해 인접 노드에 대하여 필요한 정보의 유무를 쉽게 판단할 수 있다. 따라서 만일 인접 노드가 원하는 질의결과에 대한 정보를 가지고 있지 않다면 곧바로 접촉을 중단하고 다른 노드를 선택하게 된다. 또한 클라이언트는 언제 원하는 데이터가 브로드캐스트 채널을 통하여 전달되는지 파악하여 대부분의 시간을 전원절약 모드로 유지하고 필요한 정보가 전달되는 시점에만 깨어나 불필요한 에너지소모를 줄일 수 있다. 시뮬레이션을 통해 제안 기법의 선별적 정보 청취를 통한 에너지 효율성을 증명하였다.

Keywords

References

  1. B. Zheng, J. Xu, W.-C. Lee and D. L. Lee,“Grid-partition index: a hybrid method fornearest-neighbor queries in wireless location-basedservices,” In Very Large Data Base Journal (VLDBJ), 2006, 15(1), 21-39. https://doi.org/10.1007/s00778-004-0146-0
  2. W. Lee and B. Zheng, “DSI: A Fully DistributedSpatial Index for Location-Based Wireless BroadcastServices," In Proc. of ICDCS, 2005, pp. 349-358.
  3. A. Mondal, Y. Lifu and M. Kitsuregawa, “P2PR-Tree:An R-Tree-Based Spatial Index for Peer-to-PeerEnvironments,” In Proc. of Extending DatabaseTechnology (EDBT) Workshops, 2004, pp. 516-525.
  4. P. Zhou, T. Nadeem, P. Kang and C. Borcea, “LiviuIftode: EZCab: A Cab Booking Application UsingShort-Range Wireless Communication,” In Proc. ofPervasive Computing and Communications(PerCom), 2005, pp. 27-38.
  5. A. Guttman, “R-trees: A dynamic index structure forspatial searching,” In Proc. of Special Interest Groupon Management of Data (SIGMOD), 1984, pp. 47-57.
  6. T. Camp, J. Boleng and V. Davies, “A Survey ofMobility Models for Ad Hoc Network Research,”Wireless Communication and Mobile Computing(WCMC), 2002, 2(5), 483-502. https://doi.org/10.1002/wcm.72
  7. T. Imielinski, S. Viswanathan, and B. Badrinath,“Data on Air: Organization and Access,” IEEETrans. Knowledge and Data Eng (TKDE), 1997,9(3), 353-372. https://doi.org/10.1109/69.599926
  8. B. Zheng, W. Lee and D. Lee, “Spatial Queries inWireless Broadcast Systems,”Wireless Network(WINET), 2004, 10(6), 723-736. https://doi.org/10.1023/B:WINE.0000044031.03597.97
  9. S. Hambrusch, C. L. Aref, and S. Prabhakar, “Queryprocessing in broadcasted spatial index trees,” InProc. of Symposium on Spatial and TemporalDatabases (SSTD), 2001, pp. 502-521.