LEO卫星网络动态混合卫星切换策略

LEO卫星网络切换协议中的路由选择策略应当综合考虑路由本身优化性,路由计算复杂性,路由更新的信令代价。提出适合LEO网络卫星切换要求的动态混合路由选择策略(DHRS:DynamicHybridRouteSelection),即发生卫星切换时,由卫星节点根据移动终端用户切换前所处位置和切换前路由表等信息,为移动终端选择合适的路由。     

移动卫星网络中基于最小费用的切换算法

对于移动卫星网络,合理的星地链路切换方案需要在保证最小切换时延的同时,能够最优地使用网络资源。该文通过引入业务的中断概率和费用模型,给出了切换过程中重路由的最优触发条件,提出一种基于最小费用的切换(SMCH)算法。该算法可在保证切换业务通信的连续性和时延等指标不被破坏的基础上,通过适当的触发重路由来降低切换费用。仿真表明该算法在保证切换业务的QoS,降低切换费用以及适应性、灵活性等方面都优于同类切换算法。     

LEO卫星移动通信系统空间网络技术分析

在分析LEO卫星星座移动通信系统空间段网络功能和特点的基础上,进行了星座网络路由和交换技术体制的分析和论证,提出了以支持话音业务为主的LEO卫星移动通信系统星座网络路由和交换技术方案。星座网络采用定长信元格式交换体制,采用动态拓扑离散化的拓扑快照静态路由策略。这种静态路由离线计算方式和定长信元交换相结合,提高了网络交换的效率和转发速率。     

LEO卫星IP网络中的切换管理研究

为了缓解LEO卫星IP网络的注册和绑定更新频率并降低切换延时,提出了基于虚拟移动路由器(VMR)的切换管理方案.当发生切换时,与用户段网络的移动路由器关联的VMR根据损耗函数决定是否转移以及向用户段的家乡代理发送注册和绑定更新消息.文中描述了VMR的数据结构、操作流程和损耗函数模型,并进行了仿真试验.试验结果表明,该方案实现了切换与注册与绑定更新过程的分离,可以应用在LEO卫星IP网络中.     

切换保留信道与新呼叫排队相结合的LEO星座通信系统信道分配方案研究

提出一种适用于LEO(低轨道)星座通信系统的信道分配方案。该方案为切换呼叫提供了保留信道,降低了切换呼叫的阻塞概率。同时,采取新呼叫排队策略抑制保留信道引起的新呼叫阻塞概率的恶化,如果正在进行的呼叫离开,队列中的新呼叫可以按照次序获得分配信道。结果表明,该方案可以显著降低切换呼叫阻塞概率,并使新呼叫阻塞概率得到改善。     

一种GEO/LEO卫星网络中的路由优化策略

空间信息网络具有全球覆盖的能力,是能够保证高速率传输和较宽的带宽,支持灵活的、大规模的网络结构。GEO/LEO双层卫星网络由于具有覆盖关系简单、实施复杂性低等优势成为构建多层卫星网络的新思路。基于卫星群和卫星簇的分层结构,提出了一种GEO/LEO卫星网络中的路由优化策略,该策略主要是通过引入优化卫星路由表和路由信息数据报来实现的。最后的复杂性分析表明该策略在降低网络的星上存储开销和星间通信开销方面具有较高的优越性。     

采用原子滤光器可调谐特性的新型卫星光通信捕捉方案研究

本文提出了在卫星光通信链路中利用原子滤光器可调谐特性的新型捕捉系统方案,可以将原子滤光器带宽的典型值减小到0.01nm,该方案可以适应低轨道卫星(LEO)到同步轨道卫星(GEO)任意可见时刻建立链路的需要,本文并对该方案进行了初步实验研究.     

基于纠缠度计算的低轨道量子卫星通信切换算法

为了解决低轨道(Low Earth Orbit, LEO) 量子卫星通信的越区切换问题,提出了基于纠缠度计算的量子卫星通信切换算法。在卫星与终端距离和量子噪声的作用下,得出了环境与量子系统消相干后两粒子系统的纠缠度,并且系统始终选择与终端纠缠度最大的卫星进行切换。仿真结果表明,LEO卫星在700km和1400km轨道上在一定纠缠度下的切换成功率可达到95%以上,这很好的实现了量子卫星的平稳切换,对于构建未来全球量子通信系统及其标准的制定有着重要的技术支撑作用。     

GEO与LEO间激光通信轨道特性仿真

