可避免数据包乱序的网络层软切换方法及其性能分析

随着异构无线网络的融合和全IP网络的推广,网络层软切换方法不断演进,用以提高垂直切换的性能.但是,现有的软切换方法在下行垂直切换过程中会造成严重的数据包乱序.为此,文中在讨论下行垂直切换时数据包乱序的原因之后,提出了一种新型网络层软切换方法——SHORDER.该方法根据移动终端与其家乡代理之间的交互信令对终端所收数据包进行适当的缓存,能有效避免移动终端因下行垂直切换接收到乱序的数据包.该方法所具有的网络层独立性使其能与各种传输层协议及其改进协议相兼容.此外,文中还从理论上定量地分析了所提方法对TCP应用的切换时延、有效吞吐量及拥塞窗口的影响,并与现有的典型网络层软切换方法进行了比较.通过比较,得出了SHORDER机制的适用条件,并基于此,进一步改进了SHORDER方法.最后,在原型系统上的实验显示出了所提机制便于部署的优点以及该机制在其适用条件下的良好性能.此外,实验结果还显示出与数值分析结果的一致性.     

Scanless fast handoff technique based on global Path-Cache for WLANs

Wireless LANs (WLANs) have been widely adopted and are more convenient as they are interconnected as wireless campus networks and wireless mesh networks. However, time-sensitive multimedia applications, which have become more popular, could suffer from long end-to-end latency in WLANs. This is due mainly to handoff delay, which in turn is caused by channel scanning. This paper proposes a technique called Global Path-Cache (GPC) that provides fast handoffs in WLANs. GPC properly captures the dynamic behavior of the network and mobile stations (MSs), and provides accurate next-AP (access point) predictions to minimize the handoff latency. Moreover, the handoff frequencies are treated as time-series data, thus GPC calibrates the prediction models based on short-term and periodic behaviors of mobile users. Our simulation study shows that GPC virtually eliminates the need to scan for APs during handoffs and results in much better overall handoff delay compared to existing methods.     

一种无线异构网络的自适应垂直切换算法

针对移动节点在异构网络间切换性能不理想的问题,提出了一种自适应主动预测的垂直切换算法。采用一种面向当前应用程序的代价函数对可接入网络进行评估与选择;根据稳定周期、移动节点的运动速度及所处位置来自动调整切换执行时间,使移动节点能自适应地进行切换判决。仿真结果表明,该算法可以有效地减少切换延迟、分组丢失及切换次数,提高系统的切换性能,改善业务的QoS。     

Optimization model for handoff-aware channel assignment problem for multi-radio wireless mesh networks

Optimal channel assignment (CA) in multi-radio wireless mesh networks is an NP-hard problem for which solutions usually leave several links interfering. Most of these solutions usually consider the overall throughput as the main optimization objective. However, other objectives have to be considered in order to provide better quality wireless connections to non stationary users. In this paper, we propose a multi-objective optimization model that, besides maximizing throughput, improves fairness and handoff experience of mesh clients. In this model, we use the Jain’s index to maximize users’ fairness and we allow same-channel assignments to links involved in the same high handoff traffic, thus reducing handoff-triggered re-routing characterized by its high latency. Then, we propose a centralized variable neighborhood search and a Tabu search heuristics to efficiently solve our model as an offline CA process. Moreover, in order to adapt to traffic dynamics caused especially by user handoffs, we propose an online CA scheme that carefully re-assigns channels to interfaces with the purpose of continuously minimizing the re-routing overhead/latency during user handoffs. We further improve this online scheme using load balancing. Simulation results show the good performance of our proposed approach in terms of delay, loss rate, overall throughput and fairness. Particularly, performance results of our online handoff-aware CA show the effectiveness of handoffs not involving path re-routing in decreasing the delay, especially when considering load balancing.     

移动无线因特网中的一种基于QoS的切换支持机制*

研究了移动无线因特网中基于QoS的切换支持机制,该机制采用移动台辅助切换策略和基于底层信息的动态切换准则,软、硬切换有机结合,同时辅以重路由、频繁切换QoS控制与缓存等技术,为用户QoS保证提供支持。原型系统实现表明,该机制是可行和有效的。     

A hybrid channel allocation algorithm with priority to handoff calls in mobile cellular networks

