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

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

휴면 소오스들이 존재하는 환경의 센서 네트워크를 위한 위치 보호 강화 라우팅

Location Privacy Enhanced Routing for Sensor Networks in the Presence of Dormant Sources

  • 양기원 (한국정보통신대학교 공학부) ;
  • 임화정 (강원대학교 컴퓨터정보통신공학과) ;
  • 차영환 (상지대학교 컴퓨터정보공학부)
  • 발행 : 2009.02.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

전장에서 군 작전을 지원하거나 희귀 동물을 모니터링 하는 센서 네트워크에서는 전송 정보의 보안뿐만 아니라 그러한 관심 대상(asset)들의 위치를 적이나 악의적 추적으로부터 보호할 수 있어야 한다. 본 논문에서는 위치가 보호되어야 할 대상에 근접한 센서 노드들 즉, 휴면(dormant) 소오스들이 존재하는 환경에서, 활동 소오스(즉, 메시지 발생 노드)의 위치 보호를 강화하는 라우팅 프로토콜 GSLP(GPSR-based Source-Location Privacy)를 제안한다. GSLP는 단순하면서도 scalable한 라우팅 기법인 GPSR(greedy perimeter stateless routing)을 확장하여, 확률적으로 임의의 이웃 노드를 메시지 전달 노드로 선정하여 경로의 다양성을 제고하면서 퍼리미터(perimeter) 라우팅을 적용하여 휴면 소오스 노드들을 우회하도록 함으로써 안전 기간(safety period)으로 정의되는 활동 소오스의 위치 보호 능력이 강화되도록 하였다. 휴면 소오스들의 수가 전체 노드의 1.0%에 이르기까지 시뮬레이션을 수행한 결과, 기존의 대표적인 소오스 위치 보호 프로토콜인 PR-SP(Phantom Routing, Single Path)의 안전 기간은 휴면 소오스 노드들이 증가에 따라 급속히 감소하나 제안된 GSLP는 휴면 소오스 노드들의 수와 거의 무관하게 높은 안전 기간을 제공하면서도 평균 전달 지연(delivery latency)은 도착지와의 최단 거리의 약 두 배 이내에 머무는 것으로 확인되었다.

Sensor networks deployed in battlefields to support military operations or deployed in natural habitats to monitor the rare wildlifes must take account of protection of the location of valuable assets(i.e., soldiers or wildlifes) from an adversary or malicious tracing as well as the security of messages in transit. In this paper we propose a routing protocol GSLP(GPSR-based Source-Location Privacy) that is capable of enhancing the location privacy of an active source node(i.e., message-originating node) in the presence of multiple dormant sources(i.e., nodes lying nearby an asset whose location needs to be secured). Extended is a simple, yet scalable, routing scheme GPSR(greedy perimeter stateless routing) to select randomly a next-hop node with a certain probability for randomizing paths and to perform perimeter routing for detouring dormant sources so that the privacy strength of the active source, defined as safety period, keeps enhanced. The simulation results obtained by increasing the number of dormant sources up to 1.0% of the total number of nodes show that GSLP yields increased and nearly invariant safety periods, while those of PR-SP(Phantom Routing, Single Path), a notable existing protocol for source-location privacy, rapidly drop off as the number of dormant sources increases. It turns out that delivery latencies of GSLP are roughly less than two-fold of the shortest path length between the active source and the destination.

키워드

