Adaptive power-A ware clustering and multicasting protocol for mobile ad hoc networks

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

Abstract

One of the most critical issues in wireless ad hoc networks is represented by the limited availability of energy within network nodes. Most of the researches focused on the problem of routing issues rather than energy efficiency or prolongation of network lifetime. In this paper, we proposed a multicast power greedy clustering algorithm (termed as MPGC) with the mesh scheme in the multicasting protocol of ad hoc wireless networks. The greedy heuristic clustering partitions a large-scale ad hoc network into a hierarchical cluster structure. Nodes in a cluster determine adaptively their power levels so as to be power efficient. The clusterheads acting as the agents of transmitters/receivers can reduce efficiently bandwidth consumption and complexity of mesh structures. Besides, the mechanism of cluster maintenance can remarkably prolong the network lifetime. The power aware multicasting protocol based on ODMRP executes suitably on the super-nodes topology formed by clusterheads. The results of the simulation show that our scheme achieves better performance for ad hoc networks, in terms of network lifetime and network scalability. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Leu, J. J. Y., Tsai, M. H., Chiang, T. C., & Huang, Y. M. (2006). Adaptive power-A ware clustering and multicasting protocol for mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4159 LNCS, pp. 331–340). Springer Verlag. https://doi.org/10.1007/11833529_34

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