基于P2P网络的分级路由策略分析

在P2P网络中定位节点非常重要。由于不同拓扑结构的P2P网络采用各种不同的路由方式,对P2P网络的分级路由方式进行分析,揭示基于P2P网络的分级路由策略。     

P2P-SIP技术之我见

SIP协议是当前VolP和IM等多媒体协议的呼叫建立协议。P2P技术提供了分布式的网络架构中通信节点之间得对等通信能力,P2P网络架构经历了集中目录式网络架构、纯P2P网络架构、混合式P2P网络架构和结构化P2P网络架构。通过引入P2P技术,SIP网络的能力可以得到增强。     

结构化P2P网络中资源搜索问题的研究

资源搜索问题是P2P网络的核心问题之一,也是P2P网络研究的热点。本论文选定结构化P2P网络作为研究对象,通过为Chord网络中每个节点增加一个指取表,完成了Chord网络基本路由算法的改进,提高了路由效率及减少了查询消耗时间。最后利用P2P协议仿真平台p2psim,仿真了Chord搜索算法。     

Tier_Flat:P2P网络并行模拟器(HiFiP2P)的一种路由算法

为了给P2P网络并行模拟器HiFiP2P提供正确高效的路由,使其能够高效地执行大规模P2P网络并行模拟,基于互联网中的层次路由模型和Flat本地静态路由计算和查找算法,采取边界路由最小化的并行网络拓扑划分机制,设计了Tier_Flat路由算法,用以实现HiFiP2P的远程和本地静态路由,它以最低O((N~4)~(1/3))的空间开销,取得了O(1)的查找效率。结果表明,Tier_Flat路由算法路由计算时间短,路由表内存占用小,路由查询速度快,为HiFiP2P平台的大规模P2P网络并行模拟提供了高效的路由服务。     

一种按需多径的无线传感器网络簇头路由协议

针对分簇无线传感器网络中簇头之间通信联通难以保证,由簇头构成的多跳网络拓扑频繁变化的特点,提出了一种按需多径的簇头路由(OMCHR)协议.对比现有按需路由协议,其创新之处在于:(1)利用层ID限制路由控制消息的广播转发,并控制传输路径的跳数;(2)在路由发现过程中根据需要任命部分成员节点充当路由节点,保证簇头间的通信联...     

无结构化P2P网络的路由算法

针对无结构化P2P网络的洪泛搜索与随机漫步机制的盲目性,提出了一种利用Hash函数与M-tree技术将文件聚类后,再利用路由表完全分布式存储索引指针的新的路由算法。该算法使每个节点的路由表主要记录拥有各类资源的高能力节点指针,并利用概率统计的方法不断地更新路由表项。当节点收到搜索以后,通过查询路由表,只需一跳就进入能以最大概率回应的节点处查找,并能以较低的网络时延命中多个优质资源副本,达到了高速并行下载的目的。仿真试验和数学分析表明该算法有效地减少了盲目搜索造成的网络流量,提高了查找成功率,并且具有越稀缺的资源越容易找到的特性。     

TSS-SON:一种基于结构化P2P网络路由的两级语义覆盖网络结构

提出了基于结构化P2P网络路由机制的两级语义覆盖网络结构TSS-SON.该结构根据资源主题将节点组织成主题区域,在同一主题区域内,采用基于语义相似度机制进行群的划分.该结构充分利用了结构化P2P网络的优点,解决了基于非结构化P2P网络建立的语义覆盖网络对主题群的搜索低效问题,同时克服了结构化P2P网络仅支持精确匹配查找的缺点,实现了可靠、高效的语义查询,并极大地提高了查全率.     

一种适合异构P2P网络的树形结构覆盖层

为实现异构网络下的P2P应用,分析了具有异构融合特征的P2P网络的特点,提出了与之相适应的基于二叉树结构的覆盖层网络(TSOHEN)的设计方法.该方法根据节点的不同功能和属性将节点分为普通节点和混合节点两大类,并为每类节点设计了适应异构特征的路由表,对各类节点的加入和离开功能设计了相应的算法,并通过混合节点实现跨网的P2P查询操作.数值和仿真结果表明,该覆盖层设计能够有效地适应异构网络的环境,树形结构也没有使得根节点和叶节点的负荷产生明显的区别,各混合节点的负载也基本平衡.在大规模节点数量的情况下,TSOHEN的各种算法仍具有良好的收敛性.     

基于信誉评测机制的WSN安全路由协议研究

针对无线传感器网络(WSN)路由协议存在的安全问题,考虑到WSN节点能量低、资源有限的缺陷,提出了一种新型的WSN安全路由协议——VH-GEAR协议。VH-GEAR协议在地理位置能量感知路由(GEAR)协议的基础上引入了纵向(vertocal,V)和横向(horizontal,H)分析相结合的WSN节点信誉评测模型来提高路由协议的安全性,同时通过改进路由协议的信誉更新机制来减小能耗。基于NS2的仿真实验表明,VH-GEAR路由协议能有效识别网络中的恶意节点,减小对合法节点的误判,降低网络能耗,从而加强了网络的安全性,延长了网络的生命周期,提高了网络的整体性能。     

