文件名称:ESCAL_An_Energy_Saving_Clustering_Algorithm_Based
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:84.36kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
Abstract—the application of wireless sensor network (WSN) is always restricted by the energy shortage of sensor nodes. In order to reduce the entire energy consumption of the WSN, a promising approach is to design light clustering algorithms.LEACH is such a well-known clustering algorithm that was designed to distribute the energy consumption to nodes in the WSN evenly. LEACH is characterized by its attactive clusterbased strategy however, in the algorithm, energy dissipation of
entire network is still great during the process that cluster-heads (CH) transmit data to base station (BS). In this paper, based on
LEACH, we propose a modified clustering orithm which is named ESCAL. In ESCAL, CHs won’t communicate with BS directly, but transfer aggregated data to the nearest node in term
of received signal strength then this elected nearest node willcompress and forward the data to BS.-Abstract—the application of wireless sensor network (WSN) is always restricted by the energy shortage of sensor nodes. In order to reduce the entire energy consumption of the WSN, a promising approach is to design light clustering algorithms.LEACH is such a well-known clustering algorithm that was designed to distribute the energy consumption to nodes in the WSN evenly. LEACH is characterized by its attactive clusterbased strategy however, in the algorithm, energy dissipation of
entire network is still great during the process that cluster-heads (CH) transmit data to base station (BS). In this paper, based on
LEACH, we propose a modified clustering orithm which is named ESCAL. In ESCAL, CHs won’t communicate with BS directly, but transfer aggregated data to the nearest node in term
of received signal strength then this elected nearest node willcompress and forward the data to BS.
entire network is still great during the process that cluster-heads (CH) transmit data to base station (BS). In this paper, based on
LEACH, we propose a modified clustering orithm which is named ESCAL. In ESCAL, CHs won’t communicate with BS directly, but transfer aggregated data to the nearest node in term
of received signal strength then this elected nearest node willcompress and forward the data to BS.-Abstract—the application of wireless sensor network (WSN) is always restricted by the energy shortage of sensor nodes. In order to reduce the entire energy consumption of the WSN, a promising approach is to design light clustering algorithms.LEACH is such a well-known clustering algorithm that was designed to distribute the energy consumption to nodes in the WSN evenly. LEACH is characterized by its attactive clusterbased strategy however, in the algorithm, energy dissipation of
entire network is still great during the process that cluster-heads (CH) transmit data to base station (BS). In this paper, based on
LEACH, we propose a modified clustering orithm which is named ESCAL. In ESCAL, CHs won’t communicate with BS directly, but transfer aggregated data to the nearest node in term
of received signal strength then this elected nearest node willcompress and forward the data to BS.
相关搜索: leach wsn
Sensor data clustering
clustering in sensor node
WSN clustering algorithm
leach energy
LEACH-C
(系统自动生成,下载前可以参看下载内容)
下载文件列表
ESCAL_An_Energy_Saving_Clustering_Algorithm_Based_on_LEACH_2008.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.