無線通訊網路 (Wireless Network) 為生活帶來了更大的便利性，主要提供人們一個不受時間與空間限制，可隨時進行通訊的網路環境，如此的方便性是傳統有線網路所無法提供的。無線通訊網路是未來通訊產業的主流，並且也是學術界一個相當重要的研究課題。
行動隨意網路 (Mobile Ad hoc NETwork; MANET) 是一種可動態組織形成的無線通訊網路，具有不需無線基地台即可相互通訊的特性。應用範圍相當的廣泛，在臨時或無基地台的情況下，就顯得行動隨意網路不需基地台就能讓使用者互相通訊的能力的重要性。行動隨意網路是由一群移動的節點所組成，並且形成一隨意的拓樸。由於主機具有可移動的特性，頻繁的網路拓樸變動將使得行動隨意網路維護更加的複雜及具挑戰性，然而，有線網路的協定在行動隨意網路環境中並不適用。
在本論文中，我們的研究係針對在隨意網路的移動模型研究課題中提出一個新的移動模型，並在繞徑問題和服務搜尋研究課題中提出有效率的解決方案。
許多研究者在分析隨意網路協定的效能時，經常會使用網路模擬的方式進行效能的分析，由於在行動隨意網路中的節點是動態移動，因此需一移動模型來模擬節點的行動，然而移動模型會影響模擬的結果。若能設計一個模擬現實移動行為的模型，將有助於協定的設計與分析，而以往的移動模型均是由單一的移動行為所構成，而真實的移動行為是複雜且多變化的，此外，隨著無線技術的發展，無線通訊將是日常生活中不可或缺的技術，因此，我們提出一都會區的移動模型，包含了各種不同的移動行為，例如，人們日常的移動行為，都會區常見的巴士、計程車及電車的移動模式。在都會區中人及各種載具均可能為無線節點，因此節點也會因為類型的不同而有不同的行為，以出現的地點為例，載具主要是在街道上移動，而人則可能出現在道路或建築物內。節點的移動速度也會依據節點類型而有所不同，例如，人可能會以走路或步行的方式移動，而車輛則可能會依據道路的限制使得移動速度有所不同。在提出的模型中，我們將數種簡單的移動模型組成複合模型來模擬各種節點的移動行為，達到擬真的效果，並且我們也發展一節點移動模型產生器，能產生出適用於NS2模擬器的節點資料檔。提出的移動模型主要是提供研究者有更多樣的選擇，使用者可依據需求選擇適合的模型來進行分析。
在隨意網路的研究課題的繞徑問題研究中針對有效增加繞徑穩定度的繞徑建構方法做探討，我們提出一返回追蹤繞徑通訊協定 (on-demand routing protocol with backtracking)的協定，該方法主要解決繞徑容易斷裂的問題。由於隨意網路是由許多具有無線通訊功能的節點，經自主性的相互連接所構成的網路，不需要經由過基地台管理。在這種網路中，節點的無線傳輸距離有限，兩個節點間若要傳送訊息，則需透過其他中間節點的協助，將訊息從來源節點傳遞至目的節點。此外，節點可隨時加入或離開網路，並且具有移動性，因此網路的拓樸是隨時變動的。為了提高維護節點間繞徑的效率，需求型繞徑協定 (on-demand routing)是一種當有需求時才會建立繞徑的協定。然而，需求型繞徑協定通常建立單一繞徑，常因為節點不可預知的移動，造成拓樸改變而產生繞徑斷裂的問題。為了修復斷裂的繞徑，來源節點需重新尋找新的繞徑，而需求型繞徑協定採用的氾濫(flooding) 搜尋方式會使得原本資源已經有限的無線節點產生有更多的電力消耗和頻寬壅塞的情況。為了解決這種問題，我們利用一次的氾濫搜尋建立一條主要繞徑，並且在主要繞徑上建立多條備用繞徑，擁有備份路徑的節點稱為檢查點(checkpoint)。並在訊息傳送時利用資料暫存的技術，事先將訊息存放在繞徑中的檢查點。當中間的節點發現路徑已斷裂時，則透過錯誤訊息原路返回至最近的檢查點，再由檢查點透過備份繞徑重新發送訊息，進而回復發生斷裂的繞徑，不需重新建立路徑。如此，可有效減少搜尋的成本以及資料傳送的延遲時間，改善單一繞徑的不穩定性。我們利用NS2評估所提出的方法與現有的協定進行效能分析，由效能分析的結果顯示所提出的方法確實能改進繞徑的穩定。
在服務探索問題研究中，我們提出一在階層網格架構 (Hierarchical Grid structure) 中的服務探索協定 (service discovery)，該方法主要利用一特定的傳輸樣式 (transmission pattern) 在階層網格的隨意網路中解決服務搜尋的問題。隨意網路中的節點本身資源有限，可透過分享的方式，相互提供服務。為了取得服務的資源，節點需要透過服務探索協定搜尋可提供服務節點。在pull與push的方式中均以氾濫的方式搜尋及發佈服務訊息，然而，氾濫搜尋的方式會增加通訊成本，包括電力消耗與頻寬使用。在傳統目錄式 (directory-based) 的方法中，有數個節點負責擔任記錄服務資訊的目錄，提供服務的節點則定期將服務資訊及目前位置註冊更新至目錄，需要服務的節點則向目錄詢問服務的相關資訊。這種方法主要透過目錄來管理服務的資訊。然而，此種由固定的節點擔任目錄的方式並不適合隨意網路，因為隨意網路節點的移動特性讓使用者無法確定目錄節點的位置。由於目錄式方法不能直接適用於隨意網路，我們提出一新的服務探索協定，透過地理資訊系統的協助，將網路劃分成階層式的網格架構，在每個網格內選擇一節點擔任目錄。提供服務的節點利用提出的傳送樣式，將服務註冊到特定的網格內的目錄，該傳輸樣式的形成是依照網格的階層，而要求服務的節點則透過另一傳送樣式搜尋服務。該方法的優點是將減少註冊及搜尋的成本與時間，並且搜尋和註冊不需遍及整個網路，只需要註冊及探索一部分的網格即可取得服務。

