This Article 
 Bibliographic References 
 Add to: 
General Maximal Lifetime Sensor-Target Surveillance Problem and Its Solution
Oct. 2011 (vol. 22 no. 10)
pp. 1757-1765
Hai Liu, Hong Kong Baptist University, Hong Kong
Xiaowen Chu, Hong Kong Baptist University, Hong Kong
Yiu-Wing Leung, Hong Kong Baptist University, Hong Kong
Xiaohua Jia, City University of Hong Kong, Hong Kong
Peng-Jun Wan, Illinois Institute of Technology, Chicago
We address a new and general maximal lifetime problem in sensor-target surveillance. We assume that each sensor can watch at most k targets (k \ge 1) and each target should be watched by h sensors (h \ge 1) at any time. The problem is to schedule sensors to watch targets and forward the sensed data to a base station such that the lifetime of the surveillance network is maximized. This general problem includes the existing ones as its special cases (k = 1 and h = 1 in [12] and k = 1 and h \ge 2 in [13]). It is also important in practice because some sensors can monitor multiple or all targets within their surveillance ranges and multisensor fusion (i.e., watching a target by multiple sensors) gives better surveillance results. The problem involves several subproblems and one of them is a new matching problem called (k, h)-matching. The (k, h)-matching problem is a generalized version of the classic bipartite matching problem (when k = h = 1, (k, h)-matching becomes bipartite matching). We design an efficient (k, h)-matching algorithm to solve the (k, h)-matching problem and then solve the general maximal lifetime problem. As a byproduct of this study, the (k, h)-matching problem and the proposed (k, h)-matching algorithm can potentially be applied to other problems in computer science and operations research.

[1] A.E. Abdallah, T. Fevens, J. Opatrny, and I. Stojmenovic, "Power-Aware Semi-Beaconless 3D Georouting Algorithm Using Adjustable Transmission Ranges for Wireless Ad Hoc and Sensor Networks," Ad Hoc Networks, vol. 8, no. 1, pp. 15-29, 2010.
[2] J. Blumenthal, F. Reichenbach, and D. Timmermann, "Decreasing the Localization Error in Border Areas of Sensor Networks," Proc. Int'l Conf. Distributed Computing in Sensor Systems (DCOSS '08), pp. 47-48, 2008.
[3] M. Cardei and D.-Z. Du, "Improving Wireless Sensor Network Lifetime through Power Aware Organization," J. Wireless Networks, vol. 11, pp. 333-340, 2005.
[4] M. Cardei, M. Thai, Y. Li, and W. Wu, "Energy-Efficient Target Coverage in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2005.
[5] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, third ed. MIT Press, 2009.
[6] H. Frey, S. Ruehrup, and I. Stojmenovic, "Routing in Wireless Sensor Networks," Guide to Wireless Ad Hoc Networks, S. Misra, I. Woungag, and S. Misra, eds., ch. 4, pp. 81-111, Springer-Verlag, 2009.
[7] Infra-Red Sensors, http://www.ikalogic.comir_prox_sensors. php , 2011.
[8] C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks," Proc. MObiCOM, 2000.
[9] A.M. Kermarrec, G. Tan, "Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach," Proc. 11th ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc '10), pp. 161-170, 2010.
[10] S. Lindsey, C. Raghavendra, and K.M. Sivalingam, "Data Gathering Algorithms in Sensor Networks Using Energy Metrics," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 924-935, Sept. 2002.
[11] H. Liu, X. Jia, P.-J. Wan, X. Liu, and F. Yao, "A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 5, pp. 658-671, May 2007.
[12] H. Liu, X. Jia, P.-J. Wan, C.-W. Yi, S. Makki, and N. Pissinou, "Maximizing Lifetime of Sensor Surveillance Systems," IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 334-345, Apr. 2007.
[13] H. Liu, P.-J. Wan, and X. Jia, "Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to 1 Target," IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 12, pp. 1526-1536, Dec. 2006.
[14] H.B. Mitchell, Multi-Sensor Data Fusion: An Introduction. Springer-Verlag, 2007.
[15] V. Rajendran, K. Obraczka, and J.J. Garcia-Luna-Aceves, "Energy-Efficient, Collision-Free Medium Access Control for Wireless Sensor Networks," Proc. First Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), pp. 181-192, 2003.
[16] A. Savvides, C.C. Han, and M. Srivastava, "Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors," Proc. MObiCOM, pp. 166-179, 2001.
[17] O. Simeone, U. Spagnolini, Y. Bar-Ness, and S.H. Strogatz, "Distributed Synchronization in Wireless Networks," IEEE Signal Processing Magazine, vol. 25, no. 5, pp. 81-97, Sept. 2008.
[18] Simulation Program, , 2011.
[19] T. Yan, T. He, and J.A. Stankovic, "Differentiated Surveillance for Sensor Networks," Proc. First Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), pp. 51-62, 2003.

Index Terms:
Wireless sensor networks, maximal lifetime, scheduling, matching, routing.
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Xiaohua Jia, Peng-Jun Wan, "General Maximal Lifetime Sensor-Target Surveillance Problem and Its Solution," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 10, pp. 1757-1765, Oct. 2011, doi:10.1109/TPDS.2011.42
Usage of this product signifies your acceptance of the Terms of Use.