VIMLOC Location Management in Wireless Meshes: Experimental Performance Evaluation and Comparison

무선 메쉬 네트워크는 멀티홉으로 구성된 무선 백본 네트워크 기술이다. 이러한 네트워크에서 단말에게 서비스를 제공하기 위해서는 단말 위치관리는 필수적이다. IEEE 802.11s 표준에서는 두 가지 방법의 위치관리 기법을 제시하고 있다. 하지만 제시하고 있는 기법은 불필요한 제어 메시지 발생, 비효율적인 위치정보 유지, 추가적인 지연시간 발생 등의 단점을 지니고 있다. 본 논문은 일반 트래픽의 6-Address 구조에 담겨 있는 위치정보를 사용하여 On-demand 형태로 작동하는 이동단말의 위치정보 관리기법을 제안한다. 제안방법을 실제 구현을 통해 검증하였으며, 시뮬레이션을 통해 성능을 비교 해보았다. 분석과 실험 결과를 통해 위치정보 갱신을 위해 발생한 제어 메시지의 감소, 전송을 위한 지연시간 단축 등의 결과를 보여주었다. Wireless mesh networks(WMNs) are wireless backbone networks technology consisting of a multi-hop routers. Location management is essential to provide a service to the terminal in WMNs. IEEE 802.11s standards have two basic location management scheme for location management - the proxy registration procedure and the associated station discovery protocol. These basic schemes, however, suffer from serious drawbacks including redundancy control message, ineffective location information maintenance, additional delay time. This paper propose an on-demand station location management scheme using 6-address structure of IEEE 802.11s. Through analysis and experimental evaluation on simulation, we show that proposal scheme reduce control message and forwarding delay time.

Virtual Home Region Multi-Hash Location Management Service (VIMLOC) for Large-Scale Wireless Mesh Networks

Location management schemes are essentially based on users' mobility and incoming call rate characteristics. The network mobility process has to face strong antagonism between its two basic procedures: location update (or registration) and paging. The location update procedure allows the system to keep location knowledge more or less accurately in order to find the user in case of an incoming call, for example. Location registration also is used to bring the user's service profile near its location and allows the network to rapidly provide the user with services. The paging process achieved by the system consists of sending paging messages in all cells where the mobile terminal could be located. A detailed description of the means and techniques for user location management in present cellular networks is addressed.A network must retain information about the locations of endpoints in the network in order to route traffic to the correct destinations. Location tracking (also referred to as mobility tracking or mobility management) is the set of mechanisms by which location information is updated in response to endpoint mobility. In location tracking, it is important to differentiate between the identifier of an endpoint (i.e., what the endpoint is called) and its address (i.e., where the endpoint is located). Mechanisms for location tracking provide a time-varying mapping between the identifier and the address of each endpoint. Most location tracking mechanisms may be perceived as updating and querying a distributed database (the location database) of endpoint identifier-to-address mappings. In this context, location tracking has two components: (1) determining when and how a change in a location database entry should be initiated; and (2) organizing and maintaining the location database. In cellular networks, endpoint mobility within a cell is transparent to the network, and hence location tracking is only required when an endpoint moves from one cell to another. Location tracking typically consists of two operations: (1) updating (or registration), the process by which a mobile endpoint initiates a change in the location database according to its new location; and (2) finding (or paging), the process by which the network initiates a query for an endpoint's location (which also may result in an update to the location database). Most location tracking techniques use a combination of updating and finding in an effort to select the best trade-off between update overhead and delay incurred in finding. Specifically, updates are not usually sent every time an endpoint enters a new cell, but rather are sent according to a predefined strategy so that the finding operation can be restricted to a specific area. There is also a trade-off, analyzed formally between the update and paging costs.Location management methods are most adapted and widely used in current cellular networks, e.g., GSM, IS-54. IS-95, etc. The location management methods are broadly classified into two groups. The first group includes all methods based on algorithms and network architecture, mainly on the processing capabilities of the system. The second group contains the methods based on learning processes, which require the collection of statistics on subscribers' mobility behavior, for instance.

