Deep Q-Learning Based Optimal Query Routing Approach for Unstructured P2P Network

Deep Reinforcement Learning(DRL)is a class of Machine Learning(ML)that combines Deep Learning with Reinforcement Learning and provides a framework by which a system can learn from its previous actions in an environment to select its efforts in the future efficiently.DRL has been used in many application fields,including games,robots,networks,etc.for creating autonomous systems that improve themselves with experience.It is well acknowledged that DRL is well suited to solve optimization problems in distributed systems in general and network routing especially.Therefore,a novel query routing approach called Deep Reinforcement Learning based Route Selection(DRLRS)is proposed for unstructured P2P networks based on a Deep Q-Learning algorithm.The main objective of this approach is to achieve better retrieval effectiveness with reduced searching cost by less number of connected peers,exchangedmessages,and reduced time.The simulation results shows a significantly improve searching a resource with compression to k-Random Walker and Directed BFS.Here,retrieval effectiveness,search cost in terms of connected peers,and average overhead are 1.28,106,149,respectively.

A Routing Algorithm for Risk-Scanning Agents Using Ant Colony Algorithm in P2P Network

This paper describes a routing algorithm for risk scanning agents using ant colony algorithm in P2P（peerto peer） network. Every peer in the P2P network is capable of updating its routing table in a real-time way, which enables agents to dynamically and automatically select, according to current traffic condition of the network, the global optimal traversal path. An adjusting mechanism is given to adjust the routing table when peers join or leave. By means of exchanging pheromone intensity of part of paths, the algorithm provides agents with more choices as to which one to move and avoids prematurely reaching local optimal path. And parameters of the algorithm are determined by lots of simulation testing. And we also compare with other routing algorithms in unstructured P2P network in the end.

Bidirectional Clone Node Model of Optimizing Performance of Structured P2P Overlay Network

In order to reduce the maintenance cost of structured Peer-to-Peer (P2P),Clone Node Protocol (CNP) based on user behavior is proposed.CNP considers the regularity of user behavior and uses the method of clone node.A Bidirectional Clone Node Chord model (BCNChord) based on CNP protocol is designed and realized.In BCNChord,Anticlockwise Searching Algorithm,Difference Push Synchronize Algorithm and Optimal Maintenance Algorithm are put forward to increase the performances.In experiments,according to the frequency of nodes,the maintenance cost of BCNChord can be 3.5%～32.5% lower than that of Chord.In the network of 212 nodes,the logic path hop is steady at 6,which is much more prior to 12 of Chord and 10 of CNChord.Theoretical analysis and experimental results show that BCNChord can effectively reduce the maintenance cost of its structure and simultaneously improve the query efficiency up to (1/4)O(logN).BCNChord is more suitable for highly dynamic environment and higher real-time system.

HDNBS: An approach for search in decentralized and unstructured P2P

Decentralized and unstructured peer-to-peer applications such as Gnutella are attractive because they require no centralized directories and no precise control over network topology or data placement. Search algorithm is the major component of the distributed system and its efficiency also does influence the systems performance. However the flooding-based query algorithm used in Gnutella produces huge traffic and does not scale well. Gnutella-like P2P topology has power-law characteristic, so a search algorithm was proposed based on high degree nodes of power-law network, High Degree Nodes-Based Search （HDNBS）. Extensive simulation results show that this algorithm performs on power-law networks very well, achieves almost 100% success rates, produces O（logN） messages per query and can locate target file within O（lagN） hops.

Hybrid ants-like search algorithms for P2P media streaming distribution in ad hoc networks