一种具有较好用户体验的P2P因特网视频广播系统

针对当前流行的P2P因特网视频广播系统频道切换慢、源到端时延长等问题,进行了连接节点管理算法和数据段调度算法的研究,提出了一种采用基于多树和网的方案MTreeTV,降低了时延并能适应自治节点的高波动.该方法充分利用了结构化P2P覆盖网的优点,能够扩展到非常大的规模,网络效率和健壮性较好.理论分析和仿真表明,MTreeTV可以提供较短的频道切换和源端时延(小于9s)并具有很高的播放连续性,而且控制开销较小(小于2%).此外还研究了缓冲区大小、连接节点数量、节点带宽和节目速率等关键参数对P2P因特网视频广播系统性能的影响.     

基于Ad hoc无线网络的AODV路由协议仿真

利用以Ubuntu为平台的NS2网络仿真器,对AODV路由协议进行仿真.通过分析不同仿真场景的仿真数据,绘制出相应的仿真结果对比图,并对AODV路由协议进行了性能分析.仿真结果表明,在数据流不断增加的情况下,网络平均吞吐量、归一化路由开销以及端到端平均时延等性能指标会相应下降,得出了AODV路由协议适合于中小规模且发包率不高的网络场合的结论.     

Randomised and distributed methods for reliable peer-to-peer data communication in wireless ad hoc networks

Peer-to-peer (P2P) communications have attracted a great deal of attention from the network research community in recent years. However, due to the fundamental limitations of wireless environments, providing reliable data availability for P2P applications over wireless ad hoc networks is still a major challenge. To address the problem, a distributed and randomised scheme based on self-avoiding walks is proposed. The scheme concatenates disparate network layers, with the goal of recovering from routing failures that disrupt P2P data accessibility. In addition, a probabilistic approach is presented that explores the tradeoffs between several system parameters. Some new analysis tools, such as path coupling, are utilised which provide a better understanding of the system's operations. That the proposed concepts and techniques make a significant contribution to the design of effective and efficient P2P applications in wireless ad hoc networks is believed.     

A Neural Network-Based Trust Management System for Edge Devices in Peer-to-Peer Networks

Edge devices in Internet of Things (IoT) applications can form peers to communicate in peer-to-peer (P2P) networks over P2P protocols. Using P2P networks ensures scalability and removes the need for centralized management. However, due to the open nature of P2P networks, they often suffer from the existence of malicious peers, especially malicious peers that unite in groups to raise each other's ratings. This compromises users' safety and makes them lose their confidence about the files or services they are receiving. To address these challenges, we propose a neural network-based algorithm, which uses the advantages of a machine learning algorithm to identify whether or not a peer is malicious. In this paper, a neural network (NN) was chosen as the machine learning algorithm due to its efficiency in classification. The experiments showed that the NNTrust algorithm is more effective and has a higher potential of reducing the number of invalid files and increasing success rates than other well-known trust management systems.     

A Hierarchical Trust Model for Peer-to-Peer Networks

Trust has become an increasingly important issue given society’s growing reliance on electronic transactions. Peer-to-peer (P2P) networks are among the main electronic transaction environments affected by trust issues due to the freedom and anonymity of peers (users) and the inherent openness of these networks. A malicious peer can easily join a P2P network and abuse its peers and resources, resulting in a large-scale failure that might shut down the entire network. Therefore, a plethora of researchers have proposed trust management systems to mitigate the impact of the problem. However, due to the problem’s scale and complexity, more research is necessary. The algorithm proposed here, HierarchTrust, attempts to create a more reliable environment in which the selection of a peer provider of a file or other resource is based on several trust values represented in hierarchical form. The values at the top of the hierarchical form are more trusted than those at the lower end of the hierarchy. Trust, in HierarchTrust, is generally calculated based on the standard deviation. Evaluation via simulation showed that HierarchTrust produced a better success rate than the well-established EigenTrust algorithm.     

EAMTR: energy aware multi-tree routing for wireless sensor networks

IEEE 802.15.4 is the prevailing standard for low-rate wireless personal area networks. It specifies the physical layer and medium access control sub-layer. Some emerging standards such as ZigBee define the network layer on top of these lower levels to support routing and multi-hop communication. Tree routing is a favourable basis for ZigBee routing because of its simplicity and limited use of resources. However, in data collection systems that are based on spanning trees rooted at a sink node, non-optimal route selection, congestion and uneven distribution of traffic in tree routing can adversely contribute to network performance and lifetime. The imbalance in workload can result in hotspot problems and early energy depletion of specific nodes that are normally the crucial routers of the network. The authors propose a novel light-weight routing protocol, energy aware multi-tree routing (EAMTR) protocol, to balance the workload of data gathering and alleviate the hotspot and single points of failure problems for high-density sink-type networks. In this scheme, multiple trees are formed in the initialisation phase and according to network traffic, each node selects the least congested route to the root node. The results of simulation and performance evaluation of EAMTR show significant improvement in network lifetime and traffic distribution.     

