Journal of Communications and Networks

  • 제11권6호
  • /
  • Pages.589-598
  • /
  • 2009
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

Routing for Enhancing Source-Location Privacy in Wireless Sensor Networks of Multiple Assets

  • Tscha, Yeong-Hwan (School of Computer, Information, and Communication Engineering, Sangji University)
  • 발행 : 2009.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

키워드

참고문헌

  1. J. Yick, B. Mukherjee, and D. Ghosal, "Wireless sensor network survey," Int. J. Comput. Netw., vol. 52, no. 12, pp. 2292–2330, 2008 https://doi.org/10.1016/j.comnet.2008.04.002
  2. S. Guizani, H.-H. Chen, and P. Muellerc (eds.), "Special issue on security on wireless ad hoc and sensor networks," Int. J. Comput. Commun., vol. 30, no. 12, pp. 2311–2518, 2007 https://doi.org/10.1016/j.comcom.2007.05.006
  3. C. Ozturk, Y. Zhang, and W. Trappe, "Source-location privacy in energyconstrained sensor network routing," in Proc. SASN, 2004, pp. 88–93
  4. P. Kamat,W. T.W. Xu, and Y. Zhang, "Temporal privacy in wireless sensor networks," in Proc. IEEE ICDCS, 2007, p. 23
  5. J. Deng, R. Han, and S. Mishra, "Countermeasures against traffic analysis attacks in wireless sensor networks," in Proc. IEEE SecureComm, 2005, pp. 113–126
  6. P. Kamat, Y. Zhang, W. Trappe, and C. Ozturk, "Enhancing sourcelocation privacy in sensor network routing," in Proc. IEEE ICDCS, 2005, pp. 599–608
  7. L. Zhang, "A self-adjusting directed random walk approach for enhancing source-location privacy in sensor network routing," in Proc. ACM IWCMC, 2006, pp. 33–38
  8. Y. Jian, S. Chen, Z. Zhang, and L. Zhang, "Protecting receiver-location privacy in wireless sensor networks," in Proc. IEEE INFOCOM, 2007, pp. 1955–1963
  9. Y. Ouyang, Z. Le, G. Chen, and J. Ford, "Entrapping adversaries for source protection in sensor networks," in Proc. IEEEWoWMoM, 2006, pp. 23–32
  10. K. Mehta, D. Lie, and M. Wright, "Location privacy in sensor networks against a global eavesdropper," in Proc. IEEE ICNP, 2007, pp. 314–323
  11. S. Puthenpurayil, R. Gu, and S. S. Bhattacharyya, "Energy-aware data compression for wireless sensor networks," in Proc. IEEE ICASSP, vol. 2, 2007, pp. 45–48
  12. B. Karp and H.-T. Kung, "Greedy perimeter stateless routing for wireless networks," in Proc. ACM/IEEE MobiCom, 2000, pp. 243–254
  13. I. S. P. Bose, P. Morin, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," in Proc. ACM DIALM, 1999, pp. 48–55
  14. H. Frey and I. Stojmenovic, "On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks," in Proc. ACM/IEEE MobiCom, 2006, pp. 390–401
  15. Y. Xi, L. Schwiebert, and W. Shi, "Preserving source location privacy in monitoring-based wireless sensor networks," in Proc. IEEE IPDPS, 2006, pp. 25–29
  16. M. Garey and D. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness,W.H. Freeman and Company, San Francisco, 1979
  17. G. Chen, J.-W. Branch, and B.-K. Szymanski, "Local leader election signal strength aware flooding, and routeless routing," in Proc. IEEE IPDPS, vol. 13, 2005, pp. 241–249
  18. Y.-B. Ko and N. Vaidya, "Geocasting in mobile ad hoc networks: Locationbased multicast algorithms," in Proc. IEEE WMCSA, 1999, pp. 101–110
  19. N. R and L. Kleinrock, "The spatial capacity of a slotted aloha multihop packet radio network with capture," IEEE Trans. Commun., vol. 32, p. 32, 1984 https://doi.org/10.1109/TCOM.1984.1096124
  20. N. Ahmed, S. Kanhere, and S. Jha, "The hole problem in wireless sensor networks: A survey," Mobile Comput. and Commun. Review, vol. 9, pp. 4–18, 2005
  21. P. Kamat, W. Xu, W. Trappe, and Y. Zhang, "Temporal privacy in wireless sensor networks, in Proc. IEEE ICDCS, 2007, pp. 25–29