Media streaming delivery in wireless ad hoc networks is challenging due to the stringent resource restrictions,po-tential high loss rate and the decentralized architecture. To support long and high-quality streams,one viable approach is that a media stream is partitioned into segments,and then the segments are replicated in a network and served in a peer-to-peer(P2P) fashion. However,the searching strategy for segments is one key problem with the approach. This paper proposes a hybrid ants-like search algorithm(HASA) for P2P media streaming distribution in ad hoc networks. It takes the advantages of random walks and ants-like algorithms for searching in unstructured P2P networks,such as low transmitting latency,less jitter times,and low unnecessary traffic. We quantify the performance of our scheme in terms of response time,jitter times,and network messages for media streaming distribution. Simulation results showed that it can effectively improve the search efficiency for P2P media streaming distribution in ad hoc networks.

INCENTIVE MECHANISMS FOR TRUSTWORTHY ROUTING BASED ON GAME MODEL OF THE STRATEGIES OF NODES IN P2P NETWORKS

The trustworthiness and security of routing in the existing Peer-to-Peer (P2P) networks can not be ensured because of the diversity of the strategies of P2P nodes. This paper firstly uses game theory to establish game model of the strategies and profits of various types of routing nodes. Then,two incentive mechanisms for the corresponding stages of P2P trustworthy routing are proposed,namely trust associated mechanism and trust compensated mechanism. Simulation results show that the incentive mechanisms proposed in this paper will encourage cooperation actions of good nodes and restrain malicious actions of bad nodes,which ensure the trustworthiness of routing consequently.

A P2P Approach to Routing in Hierarchical MANETs

We present an effective routing solution for the backbone of hierarchical MANETs. Our solution leverages the storage and retrieval mechanisms of a Distributed Hash Table (DHT) common to many (structured) P2P overlays. The DHT provides routing information in a decentralized fashion, while supporting different forms of node and network mobility. We split a flat network into clusters, each having a gateway who participates in a DHT overlay. These gateways interconnect the clusters in a backbone network. Two routing approaches for the backbone are explored: flooding and a new solution exploiting the storage and retrieval capabilities of a P2P overlay based on a DHT. We implement both approaches in a network simulator and thoroughly evaluate the performance of the proposed scheme using a range of static and mobile scenarios. We also compare our solution against flooding. The simulation results show that our solution, even in the presence of mobility, achieved well above 90% success rates and maintained very low and constant round trip times, unlike the flooding approach. In fact, the performance of the proposed inter-cluster routing solution, in many cases, is comparable to the performance of the intra-cluster routing case. The advantage of our proposed approach compared to flooding increases as the number of clusters increases, demonstrating the superior scalability of our proposed approach.

GRADE: Deep learning and garlic routing-based secure data sharing framework for IIoT beyond 5G

The rise of automation with Machine-Type Communication(MTC)holds great potential in developing Industrial Internet of Things(IIoT)-based applications such as smart cities,Intelligent Transportation Systems(ITS),supply chains,and smart industries without any human intervention.However,MTC has to cope with significant security challenges due to heterogeneous data,public network connectivity,and inadequate security mechanism.To overcome the aforementioned issues,we have proposed a blockchain and garlic-routing-based secure data exchange framework,i.e.,GRADE,which alleviates the security constraints and maintains the stable connection in MTC.First,the Long-Short-Term Memory(LSTM)-based Nadam optimizer efficiently predicts the class label,i.e.,malicious and non-malicious,and forwards the non-malicious data requests of MTC to the Garlic Routing(GR)network.The GR network assigns a unique ElGamal encrypted session tag to each machine partaking in MTC.Then,an Advanced Encryption Standard(AES)is applied to encrypt the MTC data requests.Further,the InterPlanetary File System(IPFS)-based blockchain is employed to store the machine's session tags,which increases the scalability of the proposed GRADE framework.Additionally,the proposed framework has utilized the indispensable benefits of the 6G network to enhance the network performance of MTC.Lastly,the proposed GRADE framework is evaluated against different performance metrics such as scalability,packet loss,accuracy,and compromised rate of the MTC data request.The results show that the GRADE framework outperforms the baseline methods in terms of accuracy,i.e.,98.9%,compromised rate,i.e.,18.5%,scalability,i.e.,47.2%,and packet loss ratio,i.e.,24.3%.

