首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 156 毫秒
1.
无线传感器网络是近年来的新兴技术,是国内外当前信息领域中研究的热点之一。该网络是一类面向应用、以数据为中心的无线网络。在军事、民用和智能居家有着广泛的应用前景。为此,如何高效、公平、节能地将数据汇集到基站是该类网络的一个关键问题。提出了一种分布式的、动态的,对不同的路由路径建立动态矩阵信号机制。该机制可以快速检测拥塞并反馈给后继结点,从而迅速缓解拥塞。模拟实验结果和分析表明该机制公平、稳定、节能。它能有效地避免无线传感器网络拥塞并具有更高的链路带宽利用率。  相似文献   

2.
本文讨论具有大量错误结点的超立方体网络中的单播路由算法,假定Hn是一个局部3-维子立方体连通的n-维超立方体网络并且每一个基本的3-维子立方体中分别最多有1个和2个错误结点,本文提出的单播路由算法能够在线性时间找到路径长度分别为源结点和目的结点之间大约1.5倍和2倍海明距离的次优路径,我们提出的单播路由算法只需要结点知道其邻结点的状态,而无需知道整个网络信息,也就是说,该算法是基于局部信息的,因而该算法具有很强的实际意义。  相似文献   

3.
针对无线传感网络(WSN)的拥塞问题,提出了一种将模糊控制和压缩感知(CS)技术相结合来缓解无线传感网络拥塞的算法。首先,将压缩感知技术引进到无线传感网络的拥塞控制中,理论分析了压缩感知对缓解传感网络拥塞的效果,通过对采集数据进行压缩感知处理来减少网络冗余信息,从而缓解网络拥塞。其次,针对网络拥塞时压缩感知技术不能动态适应无线传感网络复杂环境的问题,设计了一种模糊-压缩感知的拥塞控制算法,该算法结合网络拥塞状况对压缩感知的观测矩阵维数进行动态调节,从而使压缩感知技术更好地适应传感网络拥塞状况的变化。该机制在不同的拥塞状况下能够提高网络吞吐量10%~50%,降低网络的丢包率10%~50%,减少网络时延将近5 s。通过NS2仿真表明,该机制对无线传感网络的拥塞缓解有较明显的效果。  相似文献   

4.
针对无线传感器网络中的SFB拥塞控制算法在网络流量大时,其分类机制受影响而导致TCP流传输性能下降的问题,介绍了一种综合式拥塞控制机制的算法实现,并在NS-2平台上对该机制的性能进行了仿真研究。综合式拥塞控制机制通过建立新路径对数据包分流来解决拥塞问题;当新路径建立失败时,采用公平汇聚算法,按比例减少源节点的发送率,保证每个源节点公平发送数据;对于轻度拥塞情况,采用一种节能算法,即设置拥塞时间阈值,只有当拥塞时间超过阀值时才启动新路径查找机制。仿真结果表明,综合式拥塞控制机制能够减少丢包率,有效缓解拥塞,并能够根据数据权重的不同可靠发送重要数据。  相似文献   

5.
在并行计算机系统中,广播通信是极为重要的通信模式之一。该文基于k-Mesh子网(子立方体)连通的概念提出一个基于局部信息和分布式的三维Mesh网络容错广播路由算法。该算法利用邻结点的状态信息,动态地构建以单个k-Mesh子网为结点的广播树,该广播树能容忍相当多的结点出错。模拟结果表明广播路由算法的广播时间步接近最优的。该算法只要求结点知道它的邻结点的状态,而无需知道整个网络状态信息,也就是说,这些算法是基于局部信息的,因而具有很好的实际意义。  相似文献   

6.
针对当前大部分Ad Hoc地址配置协议配置时间较长,网络负载较大,随着网络规模的增大,协议性能下降较快等问题,提出一个新的配置协议。该协议提出了结合结点信任度的单结点分发多结点服务的模型,以及在该模型下的两次信息交换配置算法和寻找地址服务器的算法。介绍协议中出现的网络拥塞丢包、冷启动、最高信任度结点变更,信息同步等问题的处理方法。最后的实验结果证明了该协议保证配置的唯一性,具有低延迟、低负载,不依赖底层路由等特点,并且平均性能不会因为网络规模的增大而降低。  相似文献   

7.
无线网络的拥塞控制机制研究   总被引:2,自引:0,他引:2       下载免费PDF全文
由于有线网络TCP拥塞控制机制是建立在拥塞是网络丢包原因的基础上,所以该机制不能适应无线网络中高误码率造成的无线链路丢包的情况。因此,我们提出了一种改进的TCP拥塞控制机制AED和TCP.WX算法,此机制和算法能有效地降低无线网络中的丢包数,提高信道的利用率。  相似文献   

8.
IP网络中的拥塞控制   总被引:53,自引:2,他引:53  
任丰原  林闯  刘卫东 《计算机学报》2003,26(9):1025-1034
以拥塞控制机制演化的历史为线索,回顾了IP网络中已有的拥塞控制技术;总结了TCP流量控制、端到端流量控制和中间节点增强机制等各研究子方向中需要解决的问题;重点分析了主动队列管理这一热点领域中已有策略和算法的优缺点,并在此基础上,归纳和阐述了大多数算法所采用的启发式设计加仿真试验验证的模式存在的不足;提出了应用控制理论中的分析和设计方法研究网络拥塞控制的思路,并给出几个有意义的研究方向。  相似文献   

9.
为了提高交通信息采集系统中无线传感网络数据传输可靠性和实时性,提出一种高性能拥塞控制(HPCC)算法。针对单一拥塞检测无法准确预测网络负载情况问题,该算法根据队列占用率和拥塞持续时间定义拥塞预知状态指数,并通过对拥塞状态指数的判断,来准确预测拥塞趋势。为了避免最优路径失效导致网络瘫痪的问题,该算法基于TOPSIS理论思想构建选择模型,在拥塞节点周围建立临时最佳路径进行分流调节并将节点拥塞程度、剩余能量、距离原路径跳数以及信道接入率作为下一跳节点选择依据。实验结果表明,该算法能有效准确地检测拥塞,减小延迟,降低了网络能耗,保证数据的逼真度。  相似文献   

10.
在已有的主动网络拥塞控制机制(ACC)中,通过丢包的方式缓减拥塞。TCP拥塞控制机制起主导作用,但不能满足现有网络环境要求。该文提出一种改进的ACC算法,该算法将拥塞控制参数嵌入到每个主动包中,通过驻留在主动路由器中的拥塞控制代码,对参数进行相应修改,从而达到拥塞预防和控制的目的。仿真结果表明,该方法具有较好的网络带宽利用率和公平性,丢包概率接近0。  相似文献   

11.
Random Walk Routing in WSNs with Regular Topologies   总被引:3,自引:0,他引:3       下载免费PDF全文
Topology is one of the most important characteristics for any type of networks because it represents the network's inherent properties and has great impact on the performance of the network. For wireless sensor networks (WSN), a well-deployed regular topology can help save more energy than what a random topology can do. WSNs with regular topologies can prolong network lifetime as studied in many previous work. However, little work has been done in developing effective routing algorithms for WSNs with regular topologies, except routing along a shortest path with the knowledge of global location information of sensor nodes. In this paper, a new routing protocol based on random walk is proposed. It does not require global location information. It also achieves load balancing property inherently for WSNs which is difficult to achieve by other routing protocols. In the scenarios where the message required to be sent to the base station is in comparatively small size with the inquiry message among neighboring nodes, it is proved that the random walk routing protocol can guarantee high probability of successful transmission from the source to the base station with the same amount of energy consumption as the shortest path routing. Since in many applications of WSNs, sensor nodes often send only beep-like small messages to the base station to report their status, our proposed random walk routing is thus a viable scheme and can work very efficiently especially in these application scenarios. The random walk routing provides load balancing in the WSN as mentioned, however, the nodes near to the base station are inevitably under heavier burden than those far away from the base station. Therefore, a density-aware deployment scheme is further proposed to guarantee that the heavy-load nodes do not affect the network lifetime even if their energy is exhausted. The main idea is deploying sensors with different densities according to their distance to the base station. It will be shown in this paper that incorporating the random walk routing protocol with the density-aware deployment scheme can effectively prolong the network lifetime.  相似文献   

12.
杨奎武 《计算机科学》2016,43(Z6):255-259
提出一种基于基站大功率信号广播的延迟容忍移动传感器网络消息路由机制(High-power Broadcasting based Routing scheme,HBR)。该机制使用两个通信频率f1 和f2,基站以恒定大功率在频率f1上广播已经接收到的消息,网络中传感器节点根据基站广播信息计算自身转发概率并清理冗余消息副本,节点间利用频率f2进行通信。为进一步提升网络性能,HBR优先传输转发阈值(M)小且生存时间短的消息,并合理进行消息队列管理。仿真结果表明,与几种经典的路由机制相比,HBR在消息传输成功率、传输延迟方面有着一定的优势。  相似文献   

13.
We consider multiple message broadcasting in tree networks. The source (considered as the root of the tree) has k messages which have to be broadcast to all nodes of the tree. In every time unit each node can send one of its already obtained messages to one of its children. A k-message broadcasting scheme prescribes in which time unit a given node should send a message to which child. It is k-optimal if it achieves the smallest possible time for broadcasting k messages from the source to all nodes. We give an algorithm to construct a k-optimal broadcasting scheme for an arbitrary n-node tree. The time complexity of our algorithm is O(nk), i.e., the best possible.  相似文献   