An expert system for network management control

Abstract

Due to the varying time and the complexity of the commercial telecommunication network configuration, routing of the communication traffic becomes very important for telecommunication systems. No one can keep in mind all the complex routing plans used in networks, so it is hard to quickly take proper actions while the switching node is being blocked.

In this paper, we propose an expert system which can collect traffic data, monitor network status, reason and take appropriate actions for extreme traffic congestion on a network just as a network management expert can do. It would certainly streamline the whole network control procedure, and. provide dynamic routing functions based on the original static routing method adopted in Taiwan. It does improve both network efficiency and network reliability.     

A Safe and Reliable Routing Mechanism of LEO Satellite Based on SDN

Satellite networks have high requirements for security and data processing speed. In order to improve the reliability of the network, software-defined network (SDN) technology is introduced and a central controller is set in the network. Due to the characteristics of global perspective, control data separation, and centralized control of SDN, the idea of SDN is introduced to the design of the satellite network model. As a result, satellite nodes are only responsible for data transmission, while the maintenance of the links and the calculation of routes are implemented by the controller. For the massive LEO satellite network based on SDN, a state evaluation decision routing mechanism is proposed. The designed mechanism monitors the status of the entire network effectively and reduces the on-board load on the satellite network. The best routing decision is made under the comprehensive consideration of the current and historical status of each intersatellite link between Low Earth Orbit (LEO) satellite network nodes. The calculation and storage requirements are controlled within a reasonable range. Based on the curve parameter transmission fuzzy encryption algorithm, a safe and reliable condition assessment decision routing mechanism (CADRM) is designed. It ensures that the personal information of the LEO satellite network can be transmitted safely and effectively. The experimental simulation results show the improvement of network throughput, the reduction of packet loss rate and the enhancing of network reliability.     

E2-SCAN: an extended credit strategy-based energy-efficient security scheme for wireless ad hoc networks

Utilising the battery life and the limited bandwidth available in mobile ad hoc networks (MANETs) in the most efficient manner is an important issue, along with providing security at the network layer. The authors propose, design and describe E2-SCAN, an energy-efficient network layered security solution for MANETs, which protects both routing and packet forwarding functionalities in the context of the on demand distance vector protocol. E2-SCAN is an advanced approach that builds on and improves upon some of the state-of-the-art results available in the literature. The proposed E2-SCAN algorithm protects the routing and data forwarding operations through the same reactive approach, as is provided by the SCAN algorithm. It also enhances the security of the network by detecting and reacting to the malicious nodes. In E2-SCAN, the immediate one-hop neighbour nodes collaboratively monitor. E2-SCAN adopts a modified novel credit strategy to decrease its overhead as the time evolves. Through both analysis and simulation results, the authors demonstrate the effectiveness of E2-SCAN over SCAN in a hostile environment.     

Network lifetime-aware data collection in Underwater Sensor Networks for delay-tolerant applications

Development of energy-efficient data collection and routing schemes for Underwater Wireless Sensor Networks (UWSNs) is a challenging issue due to the peculiarities of the underlying physical layer technology. Since the recharging or replacement of sensor nodes is almost impossible after deployment, the critical issue of network lifetime maximization must be considered right from the beginning of designing the routing schemes. We propose a mobile sink (MS)-based data collection scheme that can extend network lifetime, taking into account power-constrained sensor nodes, partitioned networks with geographically distant data collection points and periodic monitoring applications with delay-tolerance. Lifetime extension is achieved by mitigating the ‘sink neighbourhood problem’ and by deferring the data transmissions until the MS is at the most favourable location for data transfer. Unlike the models available for terrestrial WSNs, we consider non-zero travel time of the MS between data collection points, thus making our model more realistic for UWSNs, both connected and partitioned. The performance of the proposed mobility-assisted data collection scheme is thoroughly investigated using both analytical and simulation models. The analytical results are compared to those of existing models to assess their effectiveness and to investigate the trade-offs. Results show that, with a network size of 60 nodes, the network lifetime achieved by the proposed model is 188% higher than that of static sink model and 91% higher than that of mobile sink model (MSM). The proposed maximum lifetime routing scheme is implemented in the network simulation platform OMNET++, for validating the analytical results as well as for evaluating other performance metrics that are not tractable via analytical methods. Both analytical and simulation results demonstrate the superiority of the proposed model in capturing realistic network conditions and providing useful performance indicators prior to network deployment.