移动AdHoc网络退避算法的改进与仿真研究

移动AdHoc网络由于没有固定控制中心,信道访问冲突十分严重,传统有线网络退避算法不适合于无线的移动.为了减少信道访问冲突,提高网络吞吐量,提出一种移动AdHoc网络的退避算法.算法根据网络状态和冲突节点发生情况,对竞争窗口大小分别采用线性、重增长线性和多重下降等方式进行动态调整,改善网络的性能.利用NS2仿真工具对网络退避算法进行了仿真,结果表明,网络退避算法减少网络信道访问冲突发生概率,提高了网络的吞吐量,网络系统性能更好.     

基于GloMoSim的AdHoc网络路由协议仿真研究

针对24台移动终端在无线自组织网络中的联网通信需求,需要选择一种能够适应AdHoc网络拓扑结构不断变化的路由协议。文章对AdHoc网络的路由协议进行了分类和比较,并通过GloMoSim仿真平台,结合具体的网络仿真场景,着重对AdHoc网络中的AODV和DSR两种按需路由协议进行性能仿真测试,比较不同移动速度下两种协议的平均端到端时延、分组投递率和吞吐量性能优劣。实验表明,节点在GloMoSim平台中成功实现了通信互联,无论节点在静止状态还是高速移动情况下,AODV的性能都要优于DSR协议。     

基于节点间信息事件分析的CDMA无线Ad Hoc网络传输性能研究

CDMA无线Ad Hoc网络节点间的并发信息传送所造成的节点间相互干扰是影响网络传输性能的主要因素之一.文中从CDMA无线Ad Hoc网络的节点间的信息流量角度研究了CDMA无线Ad Hoc网络的传输性能和吞吐量性能,以节点间信息事件图为工具研究了节点间干扰对网络传输性能的影响,并证明了节点间信息流量成功传输的一个充分条件,最后对结果进行了仿真并给出了节点间信息流量的一个拟合方程.     

基于NS-2的Ad hoc网络QoS仿真与研究

Ad hoc网络在军事和民用领域具有广阔的应用前景。但由于AdHoc网络复杂的动态特性,对AdHoc网络的QoS研究成为一个核心问题。在对Adhoc网络性能、QoS和NS-2仿真原理分析的基础上,实现了基于NS-2的Adhoc网络仿真平台,借助此仿真平台对丢包率、吞吐量、端到端延迟、延迟抖动等进行了仿真分析。通过综合评价得知,在Adhoc网络节点同时移动的情况下,各项参数受移动切换、节点移动速度及通信范围的影响较大。文中指出Adhoc网络的QoS尚存在诸多不足,有待于进一步的提高。     

面向Ad Hoc网络节点欺骗的网络安全的研究

节点欺骗是无线AdHoc网络最常见的攻击方式之一。该文基于平面结构的AdHoc网络,使用数据挖掘算法来发现无线Adhoc网络中的欺骗节点。该方法简单、有效,在无线Adhoc网络中较容易实现。     

无线Ad Hoc网络中的TCP改进研究综述

通过考虑影响无线AdHoc网络中TCP性能的主要因素,分析和比较现有的改善无线AdHoc网络中TCP性能的方法,将目前的改进方案分为跨层的改进方案和单层的改进方案两类,并详细分析了两者的优缺点,为未来的无线AdHoc网络中TCP传输的研究和应用提出可能的研究方向。     

基于非相干检测的UWB无线传感器网络传输性能

论文首先给出了UWB无线传感器网络体系结构模型,接着利用UWB技术和非相干信号检测技术设计了一个非相干检测UWB传感器接收机。在此基础上,着重研究了UWB无线传感器网络的传输性能。通过仿真发现采用了非相干信号检测技术,对UWB无线传感器网络传输性能的提高具有重要意义。     

面向WSN的单一和多编码方案分析

研究不同速率BCH码情况下提高无线传感器网络吞吐量的方法,给出单一编码方案对网络性能的影响及网络主节点(NM)对网络寿命和吞吐量的影响。仿真结果表明,在传感器和网络主节点(NM)之间、NM和sink之间采用不同速率/编码时,网络吞吐量随BCH编码率的增加而增加,多编码方案能更高效地提高网络吞吐量。     

