Research Article | Open Access
Energy Aware Swarm Optimization with Intercluster Search for Wireless Sensor Network
Wireless sensor networks (WSNs) are emerging as a low cost popular solution for many real-world challenges. The low cost ensures deployment of large sensor arrays to perform military and civilian tasks. Generally, WSNs are power constrained due to their unique deployment method which makes replacement of battery source difficult. Challenges in WSN include a well-organized communication platform for the network with negligible power utilization. In this work, an improved binary particle swarm optimization (PSO) algorithm with modified connected dominating set (CDS) based on residual energy is proposed for discovery of optimal number of clusters and cluster head (CH). Simulations show that the proposed BPSO-T and BPSO-EADS perform better than LEACH- and PSO-based system in terms of energy savings and QOS.
A sensor network deploys many sensor nodes inside a phenomenon or close to it. The position of the sensor nodes can be randomly deployed and does not need predetermined locations which ensure easy deployment in inaccessible terrain. Sensor networks comprise different sensors including seismic, magnetic, visual, thermal, acoustic, infrared, and radar sensors which monitor various ambient conditions. Sensor nodes can be designed to monitor continuously and are useful in event detection, location sensing, and actuators control. Due to its versatility wireless sensor network (WSN) promises applications in many areas .
Sensor networks data aggregation is challenging due to its characteristic of limited energy, processing power, and transmission range [2, 3]. Global addressing for deploying large number of sensors is difficult with currently available technology and hence conventional IP-based protocols are inapplicable to sensor networks. Contrary to communication networks, most sensor networks applications need sensed data flow from multiple regions to a specific link and generate data traffic that contains redundancy as many sensors generate similar data in a phenomenon’s proximity. This should be exploited by routing protocols to improve energy/bandwidth use. Figure 1 shows the architecture of a simple WSN organized hierarchically with the data being aggregated by the cluster head (CH) from its members and then routed to the base station (BS). CH can be special nodes or elected at every round depending on the quality of service (QoS) criteria.
Multihop routing is an important service needed for WSN. Internet and mobile Ad hoc network (MANET) routing techniques fail to perform well in WSN. Internet routing assumes reliable wired connections and hence there are infrequent packet errors, but in WSN this is not the case. Similarly, MANET routing protocols assume symmetric links between two connections which is not the case with WSN as most of the traffic is unidirectional .
WSN routing can be classified based on network structure as flat, hierarchical, or location-based. Further, such protocols are classified as multipath-based, negotiation-based, query-based, coherent-based, and QoS-based depending on protocol operation. All nodes play similar roles in flat networks and energy saving is achieved by using efficient sleep techniques in MAC protocol. Hierarchical protocols form clusters with a designated CH to aggregate and transfer data to the BS. These techniques normally depend on TDMA time slots to sleep and achieve energy efficiency. Location-based protocols use position information to relay data to desired regions and not the entire network . Query-based data-centric protocols depend on desired data naming to eliminate redundant transmissions .
Load balancing has been effectively used to allocate traffic amongst different paths to avoid forming congested areas and at the same time allow the energy consumed to be distributed among the entire network [7, 8]. For energy efficient WSN routing, the main objective would be the energy constraints within the network. Being a NP complete problem, an ideal route can be efficiently found based on heuristic or metaheuristic techniques . Maintaining WSN routes is nontrivial as energy restrictions and node status changes result in frequent/unpredictable topological changes.
Low energy adaptive clustering hierarchy (LEACH) is a popular protocol in WSN. LEACH is a clustering protocol in which the random rotations of local cluster heads are utilized in order to distribute energy load among all sensor nodes in the network. LEACH is popular since it provides scalable network by limiting the communication present inside different clusters; single-hop routing is possible from sensor node to cluster head which results in saving of energy in the network and it increases the network lifetime. The sensor nodes that are not CH communicate based on the schedule created by the CH when using time division multiple access (TDMA) protocol. LEACH operation can be organized into two phases: setup phase and a transmission phase . In the setup phase, the nodes are classified into clusters with one CH in each cluster. In transmission phase, cluster heads collect data from the nodes present in those clusters and transfer the processed information to the BS. In LEACH, CHs are rotated every round to improve the overall network life time compared to fixed CH-based algorithms . LEACH uses a random CH selection technique  where in each sensor it selects a random number between 0 and 1. If the selected number is less than predetermined threshold values then the node becomes a CH. The following equation shows the threshold computation in LEACH:where is the probability that a node will become the CH, is the current round, and is the set of nodes that are yet to become CH. The major role of CH is to aggregate data from all its members and to send the data packets to BS. Though performance of LEACH in terms of energy savings is good, it suffers from many drawbacks such as random selection of CH and not considering energy consumption. LEACH is neither suitable for large area nor suitable for densely deployed network with nonuniform distribution of CHs. Various enhancements for LEACH have been proposed in literature to improve the energy savings. Kumar et al.  did an extensive survey on clustering algorithms based on LEACH reported in WSN literature. Singh et al.  compared various clustering-based algorithm techniques including LEACH, LEACH-C, and PEGASIS.
Cluster formation being NP complete and various techniques to find optimal solution using evolutionary and swarm intelligence algorithm have been proposed in literature. Particle swarm optimization (PSO), a popular swarm intelligence algorithm, has been extensively used for solving optimization due to its simple concept and low computational cost. For clustering algorithm, PSO has been applied in many different ways [9, 15–18]. Wang et al.  made a survey on PSO-based solution for WSN issues. Sobe et al.  proposed WSN-based algorithm single cluster head PSO (SPSO) and double cluster head PSO (DPSO) over varied sensor network areas. Results show that SPSO performs better in network life extension in small network area and for large network area DPSO performs better by load balancing. Latiff et al.  proposed an energy-balanced unequal clustering (EBUC) protocol with PSO algorithm. EBUC adopts energy aware multihop routing to reduce cluster heads energy consumption for intercluster communication which results in increased network lifetime. Kulkarni and Venayagamoorthy proposed an adaptive mutation probability binary particle swarm optimization (AMPBPSO) algorithm to search for the best placement scheme to ensure network reliability and cost reduction. Jiang et al.  proposed WSN performance analysis using artificial neural networks (ANNs). PSO is used as learning algorithm to find an optimized path and to ensure an energy efficient network. In recent times Kuila and Jana  investigated PSO for energy efficient clustering and routing using a multiobjective function which improves the overall quality of service. Other swarm intelligence (SI) algorithms which have been successfully investigated for WSN network life time improvement include artificial bee colony (ABC) [20, 21], Cuckoo search , and ant colony optimization [23, 24]. A good SI algorithm shows improvements in global search and fast convergence for the globally best solution. To further improve the global search various hybrid algorithms have been proposed in literature to improve the existing SI algorithms.
Over thirty modifications of particle swarm optimization have been proposed in literature [25–31] which have shown improvements over PSO proposed by Kennedy and Eberhart  in various domains. To the best of our knowledge not many investigations have been carried out in the area of WSN using modified PSO. This work investigates the impact of hybridization of PSO and its applicability in WSN. Section 2 defines the problem statement, Section 3 gives the detailed methodology of this work, Section 4 explains the results and discusses the same, and Section 5 concludes this paper.
2. Problem Statement
One of the main objectives in WSN design is increasing the network life time. Cluster-based schemes improve network life; however, most popular algorithms including LEACH use the concept of one hop for intracluster and intercluster communication which leads to larger average transmission distance. In this work PSO-based cluster formation technique with multiple objectives is proposed for intracluster data aggregation with a connected dominated set- (CDS-) based intercluster communication based on energy objective. The multiobjective function in this work considers both energy and packet delivery ratio (PDR) which are normalized in the objective function.
WSN can be represented by a connected unidirectional graph represented by where represents the vertices and consists of nodes. represents the edges between the nodes given by . Since the objective is to improve the QoS of the network, each edge is defined by the QoS optimization attributes and can be formulated asSince is constrained by the transmission range of the node, the connectivity between node and can be represented byThe objective is to minimize where is the remaining energy in node and is the initial energy in the node.
Saravanan and Madheswaran  used minimum spanning tree (MST) for establishing intercluster communication. The technique proposed creates load balancing issues; even if multiple paths exist the communication occurs only through the path defined by the MST algorithm. In this work during the setup phase efficient clusters are formed with CH selection based on binary particle swarm optimization (BPSO) with an improved transfer function. Once the CH is elected, the intercluster communication among the CHs to reach the sink is established using energy aware connected dominating set (EADS) to find the optimal route from the suboptimal solutions.
The assumptions made in the network model for simulations are as follows.(i)The network is assumed to be square in nature.(ii)The base station is located in the centre of the network.(iii)Sensor nodes are placed randomly following uniform distribution.(iv)Each sensor node has omnidirectional antenna of uniform range.(v)All nodes have uniform initial energy.(vi)Each member node transmits its data to the specific CH selected in that round.(vii)Cluster heads can transmit the data to the base station using multihops.(viii)Nodes and base station are stationary.The first order radio model proposed in  for one hop scenarios is adapted for multihop scenario. The flow chart of the proposed method is shown in Figure 2.
PSO was initially proposed by Kennedy and Eberhart in 1995 as a stochastic optimization technique to solve discrete and continuous problems using random variables. PSO simulates the social behaviour of insects/birds. In PSO, each candidate solution is represented as a particle or as an individual bird or as an individual fish in search space . The particle moves to a better location based on its individual knowledge and the knowledge gained by the swarm to find an optimal solution using the fitness function. The initial solution is generated randomly within the boundaries of the search space . PSO uses the cognition model to perform the local search while it uses its social skills to perform global search. During each iteration, the next position of the particle is computed based on its cognition and social skills .
Each particle consists of its own position and velocity that can be randomly initialized. After initialization, the particles search their best positions with its or neighboring experience. Every particle maintains two positions called and . The represents the particles’ own best position and is the global best position among all the particles. The position and velocity  of each particle are updated based onwhere represents the current velocity, is particle’s best position, is the global best position among all the particles, and are two numbers generated randomly between 0 and 1, and are acceleration coefficients, and is the current particle position.
Selection of cluster heads from eligible nodes can be seen as a discrete binary search space problem. The nodes can flip depending on whether it is selected as a CH or not. Since PSO is represented using binary strings, the velocity and position computation can be modified accordingly. The initial population is represented by nodes where c represents a node that is selected as one of the CHs for that initial random solution. For a dimension in the search space, indicates that a node is placed for particle in period at iteration . In other words, is a binary value such that , if the node is selected as CH; else otherwise. During the setup phase each node can become a CH with a probability of 0.5. Specifically, if , then ; else . To avoid ambiguous results in this work, the velocity values are restricted to minimum and maximum values and are given by The velocity of particle in the dimensions can be established bySince binary values are used to represent the solutions, the velocities can take values as inOnce the current velocity is found,  applied the transfer function shown in (9) to update the velocity :Transfer function plays an important role in flipping the position. Larger velocities should have very high probability of flipping, whereas small value of velocity should have lower probability. In this work a novel transfer function is proposed and given inThe dimensions of the particle are updated asFigure 3 shows the plot of the proposed transfer function compared to sigmoidal transfer function used in literature. The proposed transfer function shows better flipping parameters for lower velocities in a very narrow field allowing the search to converge better. Once the clusters are formed and CH is elected during the setup phase, the route to the BS from each CH is to be determined.
This work proposed an energy aware dominating set (EADS) to find optimal dominating CH to reach the destination. In graph theory dominating set (DS) is defined as a subset of vertexes such that each node in the vertex is adjacent to at least one node in subset of vertices. Connected dominating set (CDS) is a DS of graph G which creates a subgraph by adding any vertex such that independence property of the set is broken. A detailed review of DS can be found in . In this work CDS is adapted to be energy aware across the edges such that the optimal features expected in the proposed EADS are as follows.
(ii) The total Euclidean distance between resultant DS nodes to the BS should be minimal. The shortest distance between CH and BS is the sum of the hop distance between the two. Using gamma probability density function model, the posterior distribution of sum of the hop distance for a given Euclidean distance is given by where is the hop distance, is the Euclidean distance, is the number of nodes in the DS, and is the probability that a random CH in the DS is hop away from BS.
(iii) Remaining energy between the selected DS nodes should be greater than the average energy among all the nodes and is derived usingThe proposed technique for intercluster communication uses the minimum number of CHs to reach the base station. The route is optimized by selecting nodes which are closer to the BS while ensuring that only CH with higher energy is selected.
4. Experimental Setup and Results
Simulations were carried out using LEACH, GA, and PSO proposed by Kennedy and Eberhart which we call PSO-K adapted to binary operation , PSO-SD , BPSO with proposed transfer function (10) (BPSO-T), and PSO-EADS with the parameters shown in Table 1.
Figure 5(a) shows the random layout of the nodes within the network area of 100 sqm and the BS located at (0, 0). The proposed technique chooses CH randomly as shown in Figure 3(b) with the selected CH shown in green color. This solution can be seen as suboptimal as some of the randomly selected CHs are on the edge of the network. However, these become good candidate solutions for flipping during the fitness evaluation and computation of the new velocity. The proposed transfer function helps in faster convergence. The gradient at the initial iterations indicates sharp flipping characteristic of the transfer function. The convergence factor improves over 45% compared to BPSO-K which uses the classic sigmoidal transfer function. Similarly, PSO-SD showed improvements in convergence compared to PSO-K.
The average number of clusters formed during the initial 10 rounds is shown in Figure 6.
The number of clusters formed using binary particle swarm optimization is higher compared to LEACH, GA, and PSO-SD. Higher number of clusters reduces the intracluster distance among nodes and hence improves both the packet delivery ratio and energy efficiency as the transmission power used by these nodes will be lower. The increased cluster formation is utilized by EADS to form better intercluster communication. This is evident in the remaining energy in the network as the number of rounds increases as shown in Figure 7.
Except for LEACH and GA, all techniques retain more than 50% of their energy for the first 400 rounds while GA-based cluster formation and CH selection of the retained energy during the same period are about 35% only. However, with improved intracluster communication BPSO-EADS shows better energy management for about 75% of the network life time after which it falls steeply as in other techniques. This energy management directly translates to more number of nodes being alive as seen in Figure 8. Except for LEACH, all other techniques retain 50% of the nodes for more than 550 rounds which is an improvement of over 40% compared to LEACH. In small networks, where all nodes are able to reach the BS with less than two hops, the proposed technique significantly improves the usability of the network which may not be in the case of LEACH. Due to the inherent single hop characteristic of LEACH, nodes closer to the BS die first compared to the techniques used by PSO-SD and PSO-EADS.
Quality of service also plays a very important role and a major requirement for current applications. The average packet loss rate and average end to end delay across 500 rounds is shown in Figures 9 and 10.
All the binary PSO methods have lower end to end delay with an average decrease of 1.6% compared to LEACH and 17.6% compared to GA. GA shows higher end to end delay compared to LEACH by 15.8%. However, this may not be significant if the data can tolerate some delay. However, the average packet loss rate is higher in LEACH compared to all other techniques as seen in Figure 10.
The packet loss rate is statistically similar between PSO-SD and PSO-T. However, the proposed intercluster communication using EADS has shown the least packet loss and is lower than LEACH by 44.19% and lower than BPSO-SD by 12.18%. Compared to classic PSO, PSO-EADS reduces the packet loss rate by 22.86%. BPSO-EADS has shown overall improvement in energy savings and QoS parameters of the network. It is also seen that PSO-based techniques perform better than GA-based technique where two-point crossover with uniform mutation was used in the experimental setup.
In this work, particle swarm optimization was revisited and improvements were investigated to optimize the clustering problem in wireless sensor network. The objective was to improve the energy efficiency of the network and improve the overall quality of service. In the proposed binary particle swarm optimization algorithm, an improved transfer function was investigated along with intercluster communication using a modified connected dominating set technique using the energy criteria of the cluster heads. Simulation showed that the proposed technique improved over LEACH and existing PSO algorithms in both QoS and energy savings.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
- I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Computer Networks, vol. 38, no. 4, pp. 393–422, 2002.
- C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks, vol. 1, no. 2-3, pp. 293–315, 2003.
- J. L. Hill, System architecture for wireless sensor networks [Ph.D. thesis], University of California, 2003.
- H. Frey, S. Rührup, and I. Stojmenović, “Routing in wireless sensor networks,” in Guide to Wireless Sensor Networks, Computer Communications and Networks, pp. 81–111, Springer, London, UK, 2009.
- J. N. Al-Karaki and A. E. Kamal, “Routing techniques in wireless sensor networks: a survey,” IEEE Wireless Communications, vol. 11, no. 6, pp. 6–27, 2004.
- K. Akkaya and M. Younis, “A survey on routing protocols for wireless sensor networks,” Ad Hoc Networks, vol. 3, no. 3, pp. 325–349, 2005.
- J. Tang, G. Xue, and W. Zhang, “Interference-aware topology control and QoS routing in multi-channel wireless mesh networks,” in Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC '05), pp. 68–77, ACM, May 2005.
- Y. Yang, J. Wang, and R. Kravets, Interference-Aware Load Balancing for Multihop Wireless Networks, 2005.
- R. V. Kulkarni and G. K. Venayagamoorthy, “Particle swarm optimization in wireless-sensor networks: a brief survey,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 41, no. 2, pp. 262–267, 2011.
- W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “An application-specific protocol architecture for wireless microsensor networks,” IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660–670, 2002.
- W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” in Proceedings of the 33rd Annual Hawaii International Conference on System Siences (HICSS '33), January 2000.
- T. Gao, D. Greenspan, M. Welsh, R. R. Juang, and A. Alm, “Vital signs monitoring and patient tracking over a wireless network,” in Proceedings of the IEEE 27th Annual International Conference of the Engineering in Medicine and Biology Society (EMBS '05), pp. 102–105, September 2005.
- V. Kumar, S. Jain, and S. Tiwari, “Energy efficient clustering algorithms in wireless sensor networks: a survey,” International Journal of Computer Science Issues, vol. 8, no. 5, pp. 1694–1814, 2011.
- S. S. Singh, M. Kumar, R. Saxena, and Priya, “Application of particle swarm optimization for energy efficient wireless sensor network: a survey,” International Journal of Engineering Science & Advanced Technology, vol. 2, no. 5, pp. 1246–1250, 2012.
- L. Wang, W. Ye, H. Wang, X. Fu, M. Fei, and M. I. Menhas, “Optimal node placement of industrial wireless sensor networks based on adaptive mutation probability binary particle swarm optimization algorithm,” Computer Science and Information Systems, vol. 9, no. 4, pp. 1553–1576, 2012.
- A. Sobe, I. Fehérvári, and W. Elmenreich, “FREVO: a tool for evolving and evaluating self-organizing systems,” in Proceedings of the IEEE 6th International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW '12), pp. 105–110, IEEE, Lyon, France, September 2012.
- N. M. A. Latiff, C. C. Tsimenidis, B. S. Sharif, and C. Ladha, “Dynamic clustering using binary multi-objective particle swarm optimization for wireless sensor networks,” in Proceedings of the IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '08), pp. 1–5, IEEE, September 2008.
- C.-J. Jiang, W.-R. Shi, M. Xiang, and X.-L. Tang, “Energy-balanced unequal clustering protocol for wireless sensor networks,” The Journal of China Universities of Posts and Telecommunications, vol. 17, no. 4, pp. 94–99, 2010.
- P. Kuila and P. K. Jana, “Energy efficient clustering and routing algorithms for wireless sensor networks: particle swarm optimization approach,” Engineering Applications of Artificial Intelligence, vol. 33, pp. 127–140, 2014.
- D. Karaboga, B. Gorkemli, C. Ozturk, and N. Karaboga, “A comprehensive survey: artificial bee colony (ABC) algorithm and applications,” Artificial Intelligence Review, vol. 42, no. 1, pp. 21–57, 2014.
- M. Saravanan and M. Madheswaran, “A hybrid optimized weighted minimum spanning tree for the shortest intrapath selection in wireless sensor network,” Mathematical Problems in Engineering, vol. 2014, Article ID 713427, 8 pages, 2014.
- X.-S. Yang and S. Deb, “Cuckoo search: recent advances and applications,” Neural Computing and Applications, vol. 24, no. 1, pp. 169–174, 2014.
- B. Kadri, M. Feham, and A. Mhammed, “Efficient and secured ant routing algorithm for wireless sensor networks,” International Journal of Network Security, vol. 16, no. 2, pp. 149–156, 2014.
- J.-Y. Kim, T. Sharma, B. Kumar, G. S. Tomar, K. Berry, and W.-H. Lee, “Intercluster ant colony optimization algorithm for wireless sensor network in dense environment,” International Journal of Distributed Sensor Networks, vol. 2014, Article ID 457402, 10 pages, 2014.
- Y. Hu, Y. Ding, K. Hao, L. Ren, and H. Han, “An immune orthogonal learning particle swarm optimisation algorithm for routing recovery of wireless sensor networks with mobile sink,” International Journal of Systems Science, vol. 45, no. 3, pp. 337–350, 2014.
- A. H. Gandomi, G. J. Yun, X.-S. Yang, and S. Talatahari, “Chaos-enhanced accelerated particle swarm optimization,” Communications in Nonlinear Science and Numerical Simulation, vol. 18, no. 2, pp. 327–340, 2013.
- F. P. Goksal, I. Karaoglan, and F. Altiparmak, “A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery,” Computers & Industrial Engineering, vol. 65, no. 1, pp. 39–53, 2013.
- H. Wang, H. Sun, C. Li, S. Rahnamayan, and J.-S. Pan, “Diversity enhanced particle swarm optimization with neighborhood search,” Information Sciences, vol. 223, pp. 119–135, 2013.
- J. He and H. Guo, “A modified particle swarm optimization algorithm,” TELKOMNIKA Indonesian Journal of Electrical Engineering, vol. 11, no. 10, pp. 6209–6215, 2013.
- W. Xu, Z. Geng, Q. Zhu, and X. Gu, “A piecewise linear chaotic map and sequential quadratic programming based robust hybrid particle swarm optimization,” Information Sciences, vol. 218, pp. 85–102, 2013.
- W.-N. Chen, J. Zhang, Y. Lin et al., “Particle swarm optimization with an aging leader and challengers,” IEEE Transactions on Evolutionary Computation, vol. 17, no. 2, pp. 241–258, 2013.
- J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, IEEE, Perth, Australia, December 1995.
- J. Kennedy, “Particle swarm optimization,” in Encyclopedia of Machine Learning, pp. 760–766, Springer, New York, NY, USA, 2010.
- C. J. Tu, L. Y. Chuang, J. Y. Chang, and C. H. Yang, “Feature selection using PSO-SVM,” IAENG International Journal of Computer Science, vol. 33, no. 1, pp. 111–116, 2007.
- H. Jabeen, Z. Jalil, and A. R. Baig, “Opposition based initialization in particle swarm optimization (O-PSO),” in Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2047–2052, ACM, July 2009.
- M. Imran, R. Hashim, A. K. N. Elaiza, and A. Irtaza, “Stochastic optimized relevance feedback particle swarm optimization for content based image retrieval,” The Scientific World Journal, vol. 2014, Article ID 752090, 12 pages, 2014.
- M. F. Taşgetiren and Y. C. Liang, “A binary particle swarm optimization algorithm for lot sizing problem,” Journal of Economic and Social Research, vol. 5, no. 2, pp. 1–20, 2004.
- J. Blum, M. Ding, A. Thaeler, and X. Cheng, “Connected dominating set in sensor networks and MANETs,” in Handbook of Combinatorial Optimization, pp. 329–369, Springer, New York, NY, USA, 2005.
- B. Singh and D. K. Lobiyal, “A novel energy-aware cluster head selection based on particle swarm optimization for wireless sensor networks,” Human-Centric Computing and Information Sciences, vol. 2, no. 1, pp. 1–18, 2012.
Copyright © 2015 Shanmugasundaram Thilagavathi and Bhavani Gnanasambandan Geetha. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.