共查询到19条相似文献,搜索用时 109 毫秒
1.
无线传感器网络中节点的能量是有限的,而且一般不能补充能量。所以如何最大化节点能量的利用率,延长整个传感器网络的生命周期,一直是无线传感器网络的一个研究热点。本文针对Leach路由算法的不足,提出一种新的基于能量考虑的梯度分簇路由算法。最后通过OMNET++仿真试验,来验证新的路由算法的优越性。 相似文献
2.
无线传感器网络中节点的能量是有限的,而且一般不能补充能量.所以如何最大化节点能量的利用率,延长整个传感器网络的生命周期,一直是无线传感器网络的一个研究热点.本文针对Leach路由算法的不足,提出一种新的基于能量考虑的梯度分簇路由算法.最后通过OMNET++仿真试验,来验证新的路由算法的优越性. 相似文献
3.
无线传感器网络中分簇算法能量有效性分析 总被引:1,自引:0,他引:1
该文针对无线传感器网络是一种能量受限的网络,首先说明根据节点数目以及分布区域特征,确定合理的成簇数目是分簇算法设计的核心;然后给出节点在通信中使用的能量模型,按照分簇的不同层数,分别对其成簇的数目进行理论上的优化分析,最后通过实验的方法验证优化的分簇算法能够满足能量有效性,对均匀节点能耗分布,提高网络生存时间有着重要作用。 相似文献
4.
5.
6.
7.
提出了一种基于贝叶斯博弈的无线传感器网络分簇算法.算法将无线传感器网络节点的簇头选择抽象为一个多人的博弈过程,节点之间通过不完全信息的静态博弈实现簇头的合理分布.算法在支付函数的设计时充分考虑了节点能耗和路径损耗等因素,因此通过博弈该算法能实现簇头的合理分布.仿真结果表明,算法在保证数据传输实时性的前提下可使网络能耗更加稳定、能量分布更加均匀,有效地延长网络生命周期. 相似文献
8.
针对传统的最小跳路由无线传感器网络(WSN)在数据汇聚上较高的能量开销问题,提出了一种基于无人机(UAV)数据收集的动态分簇算法,其主要思想是利用节点剩余能量来确定那些节点可以当选簇首,同时利用节点坐标位置和设定地分簇半径来划分簇的大小。该算法的优势是能最大程度地均衡每个传感器节点的能量,使整体的节点剩余的能量维持在同一水平。为了提高数据收集的效率,采用蚁群算法规划了无人机数据收集的最短路径。仿真结果表明,与相同的分簇算法下传统的最小跳路由无线传感器网络相比,所提出的基于无人机的无线传感器网络(UAV-WSN)在能量利用率和生命周期方面分别提升了15%和25%,并且以上两种网络的能量利用率高达70%。 相似文献
9.
10.
11.
无线传感器网络分簇算法分析与性能比较 总被引:1,自引:2,他引:1
文中在介绍无线传感器网络路由协议的基础上,重点分析了几种有代表性的分簇路由协议算法。然后对各种分簇算法从10个评价参数上进行了一个综合对比,总结了无线传感器网络现有分簇路由协议的优点和存在的问题。最后从网络安全性和协议的实用性等方面,并对无线传感器网络分簇路由协议算法进行了展望。 相似文献
12.
Jian-hua Huang Zi-ming Zhao Yu-bo Yuan Ya-dong Hong 《Wireless Personal Communications》2017,95(3):2127-2142
One of important issues in wireless sensor networks is how to effectively use the limited node energy to prolong the lifetime of the networks. Clustering is a promising approach in wireless sensor networks, which can increase the network lifetime and scalability. However, in existing clustering algorithms, too heavy burden of cluster heads may lead to rapid death of the sensor nodes. The location of function nodes and the number of the neighbor nodes are also not carefully considered during clustering. In this paper, a multi-factor and distributed clustering routing protocol MFDCRP based on communication nodes is proposed by combining cluster-based routing protocol and multi-hop transmission. Communication nodes are introduced to relay the multi-hop transmission and elect cluster heads in order to ease the overload of cluster heads. The protocol optimizes the election of cluster nodes by combining various factors such as the residual energy of nodes, the distance between cluster heads and the base station, and the number of the neighbor nodes. The local optimal path construction algorithm for multi-hop transmission is also improved. Simulation results show that MFDCRP can effectively save the energy of sensor nodes, balance the network energy distribution, and greatly prolong the network lifetime, compared with the existing protocols. 相似文献
13.
Adaptive Online Sensor Clustering and Routing Algorithms for QoS Provisioning and Energy Efficiency 总被引:1,自引:1,他引:0
Sungwook Kim 《Wireless Personal Communications》2012,63(4):965-975
Due to the limited energy supply, energy efficiency is the most important issue for wireless sensor networks. In addition,
next generation networks are also expected to support QoS sensitive data services. In this paper, a new online sensor network
management scheme is developed for energy efficiency and QoS provisioning. To satisfy these conflicting requirements, the
proposed scheme consists of clustering and routing algorithms. Without global network information, the online control paradigm
is realized in a distributed way. Therefore, the principle contributions of these algorithms are its scalability and responsiveness
to current network situations. Simulation results indicate the superior performance of the proposed schemes, while other schemes
cannot offer such an attractive performance balance. 相似文献
14.
Clustering of nodes is often used in wireless sensor networks to achieve data aggregation and reduce the number of nodes transmitting the data to the sink. This paper proposes a novel dual head static clustering algorithm (DHSCA) to equalise energy consumption by the sensor nodes and increase the wireless sensor network lifetime. Nodes are divided into static clusters based on their location to avoid the overhead of cluster re-formation in dynamic clustering. Two nodes in each cluster, selected on the basis of the their residual energy and their distance from the sink and other nodes in the cluster, are designated as cluster heads, one for data aggregation and the other for data transmission. This reduces energy consumption during intra-cluster and inter-cluster communication. A multi-hop technique avoiding the hot-spot problem is used to transmit the data to the sink. Experiments to observe the energy consumption patterns of the nodes and the fraction of packets successfully delivered using the DHSCA suggest improvements in energy consumption equalisation, which, in turn, enhances the lifetime of the network. The algorithm is shown to outperform all the other static clustering algorithms, while being comparable with the performance of the best dynamic algorithm. 相似文献
15.
Wireless sensor networks are composed of energy constrained nodes embedding limited transmission, processing and sensing capabilities. The main research efforts in this area sought to prolong the network lifetime by reducing energy consumption of network operations. Data gathering mechanisms such as clustering have been shown to achieve significant energy savings. However, such benefits can be obtained only if neighboring clusters operate on different frequencies (channels). As the salient characteristics of wireless sensor networks favor a distributed approach, we analyze the performance of several distributed frequency assignment algorithms with a focus on energy consumption. In this context, we find that a heuristic may achieve better results than backtracking-based algorithms. 相似文献
16.
Sungryoul Lee Han Choe Byoungchang Park Yukyoung Song Chong-kwon Kim 《Wireless Personal Communications》2011,56(4):715-731
Over the last several years, various clustering algorithms for wireless sensor networks have been proposed to prolong network lifetime. Most clustering algorithms provide an equal cluster size using node??s ID, degree and etc. However, many of these algorithms heuristically determine the cluster size, even though the cluster size significantly affects the energy consumption of the entire network. In this paper, we present a theoretical model and propose a simple clustering algorithm called Location-based Unequal Clustering Algorithm (LUCA), where each cluster has a different cluster size based on its location information which is the distance between a cluster head and a sink. In LUCA, in order to minimize the energy consumption of entire network, a cluster has a larger cluster size as increasing distance from the sink. Simulation results show that LUCA achieves better performance than conventional equal clustering algorithm for energy efficiency. 相似文献
17.
Energy conservation of the sensor nodes is the most important issue that has been studied extensively in the design of wireless sensor networks (WSNs). In many applications, the nodes closer to the sink are overburdened with huge traffic load as the data from the entire region are forwarded through them to reach the sink. As a result, their energy gets exhausted quickly and the network is partitioned. This is commonly known as hot spot problem. Moreover, sensor nodes are prone to failure due to several factors such as environmental hazards, battery exhaustion, hardware damage and so on. However, failure of cluster heads (CHs) in a two tire WSN is more perilous. Therefore, apart from energy efficiency, any clustering or routing algorithm has to cope with fault tolerance of CHs. In this paper, we address the hot spot problem and propose grid based clustering and routing algorithms, combinedly called GFTCRA (grid based fault tolerant clustering and routing algorithms) which takes care the failure of the CHs. The algorithms follow distributed approach. We also present a distributed run time management for all member sensor nodes of any cluster in case of failure of their CHs. The routing algorithm is also shown to tolerate the sudden failure of the CHs. The algorithms are tested through simulation with various scenarios of WSN and the simulation results show that the proposed method performs better than two other grid based algorithms in terms of network lifetime, energy consumption and number of dead sensor nodes. 相似文献
18.
Routing protocol plays a role of great importance in the performance of wireless sensor networks (WSNs). A centralized balance clustering routing protocol based on location is proposed for WSN with random distribution in this paper. In order to keep clustering balanced through the whole lifetime of the network and adapt to the non-uniform distribution of sensor nodes, we design a systemic algorithm for clustering. First, the algorithm determines the cluster number according to condition of the network, and adjusts the hexagonal clustering results to balance the number of nodes of each cluster. Second, it selects cluster heads in each cluster base on the energy and distribution of nodes, and optimizes the clustering results to minimize energy consumption. Finally, it allocates suitable time slots for transmission to avoid collision. Simulation results demonstrate that the proposed protocol can balance the energy consumption and improve the network throughput and lifetime significantly. 相似文献
19.
Sensor networks comprise of sensor nodes with limited battery power that are deployed at different geographical locations to monitor physical events. Information gathering is a typical but an important operation in many applications of wireless sensor networks (WSNs). It is necessary to operate the sensor network for longer period of time in an energy efficient manner for gathering information. One of the popular WSN protocol, named low energy adaptive clustering hierarchy (LEACH) and its variants, aim to prolong the network lifetime using energy efficient clustering approach. These protocols increase the network lifetime at the expense of reduced stability period (the time span before the first node dies). The reduction in stability period is because of the high energy variance of nodes. Stability period is an essential aspect to preserve coverage properties of the network. Higher is the stability period, more reliable is the network. Higher energy variance of nodes leads to load unbalancing among nodes and therefore lowers the stability period. Hence, it is perpetually attractive to design clustering algorithms that provides higher stability, lower energy variance and are energy efficient. In this paper to overcome the shortcomings of existing clustering protocols, a protocol named stable energy efficient clustering protocol is proposed. It balances the load among nodes using energy-aware heuristics and hence ensures higher stability period. The results demonstrate that the proposed protocol significantly outperforms LEACH and its variants in terms of energy variance and stability period. 相似文献