Abstract
In their EWSN’07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wireless sensor network (WSN) are active, and showed that the resulting schedules significantly improve over the commonly-used random ones, e.g., by providing greater area coverage at less energy costs. However, an open question remained about whether further improvements are possible. Here, we complete the work in [1] by providing a (centralized) optimal solution that constitutes a theoretical upper bound for wake-up scattering protocols. Simulation results shows that the decentralized algorithm proposed in [1] comes within 4% to 11% of the optimum. Moreover, we show that the modeling framework we use to derive the solution, based on integer programming techniques, allows for a particularly efficient solution. The latter result discloses important opportunities for the practical utilization of the model. The model is also general enough to encompass alternative formulations of the problem.
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
Giusti, A., Murphy, A.L., Picco, G.P.: Decentralized Scattering of Wake-up Times in Wireless Sensor Networks. In: Langendoen, K.G., Voigt, T. (eds.) EWSN 2007. LNCS, vol. 4373, pp. 245–260. Springer, Heidelberg (2007)
Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: Proc. of the IEEE Int. Conf. on Communications (ICC) (June 2001)
Tian, D., Georganas, N.D.: A coverage-preserving node scheduling scheme for large wireless sensor networks. In: First ACM Int. Wkshp. on Wireless Sensor networks and Applications (WSNA) (2002)
Huang, C., Tseng, Y.: The coverage problem in a wireless sensor network. In: Proc. of the 2nd ACM Int. Conf. on Wireless Sensor Networks and Applications (WSNA 2003) (September 2003)
Passerone, R., Palopoli, L.: Aligned schedules are optimal. Technical report, University of Trento (2008)
The Gnu Linear Programming Kit, http://www.gnu.org/software/glpk/
Cardei, M., Thai, M., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: Proc. of INFOCOM (2005)
Liu, H., et al.: Maximizing lifetime of sensor surveillance systems. IEEE/ACM Trans. on Networking 15(2), 334–345 (2007)
Alfieri, A., Bianco, A., Brandimarte, P., Chiasserini, C.F.: Maximizing system lifetime in wireless sensor networks. European Journal of Operational Research 127(1), 390–402 (2007)
Ye, F., Zhong, G., Cheng, J., Lu, S., Zhang, L.: PEAS: A robust energy conserving protocol foo long-lived sensor networks. In: 3rd Int. Conf. on Distributed Computing Systems (ICDCS 2003) (May 2003)
Hsin, C., Liu, M.: Network coverage using low duty-cycled sensors: Random & coordinated sleep algorithms. In: Proc. of the 3th Int. Symp. on Information Processing in Sensor Networks (IPSN) (2004)
Cao, Q., Abdelzaher, T., He, T., Stankovic, J.: Towards optimal sleep scheduling in sensor networks for rare-event detection. In: Proc. of the 4th Int. Symp. on Information Processing in Sensor Networks (IPSN) (April 2005)
Carbunar, B., Grama, A., Vitek, J., Carbunar, O.: Redundancy and coverage detection in sensor networks. ACM Trans. on Sensor Networks 2(1), 94–128 (2006)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage problems in wireless ad-hoc sensor networks. In: Proc. of 20th IEEE INFOCOM, April 2001, pp. 1380–1387 (2001)
Chakrabarty, K., Iyengar, S.S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. on Computers 51(12), 1448–1453 (2002)
Bulusu, N., Estrin, D., Heidemann, J.: Adaptive beacon placement. In: Proc. of the 21st Int. Conf. on Distributed Computing Systems (ICDCS), April 2001, pp. 489–498 (2001)
Howard, A., Mataric, M., Sukhatme, G.: An incremental self-deployment algorithm for mobile sensor networks. Auton. Robots 13(2), 113–126 (2002)
Howard, A., Mataric, M., Sukhatme, G.: Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem. In: Proc. of 7th Int. Symp. on Distributed Autonomous Robotic Systems (June 2002)
Zou, Y., Chakrabarty, K.: Sensor deployment and target localization in distributed sensor networks. IEEE Trans. on Embedded Computing Systems 3(1), 61–91 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Palopoli, L., Passerone, R., Murphy, A.L., Picco, G.P., Giusti, A. (2009). Solving the Wake-Up Scattering Problem Optimally. In: Roedig, U., Sreenan, C.J. (eds) Wireless Sensor Networks. EWSN 2009. Lecture Notes in Computer Science, vol 5432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00224-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-00224-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00223-6
Online ISBN: 978-3-642-00224-3
eBook Packages: Computer ScienceComputer Science (R0)