Abstract
Due to resource constraint of WSNs, it may be unnecessary or impossible to provide full coverage in many applications. Instead, partial coverage is enough to satisfy user requirements. Meanwhile, by applying partial coverage, network lifetime can be prolonged remarkably which is a primary goal of WSNs. In this paper, we investigate the p-Percent Coverage Problem which only requires that p% of the whole area to be monitored at any time and the Connected p-Percent Coverage Problem which enforces connectivity in addition. We propose two algorithms. One is pPCA which is a greedy algorithm to solve the p-Percent Coverage Problem. The other is CpPCA-CDS, which is a total distributed algorithm based on Connected Dominating Set to address Connected p-Percent Coverage Problem. The Sensing Void Distance after using CpPCA-CDS can be bounded by a constant. Theoretical analysis as well as simulation results are provided to evaluate our algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Powers, R.: Batteries for Low Power Electronics. Proceedings of the IEEE (1995)
Zhang, H., Hou, J.C.: On Deriving the Upper Bound of α-Lifetime for Large Sensor Networks. In: MobiHoc 2004, Roppongi, Japan, May 2004, pp. 121–132 (2004)
Slijepcevic, S., Potkonjak, M.: Power Efficient Organization of Wireless Networks. In: Proc. of IEEE International Conference on Communications (June 2001)
Cardei, M., MacCallum, D., Cheng, X., Min, M., Jia, X., Li, D., Du, D.-Z.: Wireless Sensor Networks with Energy Efficient Organization. Journal of Interconnection Networks 3(3-4), 213–229 (2002)
Zhou, Z., Das, S., Gupta, H.: Connected K-Coverage Problem in Sensor Networks. In: Proc. of Intl. Conf. on Computer Communications and Networks (ICCCN) (2004)
Zhang, H., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. In: Proc. of the 2004 NSF International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks (2004)
Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.D.: Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks. In: Proc. of 1st ACM Conference on Embedded Networked Sensor Systems (2003)
Cardei, M., Wu, J.: Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks. Computer Communications (2005)
Gao, S., Vu, C., Li, Y.: Sensor Scheduling for k-coverage in Wireless Sensor Networks. In: Proceedings of the 2nd International Conference on Mobile Ad-hoc and Sensor Networks (2006)
Li, Y., Gao, S.: Designing k-coverage Schedules in Wireless Sensor Networks. Journal of Combinatorial Optimization (2007)
Wang, B., Chua, K.C., Srinvasan, V., Wang, W.: Sensor Density for Complete Information Coverage in Wireless Sensor Networks. In: Römer, K., Karl, H., Mattern, F. (eds.) EWSN 2006. LNCS, vol. 3868, Springer, Heidelberg (2006)
Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Efficient Energy Management in Sensor Networks. In: Ad Hoc and Sensor Networks, ser. Wireless Networks and Mobile Computing, vol. 2, Nova Science Publishers (2005)
Tan, H.: Maximizing Network Lifetime in Energy-Constrained Wireless Sensor Network. In: Proceedings of the 2006 international conference on Wireless communications and mobile computing, pp. 1091–1096 (2006)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill Book Company, New York (2003)
Li, Y., Zhu, S., Thai, M., Du, D.: Localized Construction of Connected Dominating Set in Wireless Networks. In: NSF International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks (2004)
Wan, P., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad hoc Networks. In: Preceedings of 21th Annual Joint Conference of the IEEE Computer and Communication Societies (2002)
Liu, Y., Liang, W.: Approximate Coverage in Wireless Sensor Networks. In: The IEEE Conference on Local Computer Networks 30th Anniversary (LCN 2005), pp. 68–75 (2005)
Bai, H., Chen, X., Ho, Y., Guan, X.: Percentage Coverage Configuration in Wireless Sensor Networks. In: Pan, Y., Chen, D.-x., Guo, M., Cao, J., Dongarra, J. (eds.) ISPA 2005. LNCS, vol. 3758, pp. 780–791. Springer, Heidelberg (2005)
Tian, D., Georganas, N.D.: Location and Calculation-Free Node-Scheduling Schemes in Large Wireless Sensor Networks. Ad Hoc Networks 2, 65–85 (2004)
Kim, D., Wu, Y., Li, Y., Zou, F., Du, D.-Z.: Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems (accepted, 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, Y., Ai, C., Gao, S., Li, Y. (2008). p-Percent Coverage in Wireless Sensor Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, DZ. (eds) Wireless Algorithms, Systems, and Applications. WASA 2008. Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88582-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88581-8
Online ISBN: 978-3-540-88582-5
eBook Packages: Computer ScienceComputer Science (R0)