This paper proposes a location management scheme—combining dynamic location update scheme with static one for the next-generation mobile cellular networks. In the proposed strategy, instead of adopting dynamic location management for all mobile users, classifying them into DLMU(Dynamic Location Management User) and SLMU(Static Location Management User) by a CMR(Call-to- Mobility-Ratio) threshold. Compared with the conventional location update scheme, this strategy can make good use of the dynamic, movement-based location update scheme employed in this paper. Moreover, this paper analyzes how to choose the CMR threshold by simulation. As for the next-generation mobile cellular networks, this proposed scheme can be implemented to reduce the signaling cost evidently, for its facility and feasibility compared with the conventional dynamic location management.

The growth in the number of users in mobile communications networks and the rise in the traffic generated by each user, are responsible for the increasing importance of mobility management. Within mobility management, Location Management makes sure that the roaming of the user within the coverage area is enabled. New strategies are being proposed to minimize the signaling costs involved in Location Management. In this paper we focus on user profile based algorithms and present new methods to calculate useful parameters for the estimation of the Location Management costs. In particular, we apply new algorithms to obtain the ?O?nparameters (useful in the calculation of the location update costs for different Location Management strategies), and we summarize our results in terms of practical guidelines for the networks designers in order to minimize signaling costs.

The wireless mesh networks (WMNs) have become one of the popular technologies of the wireless network utilization. WMN provides reliable and scalable wireless network because of its features such as dynamic self-organizing, self-configuring, Self-managing and self-healing. Routing protocols play an essential role in finding and establishing an active route from a source to a destination in WMNs. This article focuses on the performance evaluation and comparison of some routing protocols commonly used in WMNs for VoIP application: AODV, DSR, OLSR and TORA has been investigated over client Wireless Mesh Networks based on OPNET simulation in a different network sizes and mobility. This article presents a background of some designs and solutions based on an elaborated simulation investigation. The performance comparisons are carried out with regard to the node variation in network sizing and mobility. Based on the empirical outputs, the authors suggested that to utilize a specific routing protocol in certain situations.

The paper proposes an integrated location management scheme, based on our previously proposed novel rule-based paging scheme (RBPS) for reducing the cost of terminal paging in a cellular wireless environment. We extend that scheme to propose a complete location management scheme. This requires application of RBPS together with a judicious movement based location update (LU) scheme. Numerical results show that the proposed integrated location management scheme, called RBPS*, not only attempts to resolve the issue of inherent tradeoff between the cost components, comprised of paging and LU cost, but also does reduce the total cost for location management compared to the other schemes. RBPS* significantly outperforms RBPS and the GSM-adopted blanket paging scheme along with movement based LU. When compared with the popular shortest distance first (SDF) scheme, results are again encouraging. The proposed scheme, RBPS*, is a generic one and can be deployed on-line. It has the potential for use in next generation wireless networks, irrespective of any standards.

Location management techniques for mobile systems

Personal communication services (PCS) standards such as the IS-41 and the GSM use a location management scheme, which is based on registration areas (RA). Overlapping of registration areas has been proposed to reduce the overhead of location updates in such systems. Overlapping provides multiple choices for the selection of a registration area, a feature that does not appear in environments of nonoverlapping RAs. In this paper, we demonstrate how the choice of a registration area affects the number of subsequent registrations and define the problem of optimal choice based on minimization of subsequent registrations. We study two versions of the problem: 1) the deterministic (or offline) version, in which the entire trajectory of the mobile unit is known a priori, and 2) the stochastic (or online) version, in which the trajectory of the mobile unit is not known a priori, but the system has the knowledge of the mobility pattern of the mobile. The mobility pattern is modeled as a random walk across coverage area. In the deterministic case, the method presented computes an optimal solution to the registration problem. In the stochastic case, we present a method that determines the registration that minimizes the expected number of registrations by looking ahead in the probable future paths of the mobile unit. The algorithm's time complexity has exponential dependence on the length of the look-ahead. The cost of search is independent of the choice, therefore the algorithm does not increase the search cost. We also consider an alternative cost model for the stochastic case and propose a preemptive and a nonpreemptive approach each of which incurs different numbers of hard and soft registration operations. Simulation results show a reduction of 25-30 percent in number of registrations over a random-choice scheme. This can be translated to 5-20 percent effective location management load reduction for most cases, subject to the call-to-mobility ratio (CMR) of a mobile unit and search-cost-to-update-cost ratio (CCR) in the network.