Difficulties, strategies, and recent research and development of layered sodium transition metal oxide cathode materials for high-energy sodium-ion batteries

Energy-storage systems and their production have attracted significant interest for practical applications.Batteries are the foundation of sustainable energy sources for electric vehicles(EVs),portable electronic devices(PEDs),etc.In recent decades,Lithium-ion batteries(LIBs) have been extensively utilized in largescale energy storage devices owing to their long cycle life and high energy density.However,the high cost and limited availability of Li are the two main obstacles for LIBs.In this regard,sodium-ion batteries(SIBs) are attractive alternatives to LIBs for large-scale energy storage systems because of the abundance and low cost of sodium materials.Cathode is one of the most important components in the battery,which limits cost and performance of a battery.Among the classified cathode structures,layered structure materials have attracted attention because of their high ionic conductivity,fast diffusion rate,and high specific capacity.Here,we present a comprehensive review of the classification of layered structures and the preparation of layered materials.Furthermore,the review article discusses extensively about the issues of the layered materials,namely(1) electrochemical degradation,(2) irreversible structural changes,and(3) structural instability,and also it provides strategies to overcome the issues such as elemental phase composition,a small amount of elemental doping,structural design,and surface alteration for emerging SIBs.In addition,the article discusses about the recent research development on layered unary,binary,ternary,quaternary,quinary,and senary-based O3-and P2-type cathode materials for high-energy SIBs.This review article provides useful information for the development of high-energy layered sodium transition metal oxide P2 and O3-cathode materials for practical SIBs.

小尺寸纳米颗粒的SEM高分辨成像模式探究——以Ni_(2)P为例

相比透射电子显微镜(TEM),扫描电子显微镜(SEM)具有批量进样、成本低、三维成像的优势,但小尺寸纳米颗粒在进行SEM成像时存在容易积碳、分辨率不足、形貌结构信息弱等技术难题。文章以超小空心(34.4 nm)、实心(13.3 nm)Ni_(2)P纳米颗粒为例,重点探究了如何通过调控工作模式、工作距离、加速电压、束流等参数获得分辨率高、形貌结构清晰的SEM图像。研究表明,高分辨模式下T2和超高分辨模式下T3探头所成二次电子(SE)像的分辨率明显优于标准模式下ETD探头的,且SE像表面形貌信息多、立体感较好。其中由于T3探头位置最高且仅收集高位二次电子信号,这部分二次电子信号进入透镜的角度准直且能量较低。因此超高分辨模式-T3探头所成SE像分辨率和信噪比最高、形貌衬度良好,但几乎观察不到颗粒内部结构。而高分辨和超高分辨模式下T1(背散射信号)探头所成BSE像成分衬度好,虽景深较小但最有利于观察空心结构。同时探究发现工作距离太小,所得SE像分辨率好但景深差,工作距离太大,SE像分辨率稍弱但景深较好。结合图像质量测量结果,对于文中的Ni_(2)P纳米颗粒,选择适中的工作距离(~8 mm)可获得质量较高的SE像。提升加速电压可有效提高图像分辨率(空心Ni_(2)P在30 kV下可达2.3 nm)。信噪比会随束流的增大而增强,其过大会导致颗粒边缘模糊,选择适中的束流(~0.2 nA)成像效果较好。以上研究结果对小尺寸及中空结构纳米颗粒的SEM成像选择具有一定的借鉴作用。

Surface engineering of P2-type cathode material targeting long-cycling and high-rate sodium-ion batteries

