Network lifetime plays an integral role in setting up an efficient wireless sensor network. The objective of this paper is twofold. The first one is to deploy sensor nodes at optimal locations such that the theoretically computed network lifetime is maximum. The second is to schedule these sensor nodes such that the network attains the maximum lifetime.
 C.-Y. Chong and S. Kumar, “Sensor networks: Evolution, opportunities, and challenges,” Proc. IEEE, vol. 91, no. 8, pp. 1247–1256, Aug. 2003.  J. Wang, R. Ghosh, and S. Das, “A survey on sensor localization,” J. Control Theory Appl., vol. 8, no. 1, pp. 2–11, 2010.  C.-F. Huang and Y.-C. Tseng, “The coverage problem in a wireless sensor network,” in Proc. 2nd ACM Int. Conf. Wireless Sensor Netw. Appl., 2003, pp. 115–121.  Y. Gu, H. Liu, and B. Zhao, “Target coverage with QoS requirements in wireless sensor networks,” in Proc. Intell. Pervas. Comput., 2007, pp. 35–38.  M. Chaudhary and A. K. Pujari, “Q-coverage problem in wireless sensor networks,” in Proc. Int. Conf. Distrib. Comput. Netw., 2009, pp. 325–330.  D. Karaboga and B. Akay, “A survey: Algorithms simulating bee swarm intelligence,” Artif. Intell. Rev., vol. 31, nos. 1–4, pp. 61–85, 2009.  D. Karaboga and B. Basturk, “On the performance of artificial bee colony (ABC) algorithm,” Appl. Soft Comput., vol. 8, pp. 687–697, Jan. 2008.  D. Karaboga, B. Gorkemli, C. Ozturk, and N. Karaboga, “A comprehensive survey: Artificial bee colony (ABC) algorithm and applications,” Artif. Intell. Rev., 2012, pp.  D. Karaboga, C. Ozturk, N. Karaboga, and B. Gorkemli, “Artificial bee colony programming for symbolic regression,” Inf. Sci., vol. 209, pp. 1–15, Nov. 2012.  D. Karaboga, S. Okdem, and C. Ozturk, “Cluster based wireless sensor network routing using artificial bee colony algorithm,” Wireless Netw., vol. 18, no. 7, pp. 847–860, 2012.  J. Yick, B. Mukherjee, and D. Ghosal, “Wireless sensor network survey,” Comput. Netw., vol. 52, pp. 2292–2330, Aug. 2008.  Y. Li and S. Gao, “Designing k-coverage schedules in wireless sensor networks,” J. Combinat. Opt., vol. 15, no. 2, pp. 127–146, 2008.  A. Krause, R. Rajagopal, A. Gupta, and C. Guestrin, “Simultaneous placement and scheduling of sensors,” in Proc. Int. Conf. IPSN, 2009, pp. 181–192.  K. Wu, Y. Gao, F. Li, and Y. Xiao, “Lightweight deployment-aware scheduling for wireless sensor networks,” Mobile Netw. Appl., vol. 10, pp. 837–852, Dec. 2005.  J. Wu and S. Yang, “Optimal movement-assisted sensor deployment and its extensions in wireless sensor networks,” Simul. Model. Pract. Theory, vol. 15, no. 4, pp. 383–399, 2007.  N. Bartolini, T. Calamoneri, T. La Porta, and S. Silvestri, “Mobile sensor deployment in unknown fields,” in Proc. IEEE INFOCOM, Mar. 2010, pp. 1–5.  C.-Y. Chang, C.-T. Chang, Y.-C. Chen, and H.-R. Chang, “Obstacleresistant deployment algorithms for wireless sensor networks,” IEEE Trans. Veh. Technol., vol. 58, no. 6, pp. 2925–2941, Jul. 2009.  T.-L. Chin, “Sensor deployment for collaborative target detection in the presence of obstacles,” in Proc. IEEE Global Telecommun. Conf., Dec. 2009, pp. 1–5.  E. Onur, C. Ersoy, and H. Deliç, “Quality of deployment in surveillance wireless sensor networks,” Int. J. Wireless Inform. Netw., vol. 12, no. 1, pp. 61–67, 2005.
Wireless sensor networks, target coverage, sensor deployment, k-coverage, Q-coverage.