This paper proposes and investigates a novel analytical model of a hybrid channel allocation algorithm within wireless cellular networks. Each cell of the network consists of a predesigned fixed number of channels and the network may approve the request for extra channels for both new and handoff calls if all predesigned channels are occupied. This approval depends on the types of new and handoff calls, as well as the number of approved additional channels in the cell. If a request is denied for the arriving new call, this call will be blocked and cleared from the system. However, if a request is denied for an arriving handoff call, this call will not be blocked immediately but rather put on hold in a buffer with finite space. The implication behind this is to give priority to handoff calls. For this proposed hybrid channel allocation scheme, we first obtain the stationary distribution of each cell when there are i calls connecting to the system and j calls holding on in the buffer. We then derive new and handoff call blocking probabilities, the average number of borrowed channels, and the average delay period of handoff calls. The numerical results show that the proposed hybrid algorithm is more efficient than other approaches, specifically, in comparison with methods without a borrowing capability for new calls and those without a reserved buffer priority for handoff calls. The idea and results presented in this paper are expected to provide guidelines for field data processing within current wireless and mobile network design and performance evaluation.     

OmniCon: a Mobile IP‐based vertical handoff system for wireless LAN and GPRS links

Wi‐Fi based hotspots offer mobile users broadband wireless Internet connectivity in public work spaces and corporate/university campuses. Despite the aggressive deployment of these hotspots in recent years, high‐speed wireless Internet access remains restricted to small geographical areas due to the limited physical coverage of wireless LANs. On the other hand, despite their lower throughput, cellular networks have a significantly wider coverage and are thus much more available. Recognizing that 2.5G or 3G cellular networks can effectively complement wireless LANs, we set out to develop a vertical handoff system that allows mobile users to seamlessly fall back to such cellular networks as the general packet radio service (GPRS) or 3G whenever wireless LAN connectivity is not available. The resulting handoff mechanism allows a network connection of a mobile node to operate over multiple wireless access networks in a way that is transparent to end user applications. In this paper, we present the design, implementation, and evaluation of a fully operational vertical handoff system, called OmniCon, which enables mobile nodes to automatically switch between wireless LAN and GPRS, based on wireless LAN availability, by introducing a simple extension to the existing Mobile IP implementation. We discuss the design issues in the proposed vertical handoff system for heterogeneous networks, including connection setup problems due to network address translation, and the disparity in link characteristics between wireless LANs and GPRS. A detailed performance evaluation study of the OmniCon prototype demonstrates its ability to migrate active network connections between these two wireless technologies with low handoff latency and close to zero packet loss. Copyright © 2006 John Wiley & Sons, Ltd.     

基于Ad Hoc无线网的多跳交换算法分析及其仿真结果

论文对基于多跳无线局域网并应用多接入点技术(APs)进行通信的交换性能进行了分析。当一个移动终端不能跟任何接入点进行通信时,它就会用其他移动终端作为终端转发器(TRs)。这种交换标准是建立在绝对和相对信号强度基础上的,其性能指标即平均交换量和平均交换延迟。论文研究了当移动终端和终端转发器均处于移动状态下的交换标准及性能指标之间的联系。多次结果表明当终端转发器移动速度增大时平均交握延迟减小但平均交换量增大。     

异构分层无线网络中基于业务QoS保证的切换策略研究

针对异构分层无线网络提出了一种保证业务QoS的切换策略。该策略在层间呼叫双向溢出基础上,为实时业务切换设置了保护信道,为非实时业务切换设置了缓冲队列。为了进一步降低实时业务切换的掉线率,还使用了信道侵占技术,原理是实时业务切换呼叫可以侵占数据业务正在使用的信道资源。仿真结果表明,提出的切换方法能够显著降低各类切换业务的掉线率,同时整个异构分层系统的信道利用率也略有提高。     

Predictive channel reservation for handoff prioritization in wireless cellular networks

