Two Bandwidth Packing Algorithms for the Centralized Wireless Network and Their Average-case Analysis

This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can be satisfied only if there is sufficient bandwidth available during resource scheduling and allocation. Unsatisfied requests were held in a queue. The metric of bandwidth utilization ratio was used to quantify the performance of our algorithms. By theoretical analysis, our algorithms can improve the average bandwidth usage ratio significantly, about 8%~10% without adding much computation complexity. Moreover, our algorithms outperform next fit with fragmentation (NFF) algorithm when the bandwidth resource is scarce. In this paper, the contributions follows: Introducing bandwidth packing problem into wireless network; Proposing two new bandwidth packing algorithms for wireless network where the complicate scheduling algorithms are prohibited; Studying the average performance of our algorithms mathematically, which agree well with the simulation results.     

Hardware architecture design of block-matching and 3D-filtering denoising algorithm

Block-matching and 3D-filtering(BM3D) is a state of the art denoising algorithm for image/video,which takes full advantages of the spatial correlation and the temporal correlation of the video. The algorithm performance comes at the price of more similar blocks finding and filtering which bring high computation and memory access. Area, memory bandwidth and computation are the major bottlenecks to design a feasible architecture because of large frame size and search range. In this paper, we introduce a novel structure to increase data reuse rate and reduce the internal static-random-access-memory(SRAM) memory. Our target is to design a phase alternating line(PAL) or real-time processing chip of BM3 D. We propose an application specific integrated circuit(ASIC) architecture of BM3 D for a 720 × 576 BT656 PAL format. The feature of the chip is with 100 MHz system frequency and a 166-MHz 32-bit double data rate(DDR). When noise is σ = 25, we successfully realize real-time denoising and achieve about 10 d B peak signal to noise ratio(PSNR) advance just by one iteration of the BM3 D algorithm.     

Switching between antenna subset selection and quasi-orthogonal space-time block code in presence of correlation

We address the problem of adaptive modulation and coding scheme (AMCS) for a multi-input multioutput (MIMO) system in presence of time-varying transmitting correlation. Antenna subset selection and quasiorthogonal space-time block code (QOSTBC) have different error performances with different signal-to-noise ratios (SNRs) and in different spatial correlation scenarios. The error performance can be improved by selecting an appropriate transmission scheme to adapt to various channel conditions. The maximum distance criterion is the simplest and very effective algorithm for the antenna subset selection without needs of complex calculation and channel state information at transmitter (CSIT). The minimum error performance criteria and the simplified linear decision strategy are developed for constant transmission rate traffic to select the optimal transmission scheme. It can dramatically decrease algorithm complexity for obtaining error probability according to the known quantities comparing with using instant CSIT. Simulation results show that, remarkable performances including low SNR and weak spatial correlation at the expense of simple calculation and almost no bandwidth loss by adopting AMCS can be achieved. The proposed AMCS improves robustness of slowly varying spatial correlated channels.     

基于定长帧的组播QoS路由技术

为高效利用网络资源且平衡负载,结合物理帧时槽交换技术,提出了基于定长帧的组播机制和QoS路由算法MRBP.该算法在满足带宽和时延要求的基础上,最小化时延和平衡节点负载,达到组播树总体时延较小并优化利用网络资源的目的.仿真结果表明,基于该算法建立的组播树具有较好的网络负载平衡性,并能够对服务质量提供较好的保证.     

基于改进AOE网络的低频浮动车数据地图匹配算法

由于低频浮动车数据时间间隔较长,现有地图匹配方法难以满足低频浮动车数据地图匹配的要求.综合考虑浮动车数据轨迹点之间的整体特性,在局部和全局地图匹配算法的基础上,提出了一种基于改进AOE网络的低频浮动车数据地图匹配方法.首先,采用相交分析判断GPS点缓冲区和候选路段的关系,以获取候选路段和候选匹配点;其次,基于四叉树空间索引和Dijkstra算法,获取候选匹配点之间的最短路径;第三,设计了一种改进AOE网络,提出了基于改进AOE网络的最短可达路径算法,以获取最终的地图匹配点;最后,对改进AOE网络的地图匹配算法进行评价,并通过实验分析了算法的时间效率和正确率.实验结果表明:基于改进AOE网络的地图匹配算法正确率为95.3%,程序执行总时间为96.8 s. 其正确率分别比点到线的局部地图匹配方法和基于弱Frchet距离的全局地图匹配方法的正确率高13.6%和2.8%.      

