共查询到20条相似文献,搜索用时 15 毫秒
1.
针对附加QoS需求的无线传感器网络,给出一种满足生命期和干扰服务要求的无线传感器网络无标度容错拓扑控制算法(scale-free fault-tolerance topology supporting quality of service,简称QoS-SFT).通过分析无标度拓扑的度分布属性与其生命期和干扰性能的关联关系,量化出生命期和干扰联合优化的无标度拓扑度分布表达式,进而以无标度拓扑的度分布表达式为设计目标,采用偏好依附规则实现QoS-SFT算法设计,形成能够满足生命期和干扰联合优化要求的容错拓扑.理论分析和仿真结果表明,QoS-SFT算法不仅能够保证无标度拓扑的强容错性,还有效提升了无标度拓扑的生命期和干扰性能. 相似文献
2.
无线传感器网络的拓扑控制算法综述 总被引:2,自引:1,他引:1
无线传感器网络的首要设计目标即延长网络生命期,而网络拓扑作为路由层协议和MAC层协议的重要平台,对其进行控制是实现这一目标的支撑基础.本文总结和分析了传感器网络领域已有的拓扑控制方面的研究成果,阐述了多种受研究者关注较多的典型拓扑控制算法,并指出其中有待解决的问题,进而归结了拓扑控制算法设计中需考虑的因素,随后针对功率控制和分簇控制分别设计了两种算法模型,最后探讨了今后应研究的问题,指明了下一步研究中的重点和难点. 相似文献
3.
无线传感网络是物联网的核心技术,其由部署在监测区域内大量的廉价微型传感器节点组成.节点除了感测特定的对象,还需要维持互相之间的网络连接.在传感器节点能量受限制情况下,良好的网络拓扑控制方法能够提升传感器网络的生存时间.因此合理地控制网络拓扑结构是当前无线传感器网络研究领域的热点和难点.提出了一种无线传感器网络分簇拓扑容错算法,利用主从簇头方式分摊簇头能量消耗,并采用候选簇头机制解决簇头失败.仿真实验证明该算法不仅具有较低的复杂度和较低的节点平均通信半径,而且具有较好的容错性能和较长的网络生命周期,可显著提高物联网的整体性能. 相似文献
4.
无线传感器网络的拓扑控制 总被引:32,自引:0,他引:32
拓扑控制是无线传感器网络研究中的核心问题之一.拓扑控制对于延长网络的生存时间、减小通信干扰、提高MAC(media access control)协议和路由协议的效率等具有重要意义.全面阐述了拓扑控制技术的研究进展,首先明确了拓扑控制研究的问题和设计目标,然后分别从功率控制和睡眠调度两个方面介绍代表性的研究工作,并加以分析和比较,同时指出了这些工作存在的不足.最后分析和总结了研究现状中存在的问题、需要进一步研究的内容以及拓扑控制研究的发展趋势. 相似文献
5.
6.
7.
无线传感器网络聚类算法研究 总被引:3,自引:0,他引:3
要在自组织无线传感器网络领域,由于受到能源以及带宽等资源的限制,使得网络的分解成为研究工作者面临的一项挑战性课题。该文就如何有效地将网络进行分解以提高网络自组织的效率进行了探讨,提出了一种新的基于预算的网络分解方案,并给出了两种算法实现。对比原有的扩展广播算法,在分解网络进而产生一定大小的聚类时,新算法的信息复杂度大大降低。 相似文献
8.
Game-Theoretic Modeling of Joint Topology Control and Power Scheduling for Wireless Heterogeneous Sensor Networks 总被引:1,自引:0,他引:1
Hongliang Ren Meng M.Q.-H. 《Automation Science and Engineering, IEEE Transactions on》2009,6(4):610-625
Wireless Heterogeneous Sensor Network (WHSN) facilitates ubiquitous information acquisition for Ambient Intelligence (AmI) systems. It is of great importance of power management and topology control for WHSN to achieve desirable network performances, such as clustering properties, connectivity and power efficiency. This paper proposes a game theoretic model of topology control to analyze the decentralized interactions among heterogeneous sensors. We study the utility function for nodes to achieve desirable frame success rate and node degree, while minimizing the power consumption. Specifically, we propose a static complete-information game formulation for power scheduling and then prove the existence of the Nash equilibrium with simultaneous move. Because the heterogeneous sensors typically react to neighboring environment based on local information and the states of sensors are evolving over time, the power-scheduling problem in WHSN is further formulated into a more realistic incomplete-information dynamic game model with sequential move. We then analyze the separating equilibrium, one of the perfect Bayesian equilibriums resulted from the dynamic game, with the sensors revealing their operational states from their actions. The sufficient and necessary conditions for the existence of separating equilibrium are derived for the dynamic Bayesian game, which provide theoretical basis to the proposed power scheduling algorithms, NEPow and BEPow. The primary contributions of this paper include applying game theory to analyze the distributed decision-making process of individual sensor nodes and to analyze the desirable utilities of heterogeneous sensor nodes. Simulations are presented to validate the proposed algorithms and the results show their ability of maintaining reliable connectivity, reducing power consumption, while achieving desirable network performances. 相似文献
9.
How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks (HWSN). In this paper, a clustering-tree topology control algorithm based on the energy forecast (CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round (the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function (including the energy, link quality and packet loss rate) and their distance. The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several noncluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy (LEACH), energy dissipation forecast and clustering management (EDFCM) and efficient and dynamic clustering scheme (EDCS) protocols, CTEF has longer network lifetime and receives more data packets at base station. 相似文献
10.
无线传感器网络人员定位算法 总被引:1,自引:0,他引:1
无线传感器网络用于人员定位给煤矿安全生产提供了有效保障。根据定位机制不同,无线传感器网络节点定位算法分为Range-based和Range-free定位算法,其中Range-based定位算法因定位精度高、误差小而在煤矿矿井中得到广泛应用。在阐述比较RSSI测距法等7种典型测距方法的基础上,分析了三边测量法等5种定位算法,指出了在选择或设计人员定位算法时应综合考虑矿井具体环境状况和特定的应用需求。 相似文献
11.
12.
无线传感器网络的拓扑控制机制 总被引:2,自引:0,他引:2
传感器网络节点是低功耗低价格微型嵌入式设备,其能量供应和无线通信带宽十分受限。无线传感器网络的拓扑控制用来控制能量高效的合理网络结构的形成,对通信机制、数据融合和时间同步等有重要影响,是无线传感器网络底层关键支撑技术之一。本文从节点功率控制、层次型拓扑形成和网内协同启发机制三个方面,详细介绍和分析了已有典型的拓扑控制算法,并对拓扑控制的研究热点和发展趋势做了总结。 相似文献
13.
Liu Yunhuai Zhang Qian Ni Lionel 《Parallel and Distributed Systems, IEEE Transactions on》2010,21(3):405-416
Topology control is an effective method to improve the energy efficiency of wireless sensor networks (WSNs). Traditional approaches are based on the assumption that a pair of nodes is either "connected” or "disconnected.” These approaches are called connectivity-based topology control. In real environments, however, there are many intermittently connected wireless links called lossy links. Taking a succeeded lossy link as an advantage, we are able to construct more energy-efficient topologies. Toward this end, we propose a novel opportunity-based topology control. We show that opportunity-based topology control is a problem of NP-hard. To address this problem in a practical way, we design a fully distributed algorithm called CONREAP based on reliability theory. We prove that CONREAP has a guaranteed performance. The worst running time is O(vert Evert ), where E is the link set of the original topology, and the space requirement for individual nodes is O(d), where d is the node degree. To evaluate the performance of CONREAP, we design and implement a prototype system consisting of 50 Berkeley Mica2 motes. We also conducted comprehensive simulations. Experimental results show that compared with the connectivity-based topology control algorithms, CONREAP can improve the energy efficiency of a network up to six times. 相似文献
14.
15.
随着无线传感器网络的广泛应用,传感器节点的部署环境也更加复杂,网络性能受到很大影响,通过优化拓扑结构,最大化利用节点有限资源成为拓扑控制研究的重要内容,网络拓扑控制在延长网络生命周期、节约节点资源、降低网络干扰等方面发挥着重要的作用,它能够提高路由协议和MAC协议的效率,为数据融合、时间同步和目标定位等很多方面提供基础。设计实现一种高效的拓扑控制机制已成为无线传感器网络的研究重点,该文中主要是针对现有的部分拓扑控制算法进行了分析和比较。 相似文献
16.
在无线传感器网络的拓扑控制问题中,保持节点能耗最低路径和低节点度之间存在一种平衡.最佳的平衡点与具体的应用和网络状态有关.文中提出一种新的拓扑控制算法,使所构造的拓扑能在这两个不一致的目标之间进行调节.该算法所构造的拓扑结构在一极能保持所有能耗最低路径,另一极能使平均节点度逼近理论最小值.仿真结果证实新算法在比已有方案更真实的能量消耗模型下可以保持所有能耗最低路径,同时也显示新算法对节点度有更大的调节范围. 相似文献
17.
一种无线传感器网络中事件区域检测的容错算法 总被引:2,自引:0,他引:2
特殊环境中的事件区域检测是无线传感器网络的一种重要应用.由于传感器的错误会导致事件区域检测的不准确,所以相关的容错算法成为近年来的研究热点.已有研究工作都仅考虑了事件的空间相关性,通过相邻传感器之间的数据交换实现容错.文中从事件的空间相关性和时间相关性入手,提出了一种以局部检测为主的分布式事件区域检测算法.该算法通过检验传感器本地采样值构成的时间序列与事件随机过程统计特征的符合程度实现容错.算法分析的结果表明,该算法可以减少传感器之间的数据交换,从而有效地利用传感器的能量.模拟实验表明,当有10%的传感器发生错误时,该算法可以检测到93%的事件区域和88%的错误传感器. 相似文献
18.
19.
20.
无线传感器网络(WSN)的分簇机制具有很多优点,在仔细分析LEACH等算法的基础上,提出了一种新的分簇方法,命名为最低能量保护算法。仿真结果证明,该算法能充分保护能量最小的点,使第一个死亡节点(FND)的出现时间大大向后拖延,延长了整个网络的生存时间。 相似文献