Cart (Loading....) | Create Account
Close category search window
 

Chaotic ant colony based routing algorithm with energy prediction and QoS guarantees for 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

3 Author(s)
Nan Shen ; Coll. of Mathematic & Comput. Sci., Fuzhou Univ., Fuzhou, China ; Chun-yan Yu ; Yun-fei Jiang

In the field of wireless sensor networks, it is a fundamental issue to balance efficient routing and energy cost via self-organization. Moreover, many applications require some QoS metrics, but not enough attention has been attracted. In this paper, an Energy prediction routing algorithm with adaptive QoS guarantees was proposed using Chaotic Ant Colony algorithm, EQCACA for short, to tackle the combination problem. Simulation results demonstrate the effectiveness of the proposed algorithm in terms of bandwidth, delay and packet loss rate compared with ant colony routing algorithm.

Published in:

Biomedical Engineering and Informatics (BMEI), 2011 4th International Conference on  (Volume:4 )

Date of Conference:

15-17 Oct. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.