• The secret of success is learning how to use pain and pleasure instead of having pain and pleasure use you. If you do that, you're in control of your life. If you don't, life controls you.
      Tony Robbins

    • If you do what you've always done, you'll get what you've always gotten.
      Tony Robbins

  1. Address: Floor 3th, Information Technology Center of BASU University, Hamedan, Iran.

    Tel: +988138270182 & +988138268809         Email: info@wsnlab.org

    • Carry out the Wireless Sensor Network Simulation projects
    • Consulting the Wireless Sensor Network Projects
    • Implementation Hardware, Middle-ware and Software of WSN.

    for more information you can contact us: info@wsnlab.org

  2. Our Persian Forum ,
    www.wsnlab.ir

Target Scheduling Algorithm For Wireless Sensor Networks: Imperialist Competitive Algorithm Appr

Discussion in 'Coverage in Wireless Sensor Networks' started by Homaei, Nov 24, 2013.

  1. Homaei

    Homaei Administrator Staff Member

    Target Scheduling algorithm for Wireless Sensor Networks: Imperialist Competitive Algorithm Approach

    Habib MOSTAFAEI
    Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, Iran
    Iran*Corresponding author: Received: November 29, 2012E-mail: h.mostafaei@iaurmia.ac.irAccepted: January 06, 2013

    Abstract Wireless sensor networks have been deployed for many applications such as surveillance an area or a set of targets and lifetime maximization is one the most important challenges in wireless sensor networks. When a set of sensor nodes dropped into a field by aircraft or manually to monitor a set of targets, scheduling sensor nodes to monitor deployed targets is necessary to prolong network lifetime. Scheduling sensor nodes into cover set is one of the most important approaches to solve this problem. Hence, it is desirable to activate a minimum number of sensor nodes that are able to monitor all targets and turn off redundant nodes to save energy. In this paper, we used Imperialist Competitive Algorithm (ICA) to schedule sensor nodes into cover sets that can monitor deployed targets and increase lifetime and ICA is used as a method to create cover set in network. To study performance of our approach computer simulations conducted and results of these simulations showed that our algorithm can improve network`s lifetime in comparison with similar existing methods.
    Keywords : Imperialist Competitive Algorithm (ICA), Scheduling, Target Coverage, Sensor Networks.




Share This Page

Get our toolbar! Flag Counter