참고문헌

  1. C. Karlof and D. Wagner, "Secure routing in wirelesssensor networks: attacks and countermeasures,"Ad Hoc Networks, VoL1, pp.293-315, 2003 https://doi.org/10.1016/S1570-8705(03)00008-8
  2. J. Deng, R Han, and S. Mishra, "Countermeasuresagainst traffic analysis attacks in wireless sensornetworks," Proc. of the 1st International Conferenceon Security and Privacy for Emerging Areasin Communications Networks, pp.113-126, 2005
  3. C. Ozturk, Y. Zhang, and W. Trappe, "Sourcelocationprivacy in energy-constrained sensor networkrouting," Proc. of the 2nd ACM Workshopon Security of Ad Hoc and Sensor Networks(SASN'04), pp.88-93, 2004
  4. P. Kamat, Y. Zhang, W. Trappe, and C. Ozturk,"Enhancing source-location privacy in sensor networkrouting," Proc. of the 25th IEEE InternationalConference on Distributed Computing Systems(lCDCS'05), pp.599-608, 2005
  5. L. Zhang, "A self-adjusting directed random walkapproach for enhancing source-location privacy insensor network routing," Proc. of the ACM InternationalWireless Communication and MobileComputing Conference(lWCMC'06), pp.33-38, 2006
  6. Y. Xi, L. Schwiebert, and W. Shi, "Preservingsource location privacy in monitoring-based wirelesssensor networks," Proc. of the 2nd InternationalWorkshop on Security in System and Networks(SSN'06), pp.25-29, 2006
  7. B. Hoh and M. Gruteser, "Protecting location privacythrough path confusion," Proc. of the istinternational Conference on Security and Privacyfor hmerging Areas in Communications Networks,pp.194-205, 2005
  8. Y. Ouyang, Z. Le, G. Chen, and J. Ford, "Entrappingadversaries for source protection in sensornetworks," Proc. of the 7th IEEE InternationalSymposium on a Word of Wireless, Mobile andMultimedia Networks(WoWMoM'IXJ). pp.23-32, 2006
  9. Y. Jian, S. Chen, Z. Zhang, L. Zhang, "Protectingreceiver-location privacy in wireless sensor networks,"Proc. of the 26th IEEE Conference onComputer Communications(JNFOCOM'07), pp.1955-1963. 2007
  10. K. Mehta, D. Lie, and M. Wright, "Location privacyin sensor networks against a global eavesdropper,"Proc. of the 15th IEEE InternationalConference on Network Protocois(INCP '07) , 2007(Session VIlI, #4).
  11. P. Kamat, W. Xu, W. Trappe, and Y. Zhang,"Temporal privacy in wireless sensor networks,"Proc. of the 27th IEEE International Conferenceon Distribute Computing :3ystems(JCDCS'07), pp.23,2007
  12. Y. Tscha, "Routing for enhancing source-locationprivacy against packet-tracing in wireless sensornetworks of multiple assets," (submitted for possiblepublirution, available on request), 2008
  13. J Yick, B. Mukherjee, and D. Ghosal, "Wireless sensor network survey," Computer Networks, Vol.52, Issue12, 2008, pp.2292-2330 https://doi.org/10.1016/j.comnet.2008.04.002
  14. B. KarP and H.-T. Kung, "Greedy perimeterstateless routing for wireless networks," Proc. ofthe 6th Annual ACM/IEEE International Conferenceon Mobile Computing and Networking(MobiCom'OO), pp.243-254, 2000
  15. Y.-B. Ko, and N. Vaidya, "Geocasting in mobilead hoc networks: location-based multicast algorithms,"Proc. of 2nd IEEE Workshop on MobileComputing Systems and Applications(WMc..,)A99J,pp.101-110, 1999
  16. K. Obraczka, K. Viswanath, and G. Tsudik,"Flooding for reliable multicast in multi-hop adhoc networks," Wireless Networks, Vo1.7, 2001,pp.627-634 https://doi.org/10.1023/A:1012323519059
  17. Z. Jiang, J. Ma, W. Low, and J. Wu, "An informationmodel for geographic greedy forwarding inwireless ad-hoc sensor networks," to appear inthe 27th IEEE Conference on Computer Communications(JN FOCOM'08J, 2008
  18. N. Asmed, S. Kanhere, and S. ]ha, "The holesproblems in wireless sensor networks: a survey,"ACM SIGMOBILE Mobile Computing and CommunimtionReview, VoL9, No.2, ppA-18, 2005
  19. H. Frey and I. Stojmenovic, "On delivery guaranteesof face and combined greedy-face routing inad hoc and sensor networks," Proc. of the 12thAnnual ACM!IEEE International Conference onMobile Computing and Networking(MobiCom'06),pp.390-401, 2006