With the recent advances in wireless sensor technologies, sensor networks have been used in many applications. One of the applications is subject monitoring and tracking, where the locations of the monitored objects are quite sensitive and need to be protected. So event source anonymity is an attractive and critical security property. For event source anonymity, the concept of source location privacy has been implemented against both local (mote-class) and global (laptop-class) adversaries. In this paper, a scheme called Boundary probabilistic algorithm is proposed to protect against laptop-class attacks. Moreover, a comparison of this proposed scheme with two existing schemes namely- Naive algorithm and Probabilistic algorithm is proposed. In the proposed Boundary Probabilistic algorithm, filtered dummy messages for achieving source location privacy are used. Through simulation results, the proposed scheme is illustrated, the message complexity is reduced. Moreover the delay of the real event message to reach the base station is reduced.

1. D. Noh and J. Hur, "Using a dynamic backbone for efficient data delivery in solar-powered WSNs," J. Network and Computer Applications, vol. 35, no. 4, pp. 1277 – 1284, July 2012.
2. M. Conti, J. Willemsen, and B. Crispo, "Providing Source Location Privacy in Wireless Sensor Networks: A Survey," Communications Surveys & Tutorials, IEEE, vol. 15, no. 3, pp. 1238-1280, Third Quarter 2013.
3. N. Li, N. Zhang, S. Das, and B. Thuraisingham, "Privacy preservation in wireless sensor networks: A state-of-the-art survey," Ad Hoc Networks, vol. 7, no. 8, pp. 1501–1514, November 2009.
4. E. Ekici, S. Vural, J. McNair, and D. Al-Abri, "Secure probabilistic location verification in randomly deployed wireless sensor networks," Ad Hoc Networks, vol. 6, no. 2, pp. 195–209, April 2008.
5. Y. Ouyang, Z. Le, D. Liu, J. Ford, and F. Makedon, "Source location privacy against laptop-class attacks in sensor networks," in SECURECOM:Proc. 4th international conference on Security and privacy in communication networks, ACM, September 2008.
6. P. Kamat, Y. Zhang, W. Trappe, and C. Ozturk, "Enhancing source location privacy in sensor network routing," in Proceedings of the 25th IEEE International Conference on Distributed Computing Systems(ICDCS), pages 599–608, June 2005.
7. C. Karlof and D. Wagner, "Secure routing in wireless sensor networks: Attacks and countermeasures," Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications 2003, pp. 113-127, 11 May 2003.
8. K. Mehta, D. Liu, and M. Wright, "Location privacy in sensor networks against a global eavesdropper," in IEEE International Conference on Network Protocols, 2007, pp. 314-323, 16-19 Oct. 2007.
9. Y. Yang, M. Shao, S. Zhu, B. Urgaonkar, and G. Cao, "Towards event source unobservability with minimum network traffic in sensor networks," in Proc. first ACM conference on Wireless network security, pp. 77–88, April 2008.
10. M. Shao, Y. Yang, S. Zhu, and G. Cao, "Towards statistically strong source anonymity for sensor networks," in INFOCOM 2008: Proceedings of the 27th IEEE Conference on Computer Communications, 13-18 April 2008.
11. R. Lu, X. Lin, H. Zhu, and X. Shen, "Tesp2: Timed efficient source privacy preservation scheme for wireless sensor networks," Communications (ICC), 2010 IEEE International Conference on Communication, pp. 1-6, 23-27 May 2010.
12. A. A. Nezhad, D. Makrakis, A. Miri, "Anonymous Topology Discovery for Multihop Wireless Sensor Networks," in Proc. of the 3rd ACM workshop on QoS and security for wireless and mobile networks, pp. 78-85, 2007.
13. R. Doomun, T. Hayajneh, P. Krishnamurthy, and D. Tipper, "Secloud:Source and destination seclusion using clouds for wireless ad hoc networks," Computers and Communications, 2009. ISCC 2009. pp. 361-367, 5-8 July 2009.
14. K. Bicakci, H. Gultekin, B. Tavli, and I. Bagci, "Maximizing lifetime of event-unobservable wireless sensor networks," Computer Standards & Interfaces, vol. 33, no. 4, pp. 401–410, June 2011.

Source Location Privacy (slp) Sensor Network.