<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

1997 - 199972000 - 2009202010 - 201611

Settings

🏛️國立陽明交通大學機構典藏

Subject: search.filters.subject.mobility management

Search Results

Now showing 1 - 10 of 38
  • Thumbnail Image
    Item type:Item,
    A dynamic paging scheme for long-term evolution mobility management
    (2015-03-01)
    Lin, Yi-Bing
    ;
    Liou, Ren-Huang
    ;
    Chang, Chun-Ting
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In long-term evolution, the service area is partitioned into several tracking areas (TAs), which comprise one or more cells (the radio coverages of base stations). The TAs are grouped into TA list (TAL). When an incoming call arrives, the network attempts to connect to the user equipment (UE) by paging the cells in the UE's TAL, which may incur large paging traffic that significantly consumes the limited radio resources. To resolve this issue, this paper proposes a dynamic paging scheme that determines the paging sequence of cells in real time according to the UE movement and call behavior. We compare the performance of the dynamic paging with that of the previously proposed Cell-TA-TAL (CTT) paging. Our study indicates that the dynamic paging outperforms the CTT paging when movement pattern is regular and the UE moves frequently. Copyright (c) 2013 John Wiley & Sons, Ltd.
  • Thumbnail Image
    Item type:Item,
    Reducing International Call Costs for Roamer to Roamer Calls
    (2010-10-01)
    Chen, Yuan-Kai
    ;
    Lin, Yi-Bing
    ;
    Liou, Ren-Huang
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Existing mobile telecom operators allow subscribers to receive mobile phone services when they roam in other countries. However, call setup to an international roaming subscriber is indirectly routed through the home network of the subscriber, which results in the usage of two expensive international telephone trunks. In this paper, we propose a plug-in roaming gateway to avoid the international trunk connections. Our solution is especially attractive when both call parties are roamers.
  • Thumbnail Image
    Item type:Item,
    Reducing location update cost in a PCS network
    (1997-02-01)
    Lin, YB
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Location tracking operations in a personal communications services (PCS's) network are expensive. Several strategies have been proposed to reduce the location update cost, This paper studies a special case of a location tracking algorithm called the alternative location algorithm, This special case is referred to as the two location algorithm (TLA), An analytical model is proposed to compare the performance of TLA and the IS-41 protocol. Our study indicates that the performance of TLA is significantly affected by the user moving patterns and the call traffic. If the user mobility is higher than the call frequency or the user tends to move back to the previously visited registration areas, then TLA may significantly outperform IS-41, We also observe that the variance of the portable residence times in registration areas has impact on the performance of TLA (i.e., better performance is expected for larger variance).
  • Thumbnail Image
    Item type:Item,
    Adaptive algorithms for reducing PCS network authentication traffic
    (1997-08-01)
    Lin, YB
    ;
    Mohan, S
    ;
    Sollenberger, N
    ;
    Sherry, H
    ;
    資訊工程學系
    Two authentication schemes (AS's) ha ce been proposed in the Electronic Industry Association/Telecommunications Industry Association's (EIA/TIA) Telecommunications Systems Bulletins (TSB's) 51 for incorporation in the cellular industry Interim Standard IS 41 Revision C. In the first scheme, which we refer to as the RS scheme, a unique secret key [also known as shared secret data (SSD)] is Shared only between the authentication center (AC) and handset. In the second scheme, referred to as the S scheme, the SSD is also shared with the visited system. The performance of the two schemes can be compared by using the expected number of call originations/terminations between two consecutive registrations or call-to-mobility ratio (CMR). Based on the message flow (accesses to databases), it is apparent that the S scheme outperforms the WS schemes if the CMR ratio is large. The CMR's of users will likely span a wide range and, even for the same user, will perhaps vary from time to time. It is therefore desirable to switch between the AS's based on the users' CMR to reduce the signaling network traffic. We propose two adaptive algorithms to determine how and when to switch between the AS's for a given user. Our performance study indicates that as the CMR of a user changes, the adaptive algorithms automatically select the best AS in real time.
  • Thumbnail Image
    Item type:Item,
    Mobility Management for Low-Latency Handover in SDN-Based Enterprise Networks
    (2016)
    Chen, Ce
    ;
    Lin, Yu-Ting
    ;
    Yen, Li-Hsing
    ;
    Chan, Min-Cheng
    ;
    Tseng, Chien-Chao
    Low-latency handover is crucial to real-time traffic in wireless networks. This paper considers an enterprise network managed by emerging Software Defined Network (SDN) technology. For this networking environment, we propose a mobility management scheme named Mobility SDN (M-SDN) that reduces the traffic pause time caused by a host-initiated layer-2 handover. M-SDN performs handover preparation in parallel with the layer-2 handover that involves N-casting of active flows to every potential handover target. Handover preparation is enabled by efficient address resolution and location tracking. We have implemented a prototype of M-SDN and conducted several experiments to evaluate the performance of M-SDN. Experimental results show that M-SDN effectively reduces the impact of layer-2 handovers without any modification on mobile devices.
  • Thumbnail Image
    Item type:Item,
    Deregistration strategies for PCS networks
    (1998-02-01)
    Lin, YB
    ;
    資訊工程學系
    ;
    Department of Computer Science
    This paper studies three deregistration strategies (explicit, implicit, and timeout (TO) deregistration) for personal communication service (PCS) networks to determine the network conditions under which each strategy gives the best performance, Two performance measures are considered: 1) the probability alpha that a portable cannot register (and receive service) and 2) the number of deregistration messages sent in a strategy, For the same database size, alpha is smaller for explicit deregistration (ED) than it is for TO or implicit deregistration (ID)). On the other hand, ID does not create any deregistration message traffic, With an appropriate TO period, the deregistration message traffic for TO deregistration is much smaller than the traffic for ED, Suppose that there are N portables in a registration area (RA) on the average, To ensure that alpha < 10(-3), our study indicates that if the database size is larger than 4N, then the implicit scheme should be selected (to eliminate deregistration traffic), If the database size is smaller than 1.5N, then the explicit scheme should be selected, Otherwise, the TO scheme should be selected to achieve the best performance.
  • Thumbnail Image
    Item type:Item,
    Mobility Management for Wireless Systems with Unreliable Backhaul Links
    (1998-05-01)
    Lin, Yi-Bing
    ;
    Chen, Shu-Chin Su
    ;
    Yang, Chu-Sing
    ;
    資訊工程學系
    ;
    Department of Computer Science
    We consider a wireless system with unreliable microwave backhaul links. Since the links may be disconnected, location update procedure may be incorrectly exercised, which results in misrouted calls. This letter proposes an analytic model to derive the misrouting probabilities as functions of the link disconnection time distribution. These equations can be used as the design guideline to select the microwave equipment for the wireless system.
  • Thumbnail Image
    Item type:Item,
    Reducing International Call Costs for Roamer to Roamer Calls
    (2010-10-01)
    Chen, Yuan-Kai
    ;
    Lin, Yi-Bing
    ;
    Liou, Ren-Huang
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Existing mobile telecom operators allow subscribers to receive mobile phone services when they roam in other countries. However, call setup to an international roaming subscriber is indirectly routed through the home network of the subscriber, which results in the usage of two expensive international telephone trunks. In this paper, we propose a plug-in roaming gateway to avoid the international trunk connections. Our solution is especially attractive when both call parties are roamers.
  • Thumbnail Image
    Item type:Item,
    A new random walk model for PCS networks
    (2000-07-01)
    Akyildiz, IF
    ;
    Lin, YB
    ;
    Lai, WR
    ;
    Chen, RJ
    ;
    資訊工程學系
    This paper proposes a new approach to simplify the two-dimensional random walk models capturing the movement of mobile users in Personal Communications Services (PCS) networks. Analytical models are proposed for the new random walks. For a PCS network with hexagonal configuration, our approach reduces the states of the two-dimensional random walk from (3n(2) + 3n - 5) to n(n + 1)/2, where n is the layers of a cluster. For a mesh configuration, our approach reduces the states from (2n(2) - 2n + 1) to (n(2) + 2n + 4)/4 if n is even and to (n(2) + 2n + 5)/4 if n is odd. Simulation experiments are conducted to validate the analytical models. The results indicate that the errors between the analytical and simulation models are within 1%, Three applications (i.e., microcell/macrocell configuration, distance-based location update, and GPRS mobility management for data routing) are used to show how our new model can be used to investigate the performance of PCS networks.
  • Thumbnail Image
    Item type:Item,
    Implicit deregistration with forced registration for PCS mobility management
    (2001)
    Pang, AC
    ;
    Lin, YB
    ;
    Fang, YG
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Registration/deregistration with a mobility database called Visitor Location Registers (VLRs) is required in a PCS network when a mobile phone moves between registration areas. Several schemes were proposed to deregister a mobile phone after it moves out of a registration area. A simple scheme, called implicit deregistration, is studied in this paper, which does not specifically deregister any obsolete record in the VLR. If the VLR is full when a mobile phone arrives, a record in the VLR is deleted and the reclaimed storage is reassigned to the incoming mobile phone. It is possible that a valid record will be deleted. If so, the VLR record of a mobile phone may be deleted before a call to the mobile phone arrives. Our previous work assumed that the incoming call setup would be lost. In this paper, we propose forced registration to restore the VLR record before the call setup operation can proceed. With this modification, implicit deregistration totally eliminates the deregistration traffic at the cost of creating some forced registration traffic. We derive the record-missing probability and the portion of the network traffic saved by implicit deregistration. Our study indicates that implicit deregistration with forced registration may significantly reduce the deregistration traffic if the user mobility is high and the number of mobile phones in a registration area is not very large.