HEED算法：节能分布式分簇协议优化传感器网络

分簇算法

HEED

5星 · 超过95%的资源需积分: 48 6 浏览量更新于2024-07-29 4 收藏 224KB PDF 举报

身份认证购VIP最低享 7 折!

领优惠券(最高得80元）

资源详情

资源推荐

1) Clustering is completely distributed. Each node independently makes its decisions based only on

local information.

2) Clustering terminates within a ﬁxed number of iterations (regardless of network diameter).

3) At the end of each T

, each node is either a cluster head, or not a cluster head (which we refer

to as a regular node) that belongs to exactly one cluster.

4) Clustering should be efﬁcient in terms of processing complexity and message exchange.

5) Cluster heads are well-distributed over the sensor ﬁeld, and have relatively high average residual

energy compared to regular nodes.

III. T

HE HEED PROTOCOL

In this section, we describe the HEED protocol. First, we deﬁne the parameters used in the clustering

process. Second, we present the protocol design and pseudo-code. Finally, we prove that the protocol

meets its requirements.

A. Clustering Parameters

The overarching goal of our approach is to prolong network lifetime. For this reason, cluster head

selection is primarily based on the residual energy of each node. Measuring this residual energy is not

necessary, since the energy consumed per bit for sensing, processing, and communication is typically

known, and hence residual energy can be estimated. To increase energy efﬁciency and further prolong

network lifetime, we also consider intra-cluster “communication cost” as a secondary clustering parameter.

For example, cost can be a function of neighbor proximity or cluster density.

We use the primary clustering parameter to probabilistically select an initial set of cluster heads, and

the secondary parameter to “break ties” among them. A tie in this context means that a node falls within

the “range” of more than one cluster head. To understand what “range” denotes in this case, observe that

a node typically has a number (e.g., 6) of discrete transmission power levels. Thus, the cluster range

or radius is determined by the transmission power level used for intra-cluster announcements and during

clustering. We refer to this level as the cluster power level. The cluster power level should be set to one of

the lower power levels of a node, to increase spatial reuse, and reserve higher power levels for inter-cluster

communication. These higher power levels should cover at least two or more cluster diameters to guarantee

that the resulting inter-cluster overlay will be connected. If this condition cannot be satisﬁed, then our

approach for clustering in conjunction with power level selection is inapplicable. We analyze inter-cluster

connectivity conditions in Section III-D. The cluster power level dictates the number of clusters in our

network. It is non-trivial to determine an optimal cluster power level, because network topology changes

due to node failures and energy depletion.

The secondary clustering parameter, intra-cluster communication cost, is a function of (i) cluster

properties, such as cluster size, and (ii) whether or not variable power levels are permissible for intra-

cluster communication. If the power level used for intra-cluster communication is ﬁxed for all nodes,

then the cost can be proportional to (i) node degree, if the requirement is to distribute load among cluster

heads, or (ii)

node degree

, if the requirement is to create dense clusters. This means that a node joins the

cluster head with minimum degree to distribute cluster head load (possibly at the expense of increased

interference and reduced spatial reuse), or joins the one with maximum degree to create dense clusters.

We use the terms minimum degree cost and maximum degree cost to denote these cost types. Observe that

inter-cluster communication is not incorporated in the cost function since local information is insufﬁcient

in this case.

Now consider the case when variable power levels are allowed for intra-cluster communication. Let

MinPwr

denote the minimum power level required by a node v

, 1 ≤ i ≤ M, to communicate with a

cluster head u, where M is the number of nodes within the cluster range. We deﬁne the average minimum

reachability power (AMRP) as the mean of the minimum power levels required by all M nodes within the

cluster range to reach u, i.e., AMRP =

i=1

MinPwr

. If each node is allowed to select the appropriate

power level to reach its cluster head, then AMRP provides a good estimate of the communication cost.

The AMRP of a node is a measure of the expected intra-cluster communication energy consumption if

this node becomes a cluster head. Using AMRP as cost in selecting cluster heads is superior to just

剩余35页未读，继续阅读

zhangying198729

粉丝: 1
资源: 3

HEED算法：节能分布式分簇协议优化传感器网络

无线传感器网络HEED论文

HEED协议的matlab源代码

几种分簇算法

HEED算法选举出来的簇首是不是在其簇的中心

heed算法的matlab仿真

leach和heed算法仿真对比matlab

leach,heed算法matlab仿真

基于LEACH和蚁群算法的协议有哪些

heed分簇未定义函数或变量 'entran'。

分簇拓扑控制算法的发展历程

WSN有网络管理协议吗

7. 传感器网络的主要仿真软件有哪些？试说明其主要工作原理，并对其进行对比分析。

用Verilog设计并实现一个31阶的FIR滤波器。

HEED、LEACH以及一种基于地理位置的非均匀分簇算法实现

无线传感器网络中改进的HEED分簇算法 (2012年)

Heed分簇算法的仿真

WSN路由分布式算法 与HEED对比 Distributed Minimum-Cost Clustering Protocol for UnderWater Sensor Networks (UWSNs)

MATLAB版的leach 及heed协议源代码

matlab分簇算法对比

heed 仿真程序基于matlab

最新资源

WSN路由分布式算法与HEED对比 Distributed Minimum-Cost Clustering Protocol for UnderWater Sensor Networks (UWSNs)