一种基于内容的双向共享组播路由协议

针对组播协议在大规模分布式交互系统应用中面临的可扩展性问题,提出一种基于内容的双向共享组播路由协议CBSMRP(content-based bi-directional shared multicast routing protocol).该协议结合运用了主动路由思想和基于内容的发布-订购模式,在基于CBT(core-based tree)结构的双向共享组播树中,根据数据包的内容实现主动路由和双向过滤,不仅解决了组播地址的维护和分配等问题,而且能够有效地减轻系统的网络负载.仿真实验及实际应用表明,该协议具有较好的扩展性,能够满足大规模分布式交互系统的网络通信要求.     

移动自组网安全技术研究

移动Ad Hoc网络由于其动态拓扑和无线通信等特点,容易受到安全威胁.将现有的移动Ad Hoc网络的网络安全技术分为入侵检测与防范、安全路由协议技术、架构模型技术、密钥技术和其他技术.其中,入侵检测与防范主要基于移动Ad Hoc网络的特点,在一定教学模型的基础上对于网络节点的行为进行分析和监测,以保证整个移动网络的网络安全.安全路由协议技术包括全新的安全路由协议技术和现有路由协议的安全化改进技术.密钥技术主要是基于移动Ad Hoc网络的特点对现有密钥技术进行改造.对上述移动Ad Hoc网络的网络安全技术分别进行了介绍和分析.     

煤矿井下ZigBee无线传感器网络路由协议的研究

文章介绍了无线传感器网络的发展及其特点,在分析比较了目前流行的几种无线传感器网络路由协议的基础上,结合煤矿井下掘进工作面的特点和需求,提出了一种适用于掘进工作面的网状拓扑结构的ZigBee无线传感器网络的路由算法,并从路由建立、路由维护、路由恢复等方面进行了详细描述。该路由算法对其它具有ZigBee网状拓扑结构的系统具有一定的参考价值。     

Degree-Optimal Routing for P2P Systems

We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency of randomized networks—e.g. optimal average path length O(log ² n/δlog δ) with δ degree—with the programmability and startup efficiency of a uniform overlay—that is, a deterministic system in which the overlay network is transitive and greedy routing is optimal. It is known that Ω(log n) is a lower bound on the average path length for uniform overlays with O(log n) degree (Xu et al., IEEE J. Sel. Areas Commun. 22(1), 151–163, 2004). Our work is inspired by neighbor-of-neighbor (NoN) routing, a recently introduced variation of greedy routing that allows us to achieve optimal average path length in randomized networks. The advantage of our proposal is that of allowing the NoN technique to be implemented without adding any overhead to the corresponding deterministic network. We propose a family of networks parameterized with a positive integer c which measures the amount of randomness that is used. By varying the value c, the system goes from the deterministic case (c=1) to an “almost uniform” system. Increasing c to relatively low values allows for routing with asymptotically optimal average path length while retaining most of the advantages of a uniform system, such as easy programmability and quick bootstrap of the nodes entering the system. We also provide a matching lower bound for the average path length of the routing schemes for any c. This work was partially supported by the Italian FIRB project “WEB-MINDS” (Wide-scalE, Broadband MIddleware for Network Distributed Services), .     

基于ROI多特征和相关反馈的图像检索算法

本文提出了一种基于感兴趣区域(ROI)综合多特征和相关反馈的图像检索算法.在对图像进行四叉树分解的基础上,由用户选择感兴趣区域,综合颜色、纹理和形状三种底层特征进行多层感兴趣区域检索;由相关反馈技术体现用户感知的主观性,通过调整感兴趣区域、特征问、特征内的权重来提高查准率.给出了改进的CBIR通用模型和特征权重模型.实现了一个图像检索原型系统,将不同实验结果进行了比较和分析,实验结果表明,该文提出的方法具有良好的检索效果.     

基于延迟合并嵌入的带障碍的时钟树布线算法

提出一种在带障碍情况下,基于延迟合并嵌入方法的时钟树构建算法,并在时钟树构造过程中引入了轨迹图以保证布线可以绕过障碍．该算法以已知障碍为布线约束,首先自底向上计算时钟树内部节点的可能位置,然后自顶向下确定每个节点的确切位置．实验结果表明,该算法能够正确、有效地实现有障碍存在时的时钟树布线,线长优化率超过7％．     

无线传感器网络路由协议及安全问题研究

无线传感器网络在军事和民用领域得到广泛的应用。由于传感器节点的资源有限以及通信的开放性使得其安全性显得尤为重要。出于对能量消耗的考虑,目前的路由协议设计得比较简单,作者对路由的安全性能以及可能受到的攻击进行分析,并给出相应的防范对策。     

Efficient realization of frequently used bijections on cube-connected cycles

CCC has lower hardware complexity than hypercube and is suited for current VLSI technology.LC-permutations are a large set of important permutations frequently used in various parallel computations.Existing routing algorithms for CCC cannot realize LC-permutations without network conflict.We present an algorithm to realize LC-permutations on CCC.The algorithm consists of two periods of inter-cycle transmissions and one period of inner-cycle transmissions.In the inter-cycle transmissions the dimensional links of CCC are used in a “pipeline” manner and in the inner-cycle transmissions the data packets are sorted by a part of its destination address.The algorithm is fast (O(log2N)) and no conflict will occur.     

Multi-objective routing algorithms for low-earth orbit satellite network

The low-earth orbit (LEO) satellite network, composed of a large number of satellite nodes, is a hot research topic at present. Due to the characteristics of the large-scale LEO satellite network, such as many satellite nodes, short orbit period, large dynamic change of topology, and unstable link-state, its communication quality of service (QoS) requirements are difficult to meet. Aiming at this problem, various factors that may affect data transmission are first analyzed. The network link selection problem is modeled as a multi-constraint optimization decision problem, a routing mathematical model based on linear programming (LP) is designed, and its solution is solved. Aiming at the problem of limited onboard computing resources, a multi-object optimization Dijkstra algorithm (MOODA) is designed. The MOODA finds the optimal path according to the comprehensive performance of the link. It solves the problems of poor comprehensive QoS performance and the low degree of load balancing of the paths found by the Dijkstra algorithm. The simulation results show that the paths found by the two algorithms have good QoS, robustness, and load balancing performance.     

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.