The cellular principle is an effective way to guarantee efficient utilization of the offered radio band. Although PCS networks use the cellular principle, the next generation of PCS networks needs more improvements in location management to face the increased number of users. Both an Enhanced Profile- Based Strategy (EPBS) for small-scale roaming and a Caching Two-Level Forwarding Pointer (C2LFP) strategy for large-scale roaming have been proposed. This chapter introduces a model that unites the above two strategies. The idea behind this model is based on applying those two location management strategies and specifying the physical parameters of PCS networks from mobility management’s point of view so that the underlying solutions can be more cost effective for location management. An evolutionary method using a constraint Genetic Algorithm (GA) has been used to achieve network parameters optimization. For convenience, we selected the planning problem with an appropriate set of parameters to be treated both genetically and analytically. Thus one can easily verify accuracy and efficiency of the evolutionary solution that would be obtained from the genetic algorithm. For more realistic environments, GA could be used reliably to solve sophisticated problems that combine the small-scale and large-scale roaming parameters of PCS networks. A case study is presented to provide a deep explanation of the proposed integration approach.

Wireless Mesh Networks (WMNs) are an important networking infrastructure for providing cost-efficient broadband wireless connectivity to a group of users. WMNs are increasingly being used in urban areas, metropolitan and municipal area networks for deployment of medical, transport, surveillance systems, etc. The good performance and operability of WMNs largely depends on placement of mesh routers nodes in the geographical area to achieve network connectivity and stability. Therefore, optimal placement of router nodes in WMNs is a main issue in deployment of WMNs. In this work we propose and evaluate local search methods for placement of mesh routers in WMNs with a two fold objective: maximizing the size of the giant component in the network and user coverage. Given a grid area where to distribute a given number of mesh router nodes, which can have different radio coverage, and a number of fixed clients a priori distributed in the given area, local search methods explore different local movements and incrementally improve the quality of the router nodes placement in terms of network connectivity and user coverage. We have experimentally evaluated the considered local search methods through a benchmark of generated instances varying from small to large size. In the instances, different distributions of mesh clients (Uniform, Normal, Exponential and Weibull) are considered aiming to evaluate the quality of achieved solutions for different client distributions. Although local search methods can be stuck in local optima, the experimental evaluation showed their good performance; local search methods could thus be applied as a first choice for optimizing network connectivity and user coverage in WMNs.

Mobility management is an important aspect in LEO systems. In terrestrial wireless networks, the movement of the user triggers location updating and determines the paging scheme, while in LEO satellite systems, location updating and paging is mainly based on the movement of satellites. Terrestrial location management techniques must be altered to fit LEO systems. The paper introduces a modified movement-based location update and paging scheme in LEO networks. We propose the meta-cell concept, which includes two spot-beams of one satellite. First, we present a location management scheme based on the architecture with a meta-cell location area. Then, an analytical model is applied to formulate the cost of location updating and location paging for the movement and meta-cell based dynamic location update scheme. The comparison of performance between the meta-cell architecture method and the conventional signal-spot-cell architecture method is provided to demonstrate the cost-effectiveness and robustness of the proposed scheme under various parameters. To reduce the impact of meta-cell architecture on location paging cost, we present a forced location update strategy which is used in the case that the meta-cell includes two spot-beams from different satellites.

IP mobility can be handled at different layers of the protocol stack. Mobile IP has been developed to handle mobility of Internet hosts at the network layer. As an alternative solution, a number of transport layer mobility protocols have been proposed. However, the location management schemes used in these transport layer solutions are not suitable for frequent mobile handovers due to user's high mobility. In this paper, we propose HiSlGMA, a hierarchical location management scheme for transport layer mobility schemes. We used an analytical model to evaluate HiSlGMA using signaling cost as the performance measure, followed by comparison of the signalling cost of HiSlGMA and hierarchical mobile IPv6 (an enhancement of Mobile IP) and existing transport layer mobility solutions.

Location management based on distance and direction for PCS networks

A location management scheme to support non-geographic phone numbers in personal communications services