Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

An efficient sensor-mission assignment algorithm based on dynamic alliance and quantum genetic algorithm in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Weizhong Luo ; Hunan Univ. of Finance & Econ., Changsha, China

In wireless sensor networks, there are often several missions that start and finish at different time need to be handled at some time. Schemes that assign sensor resources to mission demands thus become necessary. In order to adapt to the dynamic characteristic of the missions, a management mechanism, named dynamic alliance, is used in the network to organize the nodes. Moreover, since the effective assignment of nodes to missions is a NP-complete problem, a novel quantum genetic algorithm is proposed to solve it. To the best our knowledge, this paper is the first one that researches how to realize the sensor-mission assignment by dynamic alliance and quantum genetic algorithm. Simulation results show that our approach is better than previous algorithms.

Published in:

Intelligent Computing and Integrated Systems (ICISS), 2010 International Conference on

Date of Conference:

22-24 Oct. 2010