Abstract
One of the major requirements for new wireless sensor networks is to extend the lifetime of the network. Node scheduling techniques have been used extensively for this purpose. Some existing approaches rely mainly on location information through GPS devices for designing efficient scheduling strategies. However, integration of GPS devices with sensor nodes is expensive and increases the cost of deployment dramatically. In this paper we present a location-free solution for node scheduling. Our scheme is based on a graph theoretical approach using minimum dominating sets. We propose a heuristic to extract a collection of dominating sets. Each set comprises of a group of working nodes which ensures a high level of network coverage. At each round, one set is responsible for covering the sensor field while the nodes in other sets are in sleep mode. We evaluate our solution through simulations and discuss our future research directions.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Shang, Y., Ruml, W., Zhang, Y., Fromherz, M.: Localization from Connectivity in Sensor Networks. IEEE Transcations on Paralllel and Distributed Systems 15(11) (November 2004)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine 40(8), 102–114 (2002)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: Proc. IEEE Infocom, pp. 1380–1387 (2001)
Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: IEEE Int’l. Conf. on Communications (ICC), pp. 472–476 (2001)
Tian, D., Georganas, N.D.: A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: Proc. ACM Workshop on Wireless Sensor Networks and Applications, Atlanta (October 2002)
Meguerdichian, S., Potkonjak, M.: Low Power 0/1 Coverage and Scheduling Techniques in Sensor Networks. UCLA Technical Report 030001 (January 2003)
Ye, F., Zhong, G., Cheng, J., Lu, S., Zhang, L.: PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks. In: Proceedings 23rd International Conference on Distributed Computing Systems, pp. 28–37 (2003)
Huang, C.-F., Tseng, Y.-C.: The coverage problem in a wireless sensor network. In: ACM International Workshop on Wireless Sensor Networks and Applications, pp. 115–121 (2003)
Xing, G., Wang, X., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Trans. Sensor Networks (in press)
Yen, L., Yu, C.W., Cheng, Y.: Expected k-coverage in wireless sensor networks. Elsevier Ad Hoc Networks Journal (in press)
Wu, T.-T., Ssu, K.-F.: Determining active sensor nodes for complete coverage without location information. Intl. J. Ad Hoc and Ubiquitous Computing 1(1/2), 38–46 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pazand, B., Datta, A. (2006). Minimum Dominating Sets for Solving the Coverage Problem in Wireless Sensor Networks. In: Youn, H.Y., Kim, M., Morikawa, H. (eds) Ubiquitous Computing Systems. UCS 2006. Lecture Notes in Computer Science, vol 4239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11890348_34
Download citation
DOI: https://doi.org/10.1007/11890348_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46287-3
Online ISBN: 978-3-540-46289-7
eBook Packages: Computer ScienceComputer Science (R0)