Abstract
Since directional sensor networks (DSNs) are composed of a large number of sensors equipped with a limited battery and limited angles of sensing range, maximizing network lifetime while covering all the targets in a given area is still a challenge problem. In this paper, we first address the MSCD (Maximum Set Cover for DSNs) problem that is known as NP-complete. We then present a new target coverage scheduling scheme to solve this problem with a greedy algorithm. We also present another target coverage scheduling scheme based on a genetic algorithm that can find an optimal solution for target coverage by evolutionary global search technique. To verify and evaluate these schemes, we conduct simulations and show that they can contribute to extending the network lifetime. Simulation results indicate that a genetic algorithm-based scheduling scheme has a better performance than a greedy algorithm-based one in terms of the maximization of the network lifetime.
This research is financially supported by the Ministry of Knowledge Economy (MKE) and Korea Institute for Advancement in Technology (KIAT) through the Workforce Development Program in Strategic Technology, and supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (No. 2010-0015637).
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
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38, 393–422 (2002)
Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: IEEE INFOCOM 2005, pp. 1976–1984 (2005)
Zhou, G., He, T., Krishnamurthy, S., Stankovic, J.A.: Models and Solutions for radio irregularity in wireless sensor networks. ACM Transations on Sensor Networks 2(2), 221–262 (2006)
Pyun, S.-Y., Cho, D.-H.: Power-saving scheduling for multiple-target coverage in wireless sensor networks. IEEE Communications Letters 13(2), 130–132 (2009)
Ai, J., Abouzeid, A.A.: Coverage by directional sensors in randomly deployed wireless sensor networks. J. of Combinatorial Optimization 11(1), 21–41 (2006)
Sivanandam, S.N., Deepa, S.N.: Introduction to Genetic Algorithms. Springer, New York (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gil, JM., Kim, CM., Han, YH. (2010). Two Scheduling Schemes for Extending the Lifetime of Directional Sensor Networks. In: Kim, Th., Stoica, A., Chang, RS. (eds) Security-Enriched Urban Computing and Smart Grid. SUComS 2010. Communications in Computer and Information Science, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16444-6_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-16444-6_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16443-9
Online ISBN: 978-3-642-16444-6
eBook Packages: Computer ScienceComputer Science (R0)