Heuristic Clustering Algorithms in Ad hoc Networks

Authors

  • Nevin Aydın Artvin Çoruh University

DOI:

https://doi.org/10.5195/emaj.2014.39

Abstract

The clustering allows dividing the geographical region to be covered into small zones in which each zone can be handled with a powerful node called clusterhead. The clusterheads have direct communication link with each of its members whereas the member nodes of a cluster must go through the clusterhead to communicate with each other. Since choosing clusterheads optimally is an NP-hard problem, existing solutions to this problem are based on heuristic (mostly greedy) approaches. In this paper, we present three well-known heuristic clustering algorithms: the Lowest-ID, the Highest-Degree, and the Node-Weight.

Author Biography

Nevin Aydın, Artvin Çoruh University

Faculty of Economics and Administrative Sciences

References

Baker, D.J. and Ephremides, A. (1981) ``A Distributed Algorithm for Organizing Mobile Radio Telecommunication Networks," Proceedings of the Second International Conference on Distributed Computer Systems,”April, pp. 476-483.

Baker, D.J. and Ephremides, A. (1981), ``The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm," IEEE Transactions on Communications COM-29(11), November, pp. 1694-1701.

Basagni, S., Chlamtac, I., and Farago, A. (1997) ``A Generalized Clustering Algorithm for Peer-to-Peer Networks," Proceedings of Workshop on Algorithmic Aspects of Communication (Satellite Workshop of ICALP).

Basagni, S. (1999) ``Distributed Clustering for Ad Hoc Networks," Proceedings of International Symposium on Parallel Architectures, Algorithms and Networks, June, pp. 310-315.

Basagni, S. (1999) ``Distributed and MobilityAdaptive Clustering for Multimedia Support in MultiHop Wireless Networks," Proceedings of Vehicular Technology Conference, VTC 1999-Fall, Vol. 2, Amsterdam, September 19--22, pp. 889-893.

Black,U. (1999) Mobile and Wireless Networks, Prentice Hall.

Chlamtac, I. and Farago, A. (1999) ``A New Approach to the Design and Analysis of Peer-to-Peer Mobile Networks," Wireless Networks, Vol. 5, No. 3, May, pp. 149-156.

Ephremides, A., Wieselthier, J.E., and Baker, D.J. (1987) ``A design concept for reliable mobile radio networks with frequency hopping signaling," Proceedings of IEEE, Vol. 75, No. 1, January, pp. 56-73.

Gerla, M. and Tsai, J.T.C. (1995) ``Multicluster, Mobile, Multimedia Radio Network," Wireless Networks, Vol. 1, No. 3, pp. 255-265.

Joa-Ng, M. and Lu, I.-T. (1999) ``A Peer-to-Peer Zone-based Two-level Link State Routing for Mobile Ad Hoc Networks," IEEE Journal on Selected Areas in Communications, August, pp. 1415-1425.

Parekh, A.K. (1994) “Selecting Routers in Ad-Hoc Wireless Networks,” In Proceedings of the SBT/IEEE International Telecommunications Symposium, August.

Downloads

Published

2014-03-05

Issue

Vol. 3 No. 3 (2014)

Section

Articles

License

Authors who publish with this journal agree to the following terms:

  1. The Author retains copyright in the Work, where the term “Work” shall include all digital objects that may result in subsequent electronic publication or distribution.
  2. Upon acceptance of the Work, the author shall grant to the Publisher the right of first publication of the Work.
  3. The Author shall grant to the Publisher and its agents the nonexclusive perpetual right and license to publish, archive, and make accessible the Work in whole or in part in all forms of media now or hereafter known under a Creative Commons Attribution 4.0 International License or its equivalent, which, for the avoidance of doubt, allows others to copy, distribute, and transmit the Work under the following conditions:
    1. Attribution—other users must attribute the Work in the manner specified by the author as indicated on the journal Web site;
    with the understanding that the above condition can be waived with permission from the Author and that where the Work or any of its elements is in the public domain under applicable law, that status is in no way affected by the license.
  4. The Author is able to enter into separate, additional contractual arrangements for the nonexclusive distribution of the journal's published version of the Work (e.g., post it to an institutional repository or publish it in a book), as long as there is provided in the document an acknowledgement of its initial publication in this journal.
  5. Authors are permitted and encouraged to post online a prepublication manuscript (but not the Publisher’s final formatted PDF version of the Work) in institutional repositories or on their Websites prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work. Any such posting made before acceptance and publication of the Work shall be updated upon publication to include a reference to the Publisher-assigned DOI (Digital Object Identifier) and a link to the online abstract for the final published Work in the Journal.
  6. Upon Publisher’s request, the Author agrees to furnish promptly to Publisher, at the Author’s own expense, written evidence of the permissions, licenses, and consents for use of third-party material included within the Work, except as determined by Publisher to be covered by the principles of Fair Use.
  7. The Author represents and warrants that:
    1. the Work is the Author’s original work;
    2. the Author has not transferred, and will not transfer, exclusive rights in the Work to any third party;
    3. the Work is not pending review or under consideration by another publisher;
    4. the Work has not previously been published;
    5. the Work contains no misrepresentation or infringement of the Work or property of other authors or third parties; and
    6. the Work contains no libel, invasion of privacy, or other unlawful matter.
  8. The Author agrees to indemnify and hold Publisher harmless from Author’s breach of the representations and warranties contained in Paragraph 6 above, as well as any claim or proceeding relating to Publisher’s use and publication of any content contained in the Work, including third-party content.

Revised 7/16/2018. Revision Description: Removed outdated link.