簡易檢索 / 詳目顯示

研究生: 何健益
Chien-Yi Ho
論文名稱: Distributed Location Management in Wireless Mobile Networks
無線移動網路上分散式位置管理之研究
指導教授: 林華君
Hwa-Chun Lin
口試委員:
學位類別: 博士
Doctor
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2008
畢業學年度: 96
語文別: 英文
論文頁數: 80
中文關鍵詞: 分散式位置資料庫位置管理複製位置資訊滑動框架無線移動網路
外文關鍵詞: Distributed location databases, Location management, Replicated location information, Sliding-frame, Wireless mobile networks
相關次數: 點閱:3下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • Location management strategies significantly affect the performance of wireless mobile networks.
    This study investigates location management strategies in mobile wireless networks.

    The first part of this study proposes a distributed location management strategy,
    based on a distributed location information database (LID) architecture, in which
    the traffic and load for updating and finding the locations of the mobile hosts are
    evenly distributed among the LIDs. The average communication cost of the proposed
    sliding-frame strategy is then analyzed, without considering visitor location register (VLR)
    traffic, and shown to be always less than or equal to that of the strategy proposed by
    G. Krishnamurthi et al. Numerical results are then shown and demonstrate that the proposed
    strategy incurs a significantly lower average communication cost than the strategy proposed
    by G. Krishnamurthi et al. when the average call to mobility ratio of the mobile hosts is low to medium.

    The second part explores properties of the sets of LIDs based on the proposed distributed LID
    architecture, when they are queried by the MSCs to fulfill query requests for the locations of
    the mobile hosts. The average communication cost of the proposed strategy when using VLR traffic is analyzed,
    and shown to be always lower than or equal to that of the strategy proposed by G. Krishnamurthi et al.
    Finally, numerical results are presented, showing that the proposed sliding-frame strategy has a
    significantly lower average communication cost than the strategy proposed by G. Krishnamurthi et al.,
    when the average call to mobility ratio of the mobile hosts is low to medium and the number of replications
    of each piece of location information is medium to large.

    The third part explores the average database response time of LIDs. An analysis of the average database
    response time of LIDs indicates that the proposed sliding-frame strategy can manage the same amount or
    more traffic than the strategy proposed by G. Krishnamurthi et al. The average database response time
    of the proposed strategy is analyzed, and shown to be always lower than or equal to that of the strategy
    proposed by G. Krishnamurthi et al. The upper bound on the total request arrival rate is then analyzed.
    Finally, numerical results are presented, and indicate that the proposed sliding-frame strategy has a
    significantly lower average database response time than the strategy proposed by G. Krishnamurthi et al.,
    when the average call to mobility ratio of the mobile hosts is low to medium and the number of replications
    of each piece of location information is medium to large.


    隨著無線行動網路使用者的增加,貯存使用者位置資訊的資料庫負載也增加,在降低資料庫負載的同時,
    也讓資料庫系統具有容錯的能力,必須仰賴一個設計良好的位置管理策略。使用分散式資料庫
    架構來管理使用者位置資訊,可以提供資料庫系統容錯能力和分散負載於所有的資料庫中。
    因此本博士論文主要分成三個部分,研究分散式的資料庫架構下有關位置管理的相關議題。

    在本論文的第一部分,我們提出了一個新的位置管理策略稱之為滑動框架策略,這個策略可以讓更新移動手機位置資訊和尋找
    被呼叫移動手機位置資訊的訊號流量,平均的分散在貯存位置資訊的所有資料庫中;IS-41 是現行常用的通訊協定之一,在這個通訊協定中
    資料庫系統是一個雙層的資料庫結構,上層為家位置位置暫存器,下層為訪問者位置暫存器,在不考慮訪問者位置暫存器訊號流量的條件下,
    我們分析平均的通訊訊息代價而且證明滑動框架策略比 G. Krishnamurthi et al. 所提出的策略有更低的或者是相同的平
    均通訊訊息代價;在
    代入相關變數一些數值後,可以得知,若移動手機從一個位置區域移到下一個位置區域所需的平均時間內,這個移動手機
    被其他移動手機呼叫的次數很少時,則滑動框架策略會比 G. Krishnamurthi et al. 所提出的策略,明顯有較低的平均通訊訊息代價。

    在本論文的第二部分,我們將處理一個詢問要求時,所有被查詢的一些資料庫,定義為一個詢問集合,
    以資料庫總數能否被資料庫複製個數所整除的前提下,我們發現,詢問集合在不同的狀況下,會有一些不同的特點,
    這些特點在此被說明且證明;在這個部分,我們在考慮訪問者位置暫存器訊號流量的條件下,重新分析平均通訊訊息代價
    而且證明滑動框架策略比 G. Krishnamurthi et al. 所提出的策略,有更低的或者是相同的平均通訊訊息代價;在
    代入相關變數一些數值後,可以得知,在移動手機從一個位置區域移到下一個位置區域所需的平均時間內,若這個移動手機
    被其他移動手機呼叫的次數很少時,則滑動框架策略會比 G. Krishnamurthi et al. 所提出的策略,明顯有較低的平均通訊訊息
    代價;或者是複製
    移動手機位置資訊的資料庫個數增加時,滑動框架策略會比 G. Krishnamurthi et al. 所提出的策略,明顯有較低的平均通訊訊息代價。

    在本論文的最後一個部分,我們研究位置資訊資料庫的平均反應時間,經由分析位置資訊資料庫的平均反應時間,
    我們證明滑動框架策略比 G. Krishnamurthi et al. 所提出的策略,可以處理相同或者是更多的訊號流量,而且滑動框架策略
    比 G. Krishnamurthi et al. 所提出的策略,
    有相同或者是更少的平均資料庫反應時間;另外我們也分析資料庫系統所能處理訊息流量的上限值,並計算出此上限值;
    在代入相關變數一些數值後,可以得知,在移動手機從一個位置區域移到下一個位置區域所需的平均時間內,若這個移動手機
    被其他移動手機呼叫的次數很少時,則滑動框架策略會比 G. Krishnamurthi et al. 所提出的策略,明顯有較低的平均資料庫反
    應時間;或者是複製
    移動手機位置資訊的資料庫個數增加時,滑動框架策略會比 G. Krishnamurthi et al. 所提出的策略,明顯有較低的平均資料庫反應時間。

    Abstract i 中文摘要 iii Acknowledgement 誌謝 v List of Tables ix List of Figures xi 1 Introduction 1 1.1 Wireless Mobile Networks ...........................1 1.2 Location Management Strategies in Wireless Mobile Networks .............................................. 3 1.2.1 Centralized Database Architectures .............. 3 1.2.2 Distributed Database Architectures ...............8 1.3 Research Topics and Proposed Approaches .......... 12 1.4 Thesis Organization .............................. 14 2 Sliding-Frame Strategy.............................. 15 2.1 Background Information ........................... 15 2.2 Overview of Sliding-Frame Strategy ............... 17 2.3 Average Communication Cost ....................... 19 2.3.1 Communication Cost Analysis .................... 19 2.3.2 Cost Improvement of Sliding-Frame over K-A-S ... 21 2.4 Numerical Results ................................ 22 2.5 Optimal Replication Factor ........................22 2.6 Summaries ........................................ 24 3 Cost Analysis of Sliding-Frame Strategy with Consideration of VLR Traffic.......................... 31 3.1 Background Information ............................31 3.2 Overview of Sliding-Frame Strategy ................33 3.3 Some Properties of the Sets of Queried Location Information Databases .................................35 3.3.1 Property One ................................... 36 3.3.2 Property Two ....................................36 3.3.3 Property Three ................................. 37 3.3.4 Property Four .................................. 37 3.4 Related Analyses of Average Communication Cost ....39 3.4.1 Modified Procedure for Inter-VLR Location Update 43 3.4.2 Modified Procedure for Call Delivery ........... 45 3.4.3 Average Communication Cost ..................... 46 3.5 Numerical Results ................................ 49 3.6 Summaries ........................................ 51 4 Response Time of Location Information Database ......53 4.1 Background Information ........................... 53 4.2 Average Database Response Time ................... 58 4.2.1 Database Response Time Analysis ................ 58 4.2.2 Difference in Database Response Time between Sliding- Frame and K-A-S ...................................... 62 4.3 Upper Bound on the Total Request Arrival Rate .....63 4.4 Numerical Results ................................ 64 4.5 Summaries ........................................ 66 5 Conclusions .........................................68 Bibliography ..........................................71 Publication List ......................................80

    [1] EIA/TIA, “Cellular radio-telecommunications intersystem operations,”
    EIA/TIA Tech. Rep. IS-41 Revision B 1991.
    [2] A. Bar-Noy, and I. Kessler, “Tracking mobile users in wireless communications
    networks,” IEEE Trans. on Information Theory, pp. 1877-1886, Nov.
    1993.
    [3] A. Bar-Noy, I. Kessler, and M. Sidi, “Mobile users: to update or not to
    update?,” Proceedings of the IEEE INFOCOM, pp. 570-576, June 1994.
    [4] M. C. Pinotti, and L. Wilson, “On the problem of tracking mobile users
    in wireless communications networks,” Proceedings of the Thirty-First
    Hawaii International Conference on System Sciences, pp. 666-671, Jan.
    1998.
    [5] W. Huanjing, F. Guangbin and Z. Jingyuan, “Performance comparison of
    location areas and reporting centers under aggregate movement behavior
    71
    mobilitymodels,” Proceedings of International Conference on Parallel Processing,
    pp. 445-452, Aug. 2002.
    [6] G. Y. Lee, and Y. Lee, “Optimal time-interval for time-based location update
    in mobile communications,” Global Telecommunications Conference (
    GLOBECOM ), pp. 2079-2083, Nov. 2002.
    [7] G. Y. Lee, and Y. Lee,“Performance analysis of an modified time-based location
    registration scheme,” IEEE International Conference on Local Computer
    Network, pp. 492-497, Oct. 2003.
    [8] S. Saha, M. Mukherjee, A. R. Paul, and S. Neogy, “TPRLM: Time-based
    probabilistic relational location management scheme for wireless cellular
    networks,” International Conference on Communication Systems Software
    and Middleware, pp. 1-10, 2007.
    [9] A. Nayebi, M. R. Rahimi, and H. S. Azad, “Analysis of time-based random
    waypoint mobility model for wireless mobile networks,” International
    Conference on Information Technology, pp. 42-47, 2007.
    [10] V. W. S. Wong, and V. C. M. Leung, “An adaptive distance-based location
    update algorithm for next-generation PCS networks,” IEEE Journal on Selected
    Areas in Communications, pp. 1942-1952, Oct. 2001.
    [11] E. Clayirci, and I. F. Akyildiz, “User mobility pattern scheme for location
    update and paging in wireless systems,” IEEE Transactions on Mobile Computing,
    pp. 236-247, July-Sep. 2002.
    [12] G. Gupta, and R. Garg, “Minimizing the cost of mobility management:
    distance-based scheme as a function of user’s profile,” Wireless Communications
    and Networking (WCNC), pp. 2075-2080, 2003.
    [13] B. Liang, and Z. J. Haas, “Predictive distance-based mobility management
    for multidimensional PCS networks,” IEEE/ACM Transactions on Networking,
    pp. 718-732, Oct. 2003.
    [14] T. Tung, and A. Jamalipour, “Adaptive location management strategy to the
    distance-based location update technique for cellular networks,” Wireless
    Communications and Networking Conference (WCNC), pp. 21-25, March
    2004.
    [15] C. L. Ng, and H.W. Chan, “Enhanced distance-based location management
    of mobile communication systems using a cell coordinates approach,” IEEE
    Transactions on Mobile Computing, pp. 41-55, 2005.
    [16] Z. Liu, and T. D. Bui, “Dynamical mobile terminal location registration
    in wireless PCS networks,” IEEE Transactions on Mobile Computing, pp.
    630-640, 2005.
    [17] M. S. Sricharah, and V. Vaidehi, “A dynamic distance based location management
    strategy utilizing user profiles for next generation wireless networks,”
    Industrial and Information Systems, pp. 388-392, 2006.
    [18] J. Zhou, L. H. Va, Q. Lu, and C. K. Ken, “Optimizing update threshold for
    distance-based location tracking strategies in moving object environments,”
    World of Wireless Mobile and Multimedia Networks, pp. 1-8, 2007.
    [19] A. Bera, and N. Das, “Performance analysis of dynamic location updation
    strategies for mobile users,” International Conference on Distributed Computing
    Systems, pp. 428-435, 2000.
    [20] J. T. Tsai, H. H. Hsiao, “Performance of movement-based location update
    and one-step paging in wireless networks with sparsely underlaid microcells,”
    Global Telecommunications Conference (GLOBECOM), pp. 642-
    647, 2001.
    [21] F. Erbas, J. Steuer, D. Eggesieker, K. Kyamakya, and L. Jobinann, “A regular
    path recognition method and prediction of user movements in wireless
    networks,” Vehicular Technology Conference (VTC), pp. 2672-2676, Oct.
    2001.
    [22] Y. Xiao, and J. Li, “Movement-based location management for 3G cellular
    networks,” Global Telecommunications Conference ( GLOBECOM ), pp.
    4101-4105, 2003.
    [23] X. Yang, and K. Wu, “Location update for PCS networks with a fractional
    movement threshold,” International Conference on Distributed Computing
    Systems Workshops, pp. 825-829, 2003.
    [24] V. C. Giner, and P. G. Escalle, “On movement base mobility tracking
    strategy-a general framework,” Wireless Communications and Networking
    Conference, pp. 1957-1962, March 2004.
    [25] N. Shenoy, and B. Hartpence, “A mobility model for cost analysis in integrated
    cellular/WLANs,” International Conference of Computer Communications
    and Networks (ICCCN), pp. 275-280, 2004.
    [26] M.Maitra, D. Saha, C. Esakkiappan, P. S. Bhattacharjee, and A. Mukherjee
    , “An intelligent location management strategy for next generation wireless
    networks: a rule base approach,” Wireless Communications and Networking
    Conference (WCNC), pp. 1365-1370, 2005.
    [27] Y. H. Zhu, and V. C. M. Leung, “Optimization of sequential paging
    in movement-based location management based on movement statistics,”
    IEEE Transactions on Vehicular Technology, pp. 955-964, 2007.
    [28] R. M. Rodriguez-Dagnino, and H. Takagi, “Movement-based location management
    for general cell residence times in wireless networks,” IEEE Transactions
    on Vehicular Technology, pp. 2713-2722, 2007.
    [29] G. Y. Lee, Y. Lee, and Z. J. Haas, “Hybrid location-update scheme for mobile
    networks,” IEEE Transactions on Vehicular Technology: Accepted for
    future publication.
    [30] G. P. Pollini, and I. C. Lin, “A profile-based location strategy and its performance,”
    IEEE Journal on Selected Areas in Communications, vol. 15, no.
    8, pp. 1415-1424, Oct. 1997.
    [31] N. Adly, and A. EI-Nahas, “A profile-based hierarchical location management
    scheme for future PCS,” International Workshop on Database and
    Expert Systems Applications, pp. 204-208, Sep. 2000.
    [32] A. Quintero, O. Garcia, and S Pierre, “Location management in thirdgeneration
    networks: a user mobility approach,” IEEE Canadian Conference
    on Electrical and Computer Engineering, pp. 761-764, May 2003.
    [33] W. Ma, Y. Fang, and P. Lin, “Mobility management strategy based on user
    mobility patterns in wireless networks,” IEEE Trans. on Vehicular Technology,
    vol. 56, no. 1, pp. 322-330, Jan. 2007.
    [34] J. Modares, F. Hendessi, and A. Montazeri, “A profile-based scheme for
    location updating and paging in wireless systems,” The International Conference
    on ”Computer as a Tool”, pp. 1116-1123, Sep. 2007.
    [35] R. Jain, Y. B. Lin, C. Lo, and S. Mohan, “A forwarding strategy to reduce
    network impacts of PCS,” Proceedings of the IEEE INFOCOM, pp. 481-
    489, 1995.
    [36] W. Ma, and Y. Fang, “Two-level pointer forwarding strategy for location
    management in PCS networks,” IEEE Trans. on Mobile Computing, vol. 1,
    no. 1, pp. 32-45, 2002.
    [37] W.Ma, and Y. Fang, “A pointer forwarding based local anchoring (POFLA)
    scheme for wireless networks,” IEEE Trans. on Vehicular Technology, vol.
    54, no. 3, pp. 1135-1146, 2005.
    [38] Z. Mao, and C. Douligeris, “Group registration with local anchor for location
    tracking in mobile networks,” IEEE Trans. on Mobile Computing, vol.
    5, no. 5, pp. 583-595, May 2006.
    [39] Y. B. Lin, and W. N. Tsai, “Location tracking with distributed HLR’s and
    pointer forwarding,” IEEE Trans. on Vehicular Technology, vol. 47, no. 1,
    pp. 58-64, Feb. 1998.
    [40] K. L. Sue, and C. C. Tseng, “One-step pointer forwarding strategy for location
    tracking in distributed HLR environment,” IEEE Journal on Selected
    Areas in Communications, vol. 15, no.8, pp. 1455-1466, Oct. 1997.
    [41] C. M. Weng, and C. H. Chu, “K-step pointer forwarding strategy for location
    tracking in distributed HLR environment,” IEE Proceedings - Communications,
    vol. 150, no. 3, pp. 207-213, June 2003.
    [42] N. Prakash, “Performance analysis of two level single chain pointer forwarding
    strategy location management,” Proceedings of the IEEE International
    Conference on Personal Wireless Communications (ICPWC), pp.
    394-398, 2005.
    [43] C.M.Weng, and P.W. Huang, “More efficient location tracking in PCS systems
    using a novel distributed database System,” IEEE Trans. on Vehicular
    Technology, vol. 51, no. 4, pp. 677-689, July 2002.
    [44] Z. Mao, and C. Douligeris, “A distributed database architecture for global
    roaming in next-generation mobile networks,” IEEE/ACM Trans. on Networking,
    vol. 12, no. 1, February 2004.
    [45] R. Prakash, and M. Singhal, “A dynamic approach to location management
    inmobile computing systems,” Proceedings of the 8th International Conference
    on Software Engineering and Knowledge Engineering (SEKE), Lake
    Tahoe, pp. 488-495, June 1996.
    [46] R. Prakash, Z. Haas, and M. Singhal, “Load-balanced location management
    for mobile systems using dynamic hashing and quorums,” Technical Report
    UTDCS-05-97, University of Texas at Dallas, Oct. 1997.
    [47] R. Prakash, Z. Haas, and M. Singhal, “Load-balanced location management
    for cellular mobile systems using quorums and dynamic hashing,” Wireless
    Network, vol. 7, no. 5, pp. 497-512, Sep. 2001.
    [48] G. Krishnamurthi,M. Azizoglu, and A. K. Somani, “Optimal location management
    algorithms for mobile networks,” Proceedings of the Fourth Annual
    ACM/IEEE International Conference on Mobile Computing and Networking,
    pp. 223-232, Oct. 1998.
    [49] G. Krishnamurthi, S. Chessa, and A. K. Somani, “Optimal replication of
    location information in mobile networks,” Proceedings of the IEEE ICC,
    pp. 1768-1772, 1999.
    [50] G. Krishnamurthi, M. Azizoglu, and A. K. Somani, “Optimal distributed
    location management in mobile networks,” Mobile Networks and Applications,
    vol. 6, no. 2, pp. 117-124, 2001.
    [51] Y.B. Lin, and A. Noerpel, “Queueing priority channel assignment strategies
    for handoff and initial access for a PCS network,” IEEE Trans. on Vehicular
    Technology, vol. 43, no. 3,pp. 704-712, 1994.
    [52] L. Kleirock, Queueing systems, volumn I: theory, New York: Wiley, 1975.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE