In the previous years, wireless sensor networks (WSNs) got lot of attraction from the scientific and industrial society. WSNs are composed of huge number of small resource constrained devices recognized as sensors. Energy is a vital issue in WSN. Energy efficient clustering is an eminent optimization problem which has been studied extensively to prolong the lifetime of the network. This paper demonstrates the programming formulation of this problem followed by a proposed algorithm with particle swarm optimization (PSO) approach. The clustering method is stated by taking into consideration of energy saving of nodes. The proposed algorithm is experimented widely and results are evaluated with existing methods to show their supremacy in term of alive nodes, energy expenditure, packet delivery ratio, and throughput of network. Simulation results shows that our proposed algorithm outperform the other existing algorithms of its category.

In previous years, wireless sensor networks (WSNs) have fascinated lot of consideration from the scientific and technical society. The distributed characteristics and dynamic topology of sensor networks initiates very peculiar necessities in routing schemes that supposed to be met. The key feature of efficient routing protocol is energy expenditure and extension in lifetime of network. In past few years, various routing algorithms have been presented for WSNs. In this work, we focus on cluster based routing algorithms and propose a new algorithm for routing in WSNs. We perform the analysis of our new cluster based algorithms with existing algorithm on the basis of performance metrics. Simulation results shows that proposed algorithm outperform the other existing algorithms of his category.

In the past decade, Wireless sensor networks (WSNs) have attracted very much attention from the research and industrial community. Various WSN based projects produced fruitful and interesting results. In various applications, the location information of node is vital for the service. The reason is that users usually need to know what happens, but also where the concerned events happen. For example, in battlefield surveillance, the knowledge of where the enemy comes from can be much more important than only knowing the appearance of the enemy, it is much important that sensors reports the information along with their location. Localization is one of the primary and widely useful middle-ware services in sensor networks, mostly allows every node to obtain its location information. The localization schemes can be categorized on the basis of various parameters like availability of GPS, presence of anchors, range measurements, model of computation etc. On the basis of computation model, the localization approaches can be categorized into: centralized and distributed localization techniques. Due to certain advantages, distributed localization is flattering as an active stem in sensor localization. In this paper, we have been reported a detailed analysis on distributed localization techniques and outline the merits and limitations of distributed localization schemes in WSNs. Finally, we conclude the paper with some open issues.