In wireless cellular networks, a roaming mobile station (MS) is expected to move from one cell to another. In order to ensure that ongoing calls are not dropped while the owner mobile stations roam among cells, handoff calls may be admitted with a higher priority than newly generated calls. Predictive channel reservation (or pre-reservation) schemes allow the reservation of a channel for an ongoing call in an adjacent cell before its owner MS moves into that cell, so that the call is sustained when the MS moves into the adjacent cell. Pre-reservations are made when the MS is within some distance of the new cell boundary. This distance determines the area in which the MS can make channel reservations. In this paper, we study the effect of the pre-reservation area size on handoff performance in wireless cellular networks. Our studies show that if the reserved channels are strictly mapped to the MSs that made the corresponding reservations, as we increase the pre-reservation area size, the system performance (in terms of the probability that the handoff calls are dropped) improves initially. However, beyond a certain point, the performance begins to degrade due to a large number of false reservations. The optimal pre-reservation area size is closely related to the traffic load of the network and the MSs’ mobility pattern (moving speed). We provide an analytical formulation that furthers understanding with regard to the perceived behavior in one-dimensional networks (in which all cells are along a line).With the objective of improving handoff performance and alleviating this sensitivity to the area size, we propose an adaptive channel pre-reservation scheme. Unlike prior pre-reservation methods, the key idea in our scheme is to send a channel pre-reservation request for a possible handoff call to a neighboring cell not only based on the position and orientation of the owner MS, but also as per its speed towards the target cell. The newly proposed scheme uses GPS measurements to determine when channel pre-reservation requests are to be made. Simulation results show that the adaptive channel pre-reservation scheme performs better in all typical scenarios than a previously proposed popular pre-reservation method that does not take mobility into account.     

Handoff calls’ joining behavior and incentive mechanism in wireless cellular networks with retrial orbit

In wireless cellular networks, handoff is a key element in providing quality of service and supporting mobility for users. There is an interaction between wireless cellular networks and handoff calls which strategically act to achieve their own objectives. In order to reasonably control the access of handoff calls and achieve the optimization of social network resources, we present a game-theoretic queueing model to investigate the strategic behavior of handoff calls in wireless cellular networks. The noncooperative joining behavior of handoff calls that maximizes their expected net benefit selfishly is considered. Moreover, the socially optimal joining behavior of handoff calls that maximizes their social total welfare is analyzed. The equilibrium and socially optimal strategies of handoff calls are obtained. Counter-intuitively, we find that the socially optimal joining probability is larger than the equilibrium joining probability. In order to eliminate the difference of joining probabilities, an appropriate incentive-payment is proposed to attract handoff calls to join the system actively. In doing so, it is feasible to induce individuals to behave in a socially best way.

     

Context-aware handoff middleware for transparent service continuity in wireless networks

Advances in wireless networking and content delivery are enabling new challenging provisioning scenarios where a growing number of users access continuous services, e.g., audio/video streaming, while moving among different points of attachment to the Internet, possibly with different connectivity technologies, e.g., Wi-Fi, Bluetooth, and cellular 3G. That calls for novel middlewares capable of dynamically personalizing service provisioning to the characteristics of client environments, in particular to discontinuities in wireless resource availability due to handoffs. The paper proposes a novel middleware solution, called Mobile agent-based Ubiquitous multimedia Middleware (MUM), that performs effective and context-aware handoff management to transparently avoid service interruptions during both horizontal and vertical handoffs. MUM exploits the full visibility of wireless connections available and their handoff implementations (handoff awareness), of service quality requirements and handoff-related quality degradations (QoS awareness), and of network topology and local resource availability (location awareness); that visibility enables MUM to provide original solutions for handoff prediction, multimedia continuity via adaptive data buffering/pre-fetching, and proactive re-addressing/rebinding.     

Application of support vector machines to bandwidth reservation in sectored cellular communications

Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping probability for handoffs in cellular communications. The handoff events occur at a much higher rate in sectored cellular networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced termination and waste of limited bandwidth in the sectored cellular communications, particularly when the handoff traffic is heavy. In this paper, a self-adaptive bandwidth reservation scheme, which adopts support vector machines technique, is proposed to reduce the forced termination probability. Meanwhile, a channel-borrowing technique is used to decrease the new call-blocking probability of real-time traffic. The simulation results show that the proposed scheme can achieve superior performance than the representative bandwidth-reserving schemes in sectored cellular networks in the literature when performance metrics are measured in terms of the forced termination probability and the new call- blocking probability.     

Case study on handoff strategies for wireless overlay networks

