居住区共享泊位资源优化配置模型及算法

对于缓解城市停车难问题,基于泊位共享的理念充分挖掘现有私人或者专用停车位资源以供社会车辆停放的方法成为一种新的思路.由于共享车位可利用的停车时段通常具有严格的时间窗约束和片段化特征,导致共享车位资源在实际运营中难以得到高效利用.本文旨在通过设计优化配置算法,以提高共享泊位利用率为目标,将居住区泊位拥有者愿意出租的停车时段与停车需求进行匹配,从而实现共享车位的高效利用.首先,基于具有颜色约束的加权顶点着色问题,建立共享车位资源优化配置模型;其次,针对以上NP-C问题,分析蚁群算法的路径选择及信息素更新策略并设计求解算法;最后,根据居住区泊位空闲特性设计仿真实验,并与"先到先服务"的停车位资源配置方法对比,结果显示,本文提出的优化方法可以将泊位利用时长提高11.82%.     

一种基于TDD的无线mesh网络随机自学习调度算法

基于时分多址（TDD）的无线mesh网络是实现无线多跳网络和宽带无线接入的一种关键技术.为用户提供一种可以保障稳定通信的有效的分布式算法是影响基于TDD的无线mesh网络性能的关键因素.本文针对TDD的无线mesh网络提出一种随机自学习分布式调度算法,这种算法是一种基于信息学习的随机选择算法.在网络中,任一节点都要根据其邻居节点控制消息中所携带的数据,学习邻居节点的调度信息,从而判断可用时隙.若上次信息传输成功,则节点仍然沿用上次的传输时隙;反之,节点在可用时隙中随机选择一个时隙发送控制消息.仿真结果表明,与IEEE802.16标准中定义的算法相比,提出的随机自学习分布式调度算法能实现更高的吞吐量.     

A simulation study of service differentiation for the bandwidth request scheme in fixed IEEE 802.16 network

Various flexible mechanisms related to quality of service (QoS) provisioning have been specified for uplink traffic at the medium access control (MAC) layer in the IEEE 802.16 standards. Among the mechanisms, contention based bandwidth request scheme can be used to indicate bandwidth demands to the base station for the non-real-time polling and best-effort services. These two services are used for most applications with unknown traffic characteristics. Due to the diverse QoS requirements of those applications, service differentiation (SD) is anticipated over the contention based bandwidth request scheme. In this paper we investigate the SD with the bandwidth request scheme by means of assigning different channel access parameters and bandwidth allocation priorities at different packets arrival probability. The effectiveness of the differentiation schemes is evaluated by simulations. It is observed that the initial backoff window can be efficient in SD, and if combined with the bandwidth allocation priority, the SD performances will be better. Foundation item: the National Basic Research Program (973) of China (No. 2005C13321804)     

Efficient scheduling with random network coding in multi-relay wireless network

In this paper, we propose two novel efficient scheduling schemes with network coding in multi-relay wireless network to maximize the transmission efficiency. The first one uses adaptive forwarding with network coding （AF-NC）, in which each relay adaptively calculates the number of packets having innovative information according to the feedback from the sink. With AF-NC, duplicate packets are not sent, and the total number of time slots needed to complete transmission can be significantly reduced. The second scheme, named adaptive forwarding with network coding and retransmission （AFR-NC）, combines AF-NC with automatic repeat request （ARQ） to guarantee reliable end-to-end communication with limited resource occupation. Numerical results show that compared with simple forwarding with network coding （F-NC）, AF-NC has close successful delivery rate with dramatically less time slots, while AFR-NC achieves strict reliability with limited resource cost.     

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.     

一种实时多媒体数据流传输算法及其在NS2上的实现

为了解决基于UDP协议的实时多媒体数据流与基于TCP协议的应用数据流共享有限的带宽问题,文中就如何能够获得更好的多媒体数据流的传输算法进行了研究.在对传统算法进行分析和参考有关算法的基础上,改进了IETF的友好TCP速率控制协议.利用C 语言在NS2上成功地实现了改进后的算法,并进行了仿真,取得了预期的效果.     

