Abstract
One of the most fundamental tasks of wireless sensor networks is to provide coverage of barrier, which focuses on detecting intruders crossing a specific region. Suppose that all sensors are dropped from an aircraft along a given line interval, and each sensor has circular coverage range of arbitrary radii. Due to the environmental factors, the sensors will be distributed along the deployment line interval with random offsets. We study the barrier coverage problem with line-based offsets deployments by a set of wireless sensors with adjustable coverage ranges. The objective is to find a range assignment with the minimum cost. In this paper, we present a constant-approximation algorithm and two fully polynomial time approximation schemes (FPTASes) for the barrier coverage by using sensors with offsets under a linear cost function on the sensor’s range. We also show the performance of the approximation algorithms by experiments.
This work was fully supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 122512].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proceedings of International Conference on Mobile Computing and Networking, pp. 284–298. ACM (2005)
Alt, H., Arkin, E.M., Brönnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Proceedings of Symposium on Computational Geometry, pp. 449–458. ACM (2006)
Wan, P.J., Xu, X., Wang, Z.: Wireless coverage with disparate ranges. In: Proceedings of ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 1–8. ACM (2011)
Yu, Z., Teng, J., Li, X., Xuan, D.: On wireless network coverage in bounded areas. In: Proceedings of the IEEE Infocom Conference on Computer Communications, pp. 1195–1203. IEEE (2013)
Saipulla, A., Westphal, C., Liu, B., Wang, J.: Barrier coverage of line-based deployed wireless sensor networks. In: Proceedings of the IEEE Infocom Conference on Computer Communications, pp. 127–135. IEEE (2009)
Călinescu, G., Măndoiu, I.I., Wan, P.J., Zelikovsky, A.Z.: Selecting forwarding neighbors in wireless ad hoc networks. Mobile Networks and Applications 9(2), 101–111 (2004)
Narayanappa, S., Vojtechovskỳ, P.: An improved approximation factor for the unit disk covering problem. In: CCCG (2006)
Carmi, P., Katz, M.J., Lev-Tov, N.: Covering points by unit disks of fixed location. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 644–655. Springer, Heidelberg (2007)
Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: DÃaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 3–14. Springer, Heidelberg (2006)
Huang, Y., Gao, X., Zhang, Z., Wu, W.: A better constant-factor approximation for weighted dominating set in unit disk graph. Journal of Combinatorial Optimization 18(2), 179–194 (2009)
Zou, F., Wang, Y., Xu, X.H., Li, X., Du, H., Wan, P., Wu, W.: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theoretical Computer Science 412(3), 198–208 (2011)
Erlebach, T., Mihalák, M.: A (4+ ε)-approximation for the minimum-weight dominating set problem in unit disk graphs. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol. 5893, pp. 135–146. Springer, Heidelberg (2010)
Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, pp. 424–432. ACM (2004)
Wan, P.J., Yi, C.W.: Coverage by randomly deployed wireless sensor networks. IEEE/ACM Transactions on Networking (TON) 14(SI), 2658–2669 (2006)
Wang, J., Zhong, N.: Efficient point coverage in wireless sensor networks. Journal of Combinatorial Optimization 11(3), 291–304 (2006)
Li, M., Sun, X., Zhao, Y.: Minimum-cost linear coverage by sensors with adjustable ranges. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds.) WASA 2011. LNCS, vol. 6843, pp. 25–35. Springer, Heidelberg (2011)
de Rezende, P.J., Miyazawa, F.K., Sasaki, A.T.: A ptas for the disk cover problem of geometric objects. Operations Research Letters 41(5), 552–555 (2013)
Czyzowicz, J., et al.: On minimizing the maximum sensor movement for barrier coverage of a line segment. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 194–212. Springer, Heidelberg (2009)
Chen, D.Z., Gu, Y., Li, J., Wang, H.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 177–188. Springer, Heidelberg (2012)
Czyzowicz, J., et al.: On minimizing the sum of sensor movements for barrier coverage of a line segment. In: Nikolaidis, I., Wu, K. (eds.) ADHOC-NOW 2010. LNCS, vol. 6288, pp. 29–42. Springer, Heidelberg (2010)
Bar-Noy, A., Baumer, B.: Maximizing network lifetime on the line with adjustable sensing ranges. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds.) ALGOSENSORS 2011. LNCS, vol. 7111, pp. 28–41. Springer, Heidelberg (2012)
Bar-Noy, A., Rawitz, D., Terlecky, P.: Maximizing barrier coverage lifetime with mobile sensors. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 97–108. Springer, Heidelberg (2013)
Fan, H., Li, M., Sun, X., Wan, P.J., Zhao, Y.: Barrier coverage by sensors with adjustable ranges. to appear in ACM Transactions on Sensor Networks
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Fan, H., Lee, V.C.S., Li, M., Zhang, X., Zhao, Y. (2014). Barrier Coverage Using Sensors with Offsets. In: Cai, Z., Wang, C., Cheng, S., Wang, H., Gao, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2014. Lecture Notes in Computer Science, vol 8491. Springer, Cham. https://doi.org/10.1007/978-3-319-07782-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-07782-6_36
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07781-9
Online ISBN: 978-3-319-07782-6
eBook Packages: Computer ScienceComputer Science (R0)