检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]太原科技大学计算机科学与技术学院,太原030024
出 处:《太原科技大学学报》2014年第3期184-189,共6页Journal of Taiyuan University of Science and Technology
基 金:山西省留学办公室资助项目(2011-077)
摘 要:针对传统的定向扩散路由协议网络中节点耗能大、网络中兴趣消息冗余严重及时延大等不足。本文提出了一种基于RSSI的分层定向扩散路由协议。该协议在兴趣扩散的过程中,将网络中的节点进行分层,实现兴趣消息在层与层间传输,大大减少了兴趣重复传播。与此同时,记录每个节点各传播路径上的RSSI值,这样在找到匹配的数据源节点的同时,就能确定一条最优路径来进行数据的传输。仿真实验结果表明,与传统的定向扩散路由协议相比,该协议减少了参与兴趣扩散的节点数量、降低了节点的平均能耗同时减少了时延,使网络性能得到显著的改善。For traditional directed diffusion routing protocol network node large energy consumption, network redundancy serious of interest in network and large time delay, etc. This paper proposes a layered and directed diffusion muting protocol based on RSSI. The protocol take the nodes in the network of layering in the process of the spread of interest, realize the interest message transmission between layer and layer, reduce the interest repeat transmission greatly. At the same time, each node records the RSSI value of the propagation path, when it finds the data source node of matching the interest, an optimal path can be determined for data transmission. The simulation results show that this protocol compared with the traditional Directed Diffusion Routing Protocol, it reduces the number of nodes in interest diffusion, reduces the average energy consumption of nodes while reducing the delay, the network performance is significantly improved.
分 类 号:TP311.5[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.219.8.51