A power-based clustering algorithm for wireless ad-hoc networks

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Energy saving, despite recent advances in extending battery life, is still an important issue in wireless ad hoc networks. An often adopted method is power management, which can help in reducing the transmission power consumption and thus can prolong the battery life of mobile nodes. In this paper, we present a new approach of power management for the wireless ad-hoc networks. Firstly, we propose a clustering algorithm. The clustering algorithm is incooperated with power adjustment and energy-efficient routing procedure to achieve the goal of reducing the transmission power. We use clusterheads to monitor a mobile node's transmission power and to conduct the routing path between any source-destination pair. Not only the lifetime of network is increased but also the interference in communication channel is reduced. As a result, the transmission quality is improved and the network throughput is enhanced. By simulation, we showed that our algorithm outperforms the traditional clustering algorithm both in power saving and in throughput. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Huang, T. C., Shiu, L. C., & Chen, Y. F. (2004). A power-based clustering algorithm for wireless ad-hoc networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3207, 591–600. https://doi.org/10.1007/978-3-540-30121-9_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free