为了优化GEO与LEO间激光通信系统的性能,建立了卫星通信轨道特性仿真模型。通过对一年内卫星数据的分析可知,卫星通信终端间的多普勒频移变化范围约为5109 Hz,可以使用多普勒频移补偿方法减少GEO与LEO之间的多普勒频移影响。对于相干通信,终端必须进行频移补偿;提前量角的范围大于激光束散角,因此终端需要进行提前量补偿,激光通信系统可根据提前量角对视轴进行提前修正,以减少相对速度对激光通信的影响;太阳干扰和地球遮挡的时间较长,应该进行卫星组网以改善可通率,在通信过程中应根据通信终端时间,优化两个通信终端的工作流程;GEO和LEO终端的视轴变化情况不同,因此应该为卫星设计不同结构。     

基于遗传算法的非静止轨道卫星分集星座优化设计方法

本文介绍了利用遗传算法优化设计非静止轨道卫星星座的方法——卫星星座遗传算法。由该算法设计出的星座具有卫星数量最少、最小最大卫星高度、卫星间最小相移，最大的轨道面夹角，最优卫星分集轨道倾角和最佳LEO、MEO星座参数。MEO、LEO、ICO和Globalstar星座的仿真结果表明：使用卫星星座遗传算法设计二重卫星分集，不但减少了卫星总数，且卫星分集可见度性能显著提高。     

Stochastic control of path optimization for inter-switch handoffsin wireless ATM networks

One of the major design issues in wireless ATM networks is the support of inter-switch handoffs. An inter-switch handoff occurs when a mobile terminal moves to a new base station connecting to a different switch. Apart from resource allocation at the new base station, inter-switch handoff also requires connection rerouting. With the aim of minimizing the handoff delay while using the network resources efficiently, the two-phase handoff protocol uses path extension for each inter-switch handoff, followed by path optimization if necessary. The objective of this paper is to determine when and how often path optimization should be performed. The problem is formulated as a semi-Markov decision process. Link cost and signaling cost functions are introduced to capture the tradeoff between the network resources utilized by a connection and the signaling and processing load incurred on the network. The time between inter-switch handoffs follows a general distribution. A stationary optimal policy is obtained when the call termination time is exponentially distributed. Numerical results show significant improvement over four other heuristics     

Performance evaluation of path optimization schemes for inter‐switch handoff in wireless ATM networks

One of the major design issues in wireless ATM is the support of inter‐switch handoff. An inter‐switch handoff occurs when a mobile terminal moves to a new base station connecting to a different switch. Recently, a two‐phase handoff protocol has been proposed to support inter‐switch handoff in wireless ATM networks. With the aim of shortening handoff delay while using the network resources efficiently, the two‐phase handoff protocol employs path extension for each inter‐switch handoff, followed by path optimization if necessary. To implement the two‐phase handoff protocol efficiently, we need to determine when to trigger path optimization. In this paper, we propose and analyze three path optimization schemes, namely: periodic, exponential, and Bernoulli, for the two‐phase handoff protocol. The design objective is to determine the time to invoke path optimization such that the average cost per connection is minimized. We develop a discrete time analytical model and a discrete‐event simulation model for comparing the performance of the three path optimization schemes. Results indicate that the Bernoulli path optimization scheme outperforms the other two schemes by providing a lower average cost per connection. The proposed models can also be adapted to analyze other path optimization schemes in general. This revised version was published online in July 2006 with corrections to the Cover Date.     

Design of an ATM switch for handoff support

In a wireless ATM system, a network must provide seamless services to mobile users. To support this, mobility function should be added to existing ATM networks. Through a handoff operation, a mobile user can receive a service from the network without disconnecting the communication. A handoff results in connection path rerouting during an active connection. To avoid cell loss during a handoff, cell buffering and rerouting are required in the network. A handoff switch is a connection breakdown point on an original connection path in the network from which a new connection sub‐path is established. It performs cell buffering and rerouting during a handoff. Cell buffering and rerouting can introduce a cell out‐of‐sequence problem. In this paper we propose a handoff switch architecture with a shared memory. The architecture performs cell buffering and rerouting efficiently by managing logical queues of virtual connections in the shared memory and sorting head‐of‐line cells for transmission, thus achieving in‐sequence cell delivery during a handoff. We also present simulation results to understand the impacts of handoffs on switch performance. This revised version was published online in July 2006 with corrections to the Cover Date.     

有/无线ATM网的组播选路算法

本文提出一种组播选路算法,在组播连接路由树的代价函数中计入了移动成员的越区切换发生概率,使为移动成员服务的接入节点（ＡＰ）尽可能成为组播路由树的树叶节点。当移动成员发生越区切换以后,可减去原来为之服务的ＡＰ和相应的树枝通道链路,从而保证了网络资源得以有效地利用。数值模拟分析的结果表明,我们提出的算法达到了这一目的。     

