Performance Comparison of Handover Rerouting Schemes in Wireless ATM Networks

The major issue of the integration of wireless and wired ATM is the support of user mobility. In effect, many technical challenges have been posed due to mobility support. One of the most important challenges is the rerouting of active connections of mobile user during handover. The rerouting of connections must exhibit low handover latency, limit the handover delay or disruption time, maintain efficient routes and minimise the impact on existing infrastructure. To date, two dominant approaches have been proposed to support mobility into fixed ATM network. The first is the mobility enhanced switches approach and the second is the separate network-elements specific to mobility approach. The first approach implies updating the existing ATM switches with mobile specific features. The mobility functions in the second approach are entrusted to a control station attached to the ATM switch as is implemented by the Magic WAND projects. In this thesis, we investigate how mobility can be supported using both approaches. To demonstrate the effectiveness of the above approaches, we compare the performance by analytically derived formulate for their hand over latency, hand over delay, buffer size, and bandwidth requirements. The formulate were derived for both backward and forward hand overs using a number of potential rerouting schemes proposed for wireless ATM network. The results show that the mobility enhanced switches approach has slightly better performance than the separate network elements approach. The results also show that backward handover has better performance than forward handover in terms of the handover delay and buffer requirement. Finally, the results show that the Anchor Switch rerouting scheme is the best among other rerouting schemes proposed for wireless ATM

A framework for fast handoff schemes in wireless ATM networks

Includes bibliographical references.In this research, we focus on providing a framework that extends the fixed ATM standard to support user mobility in future WATM networks. The WATM architecture allows for the migration of fixed ATM networks without major modifications. Thus most of the mobility functions are implemented on the wireless access network. The most important component supporting mobility in a cluster is the Mobility Enhanced Switch (MES). We propose using direct links between adjacent MESs to support Permanent Virtual Channels (PVCs) in order to facilitate fast inter-cluster handoffwith minimum handofflatency. This research addresses a framework on handoff mobility by proposing three fast handoff re-routing schemes based on the support of PVCs

Design and implementation of a functional WATM test bed to study the performance of handoff schemes

Includes bibliographical references.The focus of this research is on the design and implementation of a WATM functional architecture in order to facilitate a seamless handoff. The project includes an experimental implementation of the WATM network. This required the building of a prototype WATM network with existing ATM switches and implementing handover protocol schemes at both the access and network sides

Soft Handoff in MC-CDMA Cellular Networks Supporting Multimedia Services

An adaptive resource reservation and handoff priority scheme, which jointly considers the characteristics from the physical, link and network layers, is proposed for a packet switching Multicode (MC)-CDMA cellular network supporting multimedia applications. A call admission region is derived for call admission control (CAC) and handoff management with the satisfaction of quality of service (QoS) requirements for all kinds of multimedia traffic, where the QoS parameters include the wireless transmission bit error rate (BER), the packet loss rate (PLR) and delay requirement. The BER requirement is guaranteed by properly arranging simultaneous packet transmissions, whereas the PLR and delay requirements are guaranteed by the proposed packet scheduling and partial packet integration scheme. To give service priority to handoff calls, a threshold-based adaptive resource reservation scheme is proposed on the basis of a practical user mobility model and a proper handoff request prediction scheme. The resource reservation scheme gives handoff calls a higher admission priority over new calls, and is designed to adjust the reservation-request time threshold adaptively according to the varying traffic load. The individual reservation requests form a common reservation pool, and handoff calls are served on a first-come-first-serve basis. By exploiting the transmission rate adaptability of video calls to the available radio resources, the resources freed from rate-adaptive high-quality video calls by service degradation can be further used to prioritize handoff calls. With the proposed resource reservation and handoff priority scheme, the dynamic properties of the system can be closely captured and a better grade of service (GoS) in terms of new call blocking and handoff call dropping probabilities(rates) can be achieved compared to other schemes in literature. Numerical results are presented to show the improvement of the GoS performance and the efficient utilization of the radio resources

Techniques of distributed caching and terminal tracking for mobile computing.

