Path: Top -> Journal -> Telkomnika -> 2014 -> Vol 12, No 2: June
A New Clustering Algorithm Using Links' Weight to Decrease Consumed Energy in MANETs
A New Clustering Algorithm Using Links' Weight to Decrease Consumed Energy in MANETs
Journal from gdlhub / 2016-11-12 06:59:04Oleh : Abbas Afsharfarnia, Abbas Karimi, Telkomnika
Dibuat : 2014-06-01, dengan 1 file
Keyword : Clustering, Mobile Networks, Nodes' Stability, MANETs, Consumed Energy
Url : http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/59
One of the most important problems of clustering algorithms in mobile ad-hoc networks (MANETs) is the relatively low stability in generated clusters which are resulted by rapid clusters destruction and high energy consumption in performing the re-clustering processes. Many algorithms have been provided to increase the clusters stability of which the most significant are weight-based algorithms. In weight-based algorithms, only limited information of each node is used to determine its weight and it causes that the best possible option for cluster-head is not selected. The purpose of this paper is providing one weight-based algorithm in which each node's weight determination is performed not only by using its node information but also its neighborÂ’s nodes information and this work is performed by determining the links' weight between nodes that provide connections between nodes. Via this method, the best possible options can be selected as cluster-head. In simulations and performed experiments, it is revealed that the generated clusters by our proposed algorithms have very high stability.
One of the most important problems of clustering algorithms in mobile ad-hoc networks (MANETs) is the relatively low stability in generated clusters which are resulted by rapid clusters destruction and high energy consumption in performing the re-clustering processes. Many algorithms have been provided to increase the clusters stability of which the most significant are weight-based algorithms. In weight-based algorithms, only limited information of each node is used to determine its weight and it causes that the best possible option for cluster-head is not selected. The purpose of this paper is providing one weight-based algorithm in which each node's weight determination is performed not only by using its node information but also its neighborÂ’s nodes information and this work is performed by determining the links' weight between nodes that provide connections between nodes. Via this method, the best possible options can be selected as cluster-head. In simulations and performed experiments, it is revealed that the generated clusters by our proposed algorithms have very high stability.
Beri Komentar ?#(0) | Bookmark
Properti | Nilai Properti |
---|---|
ID Publisher | gdlhub |
Organisasi | Telkomnika |
Nama Kontak | Herti Yani, S.Kom |
Alamat | Jln. Jenderal Sudirman |
Kota | Jambi |
Daerah | Jambi |
Negara | Indonesia |
Telepon | 0741-35095 |
Fax | 0741-35093 |
E-mail Administrator | elibrarystikom@gmail.com |
E-mail CKO | elibrarystikom@gmail.com |
Print ...
Kontributor...
- , Editor: sukadi
Download...
Download hanya untuk member.
59-60-2-PB
File : 59-60-2-PB.pdf
(264154 bytes)