OFDM System Channel Estimation with Hidden Pilot

Channel estimation using pilot is common used in OFDM system.The pilot is usually time division multiplexed with the informative sequence.One of the main drawbacks is bandwidth losing.In this paper,a new method was proposed to perform channel estimation in OFDM system.The pilot is arithmetically added to the output of OFDM modulator.Receiver uses the hidden pilot to get an accurate estimation of the channel.Then pilot is removed after channel estimation.The Cramer-Rao lower bound for this method was deprived.The performance of the algorithm is then shown.Compared with traditional methods,the proposed algorithm increases the bandwidth efficiency dramatically.     

基于移动Agent的MANET多约束QoS路由算法

针对节点能量和可用带宽2个约束条件的问题,提出了一种基于移动Agent的QoS路由算法.该算法利用移动Agent采集网络中各节点的详细信息,以最大链路的生存时间作为选择路由的基础,增强了路径的稳定性;采用多路径策略,以缩短路由重构的时间;优先选择剩余能量多的节点,延长了网络的生存时间.利用网络仿真工具NS2进行的仿真实验结果证明,与AODV协议相比,该算法具有较高的包传输率和较低的端到端平均延时.     

面向单向交通路网的绿波协调设计方法

为提高单向交通路网运行效率,本文提出了一种单向交通路网绿波协调控制方法。首先, 分析不同类型的单行环路特征,考虑行人专用相位,建立单行环路中的路段行驶时间与交叉口信 号配时参数之间的约束关系,推导环路偏移绿信比的计算公式,以所有路段平均偏移绿信比最小 作为优化目标,给出最佳公共信号周期优化算法;然后,分析环路偏移绿信比与各路段偏移绿灯 时间的关系,根据约束关系将各个最小环路的偏移绿信比分配到环路上的单向路段,推导绿波带 宽大小计算方法;随后,以单向交通路网平均带宽占比最大为目标优化交叉口绿信比,给出交叉 口相位差计算方法,实现单向交通路网信号协调控制方案的优化求解;最后,以一个3×3的单向交 通路网为例进行案例分析,结果表明：利用本文方法求得的信号配时方案可以获得明显的绿波效 果,能够使所有交叉口的带宽占比均在70%以上,总体绿波效果优于SYNCHRO方案。针对未饱 和状态下的3种不同流量输入条件,利用VISSIM仿真实验,发现与SYNCHRO方案相比,本文提 出方案的路网直行车辆平均延误时间分别降低了9.0%、16.4%、26.1%,平均停车次数分别降低了 31.2%、48.8%、41.6%,路网的服务水平明显提升,有效验证了本文方法的可行性与优越性。     

A novel vertical handoff algorithm based on fuzzy logic in aid of grey prediction theory in wireless heterogeneous networks

To coordinate the various access technologies in the 4G communication system, intelligent vertical handoff algorithms are required. This paper mainly deals with a novel vertical handoff decision algorithm based on fuzzy logic with the aid of grey theory and dynamic weights adaptation. The grey prediction theory (GPT) takes 4 sampled received signal strengths as input parameters, and calculates the predicted received signal strength in order to reduce the call dropping probability. The fuzzy logic theory based quantitative decision algorithm takes 3 quality of service (QoS) metric, received signal strength (RSS), available bandwidth (BW), and monetary cost (MC) of candidate networks as input parameters. The weight of each QoS metrics is adjusted along with the networks changing to trace the network condition. The final optimized vertical handoff decision is made by comparing the quantitative decision values of the candidate networks. Simulation results demonstrate that the proposed algorithm provides high performance in heterogeneous as well as homogeneous network environments.     

