By Topic

A power-saving routing algorithm based on ant algorithm in mobile ad hoc 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
$33 $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

2 Author(s)
Sun Li-Shan ; Dept. of Electr. Eng., Harbin Inst. of Technol., China ; Zhang Xiao-Jun

In this paper, a method of an improved ant algorithm called PSAA (power-saving ant algorithm) is proposed for ad hoc networks to prolong the life-time of ad hoc networks as long as possible. The battery remainder power and its variance of nodes in ad hoc networks are taken into account in PSAA. Variance of battery remainder power of nodes shows the equilibrium of every nodes power consumption partially. Leading in the mutation strategy that has a random small probability, PSAA can avoid getting into local optimal solutions. So the selected routing is more reasonable. Furthermore, PSAA sets hop constraint to provide QoS guarantee. Simulation shows PSAA is more efficient and robust than other power saving algorithms, especially when topology of networks changes rapidly. PSAA also has a longer lifetime.

Published in:

Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005.  (Volume:2 )

Date of Conference:

23-26 Sept. 2005