The widespread interest in layered P2-type Mn-based cathode materials for sodium-ion batteries(SIBs)stems from their cost-effectiveness and abundant resources.However,the inferior cycle stability and mediocre rate performance impede their further development in practical applications.Herein,we devised a wet chemical precipitation method to deposit an amorphous aluminum phosphate(AlPO_(4),denoted as AP)protective layer onto the surface of P2-type Na_(0.55)Ni_(0.1)Co_(0.7)Mn_(0.8)O_(2)(NCM@AP).The resulting NCM@5AP electrode,with a 5 wt%coating,exhibits extended cycle life(capacity retention of78.4%after 200 cycles at 100 mA g^(-1))and superior rate performance(98 mA h g^(-1)at 500 mA g^(-1))compared to pristine NCM.Moreover,our investigation provides comprehensive insights into the phase stability and active Na^(+)ion kinetics in the NCM@5AP composite electrode,shedding light on the underlying mechanisms responsible for the enhanced performance observed in the coated electrode.

Analytical Comparison of Resource Search Algorithms in Non-DHT Mobile Peer-to-Peer Networks

One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question?Broadcasting is a basic technique in the Mobile Ad-hoc Networks(MANETs),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive ooding technique oods the network with query messages,while the random walk scheme operates by contacting subsets of each node’s neighbors at every step,thereby restricting the search space.Many earlier works have mainly focused on the simulation-based analysis of ooding technique,and its variants,in a wired network scenario.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of mobile P2P networks.In this article,we mathematically model different widely used existing search techniques,and compare with the proposed improved random walk method,a simple lightweight approach suitable for the non-DHT architecture.We provide analytical expressions to measure the performance of the different ooding-based search techniques,and our proposed technique.We analytically derive 3 relevant key performance measures,i.e.,the avg.number of steps needed to nd a resource,the probability of locating a resource,and the avg.number of messages generated during the entire search process.

Research on Video on Demand Based on P2P Network

A P2P approaches to extend the ability of Video on Demand systems to serve more users. In the proposed system users share with each other the media data obtained and the media server is no longer the only source to get data from, thereby, the load on the media server could be greatly alleviated and the overall system capacity increases and more users could be served. The P2P streaming system introduces efficient searching;data transfer dynamically monitoring and initial buffering to maintain a high quality of playback. Its provider selection policy helps to reduce the load of the underlying network by avoiding remote data transfer.

Detecting P2P Botnet by Analyzing Macroscopic Characteristics with Fractal and Information Fusion

Towards the problems of existing detection methods,a novel real-time detection method(DMFIF) based on fractal and information fusion is proposed.It focuses on the intrinsic macroscopic characteristics of network,which reflect not the "unique" abnormalities of P2P botnets but the "common" abnormalities of them.It regards network traffic as the signal,and synthetically considers the macroscopic characteristics of network under different time scales with the fractal theory,including the self-similarity and the local singularity,which don't vary with the topology structures,the protocols and the attack types of P2P botnet.At first detect traffic abnormalities of the above characteristics with the nonparametric CUSUM algorithm,and achieve the final result by fusing the above detection results with the Dempster-Shafer evidence theory.Moreover,the side effect on detecting P2P botnet which web applications generated is considered.The experiments show that DMFIF can detect P2P botnet with a higher degree of precision.

P2-Na_(2/3)Ni_(2/3)Te_(1/3)O_(2)Cathode for Na-ion Batteries with High Voltage and Excellent Stability

Air-stable layered structured cathodes with high voltage and good cycling stability are highly desired for the practical application of Na-ion batteries.Herein,we report a P2-Na_(2/3)Ni_(2/3)Te_(1/3)O_(2) cathode that is stable in ambient air with an average operating voltage of~3.8 V,demonstrating excellent cycling stability with a capacity retention of more than 92.7%after 500 cycles at 20 mA g^(-1) and good rate capability with 91.9%capacity utilization at 500 mA g^(-1) with respect to capacity at 5 mA g^(-1) between 2.0 and 4.0 V.When the upper cutoff voltage is increased to 4.4 V,P2-Na_(2/3)Ni_(2/3)Te_(1/3)O_(2) delivers a reversible capacity of 71.9 mAh g^(-1) and retains 91.8%of the capacity after 100 cycles at 20 mA g^(-1).The charge compensation during charge/discharge is mainly due to the redox couple of Ni^(2+)/Ni^(3+)in the host with a small amount of contribution from oxygen.The stable structure of the material without phase transformation and with small volume change during charge-discharge allows it to give excellent cycle performance especially when the upper cutoff voltage is not higher than 4.2 V.