基于蚁群的AdHoc网络分簇路由算法

无线AdHoc网络是一个多跳、临时性的对等移动自治系统,它由一组带有无线收发装置的移动节点组成。而路由协议是AdHoc网络体系结构中不可或缺的重要组成部分,因此路由协议的研究成为当前AdHoc网络研究的重点。针对AdHoc网络节点能量有限的特性,提出了一种基于分簇及蚁群的组合路由算法（CRBAC）。给出了分簇策略下的簇内簇间路由机制,簇内采用按需路由策略,将改进的蚁群算法应用到簇内路由机制中,通过扩散信息素选择能量高的邻节点均衡网络节点能量,而簇间采用尽可能简单的表驱动路由策略。仿真结果表明,该算法是合理的,不仅有效地减少了端到端时延,而且提高了网络的生存时间。     

移动Ad Hoc网络多播路由协议的研究进展

移动AdHoc网络是一个自组织、移动节点通过无线链路组成的动态拓扑变化的网络.由于网络规模小、无基础设施、构建迅速等特点,从而广泛用于紧急事件、军事和民用领域以及多媒体应用等.随着网络应用规模的增长,在移动AdHoc网络中支持多播路由成为网络领域中一类重要的研究课题.该文综述了移动AdHoc网络多播路由方面的一些最新工作,论述了设计移动AdHoc网络多播路由协议的特性、问题和技术,详细描述和比较了目前典型的移动AdHoc网络多播路由协议,为进一步的应用和研究提出了新的课题.     

基于图形处理器的通用计算模式*

针对GPU图形处理的特点,分析其应用于通用计算的并行处理机制和数据映射,提出了一种GPU通用计算模式的映射机制和一般性设计方法,并针对GPU的吞吐量、数据流处理能力和基本数学运算能力等进行性能测试,为GPU通用计算的算法设计、实现和性能优化提供参考依据。     

LTE-A 异构网络的干扰抑制技术研究

针对传统的干扰协调算法存在着频谱效率不高,吞吐量低等问题,基于LTE-A,提出了一种改进的动态部分频率复用算法.在传统蜂窝网络中引入了低功率节点,与宏蜂窝网络组成异构网络.在改进的算法中,划分了干扰区域,以干扰区域比重为依据对用户进行分组,再为用户分配子信道.同时,建立干扰图,用点着色算法对图中顶点进行着色,再根据着色结果对节点进行分组,依据分组结果使用频谱资源分配算法进行资源分配.实验结果表明,该算法与传统算法相比具有更高的频谱效率,在保证系统的吞吐量的同时提高了用户的信道噪声比SINR.     

基于图着色理论的全双工D2D分簇资源分配方案

全双工通信允许用户同时同频收发信号,将其应用在D2D(Device-to-Device,D2D)通信中虽然可以提高系统吞吐量,但是也带来了更加复杂的干扰关系。为了降低干扰,提升系统吞吐量,本文提出了以簇为单位的资源分配方案。该方案先引入图着色理论为全双工D2D用户进行合理的分簇,然后采用匈牙利算法进行链路资源的分配,从而优化蜂窝系统的性能。仿真结果表明,该方案在提高频谱利用率的同时提升了整个蜂窝网络的系统容量。     

基于二分图的D2D通信资源复用分配算法

为了提升D2D（Device to Device）通信资源复用分配的频谱效率,本文以最大化系统吞吐率为目标建立资源复用模型。同时面对高复杂度的组合优化求解过程,提出一种分布式的资源分配迭代算法,该算法使用二分图建立D2D用户与RB（Resource Block）资源的关系模型。每轮资源分配中,D2D用户根据所在RB资源上的动态干扰环境,自治的竞争RB资源,基站则根据吞吐率增益选举最优的D2D用户分配,避免多对一的RB竞争冲突。仿真实验表明,二分图算法在降低算法复杂度的同时,拥有较优的吞吐率性能优势。     

A Near-Optimal Optimization Algorithm for Link Assignment in Wireless Ad-Hoc Networks

