共查询到18条相似文献,搜索用时 62 毫秒
1.
2.
3.
无线传感器网络能量均衡路由算法 总被引:5,自引:3,他引:2
设计了一种能量均衡的路由算法.路由的建立分两个阶段,在簇头建立阶段,让候选节点在覆盖范围内以剩余能量的多少和所处位置为标准来竞选簇头,以使簇头分布均匀,平衡网络覆盖;在通信阶段,根据簇头节点的剩余能量大小和其距离基站的远近,采用多跳的簇间通信方式建立路由,以此来降低簇头节点的通信负载.仿真结果表明该算法能够有效降低网络能耗和延长网络生存时间. 相似文献
4.
5.
6.
针对LEACH协议存在的3大问题:簇头选举时未考虑节点剩余能量、频繁成簇造成了大量额外能耗以及欠缺对簇间能耗均衡的考虑,提出了能量有效分簇路由协议(LEACH-improved).该协议中,首轮成簇后网络中簇的分布和数量将保持不变,以后每轮各簇的簇头由上一轮簇头结合节点的能量水平来指定,借鉴泛洪算法的思想,在簇间建立多... 相似文献
7.
传统的机会泛洪算法在低占空比无线传感器网络中,容易造成"瓶颈"节点转发大量数据而导致自身能量消耗过快,加速死亡,从而造成网络分割.针对该算法存在的缺陷,新算法在选择发送节点时,充分考虑到了节点的剩余能量和节点间通信链路的质量,达到了节点能量均衡的效果,解决了网络中瓶颈节点因负载过大而过早死亡的问题.通过仿真实验表明,在保证了较低端到端时延和较高投递率的前提下,新算法有效地延长了网络的生命期和增强了网络可靠性. 相似文献
8.
无线传感器网络在探测目标源时会碰到处理能力不足和能量缺乏的问题。为了克服这些问题,该文提出了基于能量均衡的自适应压缩感知算法。与传统自适应压缩感知算法不同,所提出的算法在选择观测向量时不仅考虑了重构性能,还考虑了节点的能量均衡,防止某些节点过快消耗能量而导致整体网络结构的破坏。同时为了适应不同应用场景的需求,将自适应压缩感知算法和能量均衡压缩感知算法相结合,通过门限值的选择达到灵活配置的目的。仿真实验的结果表明,该文所提出的算法能够有效延长网络生存时间,同时能够实现能耗和收敛性的兼顾。 相似文献
9.
在无线传感器网络环境中,用户经常提交的查询是时空查询,如“获得区域A在某个给定时间段内的感知数据”.由于传感器节点能量十分有限,因此,能量高效的时空查询处理是目前亟需解决的问题.首先指出了现有的时空查询处理算法能量消耗大的原因在于查询协调节点选择不合理.然后给出了理论上最优的查询协调节点的位置及其证明,并基于该理论提出了一类能量高效的传感器网络时空查询算法ECSTA.最后通过实验分析了节点密度和查询区域大小对算法能量消耗的影响.理论和实验结果表明ECSTA算法优于现有的STWin框架下的算法. 相似文献
10.
构建底层逻辑树能有效降低集中式top-k查询带来的巨大通信开销,针对现有逻辑树都以固定汇聚节点为根节点,导致其附近节点能耗太大、过早死亡的问题,本文在无固定汇聚节点的网络背景下,基于连通支配集,提出一种能耗均衡的top-k查询最优支撑树构建方法,综合节点能量、度数以及与邻节点通信开销,选取能量代价小的作为支配节点负责查询中间数据处理,在每次查询中,节点基于地理位置ID轮流作为根节点,有效均衡节点的能耗.仿真实验表明,与其他逻辑拓扑树相比,基于最优支撑树的top-k查询具有相近的查询时间,但其平均每轮查询能耗更小,多次查询后各节点能耗达到均衡,有效延长了网络生命周期. 相似文献
11.
In wireless sensor networks, query execution over a specific geographical region is an essential function for collecting sensed
data. However, sensor nodes deployed in sensor networks have limited battery power. Hence, the minimum number of connected
sensor nodes that covers the queried region in a sensor network must be determined. This paper proposes an efficient distributed
protocol to find a subset of connected sensor nodes to cover the queried region. Each node determines whether to be a sensing node to sense the queried region according to its priority. The proposed protocol can efficiently construct a subset of connected
sensing nodes and respond the query request to the sink node. In addition, the proposed protocol is extended to solve the k-coverage request. Simulation results show that our protocol is more efficient and has a lower communication overhead than
the existing protocol. 相似文献
12.
The smart grid has caught great attentions in recent years, which is poised to transform a centralized, producer-controlled network to a decentralized, consumer- interactive network that's supported by fine-grained monitoring. Large-scale WSNs (Wireless Sensor Networks) have been considered one of the very promising technologies to support the implementation of smart grid. WSNs are applied in almost every aspect of smart grid, including power generation, power transmission, power distribution, power utilization and power dispatch, and the data query processing of 'WSNs in power grid' become an hotspot issue due to the amount of data of power grid is very large and the requirement of response time is very high. To meet the demands, top-k query processing is a good choice, which performs the cooperative query by aggregating the database objects' degree of match for each different query predicate and returning the best k matching objects. In this paper, a framework that can effectively apply top-k query to wireless sensor network in smart grid is proposed, which is based on the cluster-topology sensor network. In the new method, local indices are used to optimize the necessary query routing and process intermediate results inside the cluster to cut down the data traffic, and the hierarchical join query is executed based on the local results.Besides, top-k query results are verified by the clean-up process, and two schemes are taken to deal with the problem of node's dynamicity, which further reduce communication cost. Case studies and experimental results show that our algorithm has outperformed the current existing one with higher quality results and better efficiently. 相似文献
13.
14.
15.
基于Contact的资源查询机制是依据小世界理论提出来的,该机制要求网络中各个节点不仅维护R跳以内的“邻居”节点的资源状态,而且还选择维护少数较远节点(Contact)的状态。Contact大大降低了查询源与目标的“分离度”。论文提出的SMQM查询机制在CARD和TRANSFER的研究成果基础上,对于Contact的选择方法进行了重要的改进。SMQM性能的仿真试验结论说明,SMQM查询机制的性能优于CARD协议。SMQM查询机制着眼于寻找“可行”的路径,而不是最“优”路径,由此降低了路径建立开销、单次查询的总能耗,提高了网络的生命周期。 相似文献
16.
Dajin Wang 《International Journal of Wireless Information Networks》2008,15(2):61-71
We study the problem of assigning clusterheads in a hierarchical Wireless Sensor Network (WSN). That is, for a given hierarchical
WSN, how many clusterhead nodes we should assign, and how to geographically allocate these clusterheads. Since an assignment
scheme optimizing all factors is impossible, we will focus on the crucial issue of energy efficiency of the WSN. Because it
is mostly true that the nodes of WSN are powered by batteries, power saving is an especially important consideration in WSN
architecture design. We will propose a hierarchical WSN architecture toward the end of saving energy of both sensor nodes
and clusterheads. Using analytical result, experiments are conducted in which realistic scenarios are simulated.
相似文献
Dajin WangEmail: |
17.
在两层传感器网络中,查询驱动模式是将查询请求在下层传感器网络层进行分布式处理的一种查询处理模式.在传感器节点产生数据的频率较高而用户发出查询请求的频率较低的情况下,查询驱动模式能够大大减少数据传输量,降低节点的能量消耗.在这种模式下,如何有效支持局部区域性Top-k查询是一个很有挑战性的问题.针对这一问题,本文首先构造了一种新的数据汇聚树(DAT),接着在DAT的基础上提出了一种支持区域性Top-k查询的数据汇聚方案.理论分析和仿真实验表明,与已有算法相比,本文提出的方案更加高效. 相似文献