Energy and path aware clustering algorithm (EPAC) for mobile ad hoc networks

Asif, Waqar ORCID: https://orcid.org/0000-0001-6774-3050 and Qaisar, Saad (2011) Energy and path aware clustering algorithm (EPAC) for mobile ad hoc networks. In: International Conference on Computational Science and Its Applications, 20-23 Jun 2011, Spain.

[thumbnail of Energy and Path Aware Clustering Algorithm (EPAC) for Mobile Ad Hoc Networks.pdf]
Preview
PDF
Energy and Path Aware Clustering Algorithm (EPAC) for Mobile Ad Hoc Networks.pdf - Accepted Version

Download (279kB) | Preview

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.

Item Type: Conference or Workshop Item (Paper)
ISBN: 9783642218989
Identifier: 10.1007/978-3-642-21898-9\_12
Page Range: pp. 133-147
Identifier: 10.1007/978-3-642-21898-9\_12
Additional Information: The final authenticated version is available online at https://doi.org/10.1007/978-3-642-21898-9\_12. Cite 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. https://doi.org/10.1007/978-3-642-21898-9_12
Keywords: SWARM, Pareto Optimality, Cluster Head, Optimality
Subjects: Computing > Information security > Cyber security
Related URLs:
Depositing User: Waqar Asif
Date Deposited: 03 Dec 2020 23:22
Last Modified: 28 Aug 2021 07:14
URI: https://repository.uwl.ac.uk/id/eprint/7527

Downloads

Downloads per month over past year

Actions (login required)

View Item View Item

Menu