By Topic

An Energy-Aware On-Demand Clustering Routing Algorithm for 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
$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)
Weiren Shi ; Chongqing Univ., Chongqing ; Chao Huang ; Jiuyin Yuan

The more the number of nodes is, the worse the performance of the flat-based routing protocol is in the wireless ad hoc network. And the clustering algorithm based on maximal connectivity ignores the equipoise of network energy, and it affects network lifetime. So, this paper brings forward a self-maintenance clustering algorithm, which takes on-demand flat-based routing mechanism, remnant energy of nodes and their maximal connectivity into account. These simulation results show its validity, and this algorithm improves the scalability, enhances the network performance and prolongs the existence time of the network.

Published in:

Convergence Information Technology, 2007. International Conference on

Date of Conference:

21-23 Nov. 2007