By Topic

Genetic Algorithm Based Length Reduction of a Mobile BS Path in WSNs

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

5 Author(s)
Liang He ; Dept. of Comput. Sci., Nankai Univ., Tianjin, China ; Jingdong Xu ; Yuntao Yu ; Miao Li
more authors

Energy in WSNs can be significantly saved by integrating a mobile BS, which on the other hand may impose the network an unacceptable latency. In this paper, we overcome this problem by making the path of the mobile BS as short as possible. Our method mainly consists of three steps. First, we construct a virtual network from which to choose the location that the BS must arrive. Next, we apply a weighting scheme to each points of the virtual network, and select a minimum number of them by implementing a genetic algorithm, while at the same time guarantee the network connectivity and coverage. Finally, after showing its NPC property, we construct the optimized BS path based on the point set obtained in the second step. Our method is testified by comprehensive experiments. The results show that it can greatly reduce the number of points that the BS must arrive, and then get us an optimized mobile BS path.

Published in:

Computer and Information Science, 2009. ICIS 2009. Eighth IEEE/ACIS International Conference on

Date of Conference:

1-3 June 2009