CDMA 网络中基于 QoS 保证的呼叫接纳控制策略

基于CDMA（code division multipleaccess）系统接纳控制（call admission control，CAC）机制没有完全考虑各种多媒体业务的现状，研究了CDMA系统中剩余容量的计算方法，采用更加符合目前无线多媒体网络中业务实际情况的业务模型，给出了一种针对多媒体业务的基于QoS（quality of service）保证的动态CAC算法．分析与仿真结果表明，该算法在保证各种业务QoS要求的情况下，可以显著改善CDMA系统的呼叫等待延时和中断率等性能，提高系统资源的利用率．     

一种无线通信网中的跨层分组调度方案

提出了基于未来无线多媒体通信标准下的一种跨层分组调度方案,在调度时,首先对多媒体混合业务进行了合理分类,即实时性业务和非实时性业务;在调度优先级的确定过程中,利用跨层优化的思想估算优先级公式中的相关参数,由此给出了跨层分组调度方案的具体算法流程.仿真结果表明,与传统经典的比例公平调度算法（PFS）相比,该方案在实时性、数据吞吐量、信道利用率等方面具有更好的性能.     

基于XML的LBS系统架构设计与实现

以GIS和移动通信技术为基础的LBS系统具有用户访问方式多样、数据格式不统一的特点，为此提出利用XML、移动Agent构建分布式LBS系统的解决思路，重点解决用户如何访问系统及系统如何处理用户请求．系统以两层业务结构为基础设计基于有限状态机运行控制的移动Agent；采用基于消息与事件驱动模型管理移动Agent；利用VoiceXML，WML以及XML，提出四种接入方式解决方案，并研究基于移动Agent，XML的LBS业务数据处理流程．     

ָ�ӿ���ϵͳͨ���������߼�ⷽ���������ʵ��

采用故障树分析方法对指挥控制系统通信网络的故障传播情况做了详细分析，并对系统各部件的重要度进行了计算．在此基础上，结合指挥控制系统通信网络自身的特点，设计了一种在线监测方案—以Trap为向导的优先级轮询监测方案．最后，利用C++语言在校园网环境下对该监测方案进行了实现．测试结果表明，以Trap为向导的优先级轮询监测方案能够在一定程度上降低网络资源的利用率，提高网络性能．     

基于移动环境的TCP协议改进方案

针对移动环境中TCP性能下降的问题，提出了一种端到端的基于ROMIPv4的TCP改进方案——TCP-BROMIPv4．该方案利用ROMIPv4中的绑定更新消息以及新增的切换警告消息，调整发送TCP在移动节点切换过程中的操作．仿真结果表明，TCP-BROMIPv4缩短了移动环境下的业务中断时间，增加了发送的分组数量，从而提高了网络吞吐量．     

DSS2点到点信令呼叫连接/释放过程分析

介绍宽带综合业务数字网络中用户与ATM交换机之间使用的信令，即2号数字用户线信令DSS2的基本概念和Q2931消息格式的组成、各部分的内容与功能、编码及其意义，介绍DSS2点对点呼叫连接／释放控制中的定时器和状态的定义与意义，以一次成功的呼叫建立与释放过程为例，结合定时器和状态的应用详细地分析了DSS2呼叫连接／释放处理的工作过程。     

基于无线网的GPRS嵌入式船舶终端控制器的设计

随着GSM网络增值业务快速发展,GPRS成为数据终端和数据网络的一种新连接,它为终端用户提供了高速无线IP和X．25分组数据接入服务。本文介绍了实现基于GSM网络的嵌入式远程终端控制单元的设计方案,介绍了该设计的硬件模块和软件设计流程,采用S3C44BOX作为微控制器芯片,用GT47模块接人无线网络,实现了控制中心对远程终端的控制。     

WindowsNT环境下网卡冗余热备的研究与设计

在网卡冗余方面提出一种新方案,即：结合Windows NT操作系统的网络组件,使用NDIS函数库创建中间层驱动程序实现双网卡冗余热备．文中对实现技术给出了较为详细的描述,测试结果表明完全适合高实时性的要求．     

高速公路收费站车道类型设置问题建模与求解

在加快推进ETC应用服务的背景下，以收费站运营成本与用户延误成本之和最小为目标，结合排队论，建立收费站车道类型设置优化模型. 提出一种自然数编码的遗传算法用于模型求解. 以广州市机场收费站为例，求解高峰时段两种不同ETC使用率下的车道类型设置优化方案，并利用VISSIM 软件对优化方案与原方案进行仿真对比. 此外，分析了机场收费站全天的车辆到达规律，讨论不同车辆到达率与ETC使用率下的车道组合方案. 结果表明，所提方法能有效地缓解收费站拥堵，合理控制成本，对收费站车道改建与收费员排班具有指导意义.     

三层结构应用模型研究

通过对两种客户机／服务器模式应用的原生性问题的剖析，阐述了三层结构出现的必然性．探讨了三层结构划分的层次特点以及因此在系统应用体系上产生的优势．同时针对传统三层结构划分认识上的误区，指出三层结构的核心思想在于使计算与数据分布合理，即分布式计算环境．提出了层次射分应当使中间层成为两层的缓冲以充当负载平衡点，同时应具备扩充性以应付未来业务需要的基本准则．在此基本准则的基础上，提出为了更加合理地使用三层结构，应将传统三层结构中的业务层进一步从逻辑上划分为业务表示层、核心业务层和基础业务层的观点．最后以医院管理信息系统中的医嘱管理为例，介绍了这种更为合理的划分方案的具体实现．     