Quality-of-service mechanisms in all-IP wireless access networks

In this paper, we focus on resource reservation protocol (RSVP)-based quality-of-service (QoS) provisioning schemes under Internet protocol (IP) micromobility. We consider QoS provisioning mechanisms for on-going RSVP flows during handoff. First, the rerouting of RSVP branch path at a crossover router (CR) at every handoff event can minimize resource reservation delays and signaling overheads, and in turn the handoff service degradation can be minimized. We show that RSVP branch path rerouting scheme could give a good tradeoff between the resource reservation cost and the link usage. Second, the new RSVP reservation can be made along the branch path toward the CR via a new base station in advance, while the existing reservation path is maintained, and in turn the on-going flow can be kept with the guaranteed QoS. We also show that seamless switching of RSVP branch path could provide the QoS guarantee by adaptively adjusting the pilot signal threshold values. Third, during RSVP resource reservation over wireless link, dynamic resource allocation scheme is used to give a statistical guarantee on the handoff success of on-going flows. We finally obtain the forced termination probability of guaranteed service flows, the average system time of best effort flows by using a transition rate matrix approach.     

Channel Allocation Scheme for Handoff Control in Wireless Ad Hoc Network with Group Mobility

Because a wireless ad hoc network does not have a fixed backbone network and the mobile base station moves randomly, the conventional channel allocation scheme cannot efficiently predict group mobility and is not feasible to support a burst handoff traffic due to group mobility. In this paper, we propose an channel allocation scheme to solve this problem. Our scheme efficiently support burst handoff using guard channel and hello message in wireless ad hoc network with group mobility. We developed an analytical Markov model for the proposed scheme and evaluate our scheme in terms of new call and handoff blocking probability and channel utilization via simulation study. Simulation results show that our scheme offers better performance than the conventional schemes.     

Dynamic resource allocation schemes during handoff for mobilemultimedia wireless networks

User mobility management is one of the important components of mobile multimedia systems. In a cell-based network, a mobile should be able to seamlessly obtain transmission resources after handoff to a new base station. This is essential for both service continuity and quality of service assurance. In this paper, we present strategies for accommodating continuous service to mobile users through estimating resource requirements of potential handoff connections. A diverse mix of heterogeneous traffic with diverse resource requirements is considered. The investigate static and dynamic resource allocation schemes. The dynamic scheme probabilistically estimates the potential number of connections that will be handed off from neighboring cells, for each class of traffic. The performance of these strategies in terms of connection blocking probabilities for handoff and local new connection requests are evaluated. The performance is also compared to a scheme previously proposed by Yu and Leung (see IEEE J. Select. Areas Commun., vol.15, p.1208-25, 1997). The results indicate that using dynamic estimation and allocation, we can significantly reduce the dropping probability for handoff connections     

An efficient handoff management scheme for mobile wireless ATMnetworks

A new handoff management scheme for wireless ATM networks is proposed. In this scheme, all cells are connected to their neighboring cells by permanent virtual circuits (PVCs) and to the access switch (AS) by switched virtual circuits (SVCs) which are only for new calls. Some carefully chosen cells, called rerouting cells, are also connected to the AS by PVCs. In summary, if a mobile roams to an ordinary neighboring cell, its traffic path is simply elongated by a PVC connecting the old and new cells. If a mobile roams to a rerouting cell, its traffic path is rerouted to a PVC between the AS and rerouting cell. By using PVC's for handoff calls, we can guarantee fast and seamless handoff. At the same time, our scheme improves the path efficiency by limiting the maximum number of hops that a path can be extended. Also, allowing path rerouting at a suitable time means the network resources are more efficiently utilized     

Adaptive Resource Management in Mobile Wireless Networks Using Feedback Control Theory

Emerging mobile wireless networks are characterized by significant uncertainties in mobile user population and system resource state. Such networks require adaptive resource management that continuously monitor the system and dynamically adjust resource allocations for adherence to the desired system performance requirements. We propose adaptive resource management technique based on control theory. The controller dynamically solves resource allocation problem using feedback control laws. In the base algorithm, the number of guard channels is dynamically adjusted by feeding back the current handoff call dropping probability. The base algorithm is then enhanced in two ways: feeding back the instantaneous number of handoff calls and by probabilistically implementing a fractional number of guard channels. We study the effects of parameter choices on the performance of the proposed algorithms using discrete event simulation. Simulation results indicate that the feedback controllers can guarantee the predetermined call dropping probability under a variety of traffic conditions, and so can utilize the scarce wireless resource efficiently by accepting more new calls.