基于遗传算法的城市单交叉路口信号动态控制

针对单交叉路口多相位交通流建立一种实时动态模型,并根据不同时刻的不同车流量, 选择最优相位配时和相位顺序.提出一种实时遗传算法优化配时控制方法,通过对本周期及前 一周期的车流量进行实时测量,采用线性预估方法,对下一周期的车流量进行预估,以最大通行能力为路口模型控制性能指标,从而确定下一周期的相位配时方案.采用MATLAB语言编程 进行实时仿真试验,结果表明,算法实时性好,运行稳定.     

Dynamic wavelength and bandwidth allocation using adaptive linear prediction in WDM/TDM ethernet passive optical networks

Hybrid wavelength-division-multiplexing (WDM)/time-division-multiplexing (TDM) ethernet passive optical networks (EPONs) can achieve low per-subscriber cost and scalability to increase the number of subscribers. This paper discusses dynamic wavelength and bandwidth allocation (DWBA) algorithm in hybrid WDM/TDM EPONs. Based on the correlation structure of the variable bit rate (VBR) video traffic, we propose a quality-of-service (QoS) supported DWBA using adaptive linear traffic prediction. Wavelength and timeslot are allocated dynamically by optical line terminal (OLT) to all optical network units (ONUs) based on the bandwidth requests and the guaranteed service level agreements (SLA) of all ONUs. Mean square error of the predicted average arriv-ing rate of compound video traffic during waiting period is minimized through Wiener-Hopf equation. Simulation results show that the DWBA-adaptive-linear-prediction (DWBA-ALP) algorithm can significantly improve the QoS performances in terms of low delay and high bandwidth utilization.     

遗传算法在城市单交叉路口信号动态控制中的研究及应用

提出一种实时遗传算法优化配时控制方法,对单交叉路口多相位交通流建立一种实时动态模型,根据不同时刻的不同车流量,选择最优相位配时和相位顺序,通过对本周期及前一周期的车流量进行实时测量,采用线性预估方法,对下一周期的车流量进行预估,以最大通行能力为路口模型控制性能指标,从而确定下一周期的相位配时方案。最后在原模型的基础上作为改进模型的例子融入了延误时间,得到了新的目标函数。采用C语言编程进行实时仿真试验,结果表明,算法实时性好,运行稳定。     

矩形波导缝隙阵列天线的快速综合算法

矩形波导缝隙阵列天线计算复杂,本文提出一种快速综合算法,充分考虑互耦的影响,并且可以对同相或不同相缝隙电压加权进行综合.首先在有源导纳法的基础上得出一个矩阵方程,互耦的影响和缝隙自身的影响分别可以用方程中的一个矩阵完全表示.分析矩阵的特性后,本文可将对面阵的综合转换为对每条波导上缝隙的综合,大大降低计算量.仿真实例验证了算法的有效性.     

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.     

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.     

基于能量与功率控制的TopDisc拓扑算法研究

拓扑控制是无线传感器网络的一个重要研究方向,选择良好的拓扑控制机制,能够提高网络通信效率并延长网络的生命周期。在TopDisc算法的基础上,提出了一种基于能量与功率控制的拓扑控制算法,在能量的引导下,通过调整节点的发射功率,生成更适合的网络拓扑结构。仿真实验结果表明改进的算法形成的簇的交叠更少,网络的生存时间更长。     

组合放行下的干路交叉口协调控制优化

采用双层规划方法建立干线协调控制模型,模型以干线两相邻交叉口之间的行驶时间,关键流向的绿灯需求,交叉口绿信比,公共周期时长等参数为基础和约束,对干线协调控制信号方案进行优化,优化参数包括交叉口放行方式、各交叉口绿波起始和终止时刻以及双向绿波带宽,实例求解计算及仿真验证显示,本方法可以应用于干线绿波控制的优化设计.     

时隙Aloha防冲突算法的马尔可夫链模型研究

