No abstract

No abstract

No abstract

No abstract

Wireless Sensor Network (WSN) is emergingtechnology and has wide range of applications, such as environment monitoring, industrial automation and numerous military applications. Hence, WSN is popular among researchers. WSN has several constraints such as restricted sensing range, communication range and limited battery capacity. These limitations bring issues such as coverage, connectivity, network lifetime and scheduling & data aggregation. There are mainly three strategies for solving coverage problems namely; force, grid and computational geometry based. PSO is a multidimensional optimization method inspired from the social behavior of birds called flocking. Basic version of PSO has the drawback of sometimes getting trapped in local optima as particles learn from each other and past solutions. This issue is solved by discrete version of PSO known as Modified Discrete Binary PSO (MDBPSO) as it uses probabilistic approach. This paper discusses performance analysis of random; grid based MDBPSO (Modified Discrete Binary Particle Swarm Optimization), Force Based VFCPSO and Combination of Grid & Force Based sensor deployment algorithms based on interval and packet size. From the results of Combination of Grid & Force Based sensor deployment algorithm, it can be concluded that its performance is best for all parameters as compared to rest of the three methods when interval and packet size is varied.