Traffic Scheduling in WDM Passive Optical Network with Delay Guarantee

IntroductionWDM passive optical network (PON) is an at-tractive solution for future broadband access net-work in that it offers the potential of large capaci-ty, network security and data transparency[1]WDM PON connects the optical line terminal( OLT ) with multiple optical network units(ONU) through a splitter. The OLT has an arrayof m fixed-tuned transceivers, each tuned to a dif-ferent wavelength. Each ONU is equipped withone fixed transmitter (control channel) and onetunable trans…     

一种基于二叉树的P2P网络查找算法

针对P2P网络中资源查找以及其自身存在的问题,提出了一种基于二叉树的P2P网络模型。该模型借鉴了可信计算中的直接匿名认证机制、DHT、超级节点的思想,在此基础上设计了一种高效的可扩展查找算法,解决P2P网络查询延迟、冗余信息、可扩展性等关键问题。模拟实验表明,该算法能够有效减少网络带宽消耗并能显著提升P2P网络的查找效率。     

基于NS-2软件的网络仿真设计与分析

网络仿真技术已成为研究网络性能、设计网络方案所不可缺少的工具。NS-2是一个面向对象的离散事件驱动的仿真软件,文中介绍了它的体系结构、仿真设计方法,并用多播通信的仿真实例,探讨了它在网络的分析、设计和优化等方面的作用。     

轨道交通中异构智融车载网络发展综述

从蜂窝无线接入技术、非蜂窝无线接入技术、异构智融车载网络接入技术三方面，分析了国内外轨道交通车载网络的研究现状；针对非蜂窝无线接入技术和蜂窝无线接入技术的问题，阐述了协同利用轨道交通周边异构无线资源进行网络融合、协同通信的优越性；从网络模型、网络架构两方面论述了异构智融车载网络的融合方案；结合智能轨道交通业务需求，从可靠性和资源利用率两方面对现有的异构智融车载网络研究进行了系统性的归类梳理；从人工智能、安全性和云边结合三方面提出未来异构智融车载网络的发展趋势。研究结果表明:异构智融车载网络可靠性分为网络架构的可靠性和数据传输的可靠性，其中在网络架构可靠性方面，主要研究了通过冗余网络架构、车云传输架构、软件定义网络构架和智慧协同网络架构4种方式提升可靠性，在数据传输可靠性方面，主要研究了通过多路径传输、网络编码和切换算法降低传输过程中的丢包率；异构智融车载网络资源利用率分为无线接入的资源利用率和链路调度的资源利用率，其中在无线接入资源利用率方面，主要通过信道状态预测、频谱划分、频移补偿3种方式增加网络吞吐量，提高资源利用率，在链路调度的资源利用率方面，主要通过调度算法、接收缓存算法和拥塞控制算法来减少异构链路对数据传输的影响，降低数据重传次数，提高网络资源利用率。      

NEURAL NETWORK TRAINING WITH PARALLEL PARTICLE SWARM OPTIMIZER

Feed forward neural net works such as multi-layer perceptron,radial basis function neural net-works,have been widely applied to classification,function approxi mation and data mining.Evolu-tionary computation has been explored to train neu-ral net works as a very promising and competitive al-ternative learning method,because it has potentialto produce global mini mum in the weight space.Recently,an emerging evolutionary computationtechnique,Particle Swar m Opti mization(PSO)be-comes a hot to…     

基于Oracle Spatial的城市公交网络出行路径选择算法

基于对象-关系模型数据库设计了公交网络空间数据表结构和求解公交出行路径选择的计算机算法,并采用Oracle Spatial组件中的空间操作存储过程、函数及操作算子实现了求解大规模公交网络出行路径选择方案的算法.在兰州市部分公交线路的实例应用中,计算机算法以毫秒时间为度量单位完成了出行方案的查询.     

基于多核处理器的高性能IPSec软件架构的研究

