光RP(k)网络上Hypercube通信模式的波长指派算法

波长指派是光网络设计的基本问题,设计波长指派算法是洞察光网络通信能力的基本方法.基于光RP(k)网络,讨论了其波长指派问题. 含有N=2ⁿ个节点的Hypercube通信模式,构造了节点间的一种排列次序Xn,并设计了RP(k)网络上的波长指派算法.在构造该算法的过程中,得到了在环网络上实现n维Hypercube通信模式的波长指派算法.这两个算法具有较高的嵌入效率.在RP(k)网络上,实现Hypercube通信模式需要max{2,「5(2^n-5/3」}个波长.而在环网络上,实现该通信模式需要复用(N/3+N/12(个波长,比已有算法需要复用「N/3+N/4」个波长有较大的改进.这两个算法对于光网络的设计具有较大的指导价值.     

一种无线传感器网络中的多维K-NN查询优化算法

提出了一种基于过滤器的无线传感器网络多维K-NN查询优化算法PREDICTOR.过滤器是设置在节点端的取值分布区间,用来屏蔽节点发送属于区间内的数据,从而节省节点能耗.在服务器端保存有各节点的历史样本数据,根据K-NN查询请求和样本数据的分布范围为节点定义过滤器.提出了3种优化策略:(1) 过滤器覆盖区间大小分配策略的动态调整方法,使得进入最终查询结果可能性小的节点拥有较大的覆盖区间;(2) 节点间过滤器共享方法,使得历史样本数据相近的节点使用相同的过滤器;(3) 过滤器压缩传输方法,减少为不同K-NN查询更新过滤器的代价.通过实验评价,验证了PREDICTOR算法的能量有效性,与朴素算法相比,极大地降低了数据传输量.     

三维水下传感网相异k-覆盖改进虚拟力算法

水下传感器的覆盖控制研究对于合理分配网络的空间资源,更好地完成环境感知、信息获取任务以及提高网络生存能力都具有重要的意义.实际情况中,水下监测区域往往需要不均匀的覆盖.现有的研究偏重于“事件驱动”概念,但不同区域的不同k-覆盖需求并未得到重视.针对UWSNs 相异k-覆盖需求区域的覆盖优化部署这一研究方向,基于浮标、锚、与浮标通过有线电缆连接通信的水下传感器模型,分析了相异k-覆盖需求区域所需的节点数下限,提出了一种基于相异k-覆盖需求的改进虚拟力算法k-ERVFA(k-equivalent radius virtual force algorithm).仿真实验结果表明,相比经典的虚拟力算法,在相同最大迭代次数和相同节点数的情况下,该算法在牺牲1-覆盖需求区域的1-覆盖率仅1.21%~3.89%的情况下,能够同比提高相应区域的2-、3-覆盖率分别达到17.42%~44.3%和28.95%~49.53%,取得了很好的部署效果,说明了k-ERVFA 算法的正确性与有效性.     

Multi-log2N交换网络的性能分析模型及控制算法

高速多平面交换网络解决了其内部冲突问题,但需要相应的路由控制算法的辅助,否则,内部冲突不能彻底解决.这是因为包在输入级路由平面的选择不够恰当,容易导致路由冲突的产生.因此,根据冲突链路集的思想,给出一种Multi-log₂N交换网络的控制算法.该算法控制分组在路由平面间的选择,不仅能够适用于RNB和SNB,还能实现单播和多播的控制,保障Multi-log₂N完全实现无阻塞.另一方面,Multi-log₂N消除了内部的链路冲突,提高了交换速率,但对其交换性能缺乏系统的理论分析.给出一种基于嵌入式马尔可夫链的分析模型,对Multi-log₂N网络中队列的使用及分组在队列中的平均等待时间、平均队长等相关性能指标进行了系统的分析,为基于Multi-log₂N的光交换节点的设计提供了良好的理论依据.     

无线多接口多信道Mesh网络下多径路由协议分析

针对无线多接口多信道Mesh网络环境,对两种多径路由模型进行比较分析。根据支持多接口多信道的无线设备的特点,提出了一套较为高效的路由方式。该方案从源节点到目的节点利用提出的接口分配策略,从不同的接口和信道建立多条可同时工作的路由和多条不重叠的备份路由以大幅提升网络性能。它充分利用了多接口多信道移动设备的性能优势,更适合Mesh网络的拓扑特点。仿真测试表明,使用该方案,在端到端时延,网络吞吐量等方面提供了更佳的性能。     

无线mesh网络的拓扑控制算法研究

针对无线mesh网络(WMN)中由于无线信号干扰造成的端到端吞吐量并不是很理想的问题,提出了一种通过以最小化最大冲突负载为策略构造无线mesh网络拓扑的拓扑控制算法.在形成网络拓扑之后,算法通过调整节点的传输功率到一个合理水平来降低干扰,从而提高信道的空间复用度以优化网络的吞吐量.最后以最大冲突域负载作为性能指标的仿真结果表明:通过拓扑控制能够提升无线mesh网络的吞吐量.     

基于CSM优先级的CogWMN联合路由与信道分配策略

认知无线Mesh网络(CogWMN)中的节点可以自主切换通信频率。当节点寻找路由和分配信道时,容易出现信道分配的不均衡化。为了提高非授权频段的利用率,发挥多信道并行传输的优势,提出一种在没有全局控制信道条件下的基于信道统计度量(CSM)优先级的联合路由与信道分配策略,以解决信道分配不均衡化问题,使网络内节点能以较少的跳数接入AP。仿真结果表明,所提策略能提高网络吞吐量和减少网络时延。     

无线Mesh网络中一种分布式路由方案

在多射频多信道无线Mesh网络中,链路负载和节点位置的变化将导致网络性能的下降。针对此问题,在混合无线网状路由协议反应式路由基础上,设计了一种新的混合信道分配的分布式路由算法。该算法在路由建立的同时可实现以数据流为单位的最优信道分配,且能避免因单节点失效导致整个网络崩溃的危险。仿真结果表明,提出的RHCA算法较传统算法在网络吞吐量和端到端平均时延方面均有显著优势。另外,在节点移动场景下,所提出的分布式路由算法较其他方法能获得更高的吞吐量和更好的稳健性。     

一种改进的基于最少信道切换的路由算法

在Ad Hoc网络中,如何基于多信道有效地利用网络中的频谱资源,提高网络的性能,已经成为近几年来研究的热点。在DSDV路由协议的基础上,提出了一种基于减少网络中的信道切换的路由算法——OLCH-DSDV,该算法采用最小切换时延的信道分配策略,尽量减少信道切换产生的时延,从而降低了网络时延,提高了吞吐量。该算法要求源节点通过自身维护的路由和信道使用信息,选择到达目的节点的最优路径,也就是需要最少信道切换的路径。仿真结果表明该路由改进算法在有效提高系统吞吐量的同时,也有效地减少了网络中的传输时延。     

多接口多信道MANET下多径路由及接口分配策略

针对多接口多信道MANET网络环境,提出了一种多径路由以及相应的接口分配策略。根据支持多接口多信道的无线设备的特点,给出了一套更为高效的路由模型。该方案从源节点到目的节点利用提出的接口分配策略,从不同的接口和信道建立多条可同时工作的路由和多条不重叠的备份路由以大幅提升网络性能。它充分利用了多接口多信道移动设备的性能优势,更适用于网络拓扑变化剧烈的MANET网络。数学模型分析与网络仿真测试表明,在其他条件相同的情况下,该方案与其他路由协议相比较,在端到端时延、网络吞吐量等方面提供了更佳的性能,且更适应于多接口多信道的MANET网络环境。     

Parallel Lagrange interpolation on <Emphasis Type="Italic">k</Emphasis>-ary <Emphasis Type="Italic">n</Emphasis>-cubes with maximum channel utilization

This paper proposes an efficient parallel algorithm for computing Lagrange interpolation on k-ary n-cube networks. This is done using the fact that a k-ary n-cube can be decomposed into n link-disjoint Hamiltonian cycles. Using these n link-disjoint cycles, we interpolate Lagrange polynomial using full bandwidth of the employed network. Communication in the main phase of the algorithm is based on an all-to-all broadcast algorithm on the n link-disjoint Hamiltonian cycles exploiting all network channels, and thus, resulting in high-efficiency in using network resources. A performance evaluation of the proposed algorithm reveals an optimum speedup for a typical range of system parameters used in current state-of-the-art implementations.

Strongly Hamiltonian laceability of the even k-ary n-cube

The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks can be viewed as the subclasses of the k-ary n-cubes include the cycle, the torus and the hypercube. A bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every two vertices which are in distinct partite sets. A bipartite graph G is strongly Hamiltonian laceable if it is Hamiltonian laceable and there exists a path of length N − 2 joining each pair of vertices in the same partite set, where N = |V(G)|. We prove that the k-ary n-cube is strongly Hamiltonian laceable for k is even and n  2.     

The diagnosability of the k-ary n-cubes using the pessimistic strategy

The pessimistic strategy, also called the t ₁/t ₁-diagnosis strategy, allows to contain all faulty vertices and at most one fault-free vertex. However, the degree of the diagnosability of a system increases quickly using the pessimistic strategy. In this paper, we consider the k-ary n-cube, which is an important hypercube variant, and show that the 3-ary n-cube and k-ary n-cube with k≥4 are (4n?3)/(4n?3)-diagnosable and (4n?2)/(4n?2)-diagnosable, respectively. Finally, we obtain the degree of the diagnosability of the tori using the pessimistic strategy.     

Data Rearrangement between Radix-k and Lee Distance Gray Codes in k-ary n-cubes

The k-ary n-cube is one of the popular topologies for interconnecting processors in multicomputers. This paper studies the difference in communication requirements between two Lee distance Gray codes when moving data from processors in normal radix k order to those in Gray code order in k -ary n-cube networks. Algorithms for k-ary to Gray code conversion, and vice versa, in k-ary n-cube networks are described under various channel constraints, i.e., one-port and all-port communication assumptions. The minimum length path routing algorithm for nonreflective Gray code requires roughly M(k/4) and (n−1) M(k/4) steps for data element transfers under all-port communication and one-port communication, respectively, for M elements per node. It is also shown that using a nonminimum length path routing algorithm, the number of steps for data element transfers can be halved. Lower bounds for the number of element transfers are derived, and the proposed algorithm using nonminimum length paths under one-port communication is shown to be near optimal.     

一种联合多信道分配决策的认知Mesh系统数据传输优化算法

在认知Mesh系统进行数据传输的过程中,为了提高数据包投递成功率及网络的吞吐量,减少网络延迟时间,提出一种联合多信道分配决策的认知Mesh系统数据传输优化算法(JCWN)。针对信道的干扰问题,建立了认知Mesh系统的干扰无向图,分析节点链路的网络干扰电平。在节点的路由请求阶段通过提出基于信道干扰电平的路由指标函数,并通过权重阈值来为节点链路分配干扰较小的信道。在路由选择上,联合多路由算法计算每条路由路径的信道干扰程度,为了保障节点传输数据的成功率而选择干扰程度更小的路由。实验仿真结果表明,在数据包投递成功率上,该算法相比POC算法以及基于RL的算法提高了20%以上,在提高网络吞吐量,减少延迟时间上也表现出了更好地效果。     

The impact of virtual channel allocation on the performance of deterministic wormhole-routed k-ary n-cubes

Virtual channels yield significant improvement in the performance of wormhole-routed networks as they can greatly reduce message blocking over network resources. K-ary n-cubes with deterministic routing have been widely analysed using analytical modelling tools. Most existing models, however, have either entirely ignored the effects of virtual channel multiplexing or have not considered the impact of virtual channels allocation on message latency. This paper discusses two different organisations of virtual channels in k-ary n-cubes, resulting in two deterministic routing algorithms. It then proposes an analytical model to compute message latency for the two routing algorithms. The proposed model is used in a case study to demonstrate the sensitivity of network latency to the way virtual channels are allocated to messages.     

Off-chip communication architectures for high throughput network processors

In this paper, we propose a new interconnection mechanism for network line cards. We project that the packet storage needs for the next-generation networks will be much higher. Such that the number of memory modules required to store the packets will be more than that can be directly connected to the network processor (NPU). In other words, the NPU I/O pins are limited and they do not scale well with the growing number of memory modules and processing elements employed on the network line cards. As a result, we propose to explore more suitable off-chip interconnect and communication mechanisms that will replace the existing systems and that will provide extraordinary high throughput. In particular, we investigate if the packet-switched k-ary n-cube networks can be a solution. To the best of our knowledge, this is the first time, the k-ary n-cube networks are used on a board. We investigate multiple k-ary n-cube based interconnects and include a variation of 2-ary 3-cube interconnect called the 3D-mesh. All of the k-ary n-cube interconnects include multiple, highly efficient techniques to route, switch, and control packet flows in order to minimize congestion spots and packet loss within the interconnects. We explore the tradeoffs between implementation constraints and performance. Performance results show that k-ary n-cube topologies significantly outperform the existing line card interconnects and they are able to sustain higher traffic loads. Furthermore, the 3D-mesh reaches the highest performance results of all interconnects and allows future scalability to adopt more memories and/or processors to increase the line card’s processing power.     

Optical transpose k-ary n-cube networks

This paper derives a number of results related to the topological properties of OTIS k-ary n-cube interconnection networks. The basic topological metrics of size, degree, shortest distance, and diameter are obtained. Then results related to embedding in OTIS k-ary n-cubes of OTIS k-ary (n−1)-cubes, cycles, meshes, cubes, and spanning trees are derived. The OTIS k-ary n-cube is shown to be Hamiltonian. Minimal one-to-one routing and optimal broadcasting algorithms are proposed. The OTIS k-ary n-cube is shown to be maximally fault-tolerant. These results are derived based on known properties of k-ary n-cube networks and general properties of OTIS networks.     

基于ZigBee的无线传感网络Cluster-Tree算法研究

ZigBee技术的无线传感器网络是基于分布式地址分配的一种支持拓扑变化、节点移动的新型无线传感网络,拥有强大的自组网能力。针对ZigBee网络的Cluster-Tree算法对簇首能量要求高及节点间非最佳路由的问题,结合节点能量分析提出新的簇首产生办法,并结合AODVjr算法的思路来寻求节点间的最佳路由。仿真结果表明,改进的算法能够有效地提高数据发送成功率,降低网络中的死亡节点数,减小端到端的报文传输时延,提高网络的使用价值。     

无线Mesh 网络低干扰组播

不同于无线传感器网络和移动Ad Hoc网络,无线Mesh网络中的组播主要侧重于提高吞吐量,而干扰是影响吞吐量的重要因素。在构建组播拓扑时,传统的方法主要考虑最小价值或最短路径,而通过减少干扰来提高组播性能的研究较少,且它们的干扰计算方法都采用单播的思想,并不适合于组播。例如,当n个接收节点同时从一个节点接收数据时,在组播中这n个接收节点之间不存在干扰,而在单播中认为存在干扰。因此,提出了组播冲突图来计算组播干扰,给出组播树干扰的定义。可以发现,求最小干扰组播扰树是NP完全问题,然后提出基于万有引力的启发式算法构建具有较小干扰的组播树。为了适用于多信道的情况,提出了满足不同干扰范围的多跳信道分配算法。最后,仿真结果显示,与MCM相比,所提出的算法无论是在单天线单信道还是多天线多信道下,都能取得较高的吞吐量和较低的延迟。