检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张岩[1] 李鸥[1] 刘广怡[1] ZHANG Yan;LI Ou;LIU Guangyi(Information Engineering University,Zhengzhou 450001,China)
机构地区:[1]信息工程大学,河南郑州450001
出 处:《信息工程大学学报》2018年第3期291-296,共6页Journal of Information Engineering University
摘 要:拓扑发现是无线自组织网络研究的重点问题。在网络外部的拓扑发现问题研究中,由于条件所限,极难获取网络地址等前提条件。从通联节点对的时域特性入手,提出了基于协议交互规程的网络通联节点对发现算法。算法以发现符合协议交互规程的原子操作为目标,利用SDM算法提取特征值,通过区分置信度对特征值进行了匹配。最后使用朴素贝叶斯分类器判定节点通联关系。仿真实验表明,算法在结果准确性上拥有较好的性能指标,可用性较强。Topology discovery is an important research topic in wireless ad hoc networks.In the research of the topology discovery from outside of the network,it is very difficult to obtain prior knowledge like network address because of the limited conditions.This paper proposes a communication node pair discovery algorithm based on the rules of network communication protocol through exploiting the time-domain characteristics of the communication node pair.For the purpose of finding the atomic operation which obeys the protocol interaction rules, the proposed algorithm employs the sort-division-maximum(SDM) algorithm to extract the feature, and then achieves the feature matching by distinguishing the confidence.Finally, the naive Bayesian classifier is utilized to determine the node communication relationship.Simulation results show that the algorithm has a better performance in terms of accuracy, thus is of great practical significance.
关 键 词:通联节点对 无线自组织网络 协议交互规程 原子操作
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49