One of the most challenging topics for next‐generation wireless networks is the process of vertical handoff since many of wireless technologies overlap each other and build a heterogeneous topology. Several parameters, pertaining to user/application requirements and network conditions, such as data rate, service cost, network latency, speed of mobile, and etc. must be considered in the handoff process of heterogeneous networks along with RSSI information. In this paper, adaptive fuzzy logic‐based vertical handoff decision‐making algorithms are presented for wireless overlay networks which consist of GSM/GPRS/Wi-Fi/UMTS/WiMAX technologies. The parameters data rate, monetary cost, speed of mobile and RSSI information are processed as inputs of the proposed fuzzy‐based systems. According to these parameters, an output value, which varies between 1 and 10, is produced. This output value is utilized to determine whether a handoff process is necessary or not and to select the best candidate access point in the vicinity. The results show that, compared to the traditional RSSI‐based algorithm significantly enhanced outcomes can be achieved for both user and network as a consequence of the proposed fuzzy‐based handoff systems. The simulation results are also compared with those of classical MADM (Multiple Attribute Decision Making) method, i.e. SAW (Simple Additive Weighting). According to the results obtained, the proposed vertical handoff decision algorithms are able to determine whether a handoff is necessary or not, properly, and select the best candidate access network considering the aforementioned parameters. Moreover, fuzzy‐based algorithm noticeably reduces the number of handoffs compared to SAW‐based algorithm.     

Dynamically adaptive channel reservation scheme for cellular networks

In personal communications networks (PCN) supporting network-wide handoffs, new and handoff requests compete for connection resources in both mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. In general, most of the previously proposed schemes for radio channel allocation in cellular networks reduce handoff call blocking probability substantially at the expense of increasing the new call blocking probability by giving higher priority to handoff calls over new calls in admission control. This reduces the total admitted traffic and results in inefficient utilization of wireless channels. The tradeoff between the new and handoff calls blocking probabilities should be defined on importance basis. In this paper, we propose a performance metric equation that makes a trade off between the two probabilities depending on the network preferences. Using this equation, we study the performance of various proposed channel reservation schemes. Also in this paper, a new dynamically adaptive channel reservation scheme (DACRS) is developed and compared with other schemes proposed in the literature. The DACRS assigns handoff-reserved channels to new calls depending on the locality principle in which the base station with the help of location estimation algorithms in the mobile location center predicts the position of the mobile terminal. Eventually, the DACRS is designed to improve channel utilization while satisfying the QoS of the calls. As will be shown analytically and through simulation, the DACRS outperforms current reservation schemes and results in more statistical gain, and powerful channel utilization.     

System supports for protocol and application adaptation in vertical handoffs

In overlay networks, the network characteristics before and after a vertical handoff would be drastically different. Consequently, in this paper, we propose an end‐to‐end based scheme to support protocol and application adaptation in vertical handoffs. First, we proposed a Vertical‐handoff Aware TCP, called VA‐TCP. VA‐TCP can identify the packet losses caused by vertical handoffs. If segments losses are due to vertical handoffs, VA‐TCP only retransmits the missing segments but does not invoke the congestion control procedure. Moreover, VA‐TCP dynamically estimates the bandwidth and round‐trip time in a new network. Based on the estimated bandwidth and round‐trip time, VA‐TCP adjusts its parameters to respond to the new network environment. Second, during a vertical handoff, applications also need to be adapted accordingly. Therefore, we design a programming interface that allows applications to be notified upon and adapt to changing network environments. To support our interface, we utilize the signal mechanism to achieve kernel‐to‐user notification. Nevertheless, signals cannot carry information. Thus, we implement the shared memory mechanism between applications and the kernel to facilitate parameters exchange. Finally, we also provide a handoff‐aware CPU scheduler so that tasks that are interested in the vertical‐handoff event are given preference over other processes to attain a prompt response for new network conditions. We have implemented a prototype system on the Linux kernel 2.6. From the experimental results, our proposed protocol and application adaptation mechanisms are shown to effectively improve the performance of TCP and applications during vertical handoffs. Copyright © 2008 John Wiley & Sons, Ltd.     

A hybrid intelligent model for network selection in the industrial Internet of Things

