共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
路由设计是认知无线传感网络(CRSNs)中目前受到较少关注却很重要的一个领域。在CRSN中,由于主用户(PUs)对可用信道资源的随机占用行为,路由算法的设计不仅需要考虑如何延长网络寿命,还要考虑网络内数据传输的可靠性。本文研究了具有频谱可感知特性,且对能量消耗敏感的 CRSN路由问题,揭示了 CRSN路由问题的独特性,并将这类问题表述为在能量约束和变化的网络拓扑环境下的网络寿命优化问题。在回顾传感器网络的典型算法之后,提出一种新的路由度量来克服 CRSN的路由设计挑战,即认知能量度量(CE)。在此基础上,提出一种分布式路由算法以延长网络寿命,同时提高数据传输的可靠性。仿真结果表明,所提路由算法能很好地适应 CRSN中可用信道资源及网络拓扑的随机变化。 相似文献
3.
交通路灯监控系统的无线传感网链状路由算法 总被引:1,自引:0,他引:1
在交通路灯监控系统中为节省网络节点能耗和降低数据传输时延,提出一种无线传感网链状路由算法(CRASMS)。该算法根据节点和监控区域的信息将监控区域分成若干个簇区域,在每一个簇区域中依次循环选择某个节点为簇头节点,通过簇头节点和传感节点的通信建立簇内星型网络,最终簇头节点接收传感节点数据,采用数据融合算法降低数据冗余,通过簇头节点间的多跳路由将数据传输到Sink节点并将用户端的指令传输到被控节点。仿真结果表明,CRASMS算法保持了PEGASIS算法在节点能耗方面和LEACH算法在传输时延方面的优点,克服了PEGASIS算法在传输时延方面和LEACH算法在节点能耗方面的不足,将网络平均节点能耗和平均数据传输时延保持在较低水平。在一定的条件下,CRASMS算法比LEACH和PEGASIS算法更优。 相似文献
4.
5.
在交通路灯监控系统中为节省网络节点能耗和降低数据传输时延,提出一种无线传感网链状路由算法(CRASMS)。该算法根据节点和监控区域的信息将监控区域分成若干个簇区域,在每一个簇区域中依次循环选择某个节点为簇头节点,通过簇头节点和传感节点的通信建立簇内星型网络,最终簇头节点接收传感节点数据,采用数据融合算法降低数据冗余,通过簇头节点间的多跳路由将数据传输到Sink节点并将用户端的指令传输到被控节点。仿真结果表明:CRASMS算法保持了PEGASIS算法在节点能耗方面和LEACH算法在传输时延方面的优点,克服了PEGASIS 算法在传输时延方面和LEACH算法在节点能耗方面的不足,将网络平均节点能耗和平均数据传输时延保持在较低水平。在一定的条件下,CRASMS算法比LEACH和PEGASIS算法更优。 相似文献
6.
7.
8.
介绍TZigBee技术与ARM相结合的无线传感网络的设计。利用SWOFT分析法得出的ZigBee的突出优势。在网络节点低能耗方面采用定时发送,中断唤醒的节能设计,延长了终端和路由的电池的使用寿命。使油田监控系统走向自动化、信息化、智能化。 相似文献
9.
针对楼宇环境监控的布线复杂与高功耗,设计了一种基于WSNs的大楼监控系统,使用了LEACH路由协议,构造了一个基于簇的网络。由于系统中的节点受到无线传输范围的限制,距离较远的簇首不能直接传递信息包给汇聚节点,所以簇首信息的交换被一个以汇聚节点为根的多跳生成树代替,汇聚节点将信息汇总然后发送至服务器内,这种簇的构造方法消耗节点能量少。子节点周期性地记录各种环境数据,实现数据传输。现场测试结果表明:此系统数据采集准确,操作方便,结构简单,实时性好。 相似文献
10.
11.
12.
针对移动P2P云环境下节点由于移动太快导致路由算法失效的问题,提出一种基于Chord资源路由算法。该算法修改基本路由结构,并设置实时机制和检查机制,实时机制在每次查找过程中实时修改路由信息,检查机制是检查路径节点是否为有效节点,并修改路径节点路由信息,提供给下次查询使用。实验结果表明,该算法有效提高查询成功率,同时减少查询延时。 相似文献
13.
Mobile sink (MS) has been used in wireless sensor networks (WSN) to increase the network lifetime by changing the location over time. The major quality of service given by WSN is coverage energy consumption (EC) and network lifetime. There are many methods implemented for enhance the coverage hole restoration and reduce the EC. We propose a novel MSCOLER (MS based Coverage Optimization and Link-stability Estimation Routing) protocol for Optimal Coverage restoration and Link stability Estimation. An optimization algorithm is used to optimize the coverage hole and move the redundant node besides the hole. During the routing process, link quality based routing is used to discover the relay nodes with the estimation of link stability to enhance the entire network lifetime and practically make the perfect transmission distance for energy saving. Experimental results demonstrate that proposed protocol can solve the coverage restoration problem, decrease the EC and reduce the network lifetime. The performance is evaluated regarding Average of residual energy (ARE), Receiving packets ratio (RPR), Moving energy consumption (MEC), Network lifetime (NL), Percentage of coverage (%C) and Average Energy Consumption (AEC). 相似文献
14.
Wireless Networks - In recent decades, Sensor nodes (SNs) are used in numerous uses of heterogeneous wireless sensor networks (HWSNs) to obtain a variety of sensing data sources. Sink mobility... 相似文献
15.
This paper presents a new position-based tracking system for autonomous mobile target tracking task. A grey-fuzzy controller (GFC) is developed for motion control of the tracker, in which dynamics models of the target and tracker are not required a priori. The target detection is based on the adaptive visual detector (AVD), which can online adjust the histogram model based on the change of surrounding conditions, such as light variation, in a natural environment. The AVD and GFC are integrated together for mobile target-tracking applications. There are several advantages of the integrated system, in particular: (1) it can rapidly learn the target appearance model for the detection involved with the tracking task; (2) the temporal dynamics model of the target motion can be approximated for the predictive localization of the moving target; and (3) the system can deal with the uncertain environmental conditions to ensure the tracking performance by GFC. Three mobile robots in the authors' laboratory have been used to demonstrate the success of this integrated system experimentally. They also conduct target tracking experiments, in which Chung Cheng-I tracks various moving targets. The results demonstrate the robustness and flexibility of the overall system in dealing with mobile target-tracking problems under varied natural environment conditions 相似文献
16.
Recently more and more research interest focuses on the energy efficient routing in mobile ad hoc networks and many related routing algorithms are reported. In this paper, a new optimized priority based energy efficient routing algorithm is presented and priority is added to the existing routing algorithm according to the residual energy proportion of the nodes. Lower residual energy means lower priority and the nodes with lower priority are less likely to forward packets to other nodes. The algorithm needs no global information of the networks and only a little modification is needed to the existing algorithm, so it is practical to be implemented. The algorithm can improve the performance of routing discovery, routing maintenance and cache management at the same time. Some optimization strategy is taken to reduce the network overhead and the lifetime of the network is much longer and the network with our algorithm can transfer much more effective data. Simulation with NS-2 is done and satisfying results are obtained with this algorithm. The results show that the algorithm is efficient. 相似文献
17.
18.
Energy conservation is a critical issue in resource constraint wireless sensor networks. Employing mobile sink to deliver the sensed data becomes pervasive approach to conserve sensors’ limited energy. However, mobile sink makes data delivery a hard nut to crack since nodes need to know its latest location. Providing sink’s latest location by traditional flooding, erode the energy conservation goal. In this paper, we propose a Grid-Cycle Routing Protocol (GCRP) with the aim of minimizing the overhead of updating the mobile sink’s latest location. In GCRP, sensor field is partitioned into grid of cells and for each cell a grid cell head (GCH) is elected. Cycles of four GCHs is formed. Cycle(s) involving border GCHs is called exterior cycle and said to belong to a region. Another cycle involving non-boundary GCHs is called interior cycle, connecting GCHs of different regions. When sink stays at one location, it updates the nearest GCH, which in turn updates the other GCHs through exterior and interior cycle. Moreover, we propose a set of sharing rules that govern GCHs when and with who share sink’s latest location information. The performance of GCRP is evaluated at different number of nodes and compared with existing work using NS-2.31. 相似文献
19.
喘振是造成压缩机损坏的重要原因,在此针对某厂70万吨/年烯烃项目,根据丙烯工艺流程,设计了一套压缩机的防喘振控制系统。该控制系统以TRIEW软件为人机界面,利用TRICON独有的防喘振控制软件包,将喘振PID控制、喘振超驰、手动控制算法相结合,通过喘振PID参数的在线优化,有效地实现了压缩机的防喘振控制,现场实际运行结果表明了该系统的稳定性和可靠性,同时,验证了该喘振控制算法的有效性。 相似文献
20.
在实时性要求比较高的应用中,时延要求限制了sink的移动速率与移动轨迹,sink的移动速率限制了节点与sink的通信时间,因此很难兼顾时延要求与数据收集效率。提出一种时延受限的移动sink数据收集算法MSDC,在低能耗缓存区内找到一条sink的最优移动轨迹,在有限的时间限制内利用sink的移动性来提升传感器网络的数据收集性能。仿真结果表明,与已有算法比较,该方案能够提高网络数据采集量,降低能耗,延长网络生命周期。 相似文献