移动社会性软件系统中搜索关键技术研究
摘要
现如今随着信息技术的迅速发展,用户需求的不断增加,用户的交互方式呈现出多样化的趋势,面对这种情况,越来越多的研究者将视线集中到研究如何将人们的社会行为映射到网络中去。社会性软件将人的行为设计、社会关系、社群关系和人群协作机制、资源网络的动力学演化机制等纳入到系统之内,为现实和网络的联系提供了一个桥梁。
社会性软件部署到移动平台,移动社会性软件系统便应运而生,该系统可以具有更灵活的参与以及协作方式、更生动的社会关系描述,也能够更贴近于真实世界。但目前大多数的研究成果仅仅关注某一具体的方面、具体的项目,并没有为移动社会性软件系统建立一个统一的应用模型。此外,搜索是移动社会性软件系统需要研究的一个基础性课题,如何能够更有效地找到志同道合的朋友,如何能在移动设备的物理位置频繁移动的情况下提高搜索效率将是本文研究的主要内容。现实中的网络大多具有复杂网络的特性,移动社会性软件系统映射了用户之间的社会性,该网络也具有复杂网络的诸多基本特征。然而,在设计移动社会性软件系统的搜索算法时,大多数研究没能将网络的拓扑特征和节点的社会性特点相结合,仅是单一的考虑覆盖层与底层网络的匹配或是节点的兴趣度等方面。
针对上述问题,本文在已有的理论及研究的基础上,将复杂性研究的相关理论和方法引入到移动社会性软件系统研究中。通过对典型移动社会性软件系统的分析,抽象出可以描述移动社会性软件系统的参数,给出移动社会性软件系统的形式化定义。建立移动社会性软件系统模型,并分析其网络拓扑特征。根据移动社会性软件系统拓扑特征和社会性优化搜索算法,并使用缓存机制辅助搜索。
本文的主要工作包括:
1.通过分析移动社会性软件系统的特点,给出移动社会性软件系统的形式化定义。尽管移动社会性软件系统的概念已经提出很久,定义也是多种多样,但目前还没有一个统一的形式化定义。文章通过对移动社会性软件系统相关定义和特征的分析,归纳总结已有的移动社会性软件系统的特征,给出一个并非全面,但可以较细致描述移动社会性软件系统特性和功能的定义。
2.根据移动社会性软件系统定义,提出一种移动社会性软件系统系统模型,并分析其所具有的网络拓扑特征。在复杂网络的基础上,根据局域世界演化模型,构建移动社会性软件系统模型,研究模型的度分布特征。
3.对移动社会性软件系统中的搜索算法进行优化改进。大多数移动社会性软件系统搜索方法缺乏对用户物理位置和社会性的兼顾研究。针对这种情况,文章提出了一种基于兴趣和位置的移动社会性软件系统搜索方法,通过设置不同功能类型的超级节点将覆盖层网络分层,从而兼顾了节点的社会性和物理位置。为了提高了查询效率,本文引入了查询度的概念,节点的查询和位置更新均受其查询度的影响。此外,缓存也是提高搜索效率的重要手段之一,在移动环境下,如何保持缓存一致性以及缓存替换策略的设计也将是本文研究的内容之一。
4.在生成的社会性软件系统网络中对算法进行仿真实验。
Nowadays with the rapid development of information technology and the gradually increasing of the user requirement the user interactions present to be more diverse. Facing this situation, more and more researchers focus on how to map the peoples’social behavior to the networks. Social Software brings the peoples’social behaviors, social relations, community relations, people cooperation mechanism and the dynamic evolution mechanism of resources network into the system of Social Software and provides a bridge between reality and networks.
The Mobile Social Software System will come into being since the Social Software was deployed to the mobile platform. The Mobile Social Software System makes the participation and cooperation more flexible, describes the social relationship more vivid and it is more close to the real world. But most research achievements pay them attention to a specific aspect or a specific project only and they do not establish a unified model. Furthermore, searching is a basic topic in Mobile Social Software System. The main contents of researching are that how to find the like-minded friends more effectively and how to improve the searching efficiency in the condition that the physical location frequently moved. Most of the real networks have the characteristics of Complex Network. Mobile Social Software System reflected the sociality among the users, so this network should have many basic characteristics of Complex Network. However, when designing the searching algorithm in the Mobile Social Software System, most studies do not combine the topology with the sociality of nodes. They just consider the matching of overlay and the underlying network or the interests of nodes and so on.
Focusing on these problems, in the basis of existing theories and research, the related theory and method of complexity research is introduced into the Mobile Social Software System. On the analysis of the typical Mobile Social Software System, the parameters that can describe the Mobile Social Software System are abstracted and the formalization definition of the Mobile Social Software System is presented. A Mobile Social Software System model is established and the characteristics of network topology are analyzed. Then the search algorithm is optimized based on the topology and sociality of Mobile Social Software System network and the caching mechanism is used to aid search.
The main work of this paper is as follows:
First, through analyzing the characteristics of Mobile Social Software System, the formalization definition of the Mobile Social Software System is presented. Although the concept of Mobile Social Software System has been presented for a long time and its definition is various, there is no uniform formalization definition at present. Through analyzing the related definitions of the Mobile Social Software System, summarizing the characteristics of existing Mobile Social Software System, a definition that is not comprehensive but can describe the properties and function of Mobile Social Software System in detail is presented.
Second, a Mobile Social Software System model is presented and its topology is analyzed based on the definition of Mobile Social Software System. On the basis of Complex Networks and local-world model, the Mobile Social Software System model is structured. Then the degree distributions character is discussed and the network characteristic is analyzed by experiment media.
Third, the search algorithm of Mobile Social Software System is optimized. Most of Mobile Social Software System search methods lack research that considers both users’physical location and sociality. To this problem an Interest and Location based Search Scheme is proposed. The overlay is layered through setting different kinds of super-nodes, thus the nodes’sociality and location are considered. In order to improve the query efficiency, the concept of query degree is introduced. In the process of searching and updating, the query degree has greater influence. Furthermore, cache is one of the important means to improve the searching efficiency. In mobile environment, keeping the cache consistency and the design of cache replacement strategy is also one of the contents.
Finally, the simulations are done in the network of Mobile Social Software System.
社会性软件部署到移动平台,移动社会性软件系统便应运而生,该系统可以具有更灵活的参与以及协作方式、更生动的社会关系描述,也能够更贴近于真实世界。但目前大多数的研究成果仅仅关注某一具体的方面、具体的项目,并没有为移动社会性软件系统建立一个统一的应用模型。此外,搜索是移动社会性软件系统需要研究的一个基础性课题,如何能够更有效地找到志同道合的朋友,如何能在移动设备的物理位置频繁移动的情况下提高搜索效率将是本文研究的主要内容。现实中的网络大多具有复杂网络的特性,移动社会性软件系统映射了用户之间的社会性,该网络也具有复杂网络的诸多基本特征。然而,在设计移动社会性软件系统的搜索算法时,大多数研究没能将网络的拓扑特征和节点的社会性特点相结合,仅是单一的考虑覆盖层与底层网络的匹配或是节点的兴趣度等方面。
针对上述问题,本文在已有的理论及研究的基础上,将复杂性研究的相关理论和方法引入到移动社会性软件系统研究中。通过对典型移动社会性软件系统的分析,抽象出可以描述移动社会性软件系统的参数,给出移动社会性软件系统的形式化定义。建立移动社会性软件系统模型,并分析其网络拓扑特征。根据移动社会性软件系统拓扑特征和社会性优化搜索算法,并使用缓存机制辅助搜索。
本文的主要工作包括:
1.通过分析移动社会性软件系统的特点,给出移动社会性软件系统的形式化定义。尽管移动社会性软件系统的概念已经提出很久,定义也是多种多样,但目前还没有一个统一的形式化定义。文章通过对移动社会性软件系统相关定义和特征的分析,归纳总结已有的移动社会性软件系统的特征,给出一个并非全面,但可以较细致描述移动社会性软件系统特性和功能的定义。
2.根据移动社会性软件系统定义,提出一种移动社会性软件系统系统模型,并分析其所具有的网络拓扑特征。在复杂网络的基础上,根据局域世界演化模型,构建移动社会性软件系统模型,研究模型的度分布特征。
3.对移动社会性软件系统中的搜索算法进行优化改进。大多数移动社会性软件系统搜索方法缺乏对用户物理位置和社会性的兼顾研究。针对这种情况,文章提出了一种基于兴趣和位置的移动社会性软件系统搜索方法,通过设置不同功能类型的超级节点将覆盖层网络分层,从而兼顾了节点的社会性和物理位置。为了提高了查询效率,本文引入了查询度的概念,节点的查询和位置更新均受其查询度的影响。此外,缓存也是提高搜索效率的重要手段之一,在移动环境下,如何保持缓存一致性以及缓存替换策略的设计也将是本文研究的内容之一。
4.在生成的社会性软件系统网络中对算法进行仿真实验。
Nowadays with the rapid development of information technology and the gradually increasing of the user requirement the user interactions present to be more diverse. Facing this situation, more and more researchers focus on how to map the peoples’social behavior to the networks. Social Software brings the peoples’social behaviors, social relations, community relations, people cooperation mechanism and the dynamic evolution mechanism of resources network into the system of Social Software and provides a bridge between reality and networks.
The Mobile Social Software System will come into being since the Social Software was deployed to the mobile platform. The Mobile Social Software System makes the participation and cooperation more flexible, describes the social relationship more vivid and it is more close to the real world. But most research achievements pay them attention to a specific aspect or a specific project only and they do not establish a unified model. Furthermore, searching is a basic topic in Mobile Social Software System. The main contents of researching are that how to find the like-minded friends more effectively and how to improve the searching efficiency in the condition that the physical location frequently moved. Most of the real networks have the characteristics of Complex Network. Mobile Social Software System reflected the sociality among the users, so this network should have many basic characteristics of Complex Network. However, when designing the searching algorithm in the Mobile Social Software System, most studies do not combine the topology with the sociality of nodes. They just consider the matching of overlay and the underlying network or the interests of nodes and so on.
Focusing on these problems, in the basis of existing theories and research, the related theory and method of complexity research is introduced into the Mobile Social Software System. On the analysis of the typical Mobile Social Software System, the parameters that can describe the Mobile Social Software System are abstracted and the formalization definition of the Mobile Social Software System is presented. A Mobile Social Software System model is established and the characteristics of network topology are analyzed. Then the search algorithm is optimized based on the topology and sociality of Mobile Social Software System network and the caching mechanism is used to aid search.
The main work of this paper is as follows:
First, through analyzing the characteristics of Mobile Social Software System, the formalization definition of the Mobile Social Software System is presented. Although the concept of Mobile Social Software System has been presented for a long time and its definition is various, there is no uniform formalization definition at present. Through analyzing the related definitions of the Mobile Social Software System, summarizing the characteristics of existing Mobile Social Software System, a definition that is not comprehensive but can describe the properties and function of Mobile Social Software System in detail is presented.
Second, a Mobile Social Software System model is presented and its topology is analyzed based on the definition of Mobile Social Software System. On the basis of Complex Networks and local-world model, the Mobile Social Software System model is structured. Then the degree distributions character is discussed and the network characteristic is analyzed by experiment media.
Third, the search algorithm of Mobile Social Software System is optimized. Most of Mobile Social Software System search methods lack research that considers both users’physical location and sociality. To this problem an Interest and Location based Search Scheme is proposed. The overlay is layered through setting different kinds of super-nodes, thus the nodes’sociality and location are considered. In order to improve the query efficiency, the concept of query degree is introduced. In the process of searching and updating, the query degree has greater influence. Furthermore, cache is one of the important means to improve the searching efficiency. In mobile environment, keeping the cache consistency and the design of cache replacement strategy is also one of the contents.
Finally, the simulations are done in the network of Mobile Social Software System.
引文
[1] Anna-Kaisa Pietilainen, Earl Oliver, Jason LeBrun, George Varghese, Jon Crowcroft, Christophe Diot. Experiments in Mobile Social Networking [R]. Technical Report CR-PRL-2008-02-0003, 2008.
[2] Gang Peng, Shanping Li, Hairong Jin, Tianchi Ma. M-CAN: A Lookup Protocol for Mobile Peer-to-Peer Environment[C]. Parallel Architectures, Algorithms and Network, 2004, 544-519.
[3] Scott Counts, Henri ter Hofte, Ian Smith. Mobile Social Software: Realizing Potential, Managing Risks [C]. Conference on Human Factors in Computing Systems, 2006, 1703-1707.
[4] Jeff Axup, Stephen Viller, Ian MacColl, Roslyn Cooper. Lo-Fi Matchmaking:A Study of Social pairing for Backpackers[C]. Proceeding of Ubiquitous Computing. 2006, 4206:351-368.
[5] Nathan Eagle, Ales Pentland. Social Serendipity: Mobilizing Social Software[C]. IEEE pervasive computing, 2005, 4(2):1536-1268.
[6] Sebastian Thrum. Simultaneous Localization and Mapping[C]. Robotics and Cognitive Approaches to Spatial Mapping, 2008, 38:13-41.
[7] Lars Erik Holmquist, Jennica Falk, Joakim Wigstrom. Supporting Group Collaboration with Interpersonal Awareness Devices[J]. Personal and Ubiquitous Computing, 1999, 3(2): 13-21.
[8] Joseph .F. McCarthy, David H. Nguyen, Al Mamunur Rashid, Suzanne Soroczak. Proactive Displays and the Experience UbiComp Project[C]. ACM: ACM Siggroup Bulletin, 2002, 23(3): 38-41.
[9] http://www.google.com/intl/en_us/latitude/intro.html.
[10] http://www.loopt.com/.
[11] Smith Ian. Social-Mobile Applications[C]. Computer, 2005, 38(4):84-87.
[12] Julian Bleecker. What’s Your Social Doing In My Mobile? Design Patterns for Mobile Social Software[C]. WWW2006 Workshop“MobEA lV-Empowering the Mobile Web”, 2006, 1-6.
[13]黄德群.移动学习研究对远程教育的影响[J].实践探索,2005,23:48-51.
[14] Tim de Jong, Marcus Specht, Rob Koper. A reference model for mobile social software for learning[J]. International Journal of Continuing Engineering Education and Lifelong Learning, 2008, 18(1):118-138.
[15]张树人.从社会性软件、Web2.0到复杂适应信息系统研究[D].北京:中国人民大学,2006.
[16]黄晔.基于Web2.0社会性标签与统计推荐系统的设计与实现[D].重庆:重庆大学,2006.
[17]懂坤坤,戴心来,陈恳.基于LMA软件的移动学习资源设计[J].现代教育技术,2009,19(1):76-78.
[18]王珍珍,杨雪,傅健.基于Flash Lite的移动学习资源开发研究[J].现代教育技术,2009,19(4):102-104.
[19] Ping Wang, Lidan Shou, Gang Chen, Jinxiang Dong. MIME: A Dynamic Index Scheme for Multi-dimensional Query in Mobile P2P Networks[C]. Advances in databases, 2007, 576-585.
[20] Dewan Tanvir Ahmed, Shervin Shirmohammadi. Multi-level Hashing for Peer-to-Peer System in WirelessAd Hoc Environment[C]. Proceeding of the Fifth Annual IEEE international Conference on Pervasive Computing and communications Workshops, 2007, 126-131.
[21] A. Liotta, M. Ballette, L. Lin, M. Gasparoni ,P. Brick, N. Papadoglous. Service-Driven Group Management for Mobile P2P Services[C]. Intelligence in Communication Systems, 2005, 190:221-230.
[22]程超.移动对等网络(MP2P)资源搜索策略研究[D].北京:北京交通大学,2009.
[23]卢炎生,许浒,潘鹏.约束的移动对象最近邻轨迹查询[J].华中科技大学学报(自然科学版), 2007,35(2):57-59.
[24]战学刚,郭建,迟呈英,周游.应用移动Agent加强JXTA网络的搜索功能[J].计算机工程与设计,2009,30(24):5622-5629.
[25] Stanley Milgram. The small world problem[J]. Psychology Today, 1967, 1(1):60-67.
[26]司徒峻峰.Internet的小世界网络研究[J].情报杂志,2004, 23(12):86-88
[27]徐敏,辛琳.由信息的时效性引发的移动博客思考[J].科技情报开发与经济,2008,18(31):159-160.
[28] Jin-hee Ko, Chihoon Hur, Hanil Kim. A Personalized Mobile Learning System Using Multi-agent[C].Web Information Systems Engineering-WISE 2005 Workshops, 2005, 3807:144-151.
[29] Jaekoo Song, Mingyun Kang, Seoksoo Kim. Study on Contents Protection in M-Learning Environment[C]. Computational Science and Its Applications-ICCSA, 2006, 3984: 575-583.
[30] Duncan J. Watts, Steven H. Strogatz. Collective dynamics of‘small-world’networks [J]. Nature, 1998, 393(6684):440-442.
[31]彭刚.MP2P环境中资源定位算法的研究[D].杭州:浙江大学,2005.
[32]庄雷.基于Gnutella协议的Peer-to-Peer网络研究及其协议验证[D].郑州:解放军信息工程大学,2004.
[33] Ian Clarke, Oskar Sandberg, Brandon Wiley, Theodore w.hong. Freenet: A distributed Anonymous Information Storage and Retrieval System[C]. Designing Privacy Enhancing Technologies, 2001, 2009: 46-44.
[34] Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger. Chord: A Scalable peer-to-peer Lookup Protocol for Internet Applications[C]. IEEE/ACM Transactions on Networking, 2003, 11(1): 17-32.
[35] Antony Rowstron, Peter Druschel. Pastry: Scalable, Decentralized object location and routing for large-scale peer-to-peer systems[C]. Middleware, 2001,2218: 329-350.
[36] Ben Yanbin Zhao, John David Kubiatowicz, Anthony Douglas Joseph. Tapestry: An infrastructure for wide-area fault-tolerant location and routing[R]. U.C. Berkeley Technical Report UCB/CSD-01-1141,2001.4.
[37] Steve Waterhouse. JXTA Search: Distributed search for distributed networks[R]. Technical report, Sun Microsystems Inc. 2001.
[38] Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker. Search and replication in Unstructured peer-to-peer networks[R]. Proceedings of the 16th ACM International Conference on Super computing(ACM ICS’02), 2002.
[39]卢国明.基于P2P的网络资源管理关键技术[D].成都:电子科技大学,2006.
[40] Bhuvan Urgaonkar, Anoop George Ninan, Mohammad Salimullah Raunak, Prashant Shenoy, KrithiRamamritham. Maintaining Mutual Consistency for Cached Web Objects[R]. In: proc. of the 21th Intl. Conf . on distributed Computing Systems(ICDCS),2001.
[41]黄宇.移动自组织环境下协作缓存一致性维护机制研究[D].安徽:中国科学技术大学,2007.
[42] Jiannong Cao, Yang Zhang, Li Xie. Consistency of cooperative Caching in Mobile Peer-to-Peer Systems over MANET[C]. International Journal of parallel, Emergent and Distributed Systems, 2006, 21(3):537-579.
[43]李天亮,石磊.一种有效的混合式P2P web缓存系统Hcache[J].计算机应用,2008,2(86):1478-1480.
[44] Nuggehalli P, Srinvivasan V, Chiasserini CF, Rao R. Efficient Cache Placement in Multi-Hop Wireless Networks[C]. IEEE/ACM Transactions on Networking , 2006, 14(5): 1045-1055.
[45] Junho Shim, Peter Scheuermann, Radek Vingralek. Proxy Cache Algorithms: Design, Implementation and Performance[C]. IEEE Transaction on Knowledge and Data Engineer, 1999, 11(4):549-562.
[46] Toshihiko Yamakami. Mobile Web 2.0: Lessons From Web 2.0 and past Mobile Internet Development[C]. Proceeding of the 2007 International Conference on Multimedia and Ubiquitous Engineering,2007, 886-890.
[47]汪小帆.复杂网络中的社团结构分析算法研究综述[J].复杂系统与复杂性科学,2005,2(3):1-12.
[48]王玲芳陈焱.P2P系统及其应用[M].北京:机械工业出版社,2008:343.
[49] Stefan Saroiu, P. Krishna. Gummadi, Steven.D. Gribbler. A measurement study of peer-to-peer File sharing systems[R]. Proceedings of Multimedia Computing and Networking 2002, 2002.
[50]陈宇,董健全.非结构化P2P网络中的副本管理策略[J].计算机工程,2008,34(18):108-110.
[51]乔延华.无线移动Ad hoc网络路由协议的研究及NS-2仿真[D].天津:河北工业大学,2007.
[2] Gang Peng, Shanping Li, Hairong Jin, Tianchi Ma. M-CAN: A Lookup Protocol for Mobile Peer-to-Peer Environment[C]. Parallel Architectures, Algorithms and Network, 2004, 544-519.
[3] Scott Counts, Henri ter Hofte, Ian Smith. Mobile Social Software: Realizing Potential, Managing Risks [C]. Conference on Human Factors in Computing Systems, 2006, 1703-1707.
[4] Jeff Axup, Stephen Viller, Ian MacColl, Roslyn Cooper. Lo-Fi Matchmaking:A Study of Social pairing for Backpackers[C]. Proceeding of Ubiquitous Computing. 2006, 4206:351-368.
[5] Nathan Eagle, Ales Pentland. Social Serendipity: Mobilizing Social Software[C]. IEEE pervasive computing, 2005, 4(2):1536-1268.
[6] Sebastian Thrum. Simultaneous Localization and Mapping[C]. Robotics and Cognitive Approaches to Spatial Mapping, 2008, 38:13-41.
[7] Lars Erik Holmquist, Jennica Falk, Joakim Wigstrom. Supporting Group Collaboration with Interpersonal Awareness Devices[J]. Personal and Ubiquitous Computing, 1999, 3(2): 13-21.
[8] Joseph .F. McCarthy, David H. Nguyen, Al Mamunur Rashid, Suzanne Soroczak. Proactive Displays and the Experience UbiComp Project[C]. ACM: ACM Siggroup Bulletin, 2002, 23(3): 38-41.
[9] http://www.google.com/intl/en_us/latitude/intro.html.
[10] http://www.loopt.com/.
[11] Smith Ian. Social-Mobile Applications[C]. Computer, 2005, 38(4):84-87.
[12] Julian Bleecker. What’s Your Social Doing In My Mobile? Design Patterns for Mobile Social Software[C]. WWW2006 Workshop“MobEA lV-Empowering the Mobile Web”, 2006, 1-6.
[13]黄德群.移动学习研究对远程教育的影响[J].实践探索,2005,23:48-51.
[14] Tim de Jong, Marcus Specht, Rob Koper. A reference model for mobile social software for learning[J]. International Journal of Continuing Engineering Education and Lifelong Learning, 2008, 18(1):118-138.
[15]张树人.从社会性软件、Web2.0到复杂适应信息系统研究[D].北京:中国人民大学,2006.
[16]黄晔.基于Web2.0社会性标签与统计推荐系统的设计与实现[D].重庆:重庆大学,2006.
[17]懂坤坤,戴心来,陈恳.基于LMA软件的移动学习资源设计[J].现代教育技术,2009,19(1):76-78.
[18]王珍珍,杨雪,傅健.基于Flash Lite的移动学习资源开发研究[J].现代教育技术,2009,19(4):102-104.
[19] Ping Wang, Lidan Shou, Gang Chen, Jinxiang Dong. MIME: A Dynamic Index Scheme for Multi-dimensional Query in Mobile P2P Networks[C]. Advances in databases, 2007, 576-585.
[20] Dewan Tanvir Ahmed, Shervin Shirmohammadi. Multi-level Hashing for Peer-to-Peer System in WirelessAd Hoc Environment[C]. Proceeding of the Fifth Annual IEEE international Conference on Pervasive Computing and communications Workshops, 2007, 126-131.
[21] A. Liotta, M. Ballette, L. Lin, M. Gasparoni ,P. Brick, N. Papadoglous. Service-Driven Group Management for Mobile P2P Services[C]. Intelligence in Communication Systems, 2005, 190:221-230.
[22]程超.移动对等网络(MP2P)资源搜索策略研究[D].北京:北京交通大学,2009.
[23]卢炎生,许浒,潘鹏.约束的移动对象最近邻轨迹查询[J].华中科技大学学报(自然科学版), 2007,35(2):57-59.
[24]战学刚,郭建,迟呈英,周游.应用移动Agent加强JXTA网络的搜索功能[J].计算机工程与设计,2009,30(24):5622-5629.
[25] Stanley Milgram. The small world problem[J]. Psychology Today, 1967, 1(1):60-67.
[26]司徒峻峰.Internet的小世界网络研究[J].情报杂志,2004, 23(12):86-88
[27]徐敏,辛琳.由信息的时效性引发的移动博客思考[J].科技情报开发与经济,2008,18(31):159-160.
[28] Jin-hee Ko, Chihoon Hur, Hanil Kim. A Personalized Mobile Learning System Using Multi-agent[C].Web Information Systems Engineering-WISE 2005 Workshops, 2005, 3807:144-151.
[29] Jaekoo Song, Mingyun Kang, Seoksoo Kim. Study on Contents Protection in M-Learning Environment[C]. Computational Science and Its Applications-ICCSA, 2006, 3984: 575-583.
[30] Duncan J. Watts, Steven H. Strogatz. Collective dynamics of‘small-world’networks [J]. Nature, 1998, 393(6684):440-442.
[31]彭刚.MP2P环境中资源定位算法的研究[D].杭州:浙江大学,2005.
[32]庄雷.基于Gnutella协议的Peer-to-Peer网络研究及其协议验证[D].郑州:解放军信息工程大学,2004.
[33] Ian Clarke, Oskar Sandberg, Brandon Wiley, Theodore w.hong. Freenet: A distributed Anonymous Information Storage and Retrieval System[C]. Designing Privacy Enhancing Technologies, 2001, 2009: 46-44.
[34] Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger. Chord: A Scalable peer-to-peer Lookup Protocol for Internet Applications[C]. IEEE/ACM Transactions on Networking, 2003, 11(1): 17-32.
[35] Antony Rowstron, Peter Druschel. Pastry: Scalable, Decentralized object location and routing for large-scale peer-to-peer systems[C]. Middleware, 2001,2218: 329-350.
[36] Ben Yanbin Zhao, John David Kubiatowicz, Anthony Douglas Joseph. Tapestry: An infrastructure for wide-area fault-tolerant location and routing[R]. U.C. Berkeley Technical Report UCB/CSD-01-1141,2001.4.
[37] Steve Waterhouse. JXTA Search: Distributed search for distributed networks[R]. Technical report, Sun Microsystems Inc. 2001.
[38] Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker. Search and replication in Unstructured peer-to-peer networks[R]. Proceedings of the 16th ACM International Conference on Super computing(ACM ICS’02), 2002.
[39]卢国明.基于P2P的网络资源管理关键技术[D].成都:电子科技大学,2006.
[40] Bhuvan Urgaonkar, Anoop George Ninan, Mohammad Salimullah Raunak, Prashant Shenoy, KrithiRamamritham. Maintaining Mutual Consistency for Cached Web Objects[R]. In: proc. of the 21th Intl. Conf . on distributed Computing Systems(ICDCS),2001.
[41]黄宇.移动自组织环境下协作缓存一致性维护机制研究[D].安徽:中国科学技术大学,2007.
[42] Jiannong Cao, Yang Zhang, Li Xie. Consistency of cooperative Caching in Mobile Peer-to-Peer Systems over MANET[C]. International Journal of parallel, Emergent and Distributed Systems, 2006, 21(3):537-579.
[43]李天亮,石磊.一种有效的混合式P2P web缓存系统Hcache[J].计算机应用,2008,2(86):1478-1480.
[44] Nuggehalli P, Srinvivasan V, Chiasserini CF, Rao R. Efficient Cache Placement in Multi-Hop Wireless Networks[C]. IEEE/ACM Transactions on Networking , 2006, 14(5): 1045-1055.
[45] Junho Shim, Peter Scheuermann, Radek Vingralek. Proxy Cache Algorithms: Design, Implementation and Performance[C]. IEEE Transaction on Knowledge and Data Engineer, 1999, 11(4):549-562.
[46] Toshihiko Yamakami. Mobile Web 2.0: Lessons From Web 2.0 and past Mobile Internet Development[C]. Proceeding of the 2007 International Conference on Multimedia and Ubiquitous Engineering,2007, 886-890.
[47]汪小帆.复杂网络中的社团结构分析算法研究综述[J].复杂系统与复杂性科学,2005,2(3):1-12.
[48]王玲芳陈焱.P2P系统及其应用[M].北京:机械工业出版社,2008:343.
[49] Stefan Saroiu, P. Krishna. Gummadi, Steven.D. Gribbler. A measurement study of peer-to-peer File sharing systems[R]. Proceedings of Multimedia Computing and Networking 2002, 2002.
[50]陈宇,董健全.非结构化P2P网络中的副本管理策略[J].计算机工程,2008,34(18):108-110.
[51]乔延华.无线移动Ad hoc网络路由协议的研究及NS-2仿真[D].天津:河北工业大学,2007.