| B-RPL:低存储开销的RPL路由协议 |
| |
| 引用本文： | 杨红,朱红松,孙利民.B-RPL:低存储开销的RPL路由协议[J].计算机科学,2015,42(1):96-100. |
| |
| 作者姓名： | 杨红 朱红松 孙利民 |
| |
| 作者单位： | 1. 中国科学院信息工程研究所信息安全国家重点实验室 北京100093;中国科学院大学 北京100049;物联网信息安全技术北京市重点实验室 北京100093
2. 中国科学院信息工程研究所信息安全国家重点实验室 北京100093;物联网信息安全技术北京市重点实验室 北京100093 |
| |
| 基金项目： | 本文受国家高技术研究发展计划(863)(2012AA050804),北京市科委科技创新基地培育与发展工程专项项目(Z131101002813085),中国科学院信息工程研究所前瞻部署项目(Y3Z0071G02)资助 |
| |
| 摘 要： | 针对低功耗易失网络(Low-power and Lossy Networks,LLNs)中存储式RPL路由的大存储开销问题,提出了一种基于存储式RPL的改进型路由协议B-RPL.该协议充分利用了LLNs网络无线通信的广播特性,将RPL中的路由表简化为目的节点集合,并利用布隆过滤器(Bloom Filter)管理该目的节点集合,极大地减少了节点的存储开销.此外,B-RPL还包含了一些针对网络拓扑动态变化的自适应机制.实验及分析表明:与存储式RPL相比,B-RPL节约了97.8％的存储开销,而通信开销仅增加2.4％.
|
| 关 键 词： | 物联网 6LoWPAN RPL 路由 布隆过滤器 |
B-RPL:Low Memory Cost RPL Routing Protocol |
| |
| YANG Hong,ZHU Hong-song and SUN Li-min.B-RPL:Low Memory Cost RPL Routing Protocol[J].Computer Science,2015,42(1):96-100. |
| |
| Authors: | YANG Hong ZHU Hong-song and SUN Li-min |
| |
| Affiliation: | State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China;University of Chinese Academy of Sciences,Beijing 100049,China;Beijing Key Laboratory of IOT Information Security Technology,Institute of Information Engineering,CAS,Beijing 100093,China,State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China;Beijing Key Laboratory of IOT Information Security Technology,Institute of Information Engineering,CAS,Beijing 100093,China and State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China;Beijing Key Laboratory of IOT Information Security Technology,Institute of Information Engineering,CAS,Beijing 100093,China |
| |
| Abstract: | The RPL routing protocol is widely used in low-power and lossy networks (LLNs).However,the storing mode of RPL is criticized for large memory consumption.In this paper,an advanced RPL was proposed,called B-RPL,which reduces the memory cost by making routing decision according to a set of destinations rather than the routing table used in the raw RPL.Further more,the B-RPL employs Bloom filter to manage the set of destinations,so that the memory consumption becomes extremely low.The B-RPL also contains several adaptive designs specially tailored for dynamic network change in LLNs.Experiments show that,comparing with RPL in storing mode,B-RPL saves 97.8% storage at the expense,and only increases 2.4% transmission overhead. |
| |
| Keywords: | Internet of things 6LoWPAN RPL Routing Bloom filter |
| 本文献已被 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
