In sensor networks,the adversaries can inject false data reports from compromised nodes.Previous approaches to filter false reports,e.g.,SEF,only verify the correctness of the message authentication code (MACs) carrie...In sensor networks,the adversaries can inject false data reports from compromised nodes.Previous approaches to filter false reports,e.g.,SEF,only verify the correctness of the message authentication code (MACs) carried in each data report on intermediate nodes,thus cannot filter out fake reports that are forged in a collaborative manner by a group of compromised nodes,even if these compromised nodes distribute in different geographical areas.Furthermore,if the adversary obtains keys from enough (e.g.,more than t in SEF) distinct key partitions,it then can successfully forge a data report without being detected en-route.A neighbor information based false report filtering scheme (NFFS) in wireless sensor networks was presented.In NFFS,each node distributes its neighbor information to some other nodes after deployment.When a report is generated for an observed event,it must carry the IDs and the MACs from t detecting nodes.Each forwarding node checks not only the correctness of the MACs carried in the report,but also the legitimacy of the relative position of these detecting nodes.Analysis and simulation results demonstrate that NFFS can resist collaborative false data injection attacks efficiently,and thus can tolerate much more compromised nodes than existing schemes.展开更多
In view of the forwarding microblogging,secondhand smoke,happiness,and many other phenomena in real life,the spread characteristic of the secondary neighbor nodes in this kind of phenomenon and network scheduling is e...In view of the forwarding microblogging,secondhand smoke,happiness,and many other phenomena in real life,the spread characteristic of the secondary neighbor nodes in this kind of phenomenon and network scheduling is extracted,and sequence influence maximization problem based on the influence of neighbor nodes is proposed in this paper.That is,in the time sequential social network,the propagation characteristics of the second-level neighbor nodes are considered emphatically,and k nodes are found to maximize the information propagation.Firstly,the propagation probability between nodes is calculated by the improved degree estimation algorithm.Secondly,the weighted cascade model(WCM) based on static social network is not suitable for temporal social network.Therefore,an improved weighted cascade model(IWCM) is proposed,and a second-level neighbors time sequential maximizing influence algorithm(STIM) is put forward based on node degree.It combines the consideration of neighbor nodes and the problem of overlap of influence scope between nodes,and makes it chronological.Finally,the experiment verifies that STIM algorithm has stronger practicability,superiority in influence range and running time compared with similar algorithms,and is able to solve the problem of maximizing the timing influence based on the influence of neighbor nodes.展开更多
针对现有模型对异质信息网络(heterogeneous information network, HIN)信息提取大部分依赖于元路径,缺乏元路径信息补充以及很少学习异质图中复杂的结构信息等问题,提出一种异质网中基于邻居节点和元路径的推荐算法(NMRec)。提取用户...针对现有模型对异质信息网络(heterogeneous information network, HIN)信息提取大部分依赖于元路径,缺乏元路径信息补充以及很少学习异质图中复杂的结构信息等问题,提出一种异质网中基于邻居节点和元路径的推荐算法(NMRec)。提取用户和物品邻居节点补充元路径缺失的信息,以卷积的方式捕获节点之间丰富的交互,通过注意力机制得到节点和元路径的嵌入表示,拼接用户、物品、邻居节点及元路径进行TOP-N推荐。在两个公开数据集上的实验结果表明,NMRec推荐性能良好,对推荐结果有良好的可解释性,与7种推荐基准算法相比,NMRec在评价指标Pre@10、Recall@10、NDGG@10上至少提升了0.21%、29%、1.46%。展开更多
为解决用户群体移动轨迹划分和密度峰值聚类算法自身局限性的问题,以校园轨迹为对象,考虑时间和位置语义信息层面的信息,建立网络用户间的相似性度量模型,提出一种基于共享近邻贡献度的密度峰值聚类算法(density peak clustering based ...为解决用户群体移动轨迹划分和密度峰值聚类算法自身局限性的问题,以校园轨迹为对象,考虑时间和位置语义信息层面的信息,建立网络用户间的相似性度量模型,提出一种基于共享近邻贡献度的密度峰值聚类算法(density peak clustering based on shared nearest neighbor contribution,SNNC-DPC),结合信息熵理论,通过最小化局部密度熵自适应选择截断距离;在局部密度计算上,利用共享近邻贡献度重新计算局部密度,更加全面地反映数据分布的特性;采用非线性变换方法选取决策值,解决聚类中心选取困难且方法单一的问题。在真实校园轨迹数据集上实验,验证了改进算法的有效性。展开更多
智能电表故障的准确预测对实现计量设备精准主动运维、保障电网稳定运行具有重要意义。电表各故障类型样本的出现频次不同,且不同故障类型样本在高维特征空间中的分布存在重叠,这极大增加了故障预测的难度。现有不平衡分类方法通过构建...智能电表故障的准确预测对实现计量设备精准主动运维、保障电网稳定运行具有重要意义。电表各故障类型样本的出现频次不同,且不同故障类型样本在高维特征空间中的分布存在重叠,这极大增加了故障预测的难度。现有不平衡分类方法通过构建单一样本信息与其对应类别标签的映射关系来划分样本类型,导致对具有相似表征信息的重叠区样本难以准确判别,降低了整体分类精度。该文提出一种基于多粒度近邻图的智能电表故障分类方法。首先,选择原始数据集中样本作为目标样本,以目标样本及其近邻样本作为节点、目标样本与其近邻样本连线作为边构建近邻图。根据选择的近邻样本数量不同构建多粒度近邻图,实现目标样本的信息扩充和训练样本的数量扩增,更有利于模型稳定训练。构建编码器挖掘近邻图节点特征,利用图注意力机制,根据近邻图节点编码特征和节点邻接关系将近邻样本信息自适应地聚合到目标样本,实现对相似样本差异的有效挖掘。对于给定测试样本,通过集成测试样本多粒度近邻图的分类结果,得到更精准、更鲁棒的智能电表故障预测结果。在20个KEEL(knowledge extraction based on evolutionary learning)和UCI(UC Irvine machine learning repository)不平衡分类公开数据集和智能电表实际故障数据集上的大量实验结果表明,与17种典型方法相比,该文所提算法在处理智能电表故障分类问题上具有显著优势。展开更多
提出了一种基于邻居节点监听的虚假数据过滤策略(false reports filtering scheme based on neighbor watch,NWFFS).在NWFFS策略中,每个节点保存两跳邻居节点信息,每个数据包必须包含T个来自不同密钥分区节点的ID及其生成的MAC.除生成...提出了一种基于邻居节点监听的虚假数据过滤策略(false reports filtering scheme based on neighbor watch,NWFFS).在NWFFS策略中,每个节点保存两跳邻居节点信息,每个数据包必须包含T个来自不同密钥分区节点的ID及其生成的MAC.除生成数据包的簇头节点外,每个中间节点向其下游节点转发数据包后,还需向自己的上游节点发送ACK包,通过对ACK包的监听,恶意节点利用其他区域俘获节点信息伪造的虚假数据包将被其一跳邻居识别出来,同时中间节点和Sink节点利用自身携带的密钥对少部分逃脱的虚假数据包进行进一步验证.理论分析和实验表明,该策略有效地避免了恶意节点利用任意区域已被其俘获的节点伪造虚假数据而不被识别出来,提高了途中过滤效率,从而降低了恶意节点对网络的影响,延长了网络生存期.展开更多
针对无线传感器网络节点自定位问题,提出了一种基于锚节点功率控制和邻居信息的距离无关定位算法——AP&NI(Anchor Power-control and Neighbor Information)。该算法可分为距离估计和位置计算两个阶段:在距离估计阶段,未知节点通...针对无线传感器网络节点自定位问题,提出了一种基于锚节点功率控制和邻居信息的距离无关定位算法——AP&NI(Anchor Power-control and Neighbor Information)。该算法可分为距离估计和位置计算两个阶段:在距离估计阶段,未知节点通过锚节点功率控制和邻居节点部署信息获得自身到锚节点的近似距离;在位置计算阶段,未知节点根据得到的近似距离的个数运用不同的方法计算自身的坐标。Matlab仿真结果表明,与DV-Hop算法和部分改进算法相比,AP&NI算法能有效减少近似距离的误差,提高定位精度。仿真还显示在各向异性的网络中,AP&NI算法克服了DV-Hop算法的缺点,依然保持良好的定位精度。展开更多
基金Projects(61173169,61103203,70921001)supported by the National Natural Science Foundation of ChinaProject(NCET-10-0798)supported by Program for New Century Excellent Talents in University of China
文摘In sensor networks,the adversaries can inject false data reports from compromised nodes.Previous approaches to filter false reports,e.g.,SEF,only verify the correctness of the message authentication code (MACs) carried in each data report on intermediate nodes,thus cannot filter out fake reports that are forged in a collaborative manner by a group of compromised nodes,even if these compromised nodes distribute in different geographical areas.Furthermore,if the adversary obtains keys from enough (e.g.,more than t in SEF) distinct key partitions,it then can successfully forge a data report without being detected en-route.A neighbor information based false report filtering scheme (NFFS) in wireless sensor networks was presented.In NFFS,each node distributes its neighbor information to some other nodes after deployment.When a report is generated for an observed event,it must carry the IDs and the MACs from t detecting nodes.Each forwarding node checks not only the correctness of the MACs carried in the report,but also the legitimacy of the relative position of these detecting nodes.Analysis and simulation results demonstrate that NFFS can resist collaborative false data injection attacks efficiently,and thus can tolerate much more compromised nodes than existing schemes.
基金Supported by the National Natural Science Foundation of China(No.62172352,61871465,42002138)the Natural Science Foundation of Hebei Province(No.F2019203157)the Science and Technology Research Project of Hebei(No.ZD2019004)。
文摘In view of the forwarding microblogging,secondhand smoke,happiness,and many other phenomena in real life,the spread characteristic of the secondary neighbor nodes in this kind of phenomenon and network scheduling is extracted,and sequence influence maximization problem based on the influence of neighbor nodes is proposed in this paper.That is,in the time sequential social network,the propagation characteristics of the second-level neighbor nodes are considered emphatically,and k nodes are found to maximize the information propagation.Firstly,the propagation probability between nodes is calculated by the improved degree estimation algorithm.Secondly,the weighted cascade model(WCM) based on static social network is not suitable for temporal social network.Therefore,an improved weighted cascade model(IWCM) is proposed,and a second-level neighbors time sequential maximizing influence algorithm(STIM) is put forward based on node degree.It combines the consideration of neighbor nodes and the problem of overlap of influence scope between nodes,and makes it chronological.Finally,the experiment verifies that STIM algorithm has stronger practicability,superiority in influence range and running time compared with similar algorithms,and is able to solve the problem of maximizing the timing influence based on the influence of neighbor nodes.
文摘针对现有模型对异质信息网络(heterogeneous information network, HIN)信息提取大部分依赖于元路径,缺乏元路径信息补充以及很少学习异质图中复杂的结构信息等问题,提出一种异质网中基于邻居节点和元路径的推荐算法(NMRec)。提取用户和物品邻居节点补充元路径缺失的信息,以卷积的方式捕获节点之间丰富的交互,通过注意力机制得到节点和元路径的嵌入表示,拼接用户、物品、邻居节点及元路径进行TOP-N推荐。在两个公开数据集上的实验结果表明,NMRec推荐性能良好,对推荐结果有良好的可解释性,与7种推荐基准算法相比,NMRec在评价指标Pre@10、Recall@10、NDGG@10上至少提升了0.21%、29%、1.46%。
文摘为解决用户群体移动轨迹划分和密度峰值聚类算法自身局限性的问题,以校园轨迹为对象,考虑时间和位置语义信息层面的信息,建立网络用户间的相似性度量模型,提出一种基于共享近邻贡献度的密度峰值聚类算法(density peak clustering based on shared nearest neighbor contribution,SNNC-DPC),结合信息熵理论,通过最小化局部密度熵自适应选择截断距离;在局部密度计算上,利用共享近邻贡献度重新计算局部密度,更加全面地反映数据分布的特性;采用非线性变换方法选取决策值,解决聚类中心选取困难且方法单一的问题。在真实校园轨迹数据集上实验,验证了改进算法的有效性。
文摘智能电表故障的准确预测对实现计量设备精准主动运维、保障电网稳定运行具有重要意义。电表各故障类型样本的出现频次不同,且不同故障类型样本在高维特征空间中的分布存在重叠,这极大增加了故障预测的难度。现有不平衡分类方法通过构建单一样本信息与其对应类别标签的映射关系来划分样本类型,导致对具有相似表征信息的重叠区样本难以准确判别,降低了整体分类精度。该文提出一种基于多粒度近邻图的智能电表故障分类方法。首先,选择原始数据集中样本作为目标样本,以目标样本及其近邻样本作为节点、目标样本与其近邻样本连线作为边构建近邻图。根据选择的近邻样本数量不同构建多粒度近邻图,实现目标样本的信息扩充和训练样本的数量扩增,更有利于模型稳定训练。构建编码器挖掘近邻图节点特征,利用图注意力机制,根据近邻图节点编码特征和节点邻接关系将近邻样本信息自适应地聚合到目标样本,实现对相似样本差异的有效挖掘。对于给定测试样本,通过集成测试样本多粒度近邻图的分类结果,得到更精准、更鲁棒的智能电表故障预测结果。在20个KEEL(knowledge extraction based on evolutionary learning)和UCI(UC Irvine machine learning repository)不平衡分类公开数据集和智能电表实际故障数据集上的大量实验结果表明,与17种典型方法相比,该文所提算法在处理智能电表故障分类问题上具有显著优势。
文摘提出了一种基于邻居节点监听的虚假数据过滤策略(false reports filtering scheme based on neighbor watch,NWFFS).在NWFFS策略中,每个节点保存两跳邻居节点信息,每个数据包必须包含T个来自不同密钥分区节点的ID及其生成的MAC.除生成数据包的簇头节点外,每个中间节点向其下游节点转发数据包后,还需向自己的上游节点发送ACK包,通过对ACK包的监听,恶意节点利用其他区域俘获节点信息伪造的虚假数据包将被其一跳邻居识别出来,同时中间节点和Sink节点利用自身携带的密钥对少部分逃脱的虚假数据包进行进一步验证.理论分析和实验表明,该策略有效地避免了恶意节点利用任意区域已被其俘获的节点伪造虚假数据而不被识别出来,提高了途中过滤效率,从而降低了恶意节点对网络的影响,延长了网络生存期.
文摘针对无线传感器网络节点自定位问题,提出了一种基于锚节点功率控制和邻居信息的距离无关定位算法——AP&NI(Anchor Power-control and Neighbor Information)。该算法可分为距离估计和位置计算两个阶段:在距离估计阶段,未知节点通过锚节点功率控制和邻居节点部署信息获得自身到锚节点的近似距离;在位置计算阶段,未知节点根据得到的近似距离的个数运用不同的方法计算自身的坐标。Matlab仿真结果表明,与DV-Hop算法和部分改进算法相比,AP&NI算法能有效减少近似距离的误差,提高定位精度。仿真还显示在各向异性的网络中,AP&NI算法克服了DV-Hop算法的缺点,依然保持良好的定位精度。