The wireless network brings convenience communication for people. People can connect with each other by wireless network anytime and anywhere. The traditional wire network cannot provide this convenience for people. The wireless network is the main development for the communication industry, and an important issue for researches.
Mobile ad hoc network (MANET) is a self-organizing and dynamically reconfigurable wireless network without fixed infrastructure or central management. The application of MANETs is very extensive. When no infrastructure exists, we can see that the importance of MANETs that provide the capability of communication for users. MANET is composed by a group of mobile nodes and is formed an arbitrary topology. Due to the frequent network topology change, to establish and maintain MANET becomes more complex and has challenge. However, the protocols of wire network are not suitable for MANETs.
This dissertation focuses three issues on MANETs, including mobile model, routing and service discovery.
Many researchers study the protocol performance for MANET by simulation. Because the nodes in MANET are dynamic, we need a mobile model to simulate the behaviors of nodes. The different behaviors of nodes influence the results of simulation. A mobile model that simulates the real behaviors of nodes contributes to design and analyze protocols. The common mobile models are usually the single
mobile behavior model. However, the real behaviors of nodes are complex and various. Additionally, the wireless communication is an indispensable application in the daily life following the development of wireless technology. Therefore, we propose an urban-area based mobile model, including various behaviors, e.g. the daily activities of people and the movements of taxi, bus, streetcar and subway. People and various vehicles are the wireless nodes in urban area. The different node types have the different mobile behaviors. For example of the location, vehicles are at the streets and people are within buildings or on the streets. The different node types also have the different speeds. For example, the people may walk or drive; the vehicles have the different speed limitation on different street types. In the proposed model, the complex models are composed of several simple mobile models to simulate various behaviors of nodes. We also develop a node mobile model generator to generate mobility trace files for NS2. The proposed mobile model offers researchers to have more various choices to analyze their protocols.
We discuss and propose an on-demand routing protocol with backtracking to improve the routing stability for MANETs. This approach solves the unstable problem of routing. A lot of wireless nodes compose a self-organizing MANET without fixed infrastructure or central management. Because the wireless transmission range between two nodes is limited, the messages from a source to a destination are needed to forward through several intermediate nodes. Additionally, the mobile nodes can join or leave network anytime, so the network topology is changed frequently. To improve the routing maintenance efficiency, the on-demand routing protocols build and maintain the routing information when a node needs a route to forward data. However, on-demand routing protocols usually build a single routing to forward data. The route is broken frequently because of the change of topology. In order to recover the broken routing, the source needs to rediscover a new route. The discovery of on-demand routing protocol is a flooding-based method that consumes more energy and increases the congestion of communication. To solve this problem, we establish a primary route and several alternate routes on primary route by a flooding-based discovery. The nodes, called checkpoints, that have alternate routes keep data packets while they receive and forward data. When an intermediate node detects the broken route, it issues an error message backtracking to the last checkpoint. The checkpoint can retransmit data to destination along an alternate route to recover the broken route, so the source does not need to reestablish a new route. Therefore, this approach can improve the instability of single route, and decrease discovery cost and data transmission latency effectively. We compare the proposed solution with the existing protocols, and analyze the performance of protocols by NS2 simulator. The simulation results show that the proposed solution can improve the stability of route.
We propose a service discovery that utilizes several transmission patterns on grid structure to solve the service discovery problem for MANETs. Because of the resource limitation of nodes on MANETs, the nodes can provide and share their services each other. To obtain the provided services, the nodes need to find out the service provider by service discovery protocol. The pull and push based methods both utilize flooding-based method to discover and register service information. However, the flooding-based discovery method increases the communication cost, including energy and bandwidth consumption. In the traditional directory-based methods, several nodes serve as the directory nodes that keep the service information. The service providers update their location and service information to directory nodes periodically, and the service requestors query the directory nodes about the service information. However, this method keeps the service information in the directory nodes that are served by the fixed nodes. This method is not suitable for MANETs, because users do not know the location of directory nodes. Therefore, we propose a novel service discovery protocol that register and discover service in grid structure. This approach divides the geographic area of MANET into a logical hierarchical grid. In each cell, a node is elected to serve as a directory. The service providers register their service information to the directory of the particular cells along the proposed transmission patterns that are formed according to the level of the cell. Then, the service requestors discover service along discovery transmission pattern. The advantages of this solution are to reduce the cost and time for registering and discovering. Additionally, the service registering and discovering do not spread through the whole network, so the requestors can obtain services by registering and discovering a portion of cells.