基于负载均衡的OFDMA双跳中继网络资源分配策略

为适应蜂窝小区内不同的用户分布,针对基于正交频分多址接入技术的双跳中继网络,提出了一种基于负载均衡的资源分配策略.考虑难以得到联合分配的最优解,在降低计算复杂度的前提下,采用分步式次优化分配.采用比例公平算法对子载波进行分配,并用数学建模的方法解决功率分配问题;根据凸规划和注水算法确定功率分配最优解需满足的条件,在逼近最优解的目标下,求得基站和中继站的发射功率.仿真分析结果表明,与传统的静态资源分配策略相比,提出的基于负载均衡的资源分配策略可以适应不同的用户分布和信道条件,系统吞吐率提高7.8%以上.      

一种改进的GSM/GPRS网络信道分配策略

在对GSM／GPRS(global system for mobile communications／general packet radio service)蜂窝系统现有典型信道分配策略FRA(fixed resource allocation)和DRA(dynamical resource allocation)及其排队策略进行分析的基础上，提出了基于DRA的改进策略DMC—DRA(dynamical minimum channels of packets for DRA)．新策略能动态改变GPRS包下限信道数，在FRA和DRA之间折衷，提高信道利用率、包传输时间、呼叫阻塞率等综合性能．     

A new channel allocation scheme for hierarchical wireless networks

A channel allocation scheme for hierarchical wireless networks was proposed in terms of the connection-level quality of service. The channel allocation scheme was analyzed using both horizontal channel borrowing and vertical traffic overflowing. Pre-emptive priority strategies are used to classify real-time services and non-real-time services, real-time service is given higher priority for it is allowed to pre-empt channels used by non-real-time service. Some channel borrowing thresholds and acceptance ratios are used to avoid channel locking or dynamic power control, which can also be dynamically adjusted according to network load. Simula-tion results show that the proposed schemes can improve the system performance.     

Pre-emptive channel borrowing and traffic overflowing channel allocation scheme for multimedia overlay networks

This paper proposes a channel allocation scheme for multimedia wireless networks, in which a twolayer macro-cell or micro-cell architecture is considered. Macro-cells are used to access high-mobility services; while micro-cells, which are overlaid by the macro-cells, are used to cater low-mobility services. To analyze the scheme, a multidimensional Markov traffic model is firstly developed, in which traffic characteristic of two special periods of time is considered. And then, a pre-emptive channel-borrowing scheme combined with trafficoverflowing strategy for multimedia (voice, video or data) networks is proposed, in which handoff requests can not only borrow channels from adjacent homogenous cells, but also be overflowed to heterogeneous cells. Priority strategies are also dedicated to high-mobility services for they can pre-empt channels being used by low-mobility services in macro-cells. To meet the high quality of service (QoS) requirements of video services and increase the channel utilization ratio, video services can be transformed between real-time services and non-real-time services as necessary. Simulation results show that our schemes can decrease the blocking probabilities and improve the channel utilization.     

A New Wireless Packet Scheduling Algorithm Based on EDF and Its Application in Multi-bottleneck Networks

Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks.     

基于价格机制的无线多跳网络拥塞控制算法

为有效缓解拥塞,并在QoS保证与业务公平性之间找到合适的平衡点,基于定价机制提出了一种链路层逐跳拥塞控制算法.该算法考虑了MAC的时间限制和二进制干扰模型限制,将传输失败率作为网络拥塞的控制准则之一引入拥塞价格函数中;流路径上的每个节点根据接收到的拥塞价格动态调整每个流的传输速率;优化目标是系统中总的流效用之和达到权重比例公平.此外,还考虑了节点内部流的调度策略,根据等待时间函数动态调整节点内各个流的优先级,以保证每个流的QoS需求和公平性.仿真结果表明:提出的拥塞控制策略能够有效缓解链路拥塞,系统总吞吐率比未采用拥塞控制机制提高约41%,公平性提高约29%,且极大地改善了平均时延、平均丢包率、平均吞吐率等其他性能指标.     

A New Traffic Model for Mobile Wireless Networks

A new traffic model for mobile wireless networks was given and analysed. In the model, it is considered of traffic characteristic for two special periods of time. A pre-emptive priority scheme combined with channel borrowing strategy according to the speciality was proposed. All the channels can be used by non-real-time services, and real-time services are given higher priority for they are allowed to pre-empt channels used by non-real-time services. Either real-time handoff requests or non-real-time handoff requests can be queued in queues when there is no channel can be used. Some channels are reserved for real-time handoff requests, which can also be used by non-real-time service when they are idle. Simulation results are also given. It is seen that our scheme performs better than other schemes when the arrival rate of real-time services is much higher than non-real-time services.     

AN OPTIMIZED SCHEME FOR FAST HANDOFF IN IP-BASED CDMA WIRELESS COMMUNICATION NETWORKS

IntroductionMobility as an essential characteristic of wire-less network has received considerable attention inrecent years.A number of system- specific solu-tions have been developed for2 G( such as GSM)and 3G( such as UMTS) wireles networks.Fromthe Internetpointofview these solutions can be re-garded as layer- 2 solutions for wireless access net-works working transparently to the layer- 3 ( IPlayer) [1] .The evolution of wireless network is be-ing strongly influenced by mainly two compo…     

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

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