分析了时隙Aloha防冲突算法的过程及马尔可夫特性,根据下一识读时间段识别出的应答器数量只与当前识读时间段识别出的应答器数量有关,与前面识读时间段识别出的应答器数量无关的特点,构建了时隙Aloha防冲突算法的马尔可夫链模型,并给出了马尔可夫链模型的求解过程,得出了应答器数量、时隙数、成功识别率之间的数学关系,并通过仿真计算得出他们之间的曲线关系.     

认知无线电带宽频谱感知性能分析及优化

为了降低认知无线电中主用户受到的干扰,根据主用户状态的变化,通过将通信带宽分为感知频带和传输频带,建立了次用户在整个帧周期内进行带宽频谱感知的模型.该模型中,次用户在每个帧使用部分带宽进行频谱感知,其余的带宽传输数据.在限制主用户受到的干扰和次用户虚警概率的基础上,通过联合优化感知带宽比和检测概率,最大化次用户的频谱效率.使用MATLAB软件仿真模型的干扰概率和频谱效率,结果表明:相比传统的时间频谱感知,当虚警概率为0.5时,带宽频谱感知能够使主用户受到干扰的概率降低30%;当干扰概率为0.2时,带宽频谱感知能够使次用户的频谱效率提高0.3 (bit/s)/Hz.      

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

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

Pragmatic physical layer abstraction method based on bit-LLR-wise exponential effective SNR mapping for bit interleaved coded orthogonal frequency division multiplexing system

In this paper, we analyze the physical layer abstraction for bit interleaved coded orthogonal frequency division multiplexing （BIC-OFDM） system from a parallel bit channel perspective. By combining the exponential effective SNR （signal-to-noise ratio） mapping （EESM） with the maximum a posteriori （MAP） algorithm, a bit LLR （log-likelihood ratio） wise EESM （BL-EESM） method is proposed. This method can abstract the link performance with high accuracy, especially for the case when channel estimation is imperfect. Afterward, the BL-EESM method is simplified by utilizing the non-linear quantization idea, which can reduce the times of exponential operation by two orders of magnitude at wide system bandwidth, yet shows little loss in accuracy. Our proposal can be applied to both system level simulations to save the time consumption and to practical terminals to facilitate the adaptive modulation and coding （AMC） procedure, bringing about throughput improvement at low hardware cost.     

An range-free localization scheme for large scale underwater wireless sensor networks

In this paper, we study an area localization problem in large scale underwater wireless sensor networks (UWSNs). The limited bandwidth, the severely impaired channel and the cost of underwater equipment all make the underwater localization problem very challenging. Exact localization is very difficult for UWSNs in deep underwater environment. We propose a range free method based on mobile detachable elevator transceiver (DET) and 3D multi-power area localization scheme (3D-MALS) to address the challenging problem. In the proposed scheme, the ideas of 2D multi-power area localization scheme (2D-ALS) and utilizing DET are used to achieve the simplicity, location accuracy, scalability and low cost performances. The DET can rise and get down to broadcast its position. And it is assumed that all the underwater nodes underwater have pressure sensors and know their z coordinates. We evaluate the performances of 2D-ALS and our proposed 3D-MALS schemes under both ideal and non-ideal channel propagation conditions, in terms of localization error and localization ratio. The simulation results show that our proposed scheme is much more efficient than the 2D-ALS.     

基于交换式以太网的列车通信网络的交换机排队时延分析

传统列车通信网络的带宽难以满足现代列车数据传输的要求.本文提出了一种基于交换式以太网的列车通信网络解决方案,为了降低列车实时数据的传输时延,为交换机设计了具有优先级的队列调度策略,并采用G/D/1排队论分析了列车实时数据和非实时数据的排队时延,计算证实了该策略可以将实时数据在交换机的平均排队时延降低到70 μs以下.最后,通过网络仿真研究证实了实时周期数据的平均排队时延从无优先级时的91 μs降低到了有优先级时的61 μs.