[1] F. Bai, S. Narayanan, and A. Helmy, "IMPORTANT: a framework to systematically analyze the Impact of Mobility on Performance of Routing Protocols for Ad hoc Networks," in Proceedings the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 2, pp. 825-835, 2003.
[2] R. Beraldi and R. Baldoni, "A Caching Scheme for Routing in Mobile Ad Hoc Networks and Its Application to ZRP," in IEEE Transactions on Computers, Vol. 52, No. 8, pp. 1051-1062, Aug. 2003.
[3] Z. Biao, X. Kaixin, and M. Gerla, "Group and swarm mobility models for ad hoc network scenarios using virtual tracks," in Proceedings IEEE Military Communications Conference, pp. 289-294, 2004.
[4] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu and J. Jetcheva, "A Performance Comparison of Multi-hop Wireless Ad Hoc Network Routing Protocols," in Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, Dallas, Texas, USA, pp. 85-97, Oct. 1998.
[5] T. Camp, J. B. V. Davies, "A survey of mobility models for ad hoc network research," in Wireless Communication & Mobile Computing, 2002, Vol. 2, No. 5, pp. 483-502.
[6] R. Castaneda and S. R. Das, "Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks," in ACM/Kluwer Wireless Networks (WINET) Journal, Vol. 8, No. 2, pp. 137-151, Mar. 2002.
[7] C. Chiang, Wireless Networks Multicasting. PhD thesis, Department of Computer Science, University of California, Los Angeles, USA, 1998.
[8] C.-C. Chiang, H.-K. Wu, W. Liu, and M. Gerla, "Routing in Clustered Multihop Mobile Wireless Networks with Fading Channel," in Proceedings of 1997 IEEE Singapore International Conference on Networks, Kent Ridge, Singapore, pp. 197-211, Apr. 1997.
[9] CMU Monarch Group. CMU Monarch extensions to ns.
[10] R. Dube, C. D. Rais, K.-Y. Wang, and S. K. Tripathi, "Signal Stability based Adaptive Routing for Ad Hoc Mobile Networks," in IEEE Personal Communication Magazine, Vol. 4, No. 1, pp. 36-45, Feb. 1997.
[11] K. Edwards and T. Rodden, Jini Example by Example, Prentice Hall PTR, Jun, 2001.
[12] P. Engelstad, Y. Zheng, T. Jonvik and D. Van Thanh, "Service Discovery and Name Resolution Architectures for On-demand MANETs," in Proceedings 23rd International Conference on Distributed Computing Systems Workshops, Providence, Rhode Island, USA, pp. 736-742, May, 2003.
[13] K. Fall and K. Varadhan, ns notes and documentation. Technical report, UC Berkeley, LBL, USC/ISI, and Xerox PARC, Nov. 1997.
[14] R. A. Guerin. "Channel Occupancy Time Distribution in a Cellular Radio System," in IEEE Transactions on Vehicular Technology, Vol. 36, No. 3, pp. 89-99, 1987.
[15] S. Guo and O. W. Yang, "Performance of Backup Source Routing in Mobile Ad Hoc Networks," in Proceedings of the 2002 IEEE Wireless Communications and Networking Conference, Orlando, FL, USA, pp.440-444, Mar. 2002.
[16] E. Guttman, J. Veizades, C. Perkins and M. Day, REC 2608: Service Location Protocol, version 2, Jun. 1999.
[17] Z. J. Haas, "A new routing protocol for the reconfigurable wireless networks," in Proceedings of IEEE 6th International Conference on Universal Personal Communications, pp. 562-566, San Diego, CA, USA, Oct. 1997.
[18] Z. J. Haas and M. R. Pearlman, "The Performance of Query Control Schemes for the Zone Routing Protocol," in IEEE/ACM Transactions on Networking, Vol. 9, No.4, pp. 427-438, Aug. 2001.
[19] K. P. Hatzis, G. P. Pentaris, P. G. Spirakis, V. T. Tampakas and R. B. Tan, "Fundamental Control Algorithms in Mobile Networks," in Proceedings of the 18th annual ACM symposium on Parallel Algorithms and Architectures, Saint Malo, pp. 251-260, France, 1999.
[20] X. Hong, M. Gerla, G. Pei, and C. Chiang, "A group mobility model for ad hoc wireless networks," in ACM/IEEE International Workshop on Modeling and Simulation of Wireless and Mobile Systems, pp. 53-60, Aug. 1999.
[21] Y.-C. Hu and D. B. Johnson, "Caching Strategies in On-Demand Routing Protocols for Wireless Ad Hoc Networks," in Proceeding of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom'00), ACM, Boston, MA, USA, pp. 231-242, Aug, 2000.
[22] IEEE Standard Department. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE standard 802.11-1997.
[23] M.U. Ilyas and H. Radha, "The influence mobility model: a novel hierarchical mobility modeling framework," in Proceedings of 2005 IEEE Wireless Communications and Networking Conference (WCNC'05), MI, USA, Vol. 3, pp. 1638-1643, Mar. 2005.
[24] A. Jardosh, E. M. Belding-Royer, K. C. Almeroth, and S. Suri, "Towards Realistic Mobility Models for Mobile Ad Hoc Networks," in Proceedings of the 9th ACM Annual international Confer-ence on Mobile computing and networks (MobiCom'03), pp. 217-229, September 2003.
[25] P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and N. Degermark, "Scenario-based performance analysis of routing protocols for mobile ad-hoc networks," in Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking (MobiCom '99), pp.195-206, Seattle, Washington, United States, 1999.
[26] D. B. Johnson, D. A. Maltz, and Josh Broch. "DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks," in Ad Hoc Networking, edited by Charles E. Perkins, Chapter 5, pp. 139-172, Addison-Wesley, 2001.
[27] D.B. Johnson, D.A. Maltz, Y.C. Hu, "The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)," IETF Mobile Ad Hoc Networks Working Group, Internet Draft, work in progress, Apr., 2003.
[28] M. Klein, B. König-Ries and P. Obreiter, "Lanes: A Lightweight Overlay for Service Discovery in Mobile Ad Hoc Networks", Technical Report Nr. 2003-6, May, 2003.
[29] M. Klein, B. König-Ries and P. Obreiter, "Service Rings - A Semantic Overlay for Service Discovery in Ad Hoc Networks," in Proceedings of 14th International Workshop on Database and Expert Systems Applications, Prague, Czech Republic, pp. 180-185, Sep. 2003.
[30] Y.-B. Ko and N.-H. Vaidya, "Location-aided routing (LAR) in mobile ad hoc networks," in Wireless Networks, Vol. 6, No. 4, pp. 307-321, Jul. 2000.
[31] U. C. Kozat and L. Tassiulas, "Network Layer Support for Service Discovery in Mobile Ad Hoc Networks," in Proceedings of the 22th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03), San Francisco, California, USA, Vol. 3, pp. 1965-1975, Mar. 2003.
[32] S.-J. Lee and M. Gerla, "AODV-BR: Backup Routing in Ad hoc Networks," in Proceedings of the 2000 IEEE Wireless Communications and Networking Conference (WCNC'00), Vol.3, pp.1311-1316, Chicago, IL, Sep. 2000.
[33] S.-J. Lee and M. Gerla, "Dynamic Load-Aware Routing in Ad hoc Networks," in Proceedings of 2001 IEEE International Conference on Communications (ICC'01), Vol.10, pp. 3206-3210, Helsinki, Finland, June 2001.
[34] S.-J. Lee, M. Gerla, and C.-K. Toh, "A Simulation Study of Table-driven and An-demand Routing Protocols for Mobile Ad Hoc Networks," in IEEE Network, Vol.13, No.4, pp. 48-54, Jul.-Aug. 1999.
[35] V. Lenders, M. May and B. Plattner, "Efficient Content Location in Wireless Ad Hoc Networks," in Pervasive and Mobile Computing, Vol. 1, No. 3, pp. 343-370, Sep., 2005.
[36] J. Li, J. Jannotti, D. De Couto, D. Karger and R. Morris, "A Scalable Location service for geographic ad-hoc routing," in Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, Boston, Massachusetts, USA, pp. 120-130, Aug. 2000.
[37] W.-H. Liao, Y.-C. Tseng, K.-L. Lo and J.-P. Sheu, "GeoGRID: A Geocasting Protocol for Mobile Ad Hoc Networks Based on GRID," in Journal of Internet Technology, Vol. 1, No. 2, pp. 23-32, Dec. 2000.
[38] W.-H. Liao, Y.-C. Tseng and J.-P. Sheu, "GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks," in Telecommunication Systems, Vol. 18, No. 1, pp. 37-60, 2001.
[39] W. D. List and N. H. Vaidya, "A Routing Protocol for K-hop Networks," in Proceedings of 2004 Wireless Communications and Networking Conference (WCNC'04), Vol.4, pp. 2545-2550, Atlanta, Georgia USA, Mar. 2004.
[40] J. Liu, K. Sohraby, Q. Zhang, B. Li, and W. Zhu, "Resource discovery in mobile ad hoc networks," Technical Report No. CSL-TR-98-769, 2003.
[41] M. K. Marina and S. R. Das, "On-demand Multipath Distance Vector Routing in Ad Hoc Networks," in Proceedings of 2001 IEEE International Conference on Network Protocols, Mission Inn, Riverside, California, pp. 14-23, 2001.
[42] S. Murthy and J. J. Garcia-Luna-Aceves, "A Routing Protocol for Packet Radio Networks," in Proceedings of ACM First International Conference on Mobile Computing & Networking (MOBICOM'95), Berkeley, California, United States, pp. 86-95, Nov. 1995.
[43] A. Nasipuri, R. Castaneda, and S. R. Das, "Performance of Multipath Routing for On-demand Protocols in Mobile Ad Hoc Networks," in ACM/Kluwer Mobile Networks and Applications (MONET) Journal, Vol. 6, No. 4, pp. 339-349, 2001.
[44] V. D. Park and M. S. Corson, "A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks," in Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'97), Kobe, Japan, pp. 1405-1413, Apr. 1997.
[45] V. D. Park and M. S. Corson, "A Performance Comparison of the Temporally-Ordered Routing Algorithm and Ideal Link-State Routing," in Proceedings of IEEE Symposium on Computers and Communication, Athens, Greece, pp.592-598, Jun. 1998.
[46] C. E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance Vector Routing (DSDV) for Mobile Computers," in Proceedings of ACM SIGCOMM’94, London, UK, pp. 234-244, September 1994.
[47] C. E. Perkins and E. M. Royer, "Ad-Hoc On-Demand Distance Vector Routing," in Proceedings of 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, Louisiana, USA, pp. 90-100, Feb. 1999.
[48] C. E. Perkins, E. M. Royer, S. R. Das, and M. K. Marina, "Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks," in IEEE Personal Communications, Vol.1, No.1, pp. 16 -28, Feb. 2001.
[49] Z. Qunwei, H. Xiaoyan, and L. Jun, "An agenda based mobility model," in Proceedings of the 39th Annual Simulation Symposium, Tuscaloosa, AL, USA, pp. 8-15, Apr. 2006.
[50] J. Raju and J. J. Garcia-Luna-Aceves, "A Comparison of On-demand and Table-driven Routing for Ad Hoc Wireless Networks," in Proceedings of IEEE International Conference on Communications (ICC'00), New Orleans, Louisiana, Vol.3, pp. 1702-1706, Jun. 2000.
[51] E. M. Royer, P. M. Melliar-Smith, and L. E. Moser, "An Analysis of the Optimum Node Density for Ad hoc Mobile Networks," in Proceedings of the IEEE International Conference on Communications (ICC'01), pp. 857-861,, Jun. 2001.
[52] E. M. Royer and C.-K. Toh, "A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks," in IEEE Personal Communications, Vol.6, No.2, pp. 46-55, Apr. 1999.
[53] N. Sadagopan, F. Bai, B. Krishnamachari, and A. Helmy, "PATHS: Analysis of PATH Duration Statistics and Their Impact on Reactive MANET Routing Protocols," in Proceedings of 4th ACM Inter-national Symposium Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 245-256, Annapolis, Maryland, USA, June 2003.
[54] F. Sailhan and V. Issarny, "Scalable Service Discovery for MANET," in Proceedings of the 3rd IEEE International Conference on Pervasive Computing and Communication (PerCom'05), Sheraton-Kauai Resort, Kauai, Hawaii, USA, pp. 235-244, Mar. 2005.
[55] Salutation Consortium, "Salutation Architecture Specification, www.salutation.org/specordr.htm," 1999.
[56] J. B. Tchakarov and N. H. Vaidya, "Efficient Content Location in Wireless Ad Hoc Networks," in Proceedings of the 2004 IEEE International Conference on Mobile Data Management (MAD'04), Berkeley, California, USA, pp. 74-85, Jan. 2004.
[57] J. Tian, J. Hahner, C. Becker, I. Stepanov, and K. Rothermel, "Graph-Based Mobility Model for Mobile Ad Hoc Network Simulation," in Proceedings of the 35th Annual Simulation Symposium, April 2002.
[58] Uddi version 3.0 published specification, http://www.uddi.org, Jul. 2002.
[59] Universal plug and play device architecture. UPnP Forum, http://www.upnp.org, Jun. 2006, Version 1.0.
[60] K. Wang and B. Li, "Group Mobility and Partition Prediction in Wireless Ad-hoc Networks," in Proceedings of IEEE International Conference on Communications (ICC'02), Vol. 2, pp. 1017-1021, New York City, New York, 2002.
[61] L. Yin and G. Cao, "Supporting Cooperative Caching in Ad hoc Networks," in Proceeding of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04), Hong Kong, China, March 2004.