利用非线性方法反演琉球-台湾-吕宋地区的岩石层P波速度结构

根据中国地震台网和ISC台站提供的P波走时资料,使用差异演化全局优化算法(DE算法)和移动窗方法反演了琉球-台湾-吕宋地区岩石层尺度的P波速度结构.在台站和地震分布较为密集的地区,反演窗口为2°×2°,移动步长为1°;在台站和地震较少的地区,反演窗口为4°×4°左右,移动步长为2°.反演结果揭示出琉球-台湾-吕宋地区壳幔结构的横向差异:琉球岛弧西侧受冲绳海槽地幔热扰动的地壳减薄,东侧由于菲律宾海板块的俯冲挤压地壳略有增厚;欧亚大陆与菲律宾海板块的相互碰撞导致台湾地区地壳及岩石层明显增厚;吕宋及菲律宾北部岩石层受岛弧火山下方热流影响较大.结果表明,非线性全局优化算法和移动窗方法能够用于反演较大尺度速度结构的横向变化.

基于U-tree的不确定移动对象索引策略

通过在U-tree中添加时间戳和速度矢量等时空因素,提出一种基于U-tree的高效率当前及未来不确定位置信息检索的索引结构TPU-tree,可以支持多维空间中不确定移动对象的索引,并提出了一种改进的基于p-bound的MP_BBRQ(modifiedp-bound based range query)域查询处理算法,能够引入搜索区域进行预裁剪以减少查询精炼阶段所需代价偏高的积分计算.实验仿真表明,采用MP_BBRQ算法的TPU-tree概率查询性能极大地优于传统的TPR-tree索引,且更新性能与传统索引大致相当,具有良好的实用价值.

张渤构造带中东段二维P波速度结构——安新—香河—宽城剖面

为了获取首都圈地区 (3 8.5°N～ 41 .0°N ,1 1 4.0°E～ 1 2 0 .0°E)三维地壳精细结构 ,在该地区实施了 6次人工爆破 ,进行三维深地震测深 .利用纵测线安新三台、安次旧州、三河新集、遵化平安城 4炮的人工爆破资料 ,研究张渤带中东段的二维速度结构 .华北平原和燕山褶断带的深部分界位置大体在宝坻断裂一带 ,深部结构构造表现为宽约数十千米的一个异常带 .分界处的壳幔结构为 :结晶基底明显凹陷 ;壳幔边界之上为强正速度梯度层 ,厚约 3～ 4km ,可能是上地幔物质上涌到下地壳底部的结果 ;壳内界面和莫霍边界上隆 ,并可能存在错断 .华北盆地地壳薄 ,壳内存在低速体和局部结构异常 ;燕山褶断带地壳厚 ,壳内分层明显 ,速度分布均匀 .两构造单元结构存在明显差异 .

一种基于局部扭曲立方体的无死锁路由算法

局部扭曲立方体是一种新提出来用于并行计算的互连网络.经研究发现,局部扭曲立方体中已有最小路由算法存在着死锁.针对原有算法的特点,提出了一种新的无死锁路由算法并给出了无死锁证明.利用将物理通道分成2条虚拟通道进而形成2个不相交的虚拟网络,将不同的点对之间的路由限定在某一个虚拟网络中,从而有效地避免了死锁的产生.同时,利用一个局部扭曲立方体可由2个低维子立方体和2-扭曲立方体构成这一性质,在局部的低维子立方体和2-扭曲立方体中均采用自适应路由,从而提高了算法的自适应性.