Main Reference PaperAn Efficient Genetic Algorithm for Maximum Coverage Deployment in Wireless Sensor Networks, IEEE Transactions on Cybernetics, 2013.
  • This paper proposed a solution for “maximum coverage deployment problem” in wireless sensor network. Random deployment is the simplest way to deploy sensor nodes but may cause unbalanced deployment.To solve this issue,this system propose an efficient genetic algorithm using a novel normalization method.

+ Description
  • This paper proposed a solution for “maximum coverage deployment problem” in wireless sensor network. Random deployment is the simplest way to deploy sensor nodes but may cause unbalanced deployment.To solve this issue,this system propose an efficient genetic algorithm using a novel normalization method.

  • To achieve the maximum coverage problem.

  • The proposed work also apply in dynamic topology.

+ Aim & Objectives
  • To achieve the maximum coverage problem.

  • The proposed work also apply in dynamic topology.

  • The proposed genetic algorithms could be further improved by combining with a well-designed local search.

+ Contribution
  • The proposed genetic algorithms could be further improved by combining with a well-designed local search.

  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

+ Software Tools & Technologies
  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

  • B.E / B.Tech / M.E / M.Tech

+ Project Recommended For
  • B.E / B.Tech / M.E / M.Tech

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.