抗毁式移动无线路由协议的研究

研究和实现在移动分组无线网中的抗毁式路由协议 .基于链路 -状态算法 ,采用距离 -矢量算法的传播方法和全局的路由拓扑表 ,实现了移动分组无线网的抗毁式路由协议 .协议的实现充分考虑了无线信道的有限带宽和移动性 ,提高了网络性能和抗毁性 .此无线路由协议适用于移动分组无线网的抗毁性要求 .

一种无线传感器网络可靠拓扑的生成算法

在无线传感器网络(WSNs)的应用中,网络中的节点需要将采集到的数据信息传送到汇聚节点,其信息传输的可靠性是十分重要的。然而,由于无线通信信道容易受到干扰和噪音的影响,极限情况时甚至可能造成数据传输失败,这对无线传感器网络的正常工作提出了极大挑战。针对上述问题,提出一种可靠拓扑的生成算法,通过该算法设计了一组可靠的路由拓扑,并通过仿真验证了其可靠性。

低压配电网的开放式能源路由网络

针对低压配电网内能源路由网络的访问管理与能耗问题,设计了一种低压能量路由器,并通过ER的不同互联模式为低压配电网设计了串联和星形两种路由网络拓扑结构.在此基础上,建立了路由矩阵以及相关的应用程序,通过单个ER串联和星形能源路由网络来实现电源管理.仿真实验表明,利用单个ER,串联和星形路由网络可以实现低压配电网中电力设备的开放接入与网络交互管理,同时还能够实现局域网中的电力平衡.

基于路由的网络流量监测系统设计与实现

介绍了一种基于路由的流量监测方法,采用监测分析路由协议和简单网络管理协议(SNMP)轮询的方式获取网络路由拓扑结构,提示网络变化事件,在获取的网络拓扑结构上利用Net Flow技术映射网络数据流量,显示流量分布数据,为流量类型分析和网络带宽占用分析提供数据支撑,为优化网络性能提供依据。该方法实现的系统在实际网络中经过长期测试和验证,试验结果表明系统运行稳定、能够监测网络变化事件和网络流量,并可对网络流量进行分析和统计,达到了监测网络流量的目的。

无线传感器网络拓扑控制分析

无线传感器网络的拓扑控制对网络的性能有很大影响。拓扑控制的目标是用最小的能量维持网络拓扑。目前,对拓扑控制算法的研究主要分为集中式和分布式两种。文章简要介绍了无线传感器网络中拓扑控制研究的意义,总结了无线传感器网络的拓扑结构及现有的一些拓扑控制算法,最后探讨了存在的问题和今后的发展方向。

虚拟蜜罐系统的设计

根据虚拟蜜罐框架Honeyd的体系结构、模拟路由拓扑、配置命令及日志功能,设计了虚拟蜜罐系统HoneypotV,并将其部署在实际网络环境中。该系统通过模拟操作系统的TCP/IP栈建立蜜罐,采用与Nmap或Xprobe相同指纹的数据库模拟操作系统,以响应针对虚拟蜜罐的网络请求。可实现欺骗和诱骗、行为控制、入侵检测、被动探测和数据分析等几项功能,实验证实达到预期的目标。

虚拟蜜罐Honeyd的分析和研究

介绍一个新的主动型的网络安全系统——蜜罐,详细描述网络层次上的模拟计算机系统的虚拟蜜罐框架Honeyd,讨论了Honeyd的原理、结构、特点、设计和实现,并对它的功能作了全面的测试评估。

虚拟蜜罐的探索与研究

随着网络入侵事件的增加和黑客攻击水平的提高,网络安全问题日趋严重。为了有效的解决新型的网络安全威胁,本文介绍一个新型网络安全防御系统—虚拟蜜罐。文章首先讲述蜜罐的定义、分类、虚拟蜜罐的结构、路由拓扑,并对其进行测试和总结。

3-D SPIDERGON:3-D TOPOLOGY OF DELAY OPTIMIZATION FOR NETWORKS-ON-CHIP

A 3-D topology architeeture based on Spidergon and its generation method are proposed. Aiming at establishing relationships between the topology architecture and the latency, the 3-D topology latency model based on prototype is proposed, and then the optimization topology structure with minimum latency is determined based on it. Meanwhile, in accordance with the structure, the adaptive routing algorithm is designed. The algorithm sets longitudinal direction priority to adaptively searching the equivalent minimum path between the source nodes and the destination nodes in order to increase network throughput. Simulation shows that in case of approximate saturation network, compared with the same scale 3-D mesh structure, 3-D Spidergon has 17% less latency and 16.7% more network throughput.