by Chiu-Fai Fong.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical references (leaves 76-81).Abstract --- p.iAcknowledgments --- p.iiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Distributed Data Caching --- p.2Chapter 1.2 --- Mobile Terminal Tracking --- p.5Chapter 1.3 --- Thesis Overview --- p.10Chapter 2 --- Personal Communication Network --- p.11Chapter 2.1 --- Network Architecture --- p.11Chapter 2.2 --- Resource Limitations --- p.13Chapter 2.3 --- Mobility --- p.14Chapter 3 --- Distributed Data Caching --- p.17Chapter 3.1 --- System Model --- p.18Chapter 3.1.1 --- The Wireless Network Environment --- p.18Chapter 3.1.2 --- Caching Protocol --- p.19Chapter 3.2 --- Caching at Mobile Computers --- p.22Chapter 3.3 --- Broadcasting at the Server --- p.24Chapter 3.3.1 --- Passive Strategy --- p.27Chapter 3.3.2 --- Active Strategy --- p.27Chapter 3.4 --- Performance Analysis --- p.29Chapter 3.4.1 --- Bandwidth Requirements --- p.29Chapter 3.4.2 --- Lower Bound on the Optimal Bandwidth Consumption --- p.30Chapter 3.4.3 --- The Read Response Time --- p.32Chapter 3.5 --- Experiments --- p.35Chapter 3.6 --- Mobility Concerns --- p.42Chapter 4 --- Mobile Terminal Tracking --- p.44Chapter 4.1 --- Movement Model --- p.45Chapter 4.2 --- Optimal Paging --- p.48Chapter 4.3 --- Transient Analysis --- p.52Chapter 4.3.1 --- The Time-Based Protocol --- p.55Chapter 4.3.2 --- Distance-Based Protocol --- p.59Chapter 4.4 --- The Reverse-Guessing Protocol --- p.64Chapter 4.5 --- Experiments --- p.66Chapter 5 --- Conclusions & Future Work --- p.71Chapter 5.1 --- Distributed Data Caching --- p.72Chapter 5.2 --- Mobile Terminal Tracking --- p.73Bibliography --- p.76A Proof of NP-hardness of the Broadcast Set Assignment Problem --- p.8

Traffic modeling in mobile internet protocol : version 6.

Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, Durban, 2005.Mobile Internet Protocol Version 6 (lPv6) is the new version of the Internet Protocol (IP) born out of the great success of Internet Protocol version 4 (IPv4). The motivation behind the development of Mobile IPv6 standard stems from user's demand for mobile devices which can connect and move seamlessly across a growing number of connectivity options. It is both suitable for mobility between subnets across homogenous and inhomogeneous media. The protocol allows a mobile node to communicate with other hosts after changing its point of attachment from one subnet to another. The huge address space available meets the requirements for rapid development of internet as the number of mobile nodes increases tremendously with the rapid expansion of the internet. Mobility, security and quality of service (QoS) being integrated in Mobile TPv6 makes it the important foundation stone for building the mobile information society and the future internet. Convergence between current network technologies: the intern et and mobile telephony is taking place, but the internet's IP routing was designed to work with conventional static nodes. Mobile IPv6 is therefore considered to be one of the key technologies for realizing convergence which enables seamless communication between fixed and mobile access networks. For this reason, there is numerous works in location registrations and mobility management, traffic modeling, QoS, routing procedures etc. To meet the increased demand for mobile telecommunications, traffic modeling is an important step towards understanding and solving performance problems in the future wireless IP networks. Understanding the nature of this traffic, identifying its characteristics and developing appropriate traffic models coupled with appropriate mobility management architectures are of great importance to the traffic engineering and performance evaluation of these networks. It is imperative that the mobility management used keeps providing good performance to mobile users and maintain network load due to signaling and packet delivery as low as possible. To reduce this load, Intemet Engineering Task Force (IETF) proposed a regional mobility management. The load is reduced by allowing local migrations to be handled locally transparent from the Home Agent and the Correspondent Node as the mobile nodes roams freely around the network. This dissertation tackles two major aspects. Firstly, we propose the dynamic regional mobility management (DRMM) architecture with the aim to minimize network load while keeping an optimal number of access routers in the region. The mobility management is dynamic based on the movement and population of the mobile nodes around the network. Most traffic models in telecommunication networks have been based on the exponential Poisson processes. This model unfortunately has been proved to be unsuitable for modeling busty IP traffic. Several approaches to model IP traffic using Markovian processes have been developed using the Batch Markovian Alrival Process (BMAP) by characterizing arrivals as batches of sizes of different distributions. The BMAP is constructed by generalizing batch Poisson processes to allow for non-exponential times between arrivals of batches while maintaining an underlying Markovian structure. The second aspect of this dissertation covers the traffic characterization. We give the analysis of an access router as a single server queue with unlimited waiting space under a non pre-emptive priority queuing discipline. We model the arrival process as a superposition of BMAP processes. We characterize the superimposed arrival processes using the BMAP presentation. We derive the queue length and waiting time for this type of queuing system. Performance of this traffic model is evaluated by obtaining numerical results in terms of queue length and waiting time and its distribution for the high and low priority traffic. We finally present a call admission control scheme that supports QoS

Air Traffic Management Abbreviation Compendium

As in all fields of work, an unmanageable number of abbreviations are used today in aviation for terms, definitions, commands, standards and technical descriptions. This applies in general to the areas of aeronautical communication, navigation and surveillance, cockpit and air traffic control working positions, passenger and cargo transport, and all other areas of flight planning, organization and guidance. In addition, many abbreviations are used more than once or have different meanings in different languages. In order to obtain an overview of the most common abbreviations used in air traffic management, organizations like EUROCONTROL, FAA, DWD and DLR have published lists of abbreviations in the past, which have also been enclosed in this document. In addition, abbreviations from some larger international projects related to aviation have been included to provide users with a directory as complete as possible. This means that the second edition of the Air Traffic Management Abbreviation Compendium includes now around 16,500 abbreviations and acronyms from the field of aviation