Industrial Internet of Things (IIoT) plays an important role in increasing productivity and efficiency in heterogeneous wireless networks. However, different domains such as industrial wireless scenarios, small cell domains and vehicular ad hoc networks (VANET) require an efficient machine learning/intelligent algorithm to process the vertical handover decision that can maintain mobile terminals (MTs) in the preferable networks for a sufficient duration of time. The preferred quality of service parameters can be differentiated from all the other MTs. Hence, in this paper, the problem with the vertical handoff (VHO) decision is articulated as the process of the Markov decision aimed to maximize the anticipated total rewards as well as to minimize the handoffs’ average count. A rewards function is designed to evaluate the QoS at the point of when the connections take place, as that is where the policy decision for a stationary deterministic handoff can be established. The proposed hybrid model merges the biogeography-based optimization (BBO) with the Markov decision process (MDP). The MDP is utilized to establish the radio access technology (RAT) selection’s probability that behaves as an input to the BBO process. Therefore, the BBO determines the best RAT using the described multi-point algorithm in the heterogeneous network. The numerical findings display the superiority of this paper’s proposed schemes in comparison with other available algorithms. The findings shown that the MDP-BBO algorithm is able to outperform other algorithms in terms of number of handoffs, bandwidth availability, and decision delays. Our algorithm displayed better expected total rewards as well as a reduced average account of handoffs compared to current approaches. Simulation results obtained from Monte-Carlo experiments prove validity of the proposed model.     

Performance analysis of a novel architecture to integrate heterogeneous wireless systems

Current wireless world witnesses multiple heterogeneous systems such as Bluetooth, IEEE 802.11, UMTS, and satellite networks. These systems are envisioned to coordinate with each other to provide ubiquitous communications to mobile users. A novel architecture, Architecture for ubiquitous Mobile Communications (AMC), is introduced in this paper that integrates these heterogeneous wireless systems. AMC eliminates the need for direct Service Level Agreements (SLAs) among service providers by using a third party, Network Inter-operating Agent (NIA). Instead of developing a new architecture, AMC extends the existing infrastructure to integrate heterogeneous wireless systems. It uses IP as the inter-connection protocol to provide transparency to the heterogeneities of individual systems. Third-party-based authentication and billing algorithms are designed for AMC. New handoff management protocols are also designed to support seamless vertical handoffs between different wireless systems in AMC. Performance analysis is carried out to determine the latency associated with vertical handoffs and the load on the NIA that arises because of these vertical handoffs. Toward this, a network deployment scenario that consists of three types of wireless systems: WLAN, 3G, and satellite networks is considered. Moreover, the number of SLAs required in AMC is also determined for a given number of network operators. It is also shown that by using hierarchical structure, AMC can realize the integration of heterogeneous wireless systems around the globe.     

An integrated traffic model for multimedia wireless networks

Multimedia wireless networks are seen today as one of the key factors for the success of the global communication infrastructure in the near future. Such networks will have to handle a range of heterogeneous traffic classes with different QoS requirements. Their design, planning and control must be supported by suitable traffic models capable of dealing with a new set of constraints where QoS management and mobility play an important role.This paper proposes a traffic model for a cellular multimedia wireless network characterized by the integration of mobility and traffic management aspects. User mobility is modeled through a Markov renewal process, which allows for non-exponential cell residence times and may restrict the user mobility to existent paths in the system. A Markov-modulated fluid process is used to describe the changes in the bandwidth requirements of each mobile over the duration of its calls, including the periods where the mobile is inactive (without call).Based on the proposed model, the number of mobiles per class of traffic in a cell and the handoff processes are characterized. System performance results, such as new and handoff call blocking probabilities, for network planning are derived. Also, the distribution of the required capacity in a short time interval for network control is obtained. Simulations were carried out to validate the analytical results. The comparisons have shown that the integrated model may be regarded as a good basis to build useful teletraffic engineering tools for multimedia wireless networks.     

Simulation studies of the effects of user mobility on the handoff performance of mobile communications

The performance of soft handoffs of code division multiple access (CDMA) mobile communication systems is determined by several factors. Due to the importance of handoffs in mobile communications, several handoff methods have been proposed and evaluated through computer simulations. However, the credibility of simulation results depends on the objectivity of the assumptions made by the simulations. This paper presents a new soft handoff method that controls handoff drop timer based on a mobile station’s speed, and compares it with the current method of CDMA systems. A computer program has been developed to simulate the handoff methods under a variety of conditions. The simulation results showed that the new method is much more efficient for mobile stations that are free in their moving direction and space than for those restricted in their moving direction and space. In addition, the results showed that even the same handoff method may produce different simulation results depending on whether a service area is modeled as two-dimensional space or three-dimensional space. These results indicate the importance of suitable models of user mobility, especially the movement types and space allowed for mobile stations, which have been neglected in simulation studies of mobile communications.