随着网络的发展,高性能的安全应用在构建未来网络系统中发挥着越来越重要的作用;同时,基于网络处理器成功构建一个安全网络系统的关键,在于网络处理器软件系统的设计与开发,其核心问题就是要安全软件系统充分发挥网络处理器灵活性和高性能的特点.针对目前最为先进的OCTEON基于M IPS64的多核处理器,结合多核技术设计了高性能的IPSec软件架构并进行验证,给出了基于选定硬件平台上的IPSec的测试方案和性能数据.     

基于加权密集连接卷积网络的快速交通标志检测

为提高算法对交通标志快速定位的准确性,改善现有检测算法在复杂交通环境下检测效果不佳、实时性较差的问题,提出一种基于动态加权密集连接卷积网络的交通标志快速检测算法. 选用YOLOv2 作为基础网络,通过增加动态加权密集块对各层特征图的权重进行调节,实现深层高语义信息和浅层低语义信息的融合;使用MobileNet 轻量化网络结构,通过可分离卷积操作有效降低网络的计算成本;针对池化操作中图像特征丢失严重问题引入 CBAM模块,利用通道注意力和空间注意力信息增强关键特征的表达能力. 实验结果表明,本文算法在GTSDB数据集上分别达到了96.14%的检测精度和139 frame/s 的检测速度,在保证较高检测精度的同时,能够有效提高检测效率,满足实时检测要求.     

基于交通流时间序列相似性的NCut城市路网分区算法

针对大规模城市道路交通路网分区的实际需求,基于可反映时间序列变化趋势的皮尔逊相关系数和度量空间关系的欧式距离,构建了一种衡量交通流时间序列相似性的综合指标; 结合交通流时间序列的时空相似性特点,引入子区内的空间连通约束,利用归一化割(NCut)算法设计了一种改进的路网静态分区算法; 为体现交通路网分区的时变特征,选取了合适的评价指标来确定每一时间段内合理的分区数量,提出了一种基于时间序列的NCut路网动态分区算法; 利用北京市东北二环区域内采集的路段交通流速度数据,应用所设计的算法对7.23 km2的路网进行分区,对比了晚高峰时期的分区效果。研究结果表明:所提出的分区算法能实现对路网内不同区域交通状况的有效识别,以30 min为间隔的动态分区算法能划分出数量和范围随时间变化的多个可变子区域; 与子区数固定为2、3、4、5的静态分区算法相比,动态分区算法的评价指标分别提升了63.77%、50.06%、6.43%和7.13%,提高了路网分区效果。可见,本文提出的动态分区算法在保证子区内部连通性的基础上可将异质路网划分成多个内部同质子区域,并充分体现交通流动态演化的时空特性,有利于制定动态的多区域边界控制方案。      

无线传感器网络多路径路由算法的研究

在多路径路由算法的研究中,仍然存在着一定的局限性,如没有充分考虑网络中链路的多重特性.因此,文中在定向扩散路由算法的基础上提出了一种多路径路由算法(EDB-MRA).该算法在源节点和目的节点之间建立多条路径,根据网络链路中的3个特征值--能量消耗、延时和带宽,给每条路径赋予一定的选择概率,使得数据总能在链路性能较优的多路径中传输,从而延长了网络的生存周期,提高了传输的可靠性.     

基于多层复杂网络的物流枢纽城市多尺度分析及发育评价

多层网络(Multilayer Network)是国际研究领域正在兴起的概念,着眼于以不同准则叠加聚合的互补性网络的系统特征和影响力.以全球物流枢纽城市为研究对象,在构建海运、空运、物流企业组织及国际贸易网络的基础上,借助Gephi分析工具,试图从网络结构特性及节点物流运行能力揭示多层物流网络的复杂性特征,实现网络聚合并运用t-SNE与聚类算法,评估城市发育水平并探索其空间分布规律.结果表明：物流网络表现出显著的小世界及无标度特性;呈现以“欧洲西部-亚洲东部及南部-亚洲西部-北美洲东部”为核心的菱形空间结构;其分布具有明显的层级性,不同等级城市分布具有空间异质性.