TaChord: a Chord system using topology-aware routing and super peers

Due to minimum consideration of an actual network topology, the existing peer-to-peer (P2P) overlay networks, such as CAN, Chord, Pastry and Tapestry, will lead to high latency and low efficiency. In TaChord, a topology-aware routing approach in P2P overlays and an improved design in Chord are presented. TaChord and other algorithms are evaluated by physical hops, interdomain-adjusted latency, and aggregate bandwidth used per message. Experimental results demonstrate that TaChord has the drastic improvement in routing performance where average physical hop is half that of chord, and the impact of cache management strategies in the TaChord overlay cannot be neglected.

MULTI-CLASS TRAFFIC QOS ROUTING FOR LEO SATELLITE NETWORKS

Due to the diversified demands of quality of service（QoS） in volume multimedia application, QoS routings for multiservice are becoming a research hotspot in low earth orbit（LEO） satellite networks. A novel QoS satellite routing algorithm for multi-class traffic is proposed. The goal of the routing algorithm is to provide the distinct QoS for different traffic classes and improve the utilization of network resources. Traffic is classified into three classes and allocated priorities based on their QoS requirements, respectively. A priority queuing mechanism guarantees the algorithm to work better for high-priority classes. In order to control the congestion, a blocking probability analysis model is built up based on the Markov process theory. Finally, according to the classification link-cost metrics, routings for different classes are calculated with the distinct QoS requirments and the status of network resource. Simulations verify the performance of the routing algorithm at different time and in different regions, and results demonstrate that the algorithm has great advantages in terms of the average delay and the blocking probability. Meanwhile, the robustness issue is also discussed.

A scalable topology aggregation algorithm for QoS routing in hierarchical networks

Topology aggregation is necessary for scalable QoS routing mechanisms. Thekey issue is how to gain good performance while summarizing the topological information. In thispaper, we propose a new method to describe the logical link, which is simple and effective innetwork with additive and constrained concave parameters. We extend the method to network associatedwith multi-parameters. Furthermore, we propose a modified star aggregation algorithm. Simulationsare used to evaluate the performance. The results show that our algorithm is relatively good.

TCAR: A new network coding-aware routing mechanism based on local topology detection

Recent researches show that inter-session network coding could decrease the number of packets transmission and achieve higher throughput in wireless network compared with traditional forwarding mechanism. In most existing relay mechanisms based on inter-session network such as COPE, relay node demands to collect the messages from its neighbor nodes to get notice of which packets already overheard by them so as to determine whether there exists coding opportunity between or among forwarding packets. However, transmission overhead of this message collection and computing cost of opportunity determination will degrade the performance of these mechanisms. It is observed that coding opportunity at relay node is much more related with the local topology, and the opportunity of encoding three or more packets together is far less than that of encoding two packets together in wireless network with general density. Based on this, a new coding-aware routing mechanism, named TCAR, is proposed. TCAR ignores the oppommity of encoding three or more than three packets together. Each relay node maintains an encoding mapping table being established according to the result of its local topology detection, which can be used to calculate the path cost during routing setup phase, and determine that which two packets can be encoded together during the packets forwarding phase. In TCAR, instead of periodic messages collection, each relay nodes just need once local topology detection, and the encoding determination is much simpler than that of the former mechanisms. Simulation results show that compared with typical inter-session network coding mechanisms COPE and COPE-based routing, TCAR achieves 12% and 7% throughput gains, and keeps the minimum end to end delay.

Geometric Name Routing for ICN in Dynamic World

A new paradigm of scalable routing for ICN is to combine a geometric routing scheme with a Distributed Hash Table. However, for most routing schemes in this paradigm, when a node joins or leaves, large numbers of nodes, even the whole topology, need to be re-embedded, and a great number of contents need to be re-registered. In this paper, we propose D-Griffin, a geometric routing scheme on flat names for dynamic topologies. D-Griffin provides two advantages. First, it avoids re-embedding the topology by using an online greedy embedding scheme and a void handling greedy forwarding scheme. Second, it decreases the number of re-registrations by using a name mapping scheme with a tradeoff between topology independence and load balancing. Theoretical and experimental analyses show that D-Griffin provides guaranteed content lookup, low description complexity, low path stretch, scalable routing update, and acceptable load balancing.

