Energy and Path Aware Clustering Algorithm (EPAC) for Mobile Ad Hoc Networks

  • Waqar Asif
  • Saad Qaisar
Conference paper

DOI: 10.1007/978-3-642-21898-9_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6785)
Cite this paper as:
Asif W., Qaisar S. (2011) Energy and Path Aware Clustering Algorithm (EPAC) for Mobile Ad Hoc Networks. In: Murgante B., Gervasi O., Iglesias A., Taniar D., Apduhan B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6785. Springer, Berlin, Heidelberg

Abstract

Node clustering is a technique that mitigates the change in topology in Ad hoc communication. It stabilizes the end to end communication path and maximizes the path life time. In SWARM communication, each cluster is assigned an objective and expected to complete it in the available resources. Most of the algorithms previously designed assume that the assignment of tasks can be done in any arbitrary manner and does not depend on the energy resources. In this work, we have emphasized that the number of nodes in a cluster is fundamentally related to the energy requirement of the objective. With the help of this new algorithm, we minimize energy consumption in a cluster by improving the mechanism for selecting objective, depending upon the amount of energy present at the nodes of that cluster.

Keywords

SWARM Pareto Optimality Cluster Head Optimality 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Waqar Asif
    • 1
  • Saad Qaisar
    • 1
  1. 1.National University of Sciences and Technology, H-12Pakistan

Personalised recommendations