Subscribe
Issue No.10 - October (2008 vol.19)
pp: 1426-1438
ABSTRACT
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such applications, certain level of protection need to be provided to them. We study the self protection problem for static wireless sensor networks in this paper. Self protection problem focuses on using sensor nodes to provide protection to themselves instead of the target objects or certain target area, so that the sensor nodes can resist the attacks targeting on them directly. A wireless sensor network is p-self-protected, if at any moment, for any wireless sensor (active or non-active), there are at least p active sensors that can monitor it. The problem finding minimum p-self-protection is NP-complete and no efficient self protection algorithms have been proposed. In this paper, we provide efficient centralized and distributed algorithms with constant approximation ratio for minimum p-self-protection problem in sensor networks with either homogeneous or heterogeneous sensing radius. In addition, we design efficient distributed algorithms to not only achieve p-self-protection but also maintain the connectivity of all active sensors. Our simulation confirms the performances of proposed algorithms.
INDEX TERMS
Sensor networks, Algorithm/protocol design and analysis, Network topology, Network Protocols
CITATION
Yu Wang, Xiang-Yang Li, Qian Zhang, "Efficient Algorithms for p-Self-Protection Problem in Static Wireless Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 10, pp. 1426-1438, October 2008, doi:10.1109/TPDS.2008.13
REFERENCES
 [1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, vol. 38, no. 4, pp. 393-422, 2002. [2] T. He, S. Krishnamurthy, J.A. Stankovic, T. Abdelzaher, L. Luo, R. Stoleru, T. Yan, L. Gu, J. Hui, and B. Krogh, “Energy-Efficient Surveillance System Using Wireless Sensor Networks,” Proc. Second ACM Int'l Conf. Mobile Systems, Applications, and Services (MobiSys), 2004. [3] C. Gui and P. Mohapatra, “Power Conservation and Quality of Surveillance in Target Tracking Sensor Networks,” Proc. ACM MobiCom, 2004. [4] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Network,” Proc. IEEE INFOCOM, 2001. [5] X.-Y. Li, P.-J. Wan, and O. Frieder, “Coverage in Wireless Ad-Hoc Sensor Networks,” Proc. IEEE Int'l Conf. Comm. (ICC), 2002. [6] S. Kumar, T.H. Lai, and A. Arora, “Barrier Coverage with Wireless Sensors,” Proc. ACM MobiCom, 2005. [7] S. Kumar, T.H. Lai, and J. Balogh, “On k-Coverage in a Mostly Sleeping Sensor Network,” Proc. ACM MobiCom, 2004. [8] X.-Y. Li, P.-J. Wan, Y. Wang, C.-W. Yi, and O. Frieder, “Robust Deployment and Fault Tolerant Topology Control for Wireless AdHoc Networks,” J. Wireless Comm. and Mobile Computing, vol. 4, no. 1, pp. 109-125, 2004. [9] M. Bahramgiri, M.T. Hajiaghayi, and V.S. Mirrokni, “Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-Hop Networks,” Proc. 11th IEEE Int'l Conf. Computer Comm. and Networks (ICCCN), 2002. [10] M. Hajiaghayi, N. Immorlica, and V.S. Mirrokni, “Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-Hop Networks,” Proc. ACM MobiCom, 2003. [11] N. Li and J.C. Hou, “FLSS: A Fault-Tolerant Topology Control Algorithm for Wireless Networks,” Proc. ACM MobiCom, 2004. [12] H. Zhang and J.C. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,” Wireless Ad Hoc and Sensor Networks: An Int'l J., vol. 1, nos. 1-2, pp. 89-123, 2005. [13] Z. Zhou, S. Das, and H. Gupta, “Fault Tolerant Connected Sensor Cover with Variable Sensing and Transmission,” Proc. Second Ann. IEEE Comm. Soc. Conf. Sensor, Mesh, and Ad Hoc Comm. and Networks (SECON), 2005. [14] X. Bai, S. Kuma, D. Xua, Z. Yun, and T.H. Lai, “Deploying Wireless Sensors to Achieve Both Coverage and Connectivity,” Proc. ACM MobiHoc, 2006. [15] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks,” ACM Trans. Sensor Networks, vol. 1, no. 1, pp. 36-72, 2005. [16] M. Cardei and J. Wu, “Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks,” Computer Comm. J., vol. 29, no. 4, pp. 413-420, 2006. [17] I. Dietrich and F. Dressler, “On the Lifetime of Wireless Sensor Networks,” Technical Report 04/06, Dept. of Computer Science, Univ. of Erlangen, Dec. 2006. [18] D. Wang, Q. Zhang, and J. Liu, “Self-Protection for Wireless Sensor Networks,” Proc. 26th IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2006. [19] D. Wang, Q. Zhang, and J. Liu, “The Self-Protection Problem in Wireless Sensor Networks,” ACM Trans. Sensor Networks, vol. 3, no. 4, p. 20, 2007. [20] Y. Wang, X.-Y. Li, and Q. Zhang, “Efficient Self Protection Algorithms for Static Wireless Sensor Networks,” Proc. 50th IEEE Global Telecomm. Conf. (Globecom), 2007. [21] D.S. Johnson, “Approximation Algorithms for Combinatorial Problem,” J. Computer System Science, vol. 9, pp. 256-278, 1974. [22] V.V. Vazirani, Approximation Algorithms. Springer, 2001. [23] S. Basagni, “Distributed Clustering for Ad Hoc Networks,” Proc. IEEE Int'l Symp. Parallel Architectures, Algorithms, and Networks (ISPAN), 1999. [24] B. Das and V. Bharghavan, “Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets,” Proc. IEEE Int'l Conf. Comm. (ICC), 1997. [25] I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002. [26] J. Wu and H. Li, “A Dominating-Set-Based Routing Scheme in AdHoc Wireless Networks,” Telecomm. Systems J., vol. 3, pp. 63-84, 2001. [27] F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 902-920, Oct. 2004. [28] Y. Li, T. Thai, F. Wang, C.-W. Yi, P. Wan, and D.-Z. Du, “On Greedy Construction of Connected Dominating Sets in Wireless Networks,” J. Wireless Comm. and Mobile Computing, vol. 5, no. 88, pp. 927-932, 2005. [29] K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder, “Geometric Spanners for Wireless Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Processing, vol. 14, no. 4, pp. 408-421, Apr. 2003. [30] F. Dai and J. Wu, “On Constructing $k\hbox{-}{\rm Connected}\;k\hbox{-}{\rm Dominating}$ Set in Wireless Networks,” Proc. 19th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), 2005. [31] F. Wang, M.T. Thai, and D.-Z. Du, “2-Connected Virtual Backbone in Wireless Networks,” IEEE Trans. Wireless Comm., to appear. [32] X.-Y. Li, W.-Z. Song, and Y. Wang, “Localized Topology Control for Heterogeneous Wireless Sensor Networks,” ACM Trans. Sensor Networks, vol. 2, no. 1, pp. 129-153, 2006. [33] V. Chvátal, “A Greedy Heuristic for the Set-Covering Problem,” Math. of Operations Research, vol. 4, no. 3, pp. 233-235, 1979. [34] H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.E. Stearns, “NC-Approximation Schemes forNP- and PSPACE-Hard Problems for Geometric Graphs,” J.Algorithms, vol. 26, no. 2, pp. 238-274, 1998. [35] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Proc. 33rd Hawaii Int'l Conf. System Sciences (HICSS), 2000. [36] M. Chatterjee, S.K. Das, and D. Turgut, “WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks,” J. Cluster Computing, vol. 5, no. 2, pp. 193-204, 2002. [37] Y. Wang, W. Wang, and X.-Y. Li, “Efficient Distributed Low Cost Backbone Formation for Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 7, pp. 681-693, Aug. 2006. [38] S. Slijepcevic and M. Potkonjak, “Power Efficient Organization of Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Comm. (ICC), 2001. [39] M. Penrose, “On $k\hbox{-}{\rm Connectivity}$ for a Geometric Random Graph,” Random Structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999. [40] C. Bettstetter, “On the Minimum Node Degree and Connectivity of a Wireless Multihop Network,” Proc. ACM MobiHoc, 2002. [41] R. Ramanathan and R. Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. IEEE INFOCOM, 2000.