Advertisement

Solving the Optimal Coverage Problem in Wireless Sensor Networks Using Evolutionary Computation Algorithms

  • Zhi-hui Zhan
  • Jun Zhang
  • Zhun Fan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6457)

Abstract

This paper formulates the optimal coverage problem (OCP) in wireless sensor network (WSN) as a 0/1 programming problem and proposes to use evolutionary computation (EC) algorithms to solve the problem. The OCP is to determine to active as few nodes as possible to monitor the area in order to save energy while at the same time meets the surveillance requirement, e.g., the full coverage. This is a fundamental problem in the WSN which is significant for the network lifetime. Even though lots of models have been proposed for the problem and variants of approaches have been designed for the solution, they are still inefficient because of the local optima. In order to solve the problem effectively and efficiently, this paper makes the contributions to the following two aspects. First, the OCP is modeled as a 0/1 programming problem where 0 means the node is turned off whilst 1 means the node is active. This model has a very natural and intuitive map from the representation to the real network. Second, by considering that the EC algorithms have strong global optimization ability and are very suitable for solving the 0/1 programming problem, this paper proposes to use the genetic algorithm (GA) and the binary particle swarm optimization (BPSO) to solve the OCP, resulting in a direct application of the EC algorithms and an efficient solution to the OCP. Simulations have been conducted to evaluate the performance of the proposed approaches. The experimental results show that our proposed GA and BPSO approaches outperform the state-of-the-art approaches in minimizing the active nodes number.

Keywords

Wireless sensor networks (WSN) optimal coverage problem evolutionary computation (EC) genetic algorithm (GA) particle swarm optimization (PSO) 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38(4), 393–422 (2002)CrossRefGoogle Scholar
  2. Quintao, F.P., Nakamura, F.G., Mateus, G.R.: Evolutionary algorithm for the dynamic coverage problem applied to wireless sensor networks design. In: Proc. IEEE Int. Conf. on Evolutionary Computation, pp. 1589–1596 (2005)Google Scholar
  3. Kuorilehto, M., Hannikainen, M., Hamalainen, T.D.: A survey of application distribution in wireless sensor networks. EURASIP Journal on Wireless Communications and Networking 5, 774–788 (2005)zbMATHGoogle Scholar
  4. Shih, E., Cho, S.H., Ickes, N., Min, R., Sinha, A., Wang, A., Chandrakasan, A.: Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks. In: Proc. of the 7th Annual Int. Conf. on Mobile Computing and Networking, pp. 272–287 (2001)Google Scholar
  5. Huang, C.F., Tseng, Y.C.: A survey of solutions to the coverage problems in wireless sensor networks. Journal of Internet Technology 6(1), 1–8 (2005)Google Scholar
  6. Cardei, M., Wu, J.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. Computer Communications 29, 413–420 (2006)CrossRefGoogle Scholar
  7. 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. on Sensor Networks 1(1), 36–72 (2005)CrossRefGoogle Scholar
  8. Tian, D., Georganas, N.D.: A node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Commun. And Mobile Comput. 3, 271–290 (2003)CrossRefGoogle Scholar
  9. Yan, T., He, T., Stankovic, J.A.: Differentiated surveillance for sensor networks. In: ACM 1st International Conf. on Embedded Networked Sensor Systems (SenSys), pp. 51–62 (2003)Google Scholar
  10. Ye, F., Zhong, G., Lu, S., Zhang, L.: PEAS: A robust energy conserving protocol for long-lived sensor networks. In: Proc. Int. Conf. on Distributed Computing Systems (ICDCS), pp. 28–37 (2003)Google Scholar
  11. Zou, Y., Chakrabarty, K.: A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Trans. Computers 54(8), 978–991 (2005)CrossRefGoogle Scholar
  12. Back, T., Hammel, U., Schwefel, H.: Evolutionary computation: comments on the history and current state. IEEE Trans. Evol. Comput. 1(1), 15–28 (1997)CrossRefGoogle Scholar
  13. Michalewicz, Z.: Genetic Algorithms + Data Structure = Evolution Programs. Springer, Heidelberg (1996)CrossRefzbMATHGoogle Scholar
  14. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE Int. Conf. Neural Networks, Perth, Australia, pp. 1942–1948 (1995)Google Scholar
  15. Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proc. IEEE Int. Conf. on Syst., Man, and Cybern., pp. 4104–4109 (1997)Google Scholar
  16. Zhan, Z.H., Zhang, J., Li, Y., Chung, S.H.: Adaptive particle swarm optimization. IEEE Trans. Syst., Man, and Cybern. B. 39(6), 1362–1381 (2009)CrossRefGoogle Scholar
  17. Zhan, Z.H., Zhang, J., Li, Y., Shi, Y.H.: Orthogonal learning particle swarm optimization. IEEE Trans. Evol. Comput. (in press)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Zhi-hui Zhan
    • 1
    • 2
    • 3
  • Jun Zhang
    • 1
    • 2
    • 3
  • Zhun Fan
    • 4
  1. 1.Dept. of Computer ScienceSUN Yat-sen UniversityP.R. China
  2. 2.Ministry of EducationKey Laboratory of Digital Life (Sun Yat-Sen University)P.R. China
  3. 3.Key Laboratory of Software TechnologyEducation Department of Guangdong ProvinceP.R. China
  4. 4.Denmark Technical UniversityDenmark

Personalised recommendations