Title: Swarm intelligence approaches for cover scheduling problem in wireless sensor networks

Authors: Vuyyuru Gopinadh; Alok Singh

Addresses: School of Computer and Information Sciences, University of Hyderabad, Hyderabad 500 046, India ' School of Computer and Information Sciences, University of Hyderabad, Hyderabad 500 046, India

Abstract: Wireless sensor networks (WSNs) are getting more and more attention these days. Already, innumerable approaches have been proposed to solve various problems in WSNs. In this paper, we have proposed two swarm intelligence approaches, viz. artificial bee colony (ABC) algorithm and invasive weed optimisation (IWO) algorithm for the cover scheduling problem in WSNs where coverage breach is allowed either due to technical constraints or deliberately. The objective of the wireless sensor network cover scheduling problem (WSN-CSP) is to schedule the covers of sensors in such a manner so that the longest target breach is minimised. The WSN-CSP is an NP-Hard problem and is relatively under-studied. ABC algorithm is based on intelligent foraging behaviour of honey bee swarms, whereas IWO algorithm is based on colonising behaviour of weeds. For further improving the results obtained through ABC and IWO approaches, we have also devised a local search. Computational results show the effectiveness of our proposed approaches in comparison to a genetic algorithm and a problem specific heuristic available in the literature.

Keywords: artificial bee colony; ABC; cover scheduling; coverage breach; invasive weed optimisation; IWO; swarm intelligence; wireless sensor networks; WSNs; sensor coverage; intelligent foraging behaviour; colonising behaviour; local search.

DOI: 10.1504/IJBIC.2015.067987

International Journal of Bio-Inspired Computation, 2015 Vol.7 No.1, pp.50 - 61

Received: 03 Sep 2013
Accepted: 22 Sep 2014
Published online: 12 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article