一种基于无线局域网的移动检测优化方案

无线局域网采用移动IP实现移动性管理.移动IP切换存在切换时延大,数据包易丢失的问题.切换时延由移动检测时延和注册时延组成,而移动检测时延在其中占主要部分.文章提出了一种移动检测优化方案,采用了自适应绑定的算法,同时充分考虑了域内小范围高频度切换的情况,使移动节点在无线局域网环境中进行快速有效的切换.     

Handoffs in Cellular Wireless Networks: The Daedalus Implementation and Experience

Network protocols in cellular wireless data networks must update routes as a mobile host moves between cells. These routing updates combined with some associated state changes are called handoffs. Most current handoff schemes in wireless networks result in data loss or large variations in packet delivery times. Unfortunately, many applications, such as real-time multimedia applications and reliable transport protocols, adapt to long term estimates of end-to-end delay and loss. Violations and rapid fluctuations of these estimates caused by handoff processing often result in degraded performance. For example, loss during handoff adversely affects TCP performance [4], and high packet loss and variable delays result in poor real-time multimedia performance. In this paper, we describe a multicast-based protocol that eliminates data loss and incurs negligible delays during a handoff. The basic technique of the algorithm is to anticipate a handoff using wireless network information in the form of received signal strengths and to multicast data destined for the mobile host to nearby base stations in advance. This routing, combined with intelligent buffering techniques at the base stations, enables very rapid routing updates and eliminates data loss without the use of explicit data forwarding. We have implemented this protocol using IP Multicast and Mobile IP-like routing. In our implementation, handoffs typically take between 8 and 15 ms to complete and result in no data loss.     

Vertical handoffs in wireless overlay networks

No single wireless network technology simultaneously provides a low latency, high bandwidth, wide area data service to a large number of mobile users. Wireless Overlay Networks - a hierarchical structure of room-size, building-size, and wide area data networks - solve the problem of providing network connectivity to a large number of mobile users in an efficient and scalable way. The specific topology of cells and the wide variety of network technologies that comprise wireless overlay networks present new problems that have not been encountered in previous cellular handoff systems. We have implemented a vertical handoff system that allows users to roam between cells in wireless overlay networks. Our goal is to provide a user with the best possible connectivity for as long as possible with a minimum of disruption during handoff. Results of our initial implementation show that the handoff latency is bounded by the discovery time, the amount of time before the mobile host discovers that it has moved into or out of a new wireless overlay. This discovery time is measured in seconds: large enough to disrupt reliable transport protocols such as TCP and introduce significant disruptions in continuous multimedia transmission. To efficiently support applications that cannot tolerate these disruptions, we present enhancements to the basic scheme that significantly reduce the discovery time without assuming any knowledge about specific channel characteristics. For handoffs between room-size and building-size overlays, these enhancements lead to a best-case handoff latency of approximately 170 ms with a 1.5% overhead in terms of network resources. For handoffs between building-size and wide-area data networks, the best-case handoff latency is approximately 800 ms with a similarly low overhead. This revised version was published online in June 2006 with corrections to the Cover Date.     

Applying packet techniques to cellular radio

The cell size in mobile networks is decreasing to accommodate more users in the same bandwidth. Smaller cell sizes increase the number of handoffs between cells and the probability of encountering a cell with more users than the bandwidth can accommodate. Stateless packet techniques, such as those used in Internet routers, can reduce the work that is performed in a handoff and reduce the probability of losing a connection in an overpopulated cell. In order to obtain these advantages, the mobile network must consist of both a wired and a wireless segment and different packet techniques must be used for the inbound and outbound traffic on each of these segments. A fifth packet technique is used for a control channel that is independent of a mobile unit's location. The resultant packet network has unique characteristics and requirements. We will show how these characteristics affect the structure of the wired network and the access protocols that are used in the wireless network.     

Extending P2PMesh: topology‐aware schemes for efficient peer‐to‐peer data sharing in wireless mesh networks

