簡易檢索 / 詳目顯示

研究生: 陳朝鈞
Chen, Chao-Chun
論文名稱: 行動計算系統下的移動及資料管理
Mobility and Data Management in Mobile Computing Systems
指導教授: 李強
Lee, Chiang
學位類別: 博士
Doctor
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2004
畢業學年度: 92
語文別: 英文
論文頁數: 148
中文關鍵詞: 移動管理行動計算資料管理
外文關鍵詞: mobile computing, mobility management, data management
相關次數: 點閱:92下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  •   在過去的十年中, 隨著無線通訊及積體電路技術的進步,行動計算成為最熱門的研究領域之一。相較傳統環境的研究,此新興的計算應用在無線行動網路中有著新的因素及限制,例如客戶端的移動,行動設備的貧乏電力,有限的無線頻寬,等等. 這些特有的特性給資料庫社群及通訊社群帶來許多新的挑戰,包括位置管理、資料傳輸、行動服務管理等。在本論文,我們探索了一些基礎但是尚未解決的議題。並且在目前存在的行動計算架構下,我們針對這些議題提出有效率的解決方法。

      在行動管理議題上,過去的研究把焦點放在改善移動運算或是尋找運算兩者之一。我們提出 Cache and Carry (C&C) 策略來同時改進上述兩個運算的效能。我們的方法尤其能成功的將許多廣域通訊運算減少成區域通訊運算。我們的實驗成果顯示 C&C 策略明顯的優於其他策略。

      我們也解決了在有限頻寬的無線網路下傳送大型資料給行動客戶端的議題。完全複製此大型資料到所有的區域是一個直覺的方法。但是此方法卻不切實際,原因是此方法不僅浪費資源並且因為龐大的傳輸負載而降低整個系統效能。我們分兩個階段解決此問題。我們首先設計一個編碼的方法來將地理上的區域編碼,並且描述此編碼方法的特性。然後,我們提出一個基於動態規劃的方法來有效率的找出行動客戶端最有可能行經的路徑。在客戶端還沒到達這些區域之前,先將大型資料傳送到路徑上的這些區域。實驗結果顯示我們提出來的方法大量改進的完全複製方法的效能。

      我們也研究在行動服務管理上的服務移動的最佳化議題。我們替行動代理人設計一個行動控制的機制,其中包括了一個要求運算及一個移動運算。接著,我們建立一個機率模型並且推導我們提出來機制的代價函數。根據這些代價函數,行動代理人可以決定出最佳的停留地點來服務行動使用者。我們的效能研究顯示使用我們提出來的機制可以大量的減少通訊代價。另外,我們也討論一些實作此機制上的相關議題,包括重複資料的維護。

      最後,我們考慮在多頻道資料傳播系統下,一個滿足具時間限制特性的服務的排程問題。無線環境下的具時間限制特性的服務在許多應用中都十分普遍,但是過去的文獻並沒有解決此問題。我們首先探討滿足此種服務的廣播排程必須具備的特性。接著,我們推導要提供此項服務的理論下限值。然後,我們提出一個排程方法可以產生具時間限制特性的服務的廣播節目,並且此廣播節目只使用最少的廣播頻道數量。我們也提供理論的證明來證明排程演算法產生的廣播節目滿足上述所有特性。

      With the advance of wireless communication and VLSI technologies,the emerging mobile computing becomes one of the most attractive research topics in the past decade.Comparing to the previous research in traditional environments,the novel computing paradigm has new factors and limitations in the wireless mobile network,such as mobility of clients, scarce power of mobile devices,limited bandwidth, $ldots$, etc.These distinctive characters bring many new challenges to the database community and the communication society, including location management, data transmission,mobile service management, $ldots$, etc.In this dissertation, we discover certain fundamental and unsolved issues,and proposed effective solutions to these problems based on the current existing mobile computing architecture.

      For location management issue, past works focus on improving either the movement operation or the locating operation. We propose the Cache and Carry (C&C) Strategy to improve both of them simultaneously to improve the performance than previous works. In particular, our proposed strategy successfully reduces a lot of global communication operations to local communication operations. Our performance results show that the C&C strategy significantly outperforms the other strategies.

      We also address the issue of delivering large-size data for mobile users under a limited bandwidth wireless environment. Fully replicating the data over all cells is a straightforward solution, but is impractical because it not only wastes resource but also degrades the overall performance due to heavy communication load. We resolve this problem in two stages. To fast look up the geographic information, we first devise an encoding scheme to encode the geographic cell, and describe useful properties of the encoding scheme. Then, we propose a dynamic-programming based method to efficiently find out those most possibly resided cells to pre-sent large-size data before the mobile user visits. Experimental results reveal that our proposed algorithm dramatically improves the performance.

      We study the optimization issue of the service mobility for the management of mobile services. A mobility controlling mechanism consisted of the request operation and the movement operation is designed for a mobile agent (MA). Then, we develop a probability model and derive the cost functions for the proposed mechanism.Based on the cost functions, the mobile agent is able to determine a best resident location to serve the roaming mobile user. Performance study shows that communication cost of employing our proposed mechanism is dramatically reduced.In addition, we discuss certain implementation issues about maintaining the duplicate data items in a MA-resident site.

      Finally, we consider the data scheduling problem for the time-constrained services in the multi-channel data dissemination systems. The time-constrained services are widely used in many applications,but not solved in past related work.We first derive the properties that a broadcast schedule must have in order to satisfy a set of given time constraints. Next, we present a theoretical lower bound on the number of channels for offering the time-constrained services. Then, we propose a scheduling algorithm that owns all the necessary properties and always employs the minimum number of channels. And,the produced schedule always meets the requirement of time constraints of the clients.

    Abstract i Acknowledgements iii Table of Contents iv Table of Figures vii Table of Algorithms ix 1 Introduction 1 1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Overview of the Dissertation . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2.1 “Cache and Carry” for Location Management in Mobile Information Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2.2 A Novel Encoding Scheme and Data Delivery in Ubiquitous Computing Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2.3 On Locating Mobile Agent in Mobile Information Systems . . . 6 1.2.4 On Optimal Allocation for Time-Constrained Services in Multi- Channel Data Dissermination Systems . . . . . . . . . . . . . . 7 1.3 Organization of the Dissertation . . . . . . . . . . . . . . . . . . . . . . 9 2 “Cache and Carry” for Location Management in Mobile Information Systems 10 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.2 Supporting Data Structure . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.3 C&C (Cache and Carry) Strategy . . . . . . . . . . . . . . . . . . . . . 14 2.3.1 The Static C&C Strategy: movement operation . . . . . . . . . 15 2.3.2 The Dynamic C&C Strategy: movement operation . . . . . . . 17 2.3.3 The C&C Strategy: locating operation . . . . . . . . . . . . . . 19 2.4 Other Related Issues . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 2.5 CostModel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 2.5.1 Parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 2.5.2 Derivation of Cost Functions . . . . . . . . . . . . . . . . . . . . 24 2.6 Performance Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 2.6.1 The effect of ρi . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 iv 2.6.2 The effect of kC&C . . . . . . . . . . . . . . . . . . . . . . . . . 32 2.6.3 The effect of distance ofmessage forwarding . . . . . . . . . . . 34 2.6.4 Optimal kC&C . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 2.7 Why Is C&C Strategy Better? . . . . . . . . . . . . . . . . . . . . . . . 36 2.8 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 3 A Novel Encoding Scheme and Data Delivery in Ubiquitous Computing Systems 39 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 3.1.1 Fundamentals . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 3.1.2 The Problemand Our Approach . . . . . . . . . . . . . . . . . 41 3.2 The Encoding Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 3.3 Properties of the Encoding Scheme . . . . . . . . . . . . . . . . . . . . 47 3.4 The Code-based Data Delivery (CD2) Strategy . . . . . . . . . . . . . . 51 3.5 CostModel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 3.5.1 Ranking of a Data Delivery Strategy . . . . . . . . . . . . . . . 56 3.5.2 Ranking the CD2 Strategy . . . . . . . . . . . . . . . . . . . . . 58 3.5.3 Ranking the Fully-Delivered (FD) Strategy . . . . . . . . . . . . 60 3.5.4 Ranking an Optimal Data Delivery Strategy . . . . . . . . . . . 61 3.6 Performance Experiments and Analysis . . . . . . . . . . . . . . . . . . 62 3.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 4 On Locating Mobile Agent in Mobile Information Systems 66 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 4.2 SystemManagement . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 4.2.1 Network Architecture . . . . . . . . . . . . . . . . . . . . . . . . 68 4.2.2 MA Controlling Mechanism . . . . . . . . . . . . . . . . . . . . 70 4.3 Analysis of the NewMechanism . . . . . . . . . . . . . . . . . . . . . . 73 4.3.1 Parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74 4.3.2 Movement Constraint ofMA . . . . . . . . . . . . . . . . . . . . 75 4.3.3 Derivation of Cost Functions . . . . . . . . . . . . . . . . . . . . 77 4.4 Performance Experiments and Analysis . . . . . . . . . . . . . . . . . . 80 4.4.1 PerformanceMetrics and Experimental Setup . . . . . . . . . . 80 4.4.2 Experiment 1: Effect of MIR . . . . . . . . . . . . . . . . . . . 81 4.4.3 Experiment 2: Effect of μ . . . . . . . . . . . . . . . . . . . . . 82 4.4.4 Experiment 3: Effect of Rresult and A . . . . . . . . . . . . . . . 83 4.4.5 Experiment 4: Effect of α and β . . . . . . . . . . . . . . . . . . 84 4.5 Savings under Optimal  and Further Findings . . . . . . . . . . . . . . 84 4.6 Implementation Issues: Considering Duplicate Data Items in a MA Node 88 4.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 5 On Optimal Allocation for Time-Constrained Services inMulti-Channel Data Dissemination Systems 93 5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 5.2 Preliminaries and Assumptions . . . . . . . . . . . . . . . . . . . . . . 96 v 5.3 Problem Formulation and Analysis . . . . . . . . . . . . . . . . . . . . 98 5.3.1 Avoiding Request Duplication and Request Folding . . . . . . . 101 5.3.2 How Far to Lookahead? . . . . . . . . . . . . . . . . . . . . . . 102 5.3.3 How Far to Rewind? . . . . . . . . . . . . . . . . . . . . . . . . 103 5.3.4 Position Preservation and Order Preservation . . . . . . . . . . 104 5.4 Transformation-Based Channel Allocation (TCA) Algorithm . . . . . . 109 5.5 AlgorithmAnalysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114 5.6 Validity and Optimality of the Algorithm . . . . . . . . . . . . . . . . . 116 5.6.1 Validity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117 5.6.2 Minimal Channels . . . . . . . . . . . . . . . . . . . . . . . . . . 121 5.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 6 Conclusions 126 A Cost Functions of Other Strategies in Chapter 2 129 A.1 Cost Functions of the Basic HLR/VLR Strategy . . . . . . . . . . . . . 129 A.2 Cost Functions of the LA strategy . . . . . . . . . . . . . . . . . . . . . 130 A.3 Cost Functions of the Forwarding Strategy . . . . . . . . . . . . . . . . 133 Bibliography 136 Biography 148

    [AAB+98] Demet Aksoy, Mehmet Altinel, Rahul Bose, Ugur Cetintemel, Michael
    Franklin, Jane Wang, and Stanley Zdonik. Research in data broadcast
    and dissemination. In Proceedings of Advanced Multimedia Content(

    AMCP’98), pages 194–207, Osaka, Japan, November 9-11 1998.
    [AAFZ95] Swarup Acharya, R. Alonso, Michael J. Franklin, and Stanley B. Zdonik.
    Broadcast disks: Data management for asymmetric communication environments.
    In Proceeding of the 1995 ACM SIGMOD International Conference
    on Management of Data (SIGMOD’95), pages 199–210, San Jose,
    California, May 22-25 1995.

    [AF98] Demet Aksoy and Michael J. Franklin. Scheduling for large-scale ondemand
    data broadcasting. In Proceeding of Seventeenth Annual Joint
    Conference of the IEEE Computer and Communications Societies (INFOCOM’
    98), pages 651–659, San Francisco, CA, USA, March 29 - April 2
    1998.

    [AF99] Demet Aksoy and Michael J. Franklin. R × W : A scheduling approach
    for large-scale on-demand data broadcast. In Proceedings of IEEE/ACM
    Transactions on Networking 7(6), pages 846–860, New York, USA, December
    1999.

    [AFZ95] Swarup Acharya, Michael Franklin, and Stanley Zdonik. Disseminationbased
    data delivery using broadcast disks. IEEE Personal Communications,
    2(6):50–60, December 1995.

    [AFZ96] Swarup Acharya, Michael Franklin, and Stanley Zdonik. Prefetching from
    a broadcast disk. In Proceedings of the 12th International Conference on
    Data Engineering, pages 276–285, New Orleans, Louisiana, February 26-
    March 1 1996.

    [AFZ97a] Swarup Acharya, Michael J. Franklin, and Stanley B. Zdonik. Balancing
    push and pull for data broadcast. In Proceeding of the 1997 ACM SIGMOD
    136
    International Conference on Management of Data (SIGMOD’97), pages
    183–194, Tucson, Arizona, USA, May 13-15 1997.

    [AFZ97b] Swarup Acharya, Michael J. Franklin, and Stanley B. Zdonik. Disseminating
    updates on broadcast disks. In Proceedings of 22nd International
    Conference on Very Large Data Bases, pages 356–365, Mumbai (Bombay),
    India, September 3-6 1997.

    [AFZ01] Demet Aksoy, Michael Franklin, and Stan Zdonik. Data staging for ondemand
    broadcast. In Proceedings of 27th International Conference on
    Very Large Data Bases (VLDB’01), pages 571–580, Roma, Italy, September
    11-14 2001.

    [AHMW94] V. Anantharam, M. Honig, U. Madhow, and V.K. Wei. Optimization of
    a database hierarchy for mobility tracking in a personal communications
    network. Performance Evaluation, 20:287–300, 1994.

    [AM98] Swarup Acharya and S. Muthukrishnan. Scheduling on-demand broadcasts:
    New metrics and algorithms. In Proceedings of the Fourth Annual
    ACM/IEEE International Conference on Mobile Computing and Networking
    (MobiCom’98), pages 43–54, Dallas, Texas, USA, October 25-30 1998.

    [Bar95] Sanjoy Baruah. Fairness in periodic real-time scheduling. In Proceedings of
    the Real-Time Systems Symposium, pages 200–209, Pisa, Italy, December
    4-7 1995.

    [Bar99] Daniel Barbara. Mobile computing and databases - a survey. IEEE Transactions
    on Knowledge and Data Engineering, 11(1):108 –117, February
    1999.

    [BB97a] Sanjoy Baruah and Azer Bestavros. Pinwheel scheduling for fault-tolerant
    broadcast disks in real-time database systems. In Proceedings of 13th International
    Conference on Data Engineering, pages 543–551, Birmingham,
    U.K., April 7-11 1997.

    [BB97b] Sanjoy Baruah and Azer Bestavros. Real-time mutable broadcast disks. In
    Proceedings of the Second InternationalWorkshop on Real-Time Databases
    (RTDB97), pages 3–22, Burlington, VT, September 18-19 1997.

    [BBIM93] B. R. Badrinath, A. Bakre, Tomasz Imielinski, and R. Marantz. Handling
    mobile clients: A case for indirect interaction. In Proceedings of the 4th
    Workshop on Workstation Operation Systems, pages 91–97, Aigen, Austria,
    October 1993.

    [BL98] Sanjoy Baruah and Shun-Shii Lin. Pfair scheduling of generalized pinwheel
    task systems. IEEE Transactions on Computers, 47(7):812–816, July 1998.

    [BNK93] Amotz Bar-Noy and Ilan Kessler. Tracking mobile users in wireless communications
    networks. IEEE Transactions on Information Theory, 39(6):
    1877–1886, 1993.

    [BNNS00] Amotz Bar-Noy, Joseph Naor, and Baruch Schieber. Pushing dependent
    data in clients-providers-servers systems. In Proceedings of the Sixth Annual
    International Conference on Mobile Computing and Networking (MobiCom’
    00), pages 222–230, Boston MA USA, August 6-11 2000.

    [CCL98] Ing-Ray Chen, Tsong-Min Chen, and Chiang Lee. Performance evaluation
    of forwarding strategies for location management in mobile networks. The
    Computer Journal, 41(4):243–253, August 1998.

    [CCL00] Ing-Ray Chen, Tsong-Min Chen, and Chiang Lee. Analysis and comparison
    of location strategies for reducing registration cost in pcs networks.
    Wireless Personal Communications Journal, 12(2):117–136, 2000.

    [CCL01] Ing-Ray Chen, Tsong-Min Chen, and Chiang Lee. Agent-based forwarding
    strategies for reducing location management cost in mobile networks.
    Mobile Networks and Applications (MONET), 6(2):105–115, March 2001.

    [CK98] Yon Dohn Chung and Myoung Ho Kim. On scheduling wireless broadcast
    data. Technical Report CS-TR98-134, Department of Computer Science,
    KAIST, 1998.

    [CL99] Chao-Chun Chen and Chiang Lee. Location management strategies for
    reducing both movement cost and locating cost. In Proceeding of the First
    International Conference on Mobile Data Access (MDA’99), pages 209–
    219, Hong-Kong, December 1999.

    [CLK03] Chao-Chun Chen, Chiang Lee, and Chih Horng Ke. Best movement of
    mobile agent in mobile computing systems. In Proceeding of the 4th International
    Conference on Mobile Data Management (MDM’03), Melbourne,
    Australia, 21-24 January 2003.

    [CLR90] Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introductions
    to Algorithms. June 1990. 978-979 pp.

    [CT99] Jun Cai and Kian-Lee Tan. Tuning integrated dissemination-based information
    systems. Data & Knowledge Engineering, 30(1):1–21, May 1999.

    [DF04] Matthew Denny and Michael J. Franklin. Edison: Database-supported
    synchronization for pdas. Distributed and Parallel Databases, 15(2):95–
    116, March 2004.

    [DVCK99] Anindya Datta, Debra E. VanderMeer, Aslihan Celik, and Vijay Kumar.
    Broadcast protocols to support efficient retrieval from databases by mobile
    users. ACM Transactions on Database Systems, 24(1):1–79, March 1999.

    [EIA91] EIA/TIA. Cellular radio telecommunication inter system operations.
    Technical Report IS-41 (Revision B), 1991.

    [FB96] Armando Fox and Eric A. Brewer. Reducing WWW latency and bandwidth
    requirements by real-time distillation. In Proceeding of the 5th International
    World Wide Web Conference, Paris, France, May 1996.

    [FCR99] Jesus Fernandez-Conde and Krithi Ramamritham. Adaptive dissemination
    of data in time-critical asymmetric communication environments.
    In Proceedings of the 11th Euromicro Conference on Real-Time Systems
    (ECRTS99), York, England, June 9-11 1999.

    [Fra01] Michael J. Franklin. Challenges in ubiquitous data management. In Proceeding
    of Informatics - 10 Years Back. 10 Years Ahead, pages 24–33,
    2001.

    [FZ98] Michael Franklin and Stanley Zdonik. Data in your face: Push technology
    in perspective. In Proceedings of ACM SIGMOD International Conference
    on Management of Data (SIGMOD 98), pages 516–519, Seattle, Washington,
    USA., June 2-4 1998.

    [GC04] Baoshan Gu and Ing-Ray Chen. Performance analysis of location-aware
    mobile service proxies for reducing network cost in personal communication
    systems. accepted to appear in ACM/Kluwer Journal on Mobile
    Networks and Applications (MONET), 2004.

    [GCK+02] Robert S. Gray, George Cybenko, David Kotz, Ronald A. Peterson, and
    Daniela Rus. D’Agents: Applications and performance of a mobile-agent
    system. Software – Practice and Experience, 32(6):543–573, May 2002.

    [GCKR02] Robert S. Gray, George Cybenko, David Kotz, and Daniela Rus. Mobile
    Agents: Motivations and State of the Art. 2002.

    [GKP+01] Robert S. Gray, David Kotz, Ronald A. Peterson, Jr., Joyce Barton,
    Daria Chac’on, Peter Gerken, Martin Hofmann, Jeffrey Bradshaw, Maggie
    Breedy, Renia Jeffers, and Niranjan Suri. Mobile-agent versus client/server
    performance: Scalability in an information-retrieval task. In Proceedings
    of the Fifth IEEE International Conference on Mobile Agents, pages 229–
    243, Atlanta, Georgia, December 2001.

    [GN02] H. Gowrisankar and Silvia Nittel. Reducing uncertainty in location prediction
    of moving objects in road networks. In Proceedings of the Second
    International Conference on Geographic Information Science (GIScience
    2002), Boulder, Colorado, USA, September 25-28 2002.

    [Gon95] Veena A. Gondhalekar. Scheduling periodic wireless data broadcast. Master’s
    thesis, The University of Texas at Austin, December 1995.

    [GSD02] Sasthi C. Ghosh, Bhabani P. Sinha, and Nabanita Das. An efficient channel
    assignment technique for hexagonal cellular networks. In Proceeding
    of the International Symposium on Parallel Architectures, Algorithms and
    Networks (ISPAN’02), pages 361–366, Makati City, Metro Manila, Philippines,
    May 22-24 2002.

    [HA96] Joseph S. M. Ho and Ian F. Akyildiz. Local anchor scheme for reducing
    signaling costs in personal communications networks. IEEE/ACM Transactions
    on Networking, 4(5):709–725, October 1996.

    [HC02] Chih-Lin Hu and Ming-Syan Chen. Dynamic data broadcasting with traf-
    fic awareness. In Proceeding of the 22nd International Conference on Distributed
    Computing Systems (ICDCS’02), pages 112–119, Vienna, Austria,
    July 2-5 2002.

    [HLC01] C.H. Hsu, G. Lee, and A.L.P. Chen. A near optimal algorithm for generating
    broadcast programs on multiple channels. In ACM International Conference
    on Information and Knowledge Management (CIKM2001), pages
    303–309, Atlanta, Georgia, USA, November 5-10 2001.

    [HLL98a] Qinglong Hu, Dik Lun Lee, andWangChien Lee. Dynamic data delivery in
    wireless communication environments. In Proceedings of ER’98 Workshops
    on Mobile Data Access, pages 218–229, Singapore, November 19-20 1998.

    [HLL98b] Qinglong Hu, Dik Lun Lee, and WangChien Lee. Optimal channel allocation
    for data dissemination in mobile computing environments. In
    Proceedings of the 18th International Conference on Distributed Computing
    Systems (ICDCS), pages 480–487, Amsterdam, The Netherlands, May
    26-29 1998.

    [HLX03] Ka Kit Hoi, Dik Lun Lee, and Jianliang Xu. Document visualization on
    small displays. In Proceedings of the 4th International Conference on Mobile
    Data Management (MDM03), pages 262–278, Melbourne, Australia,
    January 21-24 2003.

    [HV97] Sohail Hameed and Nitin H. Vaidya. Log-time algorithms for scheduling
    single and multiple channel data broadcast. In Proceedings of the Third
    Annual ACM/IEEE International Conference on Mobile Computing and
    Networking (MobiCom’97), pages 90–99, Budapest, Hungary, September
    26-30 1997.

    [HV99] Sohail Hameed and Nitin H. Vaidya. Efficient algorithms for scheduling
    data broadcast. ACM Wireless Networks, 5:183–193, 1999.

    [IB93] Tomasz Imielinski and B. R. Badrinath. Data management for mobile
    computing. SIGMOD RECORD, 22(1):34–39, March 1993.

    [IB94] Tomasz Imielinski and B. R. Badrinath. Mobile wireless computing: Challenges
    in data management. Communications of the ACM, 37(10):18–28,
    1994.

    [IV94] Tomasz Imielinski and S. Viswanathan. Adaptive wireless information
    systems. In Proceeding of the ACM Speial Interest Group on DataBase
    System, pages 19–41, 1994.

    [IVB97] Tomasz Imielinski, S. Viswanathan, and B. R. Badrinath. Data on air:
    Organization and access. IEEE Transactions on Knowledge and Data
    Engineering, 9(3):353–372, May/June 1997.

    [Jai96] Ravi Jain. Reducing traffic impacts of PCS using hierarchical user location
    databases. In Proceedings of International Conference on Communication,
    1996.

    [JHE99] Jin Jing, Abdelsalam Sumi Helal, and Ahmed
    Elmagarmid. Client-server
    computing in mobile environments. ACM Computing Surveys, 31(2):117–
    157, June 1999.

    [JLLM94] Ravi Jain, Yi-Bing Lin, Charles Lo, and Seshadri Mohan. A caching
    strategy to reduce network impacts of PCS. IEEE Journal on Selected
    Areas in Communications, 12(8):1434–1444, October 1994.

    [JLLM95] Ravi Jain, Yi-Bing Lin, Charles Lo, and Seshadri Mohan. A forwarding
    strategy to reduce network impacts of PCS. Proceeding of Fourteenth
    Annual Joint Conference of the IEEE Computer and Communications Societies
    (INFOCOM’95), 2(8):481–489, April 2-6 1995.

    [JV99] Shu Jiang and Nitin H. Vaidya. Scheduling data broadcast to “impatient”
    users. In Proceedings of the ACM international workshop on Data engineering
    for wireless and mobile access, pages 52–59, Seattle, WA, USA,
    August 20 1999.

    [JW95] Ravi Jain and John Werth. Airdisks and airraid: Modeling and scheduling
    periodic wireless data broadcast. Technical Report 95-11, Rutgers
    University, DIMACS, 1995.

    [KG78] Tomson Joe Kahwa and Nicolaos D. Georganas. A hybrid channel assignment
    scheme in large-scale, cellular-structured mobile communication
    systems. IEEE Transactions on Communications, 26(4):432–438, April
    1978.

    [KSY00] Claire Kenyon, Nicolas Schabanel, and Neal Young. Polynomial-time approxdmation
    scheme for data broadcast. In Proceedings of the Thirtysecond
    Annual ACM Symposium on Theory of Computing (STOC), pages
    659–666, Portland Oregon USA, May 21-23 2000.

    [LB00] Giuseppe Lipari and Sanjoy Baruah. Efficient scheduling of real-time
    multi-task applications in dynamic systems. In Proceedings of the Real-
    Time Technology and Applications Symposium, pages 166–175, Washington,
    DC, USA, May 31-June 2 2000.

    [LBC98] Tong Liu, Paramvir Bahl, and Imrich Chlamtac. Mobility modeling, location
    tracking, and trajectory prediction in wireless atm networks. IEEE
    Journal on Special Areas in Communications, 16(6):922–936, August 1998.

    [LC00] Shou-Chih Lo and Arbee L.P. Chen. Optimal index and data allocation in
    multiple broadcast channels. In Proceedings of 16th International Conference
    on Data Engineering (ICDE 2000), pages 293–302, San Diego, CA,
    USA, February 28-March 3 2000.

    [LC01] Chiang Lee and Chao-Chun Chen. A data delivery strategy in ubiquitous
    computing systems. In Proceeding of the 7th International Conference on
    Database Systems for Advanced Applications (DASFAA01), pages 210–
    217, Hong Kong, April 18-20 2001.

    [LCK02] Chiang Lee, Chao-Chun Chen, and Chih-Horng Ke. A code-based data
    delivery strategy in ubiquitous computing systems. Technical Report 91-
    7-20, Department of Computer Science and Information Engineering, National
    Cheng-Kung University, Taiwan, R.O.C., 2002.

    [LCY99] Kam-yiu Lam, Edward Chan, and Chun-Hung Yuen. Data broadcast
    for time-constrained read-only transactions in mobile computing systems.
    In Proceedings of the First International Workshop on Advance Issues of
    E-Commerce and Web-Based Information Systems, pages 11–19, Santa
    Clara, California, April 8-9 1999.

    [LHL97] Wang-Chien Lee, Qinglong Hu, and Dik Lun Lee. Channel allocation
    methods for data dissemination in mobile computing environments. In
    Proceedings of the 6th IEEE International Symposium on High Performance
    Distributed Computing (HPDC97), pages 274–281, Portland, Oregon,
    August 5-8 1997.

    [LHL99] Wang-Chien Lee, Qinglong Hu, and Dik Lun Lee. A study on channel allocation
    for data dissemination in mobile computing environments. Mobile
    Networks and Applications (MONET), 4(2):117–129, 1999.

    [LHL00] Dik Lun Lee, Qinglong Hu, and Wang-Chien Lee. Power conserving and
    access efficient indexes for wireless computing. In Information Organization
    and Databases: Foundations of Data Organization, chapter 18, pages
    249–263. Kluwer Academic, Norwell, MA, USA, 2000.

    [LHXW04] Dik Lun Lee, Ka Kit Hoi, Jianliang Xu, and Wing Sing Dicky Wong.
    Web browsing on small displays. IEEE Distributed Systems Online, 4(10),
    October 20 2004.

    [Lin97] Yi-Bin Lin. Introduction to Mobile Network Management. Baltzer, 1997.

    [LKC01] Chiang Lee, Chih-Horng Ke, and Chao-Chun Chen. Improving location
    management for mobile users with frequently visited locations. Performance
    Evaluation, 43(1):15–38, January 2001.

    [LLC02] Guanling Lee, Shou-Chih Lo, and Arbee L. P. Chen. Data allocation on
    wireless broadcast channels for efficient query processing. IEEE Transaction
    Computers, 51(10):1237–1252, October 2002.
    [MDW99] Dejan Milojicic, Frederick Douglis, and Richard Wheeler. Mobility – Processes,
    Computers, and Agents. Addison-Wesley, 1999.

    [MP95] M. Mouly and M.B Pautet. Current evolution of the GSM systems. IEEE
    Personal Communication, 2(5):9–19, 1995.

    [Nob98] Brian D. Nobel. Mobile Data Access. PhD thesis, Carnegie Mellon University,
    Pittsburgh, PA, USA, May 1998.

    [NSZ98] Fabian Garcia Nocetti, Ivan Stojmenovic, and Jingyuan Zhang. An effi-
    cient hierarchical scheme for locating highly mobile users. In Proceedings of
    Seventh International Conference on Information and Knowledg Management
    (CIKM’98), pages 218–225, Bethesda, Maryland, USA, November
    3-7 1998.

    [OHP00] JungHwan Oh, Kien A. Hua, and Kiran Prabhakara. A new broadcasting
    technique for an adaptive hybrid data delivery in wireless mobile network
    environment. In Proceedings of 19th IEEE International Performance
    Computing and Communications Conference, pages 361–367, Phoenix,
    Arizona, February 20-22 2000.

    [PC98] Wen-Chih Peng and Ming-Syan Chen. A dynamic and adaptive cache retrieval
    scheme for mobile computing. In Proceedings of the 3rd IFCIS International
    Conference on Cooperative Information Systems (CoopIS’98),
    pages 251–259, New York, USA, August 20-22 1998.

    [PC00] Wen Chih Peng and Ming Syan Chen. Dynamic generation of data broadcasting
    programs for a broadcast disk array in a mobile computing environment.
    In Proceedings of the ACM 9th International Conference on Information
    and Knowledge Management (CIKM’00), pages 38–45, McLean,
    VA USA, November 6-11 2000.

    [PC03] Wen-Chih Peng and Ming-Syan Chen. Developing data
    allocation schemes
    by incremental mining of user moving patterns in a mobile computing
    system. IEEE Transactions on Knowledge and Data Engineering, 15(1):
    70–85, 2003.

    [PF98] Evaggelia Pitoura and Ioannis Fudos. An efficient hierarchical scheme
    for locating highly mobile users. In Proceedings of Seventh International
    Conference on Information and Knowledg Management (CIKM’98), pages
    218–225, Bethesda, Maryland, November 3-7 1998.

    [PF01] Evaggelia Pitoura and Ioannis Fudos. Distributed location databases for
    tracking highly mobile objects. The Computer Journal, 44(2):75–91, 2001.

    [PHO00] Kiran Prabhakara, Kien A. Hua, and Jung-Hwan Oh. Multi-level multichannel
    air cache designs for broadcasting in a mobile environment. In
    Proceedings of the 16th International Conference on Data Engineering
    (ICDE’00), pages 167–176, San Diego, California, USA, 28
    February -
    3 March 2000.

    [PPTY02] Symeno Papavassiliou, Antonio Puliafito, Orazio Tomarchio, and Jian Ye.
    Mobile agent-based approach for efficient network management and resource
    allocation: Framework and applications. IEEE Journal on Selected
    Areas in Communications, 20(4):858 –872, May 2002.

    [PS98] Evaggelia Pitoura and George Samaras. Data Management for Mobile
    Computing. Kluwer Academic, 1998.

    [PS01] Evaggelia Pitoura and George Samaras. Locating objects in mobile computing.
    IEEE Transactions on Knowledge and Data Engineering, 13(4):
    571–592, July/August 2001.

    [PS02] Evaggelia Pitoura and George Samaras. Addressing and routing in hexagonal
    networks with applications for tracking mobile users and connection
    rerouting in cellular networks. IEEE Transactions on Parallel and Distributed
    Systems, 13(9):963–971, 2002.

    [SJS02] G. Slivinskas, C. Jensen, and R. Snodgrass. Bringing order to query optimization.
    ACM SIGMOD Record, 31(2), June 2002.

    [SJW97] Narayanan Shivakumar, Jan Jannink, and Jennifer Widom. Per-user pro-
    file replication in mobile environments: Algorithms, analysis, and simulation
    results. Mobile Networks and Applications (MONET), 2(2):129–140,
    1997.

    [SRB97] Konstantinos Stathatos, Nick Roussopoulos, and John S. Baras. Adaptive
    data broadcast in hybrid networks. In Proceedings of 23rd International
    Conference on Very Large Data Bases (VLDB’97), pages 326–335, Athens,
    Greece, August 25-29 1997.

    [SRM98] Arunabha Sen, Tom Roxborough, and Sirisha Medidi. Upper and lower
    bounds of a class of channel assignment problems in cellular networks.
    In Proceedings of the Seventeenth Annual Joint Conference of the IEEE
    Computer and Communications Societies (INFOCOM’98), pages 378–390,
    Athens, Greece, 29 Mar-2 Apr 1998.

    [SSS+01] Weiwei Sun, Weibin Shi, Bole Shi, Wenyun Ji, and Yijun Yu. A selfadaptive
    scheduling algorithm of on-demand broadcasts. In Proceedings
    of the 4th ACM International Workshop on Modeling, Analysis and Simulation
    of Wireless and Mobile Systems, pages 139–146, Rome, Italy, July
    2001.

    [STT99] Chi-Jiun Su, Leandros Tassiulas, and Vassilis J. Tsotras. Broadcast
    scheduling for information distribution. ACM Wireless Networks, 5(2):
    137–147, March 1999.

    [SV96] Narayanan Shivakumar and Suresh Venkatasubramanian. Efficient indexing
    for broadcast based wireless systems. Mobile Networks and Applications,
    1(4):433–446, December 1996.

    [Tab95] Sami Tabbane. An alternative strategy for location tracking. IEEE Journal
    on Selected Areas in Communications, 13(5):880–892, June 1995.

    [THJ01] Duc A. Tran, Kien A. Hua, and Ning Jiang. A generalized air-cache design
    for efficiently broadcasting on multiple physical channels. In Proceedings
    of the 2001 ACM symposium on Applied computing, pages 387–392, Las
    Vegas, Nevada, United States, March 11-14 2001.

    [TLH04] Duc A. Tran, Minh Le, and Kien A. Hua. MobiVoD: A video-on-demand
    system design for mobile ad hoc networks. In Proceedings of the 5th International
    Conference on Mobile Data Management (MDM04), pages 212–
    223, Berkeley, CA, USA, 19-22 January 2004.

    [TY98] Kian-Lee Tan and Jeffrey X. Yu. Generating broadcast programs that
    support range queries. IEEE Transactions on Knowledge and Data Engineering,
    10(4):668–672, January-February 1998.

    [Var00] Upkar Varshney. Recent advances in wireless networking. IEEE Personal
    Communication, 33(6):100–103, 2000.

    [VH96a] Nitin H. Vaidya and Sohail Hameed. Data broadcast in asymmetric wireless
    environments. In First International Workshop on Satellite-based Information
    Services (WOSBIS), Rye, NY, November 1996.

    [VH96b] Nitin H. Vaidya and Sohail Hameed. Data broadcast scheduling: Online
    and off-line algorithms. Technical Report 96-017, Computer Science,
    Texas A&M Univ., 1996.

    [VH96c] Nitin H. Vaidya and Sohail Hameed. Improved algorithms for scheduling
    data broadcast. Technical Report 96-029, Computer Science, Texas A&M
    Univ., 1996.

    [Wei91] Mark Weiser. The computer for the twenty-first century. Scientific American,
    265(3):94–104, September 1991.

    [Wei93] Mark Weiser. Some computer science problems in ubiquitous computing.
    Communications of the ACM, 36(7):74–84, July 1993.

    [WJH97] Ouri Wolfson, Sushil Jajodia, and Yixiu Huang. An adaptive data replication
    algorithm. ACM Transaction on Database Systems, 22(2):255–314,
    June 1997.

    [WXC00] Ouri Wolfson, Bo Xu, and Sam Chamberlain. Location prediction and
    queries for tracking moving objects. In Proceedings of the 16th International
    Conference on Data Engineering (ICDE2000), pages 687–688, San
    Diego, California, USA, 28 February - 3 March 2000.

    [XSG+97] Ping Xuan, Subhabrata Sen, Oscar Gonzalez, Jesus Fernandez, and Krithi
    Ramamritham. Broadcast on demand: Efficient and timely dissemination
    of data in mobile environments. In Proceedings of the 3rd IEEE Real-
    Time Technology and Applications Symposium (RTAS’97), pages 38–48,
    Montreal, CANADA, June 9-11 1997.

    [XTL03] Jianliang Xu, Xueyan Tang, and Dik Lun Lee. Performance analysis of
    location-dependent cache invalidation schemes for mobile environments.
    IEEE Transactions on Knowledge and Data Engineering, 15(2):474–488,
    2003.

    [YHTN01] Etsuko Yajima, Takahiro Hara, Masahiko Tsukamoto, and Shojiro Nishio.
    Scheduling and caching strategies for broadcasting correlated data. In
    Proceedings of the 2001 ACM Symposium on Applied Computing, pages
    504–510, Las Vegas, Nevada, United States, March 11-14 2001.

    [YNOJ02] Wai Gen Yee, Shamkant B. Navathe, Edward Omiecinski, and Chris
    Jermaine. Efficient data allocation over multiple channels at broadcast
    servers. IEEE Transaction Computers, 51(10):1231–1236, October 2002.

    [ZAFA94] Stanley Zdonik, Rafael Alonso, Michael Franklin, and Swarup Acharya.
    Are “disks in the air” just pie in the sky? In IEEE Workshop on Mobile
    Computing Systems and Applications, pages 12–19, Santa Cruz, CA,
    December 1994.

    [ZD97] Bruce Zenel and Dan Duchamp. A general purpose proxy filtering mechanism
    applied to the mobile environment. In Proceeding of Third Annual
    ACM/IEEE International Conference on Mobile Computing and Networking
    (MobiCom’97), pages 248–259, Budapest, September 1997.

    [Zip49] G.K. Zipf. Human Behavior and the Principle of Least Effort: An Introduction
    to Human Ecology. Addison-Wesley, 1949.

    [Zor96] Michele Zorzi. Power control and diversity in mobile radio cellular systems
    in the presence of ricean fading and log-normal shadowing. IEEE
    Transactions on Vehicular Technology, 45(2):373–382, May 1996.

    下載圖示 校內:2005-07-09公開
    校外:2005-07-09公開
    QR CODE