检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001
出 处:《通信学报》2015年第10期224-234,共11页Journal on Communications
基 金:国家自然科学重点基金资助项目(61190115;61033015)~~
摘 要:为了实现低占空比无线传感器网络中任意端到端之间的实时数据传输,提出了一种基于动态切换的实时路由协议(DSRT)。首先针对低占空比网络中睡眠延迟太长的特点,DSRT利用2跳邻居信息提出了一种可达速度的概念来帮助发现延迟更优的路径(实验证明该方法至少能够多发现20%左右延迟更优的路径)。另外,首次发现了在低占空比网络中节点的拥塞程度不仅与缓冲队列中数据分组的个数有关,而且与数据分组的目的节点有关。然而传统基于1跳邻居的方法无法区分此类拥塞,因此DSRT利用2跳邻居信息结合动态切换机制提出了一种通过将缓冲队列分类的拥塞避免算法。最后,通过大量的实验证明,DSRT比传统的路由算法在实时性和能量消耗上更高效,并且在网络发生拥塞时能够将数据分组的延迟降低200%以上。The dynamic switching based real-time(DSRT) routing protocol was proposed to handle the arbitrary end-to-end(E2E) real-time communication in the low-duty-cycle wireless sensor networks. Firstly, the concept of available speed was designed to compensate for the big sleep latency and facilitate discovering the routes with less latency based on two-hop neighbors' information(at lease about 20% routing path with less latency was discovered by DRST in the experiments). Moreover, it was noticed that the congestion extent in the low-duty-cycle network was determined not only by the number of packets in the network output queue, but also the destination of the packets. However, the traditional method with one-hop neighbors' information cannot differentiate this kind of congestion. Therefore, combined with the dynamic switching mechanism, the DSRT proposed a congestion avoiding algorithm by classifying the packets in the queue. Through comprehensive experiments, the efficiency of routing discovering and congestion avoiding of the DSRT protocol is demonstrated, and the E2 E delay is decreased by at least 200% when the traffic was high.
分 类 号:TP393.01[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229