Over the past few years, wireless networking technologies have made vast forays in our daily lives. In wireless ad-hoc networks, links are set up by a number of units without any permanent infrastructures. In this paper, the resource optimization is considered to maximize the network throughput by efficiently using the network capacity, where multi-hop functionality and spatial TDMA （STDMA） access scheme are used. The objective is to find the minimum frame length with given traffic distributions and corresponding routing information. Because of the complex structure of the underlying mathematical problem, previous work and analysis become intractable for networks of realistic sizes. The problem is addressed through mathematical programming approach, the linear integer formulation is developed for optimizing the network throughput, and then the similarity between the original problem and the graph edge coloring problem is shown through the conflict graph concept. A column generation solution is proposed and several enhancements are made in order to fasten its convergence. Numerical results demonstrate that the theoretical limit of the throughput can be efficiently computed for networks of realistic sizes.     

新型互连网络NIN研究

以通信延迟和网络吞吐率这两个重要参数为出发点,以大规模并行处理系统的新型互连网络（ＮＩＮ）进行了理论分析和模拟测试,并与二维网格、环形网以及反图拓扑互连网络进行了比较,结果表明：与其它三种网络相比,ＮＩＮ不仅保持了反图拓扑互连网络可以连接更多处理机的优点,同时还具有较短的通信延迟和较高的网络吞吐率。     

Enhancing throughput for streaming applications running on cluster systems

The exploitation of throughput in a parallel application that processes an input data stream is a difficult challenge. For typical coarse-grain applications, where the computation time of tasks is greater than their communication time, the maximum achievable throughput is determined by the maximum task computation time. Thus, the improvement in throughput above this maximum would eventually require the modification of the source code of the tasks. In this work, we address the improvement of throughput by proposing two task replication methodologies that have the target throughput to be achieved as an input parameter. They proceed by generating a new task graph structure that permits the target throughput to be achieved. The first replication mechanism, named DPRM (Data Parallel Replication Mechanism), exploits the inner task data parallelism. The second mechanism, named TCRM (Task Copy Replication Mechanism), creates new execution paths inside the application task graph structure that allows more than one instance of data to be processed concurrently. We evaluate the effectiveness of these mechanisms with three real applications executed in a cluster system: the MPEG2 video compressor, the IVUS (Intra-Vascular Ultra-Sound) medical image application and the BASIZ (Bright and SAtured Images Zone) video processing application. In all these cases, the obtained throughput was greater after applying the proposed replication mechanism than what the application could provide with the original implementation.     

An effective scheduling scheme for multi-hop multicast in wireless mesh networks

With the utilization of concurrent transmission strategy, a throughput-enhanced scheduling scheme is devised for multicast service in wireless multi-hop mesh networks. Since the performance of a multicast mechanism is constrained in a wireless setting due to the interference among local wireless transmissions, the interference relationships are first characterized by introducing a graph transformation method. Based on the graph transformation, the multicast scheduling problem is converted to the graph coloring problem, and then a capacity greedy algorithm is designed to provide concurrent transmission scheduling so that the demanded multicast transmission rate can be achieved. Moreover, the necessary and sufficient conditions of multicast schedulable feasibility are derived. Through corresponding simulations, it is shown that the proposed strategy can enhance the throughput of wireless multi-hop multicast systems significantly.     

An effective scheduling scheme for multi-hop multicast in wireless mesh networks

With the utilization of concurrent transmission strategy, a throughput-enhanced scheduling scheme is devised for multicast service in wireless multi-hop mesh networks. Since the performance of a multicast mechanism is constrained in a wireless setting due to the interference among local wireless transmissions, the interference relationships are first characterized by introducing a graph transformation method. Based on the graph transformation, the multicast scheduling problem is converted to the graph coloring problem, and then a capacity greedy algorithm is designed to provide concurrent transmission scheduling so that the demanded multicast transmission rate can be achieved. Moreover, the necessary and sufficient conditions of multicast schedulable feasibility are derived. Through corresponding simulations, it is shown that the proposed strategy can enhance the throughput of wireless multi-hop multicast systems significantly.