14.
针对太赫兹无线纳米传感器网络节点处理能力弱,功耗低的问题,提出了一种基于时隙侦听的传感器节点接入方案.将时间划分成等长的帧,主控节点通过发送帧同步信号实现整个网络所有节点的帧同步.当传感器节点出现发送数据请求时,通过侦听每个时隙,寻找一个空闲时隙发送数据,省去了主控节点与接入节点间控制信息的交互,具有简单、易于实现的优点.优化了帧周期设定,并提出了一种避冲突方法.仿真结果显示:方案可以在冲突概率较低的同时,实现高数据吞吐量.  相似文献   

15.
Routing for wireless sensor networks based on gradient is a simple, reliable solution resulting in low information costs for the network package, as well as for the node itself. It is used for convergent traffic, where sensor nodes send messages to the sink node. Due to message transmission failures inherent to wireless sensor networks, researches in this area agree that point-to-point message confirmation in these networks is essential. This work proposes solutions for gradient-based routing using a confirmation mechanism for different neighbors, where four protocol variations are evaluated for sensor networks applications in order to monitor and control electrical variables. Results demonstrate that the protocol based on the longest distance has a satisfactory package delivery rate in severe conditions specified to the application. Furthermore, results show in which situations each routing protocol variation better suits the target application.  相似文献   

16.
Broadcast, referring to a process of information dissemination in a distributed system whereby a message originating from a certain node is sent to all other nodes in the system, is a very important issue in distributed computing. All-to-all broadcast means the process by which every node broadcasts its certain piece of information to all other nodes. In this paper, we first develop the optimal all-to-all broadcast scheme for the case of one-port communication, which means that each node can only send out one message in one communication step, and then, extend our results to the case of multi-port communication, i.e., k-port communication, meaning that each node can send out k messages in one communication step. We prove that the proposed schemes are optimal for the model considered in the sense that they not only require the minimal number of communication steps, but also incur the minimal number of messages  相似文献   

17.
Wireless sensor network (WSN) can be deployed in any unattended environment. With the new developed IoT (Internet of Things) technology, remote authorized users are allowed to access reliable sensor nodes to obtain data and even are allowed to send commands to the nodes in the WSN. Because of the resource constrained nature of sensor nodes, it is important to design a secure, effective and lightweight authentication and key agreement scheme. The gateway node (GWN) plays a crucial role in the WSN as all data transmitted to the outside network must pass through it. We propose a temporal-credential-based mutual authentication scheme among the user, GWN and the sensor node. With the help of the password-based authentication, GWN can issue a temporal credential to each user and sensor node. For a user, his/her temporal credential can be securely protected and stored openly in a smart card. For a sensor node, its temporal credential is related to its identity and must privately stored in its storage medium. Furthermore, with the help of GWN, a lightweight key agreement scheme is proposed to embed into our protocol. The protocol only needs hash and XOR computations. The results of security and performance analysis demonstrate that the proposed scheme provides relatively more security features and high security level without increasing too much overhead of communication, computation and storage. It is realistic and well adapted for resource-constrained wireless sensor networks.  相似文献   

18.
基于无线传感器网络的楼宇环境监测系统设计   总被引:1,自引:0,他引:1  
设计了基于无线传感器网络技术的楼宇温湿度监测系统.该系统完成对各室内温湿度光强数据的采集、传输、存储、分析,具有低功耗、自组织特点.管理节点利用ZigBee网络,根据管理中心的要求发送无线传感器网络各节点温湿度光强数据及报警信息.实验结果表明,ZigBee技术以其低功耗、低成本、网络容童大的特点,在实现实时楼宇环境监测方面有很大的优势,可满足中央空调系统对楼宇温湿度光强的监测需求.  相似文献   

19.
以带式输送机故障定位系统为应用背景,提出了一种基于STM32F103VE微处理器的CAN总线与Profibus-DP总线网关的设计方案。该网关在CAN网络中作为一个CAN通信节点,在Profibus-DP网络中作为一个从站;带式输送机沿线分布若干个CAN检测节点,每个节点负责检测其段内的4种传感器设备采集的实时数据,如果检测到故障信息,CAN检测节点就会向网关发送故障信息报文,网关接收CAN检测节点发送的报文并进行存储;当网关与Profibus-DP主站连通后,作为Profibus-DP从站的网关可以通过查询方式把故障信息报文传送到Profibus-DP主站中,从而实现故障定位功能。实际应用表明,该网关运行稳定、可靠,实现了带式输送机故障定位系统中CAN总线及Profibus-DP总线的互联。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号