Topology Discovery Sub-Layer for Integrated Terrestrial-Satellite Network Routing Schemes

With the booming development of terrestrial network, scaling terrestrial network over satellite network to build Integrated Terrestrial-Satellite Network(ITSN) and meanwhile to provide the global Internet access, has become ever more attractive. Naturally, the widely and successfully used terrestrial routing protocols are the promising protocols to integrate the terrestrial and satellite networks. However, the terrestrial routing protocols, which rely on propagating routing messages to discover New Network Topology(NNT) in the terrestrial network with rare topology changes, will suffer from overly numerous routing messages in satellite network whose topology frequently changes as satellites move. In this paper, a Topology Discovery Sub-layer for ITSN Routing Schemes(TDS-IRS) is firstly proposed to avoid the propagation of numerous routing messages by taking advantage of the movement predictability of satellite and the requirements of routing schemes to discover NNT in advance of topology change. Secondly, a Weighted Perfect Matching based Topology Discovery(WPM-TD) model is designed to conduct the NNT discovery on the ground. Thirdly, this paper builds a testbed with real network devices and meanwhile interconnect that testbed with real Internet, to validate that RS-TDS can discover NNT immediately with the less on-board overhead compared with optimized routing schemes. Finally, different network scenarios are applied to validate the WPM-TD, i.e., the core module of TDS-IRS. Extensive experiments show WPM-TD can work efficiently, avoiding the invalid NNT discovery and decreasing 20% ~ 57% of potential topology changes, which can also improve up to 47% ~ 105% of network throughput.

A distributed routing algorithm based-on simplified topology in LEO satellite networks

In this paper, a distributed muting strategy based on simplified topology （DRBST） was proposed for LEO satellite networks. The topology of LEO satellite networks was simplified aiming at minimizing intersatellite links handover number. To optimize the route based on the simplified topology, we considered not only the transmission delay but also the queuing delay and the processing delay, which were analyzed using Markov chain and determined using a novel methodology. The DRBST algorithm was simulated in a LEO satellite networks model built using OPNET. The simulation results demonstrate that the low complexity DRBST algorithm can guarantee end-to-end delay bound. Moreover, the muting protocol cost is much less than traditional algorithms.

Topology aggregation with multiple QoS parametersfor scalable routing problem

In this paper, we investigate the problem of topology aggregation in QoS-based routing. We propose a new algorithm to perform full-mesh and modified-star aggregation, which is simple and effective in a network with additive and concave parameters constrained. The time complexity is O(b^2), where b is the number of border nodes. We extend the algorithm to topology aggregation with multi-parameters constrained. The simulation results show that our algorithm has very good performance in terms of success ratio.

An adaptive routing protocol based on relative positions in VANETs

After presenting weaknesses of several classic routing protocols applied in vehicular ad hoc networks （VANETs） by a qualitative comparison, this paper proposes a novel self-adaptive routing protocol, named ARPP. With respect to the specific characteristics of VANETs, the proposed routing protocol adopts a dynamic topology establishment and time-varying control message sending mechanism. A direction-based forwarding strategy and a specific warning solution enhance the routing performance in ARPP. Simulation results show that the ARPP protocol outperforms the classic AODV in urban vehicle environment.

AODV-Deleting Path with Bad Broken Index

In recent years, the development of mobile equipment makes the topology of the network to change rapidly. So that its routing problem an important research subject accordingly. In all the proposed protocols, the Ad Hoc On-demand Distance Vector Routing Protocol（AODV） is applied to most wireless environments. With it, the shortest path from the source to destination node is chosen by the metric of hop counts. However, the chosen path with this metric may not be a stable one. With the research of predecessors, the Link Available Time（LAT ） can be calculated by the strength of received signal and may be regarded as another usable routing metric. Based on that, the authors develop a protocol named AODV-Deleting Path with Bad Broken Index （AODV-DPWBB） and discuss all the logicality of it. The simulation is done for two contention modes in several node speeds with discussion followed. The simulation result shows better throughput, and end-to-end delay can be obtained comparing the original AODV with metric of hop-count.

虚拟蜜罐Honeyd的分析和研究

该文介绍一个新的主动型的网络安全系统-蜜罐。首先给出了蜜罐的定义和分类,然后详细描述了一个网络层次上的模拟计算机系统的虚拟蜜罐框架Honeyd,讨论了Honeyd的原理、结构、特点、设计和实现,并对它的功能作了全面的测试评估。