New Clustering Schemes for Wireless Sensor Networks
نویسنده:
, , , , , ,سال
: 2010
چکیده: In this paper, two clustering algorithms are proposed. In the first one, we
investigate a clustering protocol for single hop wireless sensor networks that employs a
competitive scheme for cluster head selection. The proposed algorithm is named EECSM
that is a modified version to the well known protocol EECS where some of the nodes
become volunteers to be cluster heads with an equal probability. In the competition
phase in contrast to EECS using a fixed competition range for any volunteer node, we
assign a variable competition range to it that is related to its distance to base station. The
volunteer nodes compete in their competition ranges and every one with more residual
energy would become cluster head. In the second one, we develop a clustering protocol
for single hop wireless sensor networks. In the proposed algorithm some of the nodes
become volunteers to be cluster heads. We develop a time based competitive clustering
algorithm that the advertising time is based on the volunteer node’s residual energy. We
assign to every volunteer node a competition range that may be fixed or variable as a
function of distance to BS. The volunteer nodes compete in their competition ranges and
every one with more energy would become cluster head. In both proposed algorithms,
our objective is to balance the energy consumption of the cluster heads all over the
network. Simulation results show the more balanced energy consumption and longer
investigate a clustering protocol for single hop wireless sensor networks that employs a
competitive scheme for cluster head selection. The proposed algorithm is named EECSM
that is a modified version to the well known protocol EECS where some of the nodes
become volunteers to be cluster heads with an equal probability. In the competition
phase in contrast to EECS using a fixed competition range for any volunteer node, we
assign a variable competition range to it that is related to its distance to base station. The
volunteer nodes compete in their competition ranges and every one with more residual
energy would become cluster head. In the second one, we develop a clustering protocol
for single hop wireless sensor networks. In the proposed algorithm some of the nodes
become volunteers to be cluster heads. We develop a time based competitive clustering
algorithm that the advertising time is based on the volunteer node’s residual energy. We
assign to every volunteer node a competition range that may be fixed or variable as a
function of distance to BS. The volunteer nodes compete in their competition ranges and
every one with more energy would become cluster head. In both proposed algorithms,
our objective is to balance the energy consumption of the cluster heads all over the
network. Simulation results show the more balanced energy consumption and longer
کلیدواژه(گان): wireless sensor networks,clustering,residual energy,balanced energy,
single hop
کالکشن
:
-
آمار بازدید
New Clustering Schemes for Wireless Sensor Networks
Show full item record
contributor author | سید مجید مزینانی | en |
contributor author | J. CHITIZADEH | en |
contributor author | محمدحسین یغمائی مقدم | en |
contributor author | M.T.Honary | en |
contributor author | F. TASHTARIAN | en |
contributor author | Sayyed Majid Mazinani | fa |
contributor author | Mohammad Hossein Yaghmaee Moghaddam | fa |
date accessioned | 2020-06-06T13:33:01Z | |
date available | 2020-06-06T13:33:01Z | |
date issued | 2010 | |
identifier uri | http://libsearch.um.ac.ir:80/fum/handle/fum/3359449 | |
description abstract | In this paper, two clustering algorithms are proposed. In the first one, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECSM that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability. In the competition phase in contrast to EECS using a fixed competition range for any volunteer node, we assign a variable competition range to it that is related to its distance to base station. The volunteer nodes compete in their competition ranges and every one with more residual energy would become cluster head. In the second one, we develop a clustering protocol for single hop wireless sensor networks. In the proposed algorithm some of the nodes become volunteers to be cluster heads. We develop a time based competitive clustering algorithm that the advertising time is based on the volunteer node’s residual energy. We assign to every volunteer node a competition range that may be fixed or variable as a function of distance to BS. The volunteer nodes compete in their competition ranges and every one with more energy would become cluster head. In both proposed algorithms, our objective is to balance the energy consumption of the cluster heads all over the network. Simulation results show the more balanced energy consumption and longer | en |
language | English | |
title | New Clustering Schemes for Wireless Sensor Networks | en |
type | Journal Paper | |
contenttype | External Fulltext | |
subject keywords | wireless sensor networks | en |
subject keywords | clustering | en |
subject keywords | residual energy | en |
subject keywords | balanced energy | en |
subject keywords | single hop | en |
journal title | IIUM Engineering Journal | fa |
pages | 51-69 | |
journal volume | 11 | |
journal issue | 1 | |
identifier link | https://profdoc.um.ac.ir/paper-abstract-1060582.html | |
identifier articleid | 1060582 |