Wireless mesh networks (WMNs) have emerged as a promising technology that provides low‐cost broadband access to the Internet for fixed and mobile wireless end users. An orthogonal evolution in computer networking has been the rise of peer‐to‐peer (P2P) applications such as P2P data sharing. It is of interest to enable effective P2P data sharing in this type of networks. Conventional P2P data sharing systems are not cognizant of the underlying network topology and therefore suffer from inefficiency. We argue for dual‐layer mesh network architecture with support from wireless mesh routers for P2P applications. The main contribution of this paper is P2PMesh: a topology‐aware system that provides combined architecture and efficient schemes for enabling efficient P2P data sharing in WMNs. The P2PMesh architecture utilizes three schemes: (i) an efficient content lookup that mitigates traffic load imbalance at mesh routers; (ii) an efficient establishment of download paths; and (iii) a data transfer protocol for multi‐hop wireless networks with limited capacity. We note here that the path establishment and data transfer schemes are specific to P2P traffic and that other traffic would use routes determined by the default routing protocol in the WMN. Simulation results suggest that P2PMesh has the potential to improve the performance of P2P applications in a wireless multi‐hop setting; specifically, we focused on data sharing, but other P2P applications can also be supported by this approach. Copyright © 2011 John Wiley & Sons, Ltd.     

无线网状网技术与应用

无线网状网(WMNs)由网状路由器节点和客户机节点组成,其中的网状路由器节点组成了无线网状网的网络骨干,其移动性很小。他们一起为无线网状网和其他常规无线网络的客户机节点提供网络的无线接入。WMNs技术结合了中心式控制的蜂窝网与分布式控制的无线自组织网的优点,可有效克服这两种技术的缺陷并显著提高无线网络的性能,已经成为下一代无线通信网络的研究热点之一。WMNs可为无线个域网、局域网、校园网、城域网的一系列应用提供高速无线宽带接入服务。虽然目前WMNs技术发展很快,但其协议栈各层仍存在许多有待研究的课题。首先简要介绍了无线网状网的结构与特点;随后重点分析了其主要的几个应用领域;最后探讨了WMNs各协议层的研究现状与关键技术,并分析了该技术存在的问题及未来的研究方向。     

一种移动IP快速平滑切换方案

无线IP网络中将采用移动IP实现移动性管理,但该方案应用在高频度切换环境,存在不可接受的切换时延和数据包丢失,很难保证通信业务的服务质量.提出了一种移动IP快速平滑切换方案,该方案利用后注册切换的概念,在切换过程中不存在数据包的丢失,并可以获得很小的切换时延,在实际系统中运行能够达到良好的效果.     

Design and Performance Study for a Mobility Management Mechanism (WMM) Using Location Cache for Wireless Mesh Networks

Wireless mesh networks (WMNs) have emerged as one of the major technologies for 4G high-speed mobile networks. In a WMN, a mesh backhaul connects the WMN with the Internet, and mesh access points (MAPs) provide wireless network access service to mobile stations (MSs). The MAPs are stationary and connected through the wireless mesh links. Due to MS mobility in WMNs, mobility management (MM) is required to efficiently and correctly route the packets to MSs. We propose an MM mechanism named Wireless mesh Mobility Management (WMM). The WMM adopts the location cache approach, where mesh backhaul and MAPs (referred to as mesh nodes (MNs)) cache the MS's location information while routing the data for the MS. The MM is exercised when MNs route the packets. We implement the WMM and conduct an analytical model and simulation experiments to investigate the performance of WMM. We compare the signaling and routing cost between WMM and other existing MM protocols. Our study shows that WMM has light signaling overhead and low implementation cost.     

A ring-based multicast routing topology with QoS support in wireless mesh networks

Wireless mesh networking (WMN) is an emerging technology for future broadband wireless access. The proliferation of the mobile computing devices that are equipped with cameras and ad hoc communication mode creates the possibility of exchanging real-time data between mobile users in wireless mesh networks. In this paper, we argue for a ring-based multicast routing topology with support from infrastructure nodes for group communications in WMNs. We study the performance of multicast communication over a ring routing topology when 802.11 with RTS/CTS scheme is used at the MAC layer to enable reliable multicast services in WMNs. We propose an algorithm to enhance the IP multicast routing on the ring topology. We show that when mesh routers on a ring topology support group communications by employing our proposed algorithms, a significant performance enhancement is realized. We analytically compute the end-to-end delay on a ring multicast routing topology. Our results show that the end-to-end delay is reduced about 33 %, and the capacity of multicast network (i.e., maximum group size that the ring can serve with QoS guarantees) is increased about 50 % as compared to conventional schemes. We also use our analytical results to develop heuristic algorithms for constructing an efficient ring-based multicast routing topology with QoS guarantees. The proposed algorithms take into account all possible traffic interference when constructing the multicast ring topology. Thus, the constructed ring topology provides QoS guarantees for the multicast traffic and minimizes the cost of group communications in WMNs.     

Intelligent Handoff for Mobile Wireless Internet

This paper presents an intelligent mobility management scheme for Mobile Wireless InterNet – MWIN. MWIN is a wireless service networks wherein its core network consisting of Internet routers and its access network can be built from any Internet-capable radio network. Two major standards are currently available for MWIN, i.e., the mobile IP and wireless LAN. Mobile IP solves address mobility problem with the Internet protocol while wireless LAN provides a wireless Internet access in the local area. However, both schemes solve problems independently at different layers, thereby some additional problems occur, e.g., delayed handoff, packet loss, and inefficient routing. This paper identifies these new problems and performs analyses and some real measurements on the handoff within MWIN. Then, a new handoff architecture that extends the features of both mobile IP and wireless LAN handoff mechanism was proposed. This new architecture consists of mobile IP extensions and a modified wireless LAN handoff algorithm. The effect of this enhancement provides a linkage between different layers for preventing packet loss and reducing handoff latency. Finally, some optimization issues regarding network planning and routing are addressed.     

Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions

Next-generation wireless mobile communications will be driven by converged networks that integrate disparate technologies and services. The wireless mesh network is envisaged to be one of the key components in the converged networks of the future, providing flexible high- bandwidth wireless backhaul over large geographical areas. While single radio mesh nodes operating on a single channel suffer from capacity constraints, equipping mesh routers with multiple radios using multiple nonoverlap- ping channels can significantly alleviate the capacity problem and increase the aggregate bandwidth available to the network. However, the assignment of channels to the radio interfaces poses significant challenges. The goal of channel assignment algorithms in multiradio mesh networks is to minimize interference while improving the aggregate network capacity and maintaining the connectivity of the network. In this article we examine the unique constraints of channel assignment in wireless mesh networks and identify the key factors governing assignment schemes, with particular reference to interference, traffic patterns, and multipath connectivity. After presenting a taxonomy of existing channel assignment algorithms for WMNs, we describe a new channel assignment scheme called MesTiC, which incorporates the mesh traffic pattern together with connectivity issues in order to minimize interference in multi- radio mesh networks.     

Fast and scalable wireless handoffs in support of mobile Internet audio

Future internetworks will include large numbers of portable devices moving among small wireless cells. We propose a hierarchical mobility management scheme for such networks. Our scheme exploits locality in user mobility to restrict handoff processing to the vicinity of a mobile node. It thus reduces handoff latency and the load on the internetwork. Our design is based on the Internet Protocol (IP) and is compatible with the Mobile IP standard. We also present experimental results for the lowest level of the hierarchy. We implemented our local handoff mechanism on Unix-based portable computers and base stations, and evaluated its performance on a WaveLAN network. These experiments show that our handoffs are fast enough to avoid noticeable disruptions in interactive audio traffic. For example, our handoff protocol completes less than 10 milliseconds after a mobile node initiates it. Our mechanism also recovers from packet losses suffered during the transition from one cell to another. This work helps extend Internet telephony and teleconferencing to mobile devices that communicate over wireless networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

Performance Analysis of Trunk Network for Inter-MSC Soft Handoffs in CDMA Cellular Communication Systems

The soft handoffs between two adjacent MSC's should be employed to support the calls requesting handoffs to an MSC while minimizing the undesirable “ping pong” phenomenon of back-and-forth handoffsbetween two adjacent cells in conventional hard handoffs. In this paper, the soft handoff scheme between two MSC's is considered using the trunk between the packet routers for the two MSC's. The trunk network is proposed to support the inter-MSC soft handoff scheme in the service area with many MSC's. The probability that a°soft handoff to an adjacent MSC will be blocked due to the shortage of the trunk capacity is derived.     

A Comprehensive Analysis of Mobility Management in MPLS-Based Wireless Access Networks

Efficient mobility management is one of the major challenges for next-generation mobile systems. Indeed, a mobile node (MN) within an access network may cause excessive signaling traffic and service disruption due to frequent handoffs. The two latter effects need to be minimized to support quality-of-service (QoS) requirements of emerging multimedia applications. In this perspective, we propose in this paper a new mobility management scheme designed to track host mobility efficiently so as to minimize both handoff latency and signaling cost. Building on and enhancing Mobile IP and taking advantage of MPLS traffic engineering capability, three mechanisms (FH-, FC- and MFC-Micro Mobile MPLS) are introduced. In order to assess the efficiency of our proposals, all protocols are compared. To achieve this, we develop analytical models to evaluate the signaling cost and link usage for both two-dimensional and one-dimensional mobility models. Additional mathematical models are also provided to derive handoff latency and packet loss rate. Numerical and simulation results show that the proposed mechanisms can significantly reduce the registration updates cost and provide low handoff latency and packet loss rate under various scenarios.      

A reliable overlay video transport protocol for multicast agents in wireless mesh networks

A new video transport protocol for multicast agents in wireless mesh networks (WMNs) is proposed in this paper. The proposed protocol enables a significant reduction in the transmission overhead, while providing reliable communication for its use in multicast applications. This proposed reliable protocol provides a practical approach for an overlay peer‐to‐peer multicast facility supported within the application layer. This obviates the need to give upgraded routers capable of handling multicast broadcasting or modify the existing protocol stack. The protocol tolerates partial losses in multimedia transmissions, while supporting control of the delay sensitivity of such transmissions in WMNs. The key issue in this protocol is the ability to detect packet loss, anticipate retransmission requests, and use the anticipated retransmission requests to transmit the lost packets prior to requests from other receiving agents. The proposed protocol allows for the receiver to determine if retransmission of lost packets is required, ensuring the greatest flexibility needed for a reliable multicast protocol. Copyright © 2009 John Wiley & Sons, Ltd.     

Asymptotic Capacity of Infrastructure Wireless Mesh Networks

An infrastructure wireless mesh network (WMN) is a hierarchical network consisting of mesh clients, mesh routers and gateways. Mesh routers constitute a wireless mesh backbone, to which mesh clients are connected as a star topology, and gateways are chosen among mesh routers providing Internet access. In this paper, the throughput capacity of infrastructure WMNs is studied. For such a network with Nc randomly distributed mesh clients, Nr regularly placed mesh routers and Ng gateways, assuming that each mesh router can transmit at W bits/s, the per-client throughput capacity has been derived as a function of Nc , Nr , Ng and W . The result illustrates that, in order to achieve high capacity performance, the number of mesh routers and the number of gateways must be properly chosen. It also reveals that an infrastructure WMN can achieve the same asymptotic throughput capacity as that of a hybrid ad hoc network by choosing only a small number of mesh routers as gateways. This property makes WMNs a very promising solution for future wireless networking.     

Association control algorithms for handoff frequency minimization in mobile wireless networks

As mobile nodes roam in a wireless network, they continuously associate with different access points and perform handoff operations. Frequent handoffs performed by a mobile device may have undesirable consequences, as they can cause interruptions for interactive applications and increase the energy usage of mobile devices. While existing approaches to this issue focus entirely on improving the latency incurred by individual handoffs, in this paper, we initiate a novel approach to association control of mobile devices with the goal of reducing the frequency of handoffs for mobile devices. We study the handoff minimization problem across multiple dimensions: offline versus online where the complete knowledge of mobility patterns of users is known in advance or unknown respectively; capacity constrained versus unconstrained access points, which imposes limits on the number of mobile devices which could be associated with a given access point at any given point in time; group mobility versus arbitrary mobility of users, which are contrasting ways to model the mobility patterns of the mobile users. We consider various combinations of the above dimensions and present the following: (1) optimal algorithms, (2) provably-good online and offline approximation algorithms, (3) complexity (NP-Completeness) results, and (4) a practical heuristic which is demonstrated to work well on real network traces.     

Design and implementation of CLASS: A Cross-Layer ASSociation scheme for wireless mesh networks

This paper focuses on the design and implementation of CLASS, a Cross-Layer Association scheme for IEEE 802.11-based multi-hop wireless mesh networks. The widely-used association strategy in traditional IEEE 802.11 wireless LANs allows a Mobile Station (MS) to scan wireless access links and then associate with the Access Point (AP) that has the best Received Signal Strength Indication (RSSI) value. Unlike traditional wireless LANs, IEEE 802.11-based wireless mesh networks consist of a multi-hop wireless backhaul. As such, the performance experienced by an MS after association with a specific Mesh Access Point (MAP) depends heavily on the conditions of both the access link (e.g., traffic load of associated stations, the frame error rate between an MS and an MAP) and the mesh backhaul (e.g., end-to-end latency and asymmetric uplink/downlink transportation costs). That is, selecting the MAP that yields the “best” performance depends on several factors and cannot be determined solely on the RSSI of the MS-MAP access link. CLASS uses an end-to-end airtime cost metric to determine the MAP to which an MS should associate. The airtime cost metric is based on the IEEE 802.11s, and comprises the access link airtime cost and the backhaul airtime cost. The proposed association scheme considers the frame error rate for various packet sizes, the available bandwidth on the access link after the association of the new MS, and the asymmetric uplink and downlink transportation costs on the backhaul. All experimental results are based on actual Linux-base testbed implementation. We also implement a general Cross-Layer Service Middleware (CLSM) module that is used to monitor network conditions and gather relevant metrics and factor values. Experimental results show that the proposed association scheme is able to identify the MAP which yields the highest end-to-end network performance for the mobile stations after their associations.     

基于IPv6的快速切换改进方案

在移动IP网络中,当前的移动性管理方案由于其基本协议的切换时延较大、丢包率较高而不能适应实时业务和移动通信的要求,所以需要改善移动性管理策略的切换性能,尽量实现无缝切换和零丢包率。提出了一种基于移动IPv6的快速切换的改进方案,采用一种新的地址分配方式使得移动节点能够在移动至新的网络后迅速获取新的转交地址,有效地减少了切换所产生的时延和丢包率,具有较好的切换性能。     

A seamless handoff scheme for IEEE 802.11 wireless networks

The advance of computer network technologies such as IEEE 802.11 wireless local area network has made it possible for users to connect to Internet almost anywhere. A mobile node (MN) is likely to move between different base stations while running applications. The IETF has defined the Mobile IP (MIP) to allow MNs to maintain their communication uninterrupted while roaming across different IP subnets. However, the mechanisms defined in MIP may cause undesired connection disruptions or packet losses, which will significantly degrade the quality of real‐time applications. It is an important and challenging issue to support seamless handoff management. To achieve seamless handoff, we propose a unified scheme to address application quality degradation. Our main contribution is the concept and implementation of utilising buffering and resending method to eliminate the packet losses while keeping the end‐to‐end delay of real‐time traffic flow in an acceptable value. The NS‐2 simulation results show that our proposed scheme can significantly maintain application quality during layer‐2 and ‐3 handoffs. Copyright © 2011 John Wiley & Sons, Ltd.