Abstract
In one random node deployment, the number of scattered sensors is normally higher than that required by the critical sensor density such that this deployment can achieve complete area coverage almost surely. In some cases, the number of deployed sensor nodes may even be much higher than the optimum to provide certain robustness for the deployed network. After nodes have been deployed, there might be some redundant sensors whose covered area can also be covered by other sensors. Sensor activity scheduling is used to schedule nodes to be activated alternatively so that the network operation time may be prolonged and certain area coverage requirement can still be met. Generally speaking, the design of a sensor activity scheduling scheme should answer the following question:
How to determine which sensors to be active at which time and be active for how long?
The first part of the question is the focus of this chapter. The second part of the question can be approached by two ways: One is to let each active sensor operate until it depletes its energy, and after that, reselection for active sensors is performed again. The other is to let each active sensor operate for a fixed time interval, and reselection for active sensors is then performed at the beginning of each interval. This chapter first summarizes the assumptions and objectives when designing an activity scheduling scheme and then introduces some representative schemes to illustrate how to select active sensors.
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
Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: ACM International Symposium on Information Processing in Sensor Networks (IPSN), pp. 424–432 (2004)
Ahmed, N., Kanhere, S.S., Jha, S.: Probabilistic coverage in wireless sensor networks. In: IEEE Conference on Local Computer Networks (LCN), pp. 672–681 (2005)
Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: A survey. Computer Networks 39(4), 393–422 (2002)
Ammari, H.M., Das, S.K.: Joint k-coverage and hybrid forwarding in duty-cycled three-dimensional wireless sensor networks. In: IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), pp. 170–178 (2008)
Bai, H., Chen, X., Li, B., Han, D.: A location-free algorithm of energy-efficient connected coverage for high density wireless sensor networks. Discrete Event Dynamic Systems (Springer) 17(1), 1–21 (2007)
Boukerche, A., Fei, X.: A Voronoi approach for coverage protocols in wireless sensor networks. In: IEEE Global Telecommunications Conference (Globecom), pp. 5190–5194 (2007)
Boukerche, A., Fei, X., Araujo, R.B.: An optimal coverage-preserving scheme for wireless sensor networks based on local information exchange. Computer Communications (Elsevier) 30(14–15), 2708–2720 (2007)
Cărbunar, B., Grama, A., Vitek, J., Carbunar, O.: Redundancy and coverage detection in sensor networks. ACM Transactions on Sensor Network (ToSN) 2(1), 94–128 (2006)
Choi, W., Das, S.K.: Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks. Computer Communications (Elsevier) 29(17–18), 3476–3482 (2006)
Deng, J., Han, Y.S., Heinzelman, W.B., Varshney, P.K.: Balanced-energy sleep scheduling scheme for high-density cluster-based sensor networks. Computer Communications 28(14), 1631–1642 (2005)
Deng, J., Han, Y.S., Heinzelman, W.B., Varshney, P.K.: Scheduling sleeping nodes in high density cluster-based sensor networks. ACM/Kluwer Mobile Networks and Applications (MONET) 10(6), 825–835 (2005)
Du, X., Lin, F.: Maintaining differentiated coverage in heterogeneous sensor networks. EURASIP Journal on Wireless Communications and Networking 2005(4), 565–572 (2005)
Funke, S., Kesselman, A., Kuhn, F., Lotker, Z., Segal, M.: Improved approximation algorithms for connected sensor cover. Wireless Networks (Springer) 13(2), 153–164 (2007)
Fusco, G., Gupta, H.: Selection and orientation of directional sensors for coverage maximization. In: IEEE Communications Society 6th Annual Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), pp. 1–9 (2009)
Gallais, A., Carle, J., Simplot-Ryl, D., Stojmenovic, I.: Localized sensor area coverage with low communication overhead. IEEE Transactions on Mobile Computing 7(5), 661–672 (2008)
Gao, Y., Wu, K., Li, F.: Analysis on the redundancy of wireless sensor networks. In: ACM International Conference on Wireless Sensor Networks and Applications (WSNA), pp. 108–114 (2003)
Gui, C., Mohapatra, P.: Power conservation and quality of surveillance in target tracking sensor networks. In: ACM International Conference on Mobile Computing and Networking (MobiCom), pp. 129–143 (2004)
Gupta, H., Das, S.R., Gu, Q.: Connected sensor cover: Self-organization of sensor networks for efficient query execution. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 189–200 (2003)
Gupta, H., Zhou, Z., Das, S.R., Gu, Q.: Connected sensor cover: Self-organization of sensor networks for efficient query execution. IEEE/ACM Transactions on Networking 14(1), 55–67 (2006)
Hall, P.: Introduction to the Theory of Coverage Processes. Wiley, New York (1988)
Hefeeda, M., Ahmadi, H.: A probabilistic coverage protocol for wireless sensor networks. In: IEEE International Conference on Network Protocols (ICNP), pp. 1–10 (2007)
Hsin, C., Liu, M.: Randomly duty-cycled wireless sensor networks: Dynamics of coverage. IEEE Transactions on Wireless Communications 5(11), 3182–3192 (2006)
Hua, C., Yum, T.S.P.: Asynchronous random sleeping for sensor networks. ACM Transactions on Sensor Networks (ToSN) 3(3), 1–25 (2007)
Huang, C.F., Tseng, Y.C.: The coverage problem in wireless sensor networks. Mobile Networks and Applications 10(4), 519–528 (2005)
Huang, C.F., Tseng, Y.C., Lo, L.C.: The coverage problem in three-dimensional wireless sensor networks. In: IEEE Global Telecommunications Conference (Globecom), pp. 3182–3186 (2004)
Huang, C.F., Lo, L.C., Tseng, Y.C., Chen, W.T.: Decentralized energy-conserving and coverage-preserving protocols for wireless sensor networks. In: International Symposium on Circuits and Systems (ISCAS) (2005)
Huang, C.F., Tseng, Y.C., Wu, H.L.: Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network. ACM Transactions on Sensor network (ToSN) 3(1), 1–24 (2007)
Jiang, J., Dou, W.: A coverage-preserving density control algorithm for wireless sensor networks. In: The 3rd International Conference on Ad-Hoc Networks and Wireless (Adhoc-Now), also in LNCS, vol. 3158, pp. 42–55 (2004)
Kershner, R.: The number of circles covering a set. American Journal of Mathematics 61(3), 665–671 (1939)
Liu, Y., Liang, W.: Approximate coverage in wireless sensor networks. In: Local Computer Networks (LCN), pp. 68–75 (2005)
Liu, B., Towsley, D.: A study of the coverage of large-scale sensor networks. In: IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), pp. 475–483 (2004)
Liu, C., Wu, K., Xiao, Y., Sun, B.: Random coverage with guaranteed connectivity: Joint scheduling for wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems 17(6), 562–575 (2006)
Lu, J., Wang, J., Suda, T.: Scalable coverage maintenance for dense wireless sensor networks. EURASIP Journal of Wireless Communications and Networking (2007)
Noh, Y., Lee, S., Kim, K.: Central angle decision algorithm in coverage-preserving scheme for wireless sensor networks. In: IEEE Wireless Communications and Networking Conference (WCNC), pp. 2492–2496 (2008)
Quang, V.T., Miyoshi, T.: An algorithm for sensing coverage problem in wireless sensor networks. In: IEEE Sarnoff Symposium, pp. 1–5 (2008)
Ren, S., Li, Q., Wang, H., Chen, X., Zhang, X.: Design and analysis of sensing scheduling algorithms under partial coverage for object detection in sensor networks. IEEE Transactions on Parallel and Distributed Systems 18(3), 334–350 (2007)
Tezcan, N., Wang, W.: Self-orienting wireless multimedia sensor networks for maximizing multimedia coverage. In: IEEE International Conference on Communications (ICC), pp. 2206–2210 (2008)
Tian, D., Georganas, N.D.: A node scheduling scheme for energy conservation in large wireless sensor networks. Journal of Wireless Communications and Mobile Computing 3(2), 271–290 (2003)
Tian, D., Georganas, N.D.: Location and calculation-free node-scheduling schemes in large wireless sensor networks. Ad Hoc Networks (Elsevier) 2(1), 65–85 (2004)
Tian, D., Georganas, N.D.: Connectivity maintenance and coverage preservation in wireless sensor networks. Ad Hoc Networks 3(6), 744–776 (2005)
Tian, Y., Zhang, S.F., Wang, Y.: A distributed protocol for ensuring both probabilistic coverage and connectivity of high density wireless sensor networks. In: IEEE Wireless Communications and Networking Conference (WCNC), pp. 2069–2074 (2008)
Tran-Quang, V., Miyoshi, T.: A novel gossip-based sensing coverage algorithm for dense wireless sensor networks. Computer Networks (Elsevier) 53(13), 2275–2287 (2009)
Vashistha, S., Azad, A.P., Chockalingam, A.: Energy efficient area monitoring using information coverage in wireless sensor networks. In: IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), pp. 1–10 (2007)
Wang, L., Kulkarni, S.S.: Sacrificing a little coverage can substantially increase network lifetime. Ad Hoc Networks (Elsevier) 6(8), 1281–1300 (2008)
Wang, B., Vikram, S., Chua, K.C., Wang, W.: Information coverage and network lifetime in energy constrained wireless sensor networks. In: IEEE the 32rd Conference on Local Computer Networks (LCN), pp. 512–519 (2007)
Wang, B., Chua, K.C., Srinivasan, V.: Connected sensor cover for area information coverage in wireless sensor networks. Journal of Communications System (Wiley) 21(11), 1181–1203 (2008)
Wang, B., Fu, C., Lim, H.B.: Layered diffusion based coverage control in wireless sensor networks. Computer Networks (Elsevier) 53(7), 1114–1124 (2009)
Wu, T.T., Ssu, K.F.: Determining active sensor nodes for complete coverage without location information. International Journal of Ad Hoc and Ubiquitous Computing 1(1), 38–46 (2005)
Wu, J., Yang, S.: Energy-efficient node scheduling models in sensor networks with adjustable ranges. International Journal of Foundations of Computer Science 16(1), 3–17 (2005)
Wu, K., Gao, Y., Li, F., Xiao, Y.: Lightweight deployment-aware scheduling for wireless sensor networks. Mobile Networks and Applications (MNA) (Springer) 10(6), 837–852 (2005)
Xing, G., Wang, X., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Transactions on Sensor Networks 1(1), 36–72 (2005)
Yan, T., Gu, Y., He, T., Stankovic, J.A.: Design and optimization of distributed sensing coverage in wireless sensor networks. ACM Transactions on Embedded Computing Systems 7(3), 1–40 (2008)
Yardibi, T., Karasan, E.: A distributed activity scheduling algorithm for wireless sensor networks with partial coverage. Wireless Networks (Springer), pp. 1–13 (2009). doi:10.1007/s11276-008-0125-2
Ye, F., Zhang, H., Lu, S., Zhang, L., Hou, J.: A randomized energy-conservation protocol for resilient sensor networks. Wireless Networks 12(5), 637–652 (2006)
Younis, O., Krunz, M., Ramasubramanian, S.: Location-unaware coverage in wireless sensor networks. Ad Hoc Networks (Elsevier) 6(7), 1078–1097 (2008)
Zhang, H., Hou, J.: On deriving the upper bound of α-lifetime for large sensor networks. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 121–132 (2004)
Zhang, H., Hou, J.C.: Maintaining sensing coverage and connectivity in large sensor networks. Journal of Ad Hoc and Sensor Wireless Networks 1(1–2), 89–124 (2005)
Zhang, M., Chan, M.C., Ananda, A.L.: Coverage protocol for wireless sensor networks using distance estimates. In: IEEE the 4th Annual Communications Society on Sensor and Ad Hoc Communications and Networks (SECON), pp. 1–10 (2007)
Zhao, T., Zhao, Q.: Lifetime maximization based on coverage and connectivity in wireless sensor networks. Journal of Signal Processing Systems (Springer) (2009). doi:10.1007/s11265-008-0324-1
Zhou, Z., Das, S., Gupta, H.: Variable radii connected sensor cover in sensor networks. In: IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON), pp. 387–396 (2004)
Zhou, Z., Das, S., Gupta, H.: Fault tolerant connected sensor cover with variable sensing and transmission ranges. In: IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON) (2005)
Zhou, Z., Das, S.R., Gupta, H.: Variable radii connected sensor cover in sensor networks. ACM Transactions on Sensor Network (ToSN) 5(1), 1–36 (2009)
Zou, Y., Chakrabarty, K.: A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Transactions on Computers 54(8), 978–991 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag London
About this chapter
Cite this chapter
Wang, B. (2010). Sensor Activity Scheduling. In: Coverage Control in Sensor Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84996-059-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-84996-059-5_7
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84996-058-8
Online ISBN: 978-1-84996-059-5
eBook Packages: Computer ScienceComputer Science (R0)