P2P网络拓扑结构研究
|
摘要
P2P网络是物理网络上的一层逻辑网络,因其具有非中心化、可扩展性、健壮性、高性价比和负载均衡等优点,广泛应用于分布式存储、计算能力共享、协同工作和即时通讯等领域。P2P网络拓扑结构是指P2P网络中各节点之间的逻辑关系,是改善P2P网络性能的基础,因此倍受研究人员的关注,一直都是P2P领域的研究热点。
论文以P2P网络拓扑结构作为研究主线,主要开展了以下几方面的研究工作:
分析了P2P网络拓扑结构的分类方法,对每类拓扑结构中具有代表性的P2P网络,从网络结构、路由方式和搜索效率等方面进行了说明和评述。同时探索了P2P网络性能评价的方法,对实验法中开放的互联网实验平台、分析法中常用的数学理论和形式化方法、仿真法中主要的P2P模拟器、拓扑生成器和可视化工具进行了介绍。
深入研究了层次化拓扑结构的P2P网络,探讨了层次化P2P网络体系结构、组建方式、路由机制和查询模式等,并通过对比说明层次化P2P网络的优势。基于层次化P2P网络模型,提出分裂合并模式的P2P网络拓扑构造方法,有效的提高了网络的路由效率,并利用扩展COU策略实现链接的被动维护,极大的降低了网络的维护开销。
针对现有P2P网络无法正确构造包含非传递连通节点的网络拓扑的问题,提出了非确定性DHT的拓扑构造方法,从拓扑构造上解除了非传递连通节点的标识与逻辑位置对应的关系,使网络对非传递连通节点具有较好的容忍能力。同时探讨了用于非确定性DHT网络的可靠路由和重定向路由机制,并利用重定向消息复制策略提高路由效率。
构建具有小世界特征的P2P网络拓扑结构,使P2P网络在随机选择链接的情况下,具有均匀的度数分布、较小的路径长度和较大的聚类系数。通过对小世界理论、特征、度量和构建方法的研究,提出了动态构造小世界P2P网络的方法,且能够通过参数调节网络的特征倾向。为了解除小世界P2P网络的维护开销与近端节点数量之间的线形比例关系,分析了维护开销的产生原因,提出利用双向控速令牌机制降低网络维护开销的方法,有效的减少了节点在加入、退出和失效处理等过程中产生的维护开销。
无线传感器网络和P2P网络有着很多的相似点,将P2P网络的节点信息交换思想引入无线传感器网络,很好的解决了传感器网络的负载均衡成簇问题。在分析传感器网络的成簇机制、能量模型、度量方法和以往的负载均衡算法后,提出了用于多级能量异构的无线传感器网络负载均衡成簇算法,算法极大的延长了网络的稳定周期,对需要可靠反馈的无线传感器网络应用具有非常重要的意义。
总之,论文对P2P网络的拓扑构造和维护方法进行了深入研究,将其用于解决P2P网络的非传递连通、路由效率和维护开销等问题,以及能量异构无线传感器网络的负载均衡成簇问题。
P2P network is a logic network on top of the physical network, which has the advantages of non-center, scalability, robustness, high performance/price ratio and load balancing, have widely used in distributed storage, computing power sharing, teamwork, instant communication and other fields. P2P network topology is the logic relationship between peers in P2P network, which is the basis of P2P network performance and has been conern by the researchers. P2P network topology is always the hotspot of the P2P field.
Based on P2P network topology as a main line of research, mainly in the following areas of study:
Analysis of the P2P network topology classification method and each of the topology of representative P2P networks are introduced and evaluated, from the network structure, routing methods and search efficiency. At the same time explore the performance evaluating method of the P2P network, and introduce the open Internet experiment platform in experimental method, the common mathematical and formal methods in analytical method, the primary P2P simulator, topology generation and visualization tools in simulant method.
Deeply study the P2P network of hierarchical topology, and discusses the hierarchical P2P networks architecture, construction method, routing mechanism and query model. In the contrast of other P2P network topology, the advantages of hierarchical P2P network are explained. Based on the hierarchical P2P network model, proposed a P2P network topology creation method of split and merge mode, effectively improve the efficiency of network routing, and use expanded COU strategy to achieve the links passive maintenance, greatly reducing the network maintenance cost.
The existing P2P network could not correctly construct topology which contains non-transitivity connectivity peers, proposed the topology constructing method of uncertainty DHT. The method rescinds the relationship between peer identifier and logical location in topology construction, so that the network has the good tolerance capability for the non-transitivity connectivity nodes. The dissertation discusses the reliable routing and redirects routing mechanisms for uncertainty DHT network, and use redirect message replication strategy to improve the routing efficiency.
Constructing the P2P network topology of a small world characteristics, make it possible that P2P network has uniformity degree distribution, smaller average path length and larger cluster coefficient in the condition of random links selection. Based on the research of small world theory, characteristics, measurement and construction methods, propose the methord of dynamic construction small world P2P network, and could adjust the network feature tendency by parameters. In order to rescind the linear relationship between the maintenance cost and proximal peer number in P2P network, analyse the generation reason of maintenance cost, and propose the two-way speed control token mechanism to reduce network maintenance costs approach, which effectively reduce the maintenance costs in the process of node join, leave and invalidation.
Wireless sensor networks and P2P networks have many similarities, bring the idear of peer information exchanging of P2P network to the wireless sensor networks, and will be satisfactorily resolved sensor network load balancing problem. Analysis of the clustering mechanism, energy model, measurement and previous load balancing methods of sensor networks, a load balancing clustering algorithms for multi-level energy heterogeneous wireless sensor network is proposed. The algorithm greatly extends the stability period of the network, and has very important significance for wireless sensor network applications which need reliable feedback.
In short, the dissertation deeply studies on topology constructing and maintenance methods of P2P network, and to solve non-transitivity connectivity, routing efficiency, maintenance costs in the P2P networks, and load balancing clustering problem in energy heterogeneous wireless sensor network.
论文以P2P网络拓扑结构作为研究主线,主要开展了以下几方面的研究工作:
分析了P2P网络拓扑结构的分类方法,对每类拓扑结构中具有代表性的P2P网络,从网络结构、路由方式和搜索效率等方面进行了说明和评述。同时探索了P2P网络性能评价的方法,对实验法中开放的互联网实验平台、分析法中常用的数学理论和形式化方法、仿真法中主要的P2P模拟器、拓扑生成器和可视化工具进行了介绍。
深入研究了层次化拓扑结构的P2P网络,探讨了层次化P2P网络体系结构、组建方式、路由机制和查询模式等,并通过对比说明层次化P2P网络的优势。基于层次化P2P网络模型,提出分裂合并模式的P2P网络拓扑构造方法,有效的提高了网络的路由效率,并利用扩展COU策略实现链接的被动维护,极大的降低了网络的维护开销。
针对现有P2P网络无法正确构造包含非传递连通节点的网络拓扑的问题,提出了非确定性DHT的拓扑构造方法,从拓扑构造上解除了非传递连通节点的标识与逻辑位置对应的关系,使网络对非传递连通节点具有较好的容忍能力。同时探讨了用于非确定性DHT网络的可靠路由和重定向路由机制,并利用重定向消息复制策略提高路由效率。
构建具有小世界特征的P2P网络拓扑结构,使P2P网络在随机选择链接的情况下,具有均匀的度数分布、较小的路径长度和较大的聚类系数。通过对小世界理论、特征、度量和构建方法的研究,提出了动态构造小世界P2P网络的方法,且能够通过参数调节网络的特征倾向。为了解除小世界P2P网络的维护开销与近端节点数量之间的线形比例关系,分析了维护开销的产生原因,提出利用双向控速令牌机制降低网络维护开销的方法,有效的减少了节点在加入、退出和失效处理等过程中产生的维护开销。
无线传感器网络和P2P网络有着很多的相似点,将P2P网络的节点信息交换思想引入无线传感器网络,很好的解决了传感器网络的负载均衡成簇问题。在分析传感器网络的成簇机制、能量模型、度量方法和以往的负载均衡算法后,提出了用于多级能量异构的无线传感器网络负载均衡成簇算法,算法极大的延长了网络的稳定周期,对需要可靠反馈的无线传感器网络应用具有非常重要的意义。
总之,论文对P2P网络的拓扑构造和维护方法进行了深入研究,将其用于解决P2P网络的非传递连通、路由效率和维护开销等问题,以及能量异构无线传感器网络的负载均衡成簇问题。
P2P network is a logic network on top of the physical network, which has the advantages of non-center, scalability, robustness, high performance/price ratio and load balancing, have widely used in distributed storage, computing power sharing, teamwork, instant communication and other fields. P2P network topology is the logic relationship between peers in P2P network, which is the basis of P2P network performance and has been conern by the researchers. P2P network topology is always the hotspot of the P2P field.
Based on P2P network topology as a main line of research, mainly in the following areas of study:
Analysis of the P2P network topology classification method and each of the topology of representative P2P networks are introduced and evaluated, from the network structure, routing methods and search efficiency. At the same time explore the performance evaluating method of the P2P network, and introduce the open Internet experiment platform in experimental method, the common mathematical and formal methods in analytical method, the primary P2P simulator, topology generation and visualization tools in simulant method.
Deeply study the P2P network of hierarchical topology, and discusses the hierarchical P2P networks architecture, construction method, routing mechanism and query model. In the contrast of other P2P network topology, the advantages of hierarchical P2P network are explained. Based on the hierarchical P2P network model, proposed a P2P network topology creation method of split and merge mode, effectively improve the efficiency of network routing, and use expanded COU strategy to achieve the links passive maintenance, greatly reducing the network maintenance cost.
The existing P2P network could not correctly construct topology which contains non-transitivity connectivity peers, proposed the topology constructing method of uncertainty DHT. The method rescinds the relationship between peer identifier and logical location in topology construction, so that the network has the good tolerance capability for the non-transitivity connectivity nodes. The dissertation discusses the reliable routing and redirects routing mechanisms for uncertainty DHT network, and use redirect message replication strategy to improve the routing efficiency.
Constructing the P2P network topology of a small world characteristics, make it possible that P2P network has uniformity degree distribution, smaller average path length and larger cluster coefficient in the condition of random links selection. Based on the research of small world theory, characteristics, measurement and construction methods, propose the methord of dynamic construction small world P2P network, and could adjust the network feature tendency by parameters. In order to rescind the linear relationship between the maintenance cost and proximal peer number in P2P network, analyse the generation reason of maintenance cost, and propose the two-way speed control token mechanism to reduce network maintenance costs approach, which effectively reduce the maintenance costs in the process of node join, leave and invalidation.
Wireless sensor networks and P2P networks have many similarities, bring the idear of peer information exchanging of P2P network to the wireless sensor networks, and will be satisfactorily resolved sensor network load balancing problem. Analysis of the clustering mechanism, energy model, measurement and previous load balancing methods of sensor networks, a load balancing clustering algorithms for multi-level energy heterogeneous wireless sensor network is proposed. The algorithm greatly extends the stability period of the network, and has very important significance for wireless sensor network applications which need reliable feedback.
In short, the dissertation deeply studies on topology constructing and maintenance methods of P2P network, and to solve non-transitivity connectivity, routing efficiency, maintenance costs in the P2P networks, and load balancing clustering problem in energy heterogeneous wireless sensor network.
引文
[1]Leibowitz N,Ripeanu M,Wierzbicki A.Deconstructing the Kazaa Network.In Proc.of the Third IEEE Workshop on Intemet Applications WIAPP '03,2003
[2]Yang B,Garcia-Molina H.Designing a Super-peer Network.In Proc.of the Nineteenth International Conference on Data Engineering,IEEE Computer Society,2003:49-60P
[3]Napster.http://computer.howstuffworks.com/napster2.htm.
[4]Aimster.http://computer.howstuffworks.com/question587.htm
[5]Bolcer G A.Magi:An Architecture for Mobile and Disconnected Workflow.IEEE Internet Computing.2000,4(3):46-54P
[6]SoftWax.http://www.softwax.com/
[7]iMesh,http://www.imesh.com/
[8]Ganesh J A,Kermarrec A M,Massoulie L.Peer-to-Peer Membership Management for Gossip-Based Protocols.IEEE Transactions on Computers.2003,52(2):139-149P
[9]Clarke I,Sandberg O,Wiley,et al.Freenet:A Distributed Anonymous Information Storage and Retrieval System.In Proc.of Designing Privacy Enhancing Technologies:International Workshop on Design Issues in Anonymity and Unobservability,2001
[10]罗绪成,刘峤.RNP2P—一种基于复本网络的非结构化P2P系统.计算机应用.2007,27(8):1381-1388P
[11]曾碧卿,吕西红,陈志刚.OHQFS:一种非结构化P2P网络中数据查询搜索新策略.小型微型计算机系统.2007,28(9):1572-1578P
[12]Plaxton C C,Rajaraman R,Richa A W.Accessing Nearby Copies of Replicated Objects in a Distributed Environment.In Proc.of ACM Symposium on Parallel Algorithms and Architectures,1997
[13]Zhao B Y,Kubiatowicz J,Joseph A D.Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report No.UCB/CSD-01-1141, University of California Berkeley,2001
[14] Rowstron A, Druschel P. Pastry: Scalable, Decentralized Object Location and Routing for Large-scale Peer-to-peer Systems. In Proc. of IFIP/ACM International Conference on Distributed Systems Platforms,2001
[15] Stoica I, Morris R, Karger D, et al. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proc. of the 2001 Conference on Applications Technologies Architectures and Protocols for Computer Communications (SigComm). New York:ACM Press, 2001:149-160
[16] Manku G S, Bawa M, Raghavan P. Symphony: Distributed Hashing in a Small Wold. In Proc. of the 4th USENIX Symposium on Internet Technologies and Systems (USITS), 2003
[17] Ratnasamy S, Francis P, Handley M, et al. A Scalable Content-Addressable Network. In Proc. of ACM STGCOMM2001,USA, 2001
[18] Xu Z, Zhang Z. Building Low-maintenance Expressways for P2P systems.Technical report, Hewlett-Packard Labs: Palo Alto, 2001
[19] Maymounkov P, Mazieres D. Kademlia: A Peer-topeer Information System Based on the XOR Metric. In Proc. of IPTPS, 2002
[20] Malkhi D, Naor M, Ratajczak D. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proc. of Principles of Distributed Computing,2002:183-192P
[21] Fiat A, Saia J. Censorship Resistant Peer-to-Peer Content Addressable Networks. In Proc. of the 13rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002
[22] Saia J, Fiat A, Gribble S, et al. Dynamically Fault-Tolerant Content Addressable Networks. In Proc. of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), 2002
[23] Xu J, Kumar A, Yu X. On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks. IEEE Journal on Selected Areas in Communications. 2004,22(1):151-163P
[24] Law C, Siu K Y. Distributed Construction of Random Expander Graphs. In Proc. of IEEE Conference on Computer Communications (INFOCOM),2003.
[25] Aspnes J, Diamadi Z, Shah G. Fault-Tolerant Routing in Peer-to-Peer Systems. In Proc. of Twenty-First ACM Symposium on Principles of Distributed Computing, 2002:223-232P
[26] Fraigniaud P, Gauron P. An Overview of the Content-addressable Network D2B. In Proc. of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), 2003
[27] Kaashoek M F, Karger R. Koorde: A Simple Degree-optimal Distributed Hash table. In Proc. of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003
[28] Naor M, Mieder U. Novel Architectures for P2P Applications: the Continuous-Discrete Approach. In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2003
[29] Ganesan P, Sun S, Garcia-Molina H. YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology. In Proc. of IEEE Conference on Computer Communications (INFOCOM), 2003
[30] Ganesan P, Gummadi K, Garcia-Molina H. Canon in G Major: Designing DHTs with Hierarchical Structure. In Proc. of the Twenty-Fourth International Conference on Distributed Computing Systems,2004:263-272P
[31] Kermarrec A M, Massoulie L, Ganesh A J. Probabilistic Reliable Dissemination in Large-scale Systems. IEEE Transactions on Parallel and Distributed Systems. 2003, 14(3): 248-258P
[32] Zhang X Y, Zhang Q, Zhang Z, et al. A Construction of Locality-aware Overlay Network: mOverlay and its Performance. IEEE Journal on Selected Areas in Communications. 2004, 22(1): 18-28P
[33]Garces-Erice L,Biersack E W,Felber P A,et al.Hierarchical Peer-to-peer Systems.In Proc.of ACM/IFIP International Conference on Parallel and Distributed Computing,2003
[34]Castro M,Druschel P,Hu Y C,et al.Exploiting Network Proximity in Peer-to-peer Overlay Networks.Technich Report MSR-TR-2002-82,2002
[35]Zhao B Y,Duan Y,Huang L,et al.Brocade:Landmark Routing on Overlay Networks.In Proc.of IPTPS,2002
[36]Xu Z,Mahalingam M,Karlsson M,Turning Heterogeneity into an Advantage in Overlay Routing.In Proc.of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies,2003.
[37]Tian R,Xiong Y,Zhang Q,et al.Hybrid Overlay Structure Based on Random Walks.In Proc.of the Fourth International Workshop on Peer-to-Peer Systems,2005.3640:152-162P
[38]Mizrak A T,Cheng Y,Kumar V,et al.Structured Superpeers:Leveraging Heterogeneity to Provide Constanttime Lookup.In Proc.of the Third IEEE Workshop on Internet Applications,2003.IEEE Computer Society:104-111P
[39]陈东锋,杨寿保,彭小燕.TaChord:利用拓扑相关路由算法和超级节点的Chord系统.东南大学学报(英文版).2004,20(3):273-278页
[40]廖小伟,王敏,SE晓国.一种基于超级节点的半分布式P2P系统改进策略.计算机应用与软件.2007,24(11):139-141页
[41]高田,刘方爱.一种含超级节点的P2P模型在数据复制中的应用.山东科学.2007,20(5):57-60页
[42]PlanetLab.http://www.planet-lab.org
[43]曹佳,张国清,鲁士文.非结构的P2P网络拓扑模型.计算机工程与应用.2006,5:23-25页
[44]丁强,徐恪.Globe:低延时可扩展的P2P网络拓扑框架.计算机工程与应用.2006,26:123-128页
[45]Dmitri L,Anuj K,Vivek R,et al.Graph-theoretic Analysis of Structured Peer-to-peer Systems:Routing Distances and Fault Resilience.In Proc.of ACM SIGCOMM. Karlsruhe: ACM Press, 2003: 395-406
[46] Bellettini C, Capra L, Monga M. A Comparative Assessment of Peer-to-peer and Server-based Configuration Management Systems. In Proc. of the Workshop on Cooperative Support for Distributed Software Engineering Processes (CSSE'04), 2004:15-26页
[47] Klein M, Bar-Yam Y. Handling Emergent Dysfunctions in Open Peer-to-Peer Systems. Massachusetts Institute of Technology, 2001
[48] Bakhshi R, Gurov D. Verification of Peer-to-peer Algorithms: A Case Study. Electronic Notes in Theoretical Computer Science. 2007,181:35-47
[49] Guili T J, Barker M. Narses: A Scalable Flow Based Network Simulator.Technical Report cs.PF/0211024. California: Computer Science Department, Stanford University, 2002
[50] NeuroGrid. http://www.neurogridnet
[51] Peersim Simulator Home Page. http://sourceforge.net/projects/ peersim/
[52] P2PSim: a Simulator for Peer-to-peer Protocols. http://pdos.csail.mit.edu/p2psim/
[53] PlanetSim: an Overlay nNetwork Simulation Framework.http://planet.urv.es/planetsim/
[54] Overlay Weaver. http://overlayweaver.sourceforge.net/
[55] Jared Winick, Sugih Jamin. Inet-3.0: Internet topology generator[R]. Ann Arbor: University of Michigan, 2002
[56] Damien Magoni. nem: A Software for Network Topology Analysis and Modeling: Proceedings of the MASCOTS, 2000. Washington: IEEE Computer Society, 2002: 364-371P
[57] K Calvert, J Eagan, S Merugu, et al. Extending and enhancing GT-ITM:Proceedings of the ACM SIGCOMM, 2003. New York: ACM Press,2003:23-27P
[58] Medina A, Lakhina A, Matta I, et al. BRITE: An approach to universal topology generation: Proceedings of the MASCOTS, 2001. Washington:IEEE Computer Society, 2001: 346-353P
[59] AiSee Site. http://www.aisee.com/
[60] Otter Site. http://www.caida.org/tools/visualization/otter/
[61] Dabek F, Li J, Sit E, et al. Designing a DHT for Low Latency and High Throughput. In Proc. of NSDI, 2004
[62] Rhea S, Chun B G, Kubiatowicz J, et al. Fixing the Embarrassing Slowness of OpenDHT on PlanetLab. In Proc. of WORLDS, 2005
[63] Gu X, Nahrstedt K, Yu B. et al. An Integrated Peer-to-peer Service Composition Framework. In Proc. of the Int'l Symp. on High-Performance Distributed Computing (HPDC-13). 2004:110-119P
[64] Alima L, El-AnsaryS, Brand P, et al. DKS(N,k,f): a Family of Low Communication Scalable and Fault-tolerant Infrastructures for P2P Applications. In Proc. of 3rd IEEE/ACM Int'l Symposium on Cluster Computing and the Grid. 2003: 344-350P
[65] PlanetLab All-Pairs Pings, http://pdos.lcs.mit. edu/~strib/pl_app/
[66] Neel D. Cogent Level 3 in Standoff over Internet Access.http://www.crn.com/nerworking/171204130
[67] Dedinski I, Berl A, Hofmann A,et al. A Source Routing Solution to Non-Transistive Connectivity problems in Distributed Hash Tables. In Proc. of IEEE Symposium on Computers and Communications, 2007
[68] Gerding S, Stribling J. Examining the Tradeoffs of Structured Overlays in a Dynamic Non-transitive Network.http://pdos.csail.mit.edu/～strib/docs/projects/networkingfall2003.pdf
[69] Freedman M J, Lakshminarayanan K, Rhea S,et al. Non-transitive Connectivity and DHTs. In Proc. of USENIX WORLDS. 2005:55-60P
[70] Dabek F, Cox R, Kaahoek F, et al . Vivaldi: A Decentralized Network Coordinate System. In Proc. of SIGCOMM, 2004
[71] Rhea S, Geels D, Roscoe T, et al. Handling Churn in a DHT. In Proc. of USENIX Annual Tech. Conference, 2004
[72]Castro M,Costa M,Rowstron A.Performance and Dependability of Structured Peer-to-peer Overlays.Technical Report MSR-TR-2003-94,2003
[73]Muthitacharoen A,Gilbert S,Morris R.Etna:A Fault-tolerant Algorithm for Atomic Mutable DHT Data.Technical Report MIT-LCS-TR-993,2005
[74]Rodrigues R,Liskov B.Rosebud:A Scalable Byzantine-fault-tolerant Storage Architecture.Technical Report TR/932,MIT CSAIL,2003
[75]Cates J.Robust and Efficient Data Management for a Distributed Hash Table.Massachusetts Institute of Technology,2003
[76]Rhea S.OpenDHT:A Public DHT Service.PhD thesis,U.C.Berkeley,2005
[77]Paxson V.Measurements and Analysis of End-to-End Internet Dynamics.PhD thesis,U.C.Berkeley,1997
[78]Andersen D,Balakrishnan H,Kaashoek F,et al.Resilient Overlay Networks.In Proc.of SOSP,2001
[79]Gummadi K P,Madhyastha H V,Gribble S D,et al.Improving the Reliability of Internet Paths With One-hop Source Routing.In Proc.of OSDI,2002
[80]FreePastry Release Notes.http://freepastry.org/Free Pastry/README-2.0b.html
[81]Joung Y J,Wang J C.Chord2:A Two-layer Chord for Reducing Maintenance Overhead via Heterogeneity.Computer Networks,2007,51(3):712-731P
[82]Armstrong J,Virding R,Wikstr"om C,et al.Concurrent Programming in Erlang.Prentice Hall,2nd edition,1996
[83]Fredlund L A.Framework for Reasoning about Erlang Code.PhD thesis,Royal Institute of Technology,Kista,Sweden,2001
[84]Milgram S.The Small World Problem.Psychol Today.1967,2:60-67P
[85]Watts D J,Strogatz S H.Collective Dynamics of Small-world Networks.Nature.1998,393(4):440-442P
[86]Barrat A,Weight M.On the Properties of Small-world Network Models.The European Physical Journal.2000,13(3):547-560P
[87]Watts D.Small-Worlds:The Dynamics of Networks between Order and Randomness.Princeton University Press.1999,107(7):664-668P
[88]Comellas F,Mitjana M.Broadcasting in Small-world Communication Networks.Proc.of 9th Structure of Information Networks,2000
[89]Kleinberg J.Navigation in a Small-world.Nature.2000,406(8)
[90]Kleinberg J.The Small-world Phenomenon:an Algorithmic Perspective.Cornell Computer Science Technical Report.2000
[91]汤大权,贺明科,孟庆崧.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究.计算机研究与发展.2007,44(9):1566-1571
[92]周晋,路海明,李衍达.用Small-World设计无组织P2P系统的路由算法.软件学报.2004,15(6):915-923页
[93]Zhang H,Goel A,Govindan R.Using the Small-world Model to Improve Freenet Performance.In Proc.of IEEE Infocom,2002
[94]Shashidhar S S,Zegura E.Adding Structure to Unstructured Peer-to-peer Networks:the Use of Small-world Graphs.Parallel Distributed Compute.2005,65(2):142-153P
[95]Hui Y K K,Lui J C S,Yau D K Y.Small-world Overlay P2P Networks:Construction Management and Handling of Dynamic Flash Crowds.Computer Networks.2006,50:2727-2746P
[96]李玲娟,姬同亮,王汝传.小世界现象在P2P网络中的应用研究.南京邮电大学学报(自然科学版).2006,26(4):86-89页
[97]朱晓姝,周娅,黄桂敏.基于小世界层次分布式路由模型研究,计算机工程.2005,32(15):120-122页
[98]冯国富,毛莺池,陆桑璐等.SWAPS:一种基于Small World的文件搜索算法.计算机研究与发展.2006,43(3):395-401页
[99]李伟荣,吴国新,李建飞.Small-World在对等网络中的应用研究.计算机工程与应用.2006,06:158-161页
[100]吕锋,柴洁.基于小世界模型和对等代理的副本定位模型.武汉理工大 学学报.2007,29(7):130-132页
[101]周晋,李衍达.基于Small-World网络的非结构化DHT算法.计算机研究与发展.2005,42(1):109-117页
[102]Newman M E J,Watts D J.Scaling and Percolation in the Small-world Metwork Model.Physical Review.1999,60(6):7332-7342P
[103]Ozik J,Hunt B R,Ott E.Growing Networks with Geographical Attachment Preference:Emergence of Small Worlds.Physical Review.2004,69(2):1081-1085
[104]Zhang Z,Zhou S,Shen Z,et al.Form Regular to Growing Small-world Networks.Physical Review.2007,385:765-772P
[105]Kunzrnann G,Nagel R,Eberspacher J.Increasing the Reliability of Structured P2P Networks.Design of Reliable Communication Networks.2005:489-495P
[106]Akyildiz I F,Su W,Sankarasubramaniam Y,et al.A Survey on Sensor Networks.IEEE Communications Magazine.2002,40(8):102-114P
[107]Szewczyk R,Osterweil E,Polastre J,et al.Habitat Monitoring with Sensor Networks.Communications of the ACM.2004,47(6):34-40P
[108]Butler Z,Corke P,Peterson R,et al.Network Cows:Virtual Fences for Controlling Cows.In Proc.of WAMES,Boston,2004
[109]Schwiebert L,Gupta S K S,Weinmann J.Research Challenges in Wireless Networks of Biomedical Sensors.In Proc.of 7th Annual International Conference on Mobile Computing and Networking.Rome:ACM Press,2001:151-165P
[110]Meyer S,Rakomonirainy A.A Survey of Research on Context-aware Homes.In Proc.of Workshop on Wearable,Invisible,Context-Aware.Australia:Australian Computer Society,2003
[111]Wemer-Allen,Johnson J,Ruiz M,et al..Monitoring Volcanic Eruptions with a Wireless Sensor Network.In Proc of European Workshop on Senson Network,2005:108-120P
[112]Heinzelman W R,Chandrakasan A P,Balakrishnan H.Energy-Efficient Communication Protocol for Wireless Microsensor Networks.In Proc.of the 33rd HICSS,2000:3005-3014
[113]沈波,张世永,钟亦平.无线传感器网络分簇路由协议.软件学报.2006,17(7):1588-1600页
[114]Heinzelman W,Chandrakasan A,Balakrishnan H.An Application-specific Protocol Architecture for Wireless Microsensor Networks.Wireless Communication.2002,1(4):660-670P
[115]Smaragdakis G,Matta I,Bestavros A.SEP:A Stable Election Protocol for Clustered Heterogeneous Wireless Sensor Networks.In Porc.of the Int' 1Workshop on SANPA 2004.2004
[116]Mhatre V,Rosenberg C.Design Guidelines for Wireless Sensor Networks:Communication Clustering and Gggregation.Ad Hoe Network Journal.2004,2(1):45-63
[117]Ye M,Li C,Chen G,et al.EECS:An Energy Efficient Cluster Scheme in Wireless Sensor Networks.In Proc.of the IEEE IPCCC 2005.New York:IEEE Press,2005:535-540P
[118]Depedri A,Zanella A,Verdone R.An Energy Efficient Protocol for Wireless Sensor Networks.In Proc.of the AINS 2003.Menlo Park,2003:1-6P
[119]Lindsey S,Raghavendra C S.PEGASIS:Power-efficient Gathering in Sensor Information Systems.In Proc.of the IEEE Aerospace Conference.Montana:IEEE Aerospace and Electronic Systems Society,2002:1125-1130
[120]Manjeshwar A,Agrawal D P.TEEN:A Protocol for Enhanced Efficiency in Wireless Sensor Networks.In Proc.of the 15th Parallel and Distributed Processing Symposium.San Francisco:IEEE Computer Society,2001:2009-2015P
[121]卿利,朱清新,王明文.异构传感器网络的分布式能量有效成簇算法.软件学报.2006,17(3):481-489页
[122]Younis O, Fahmy S. Heed: A Hybrid, Energy-efficient, Distributed Clustering Approach for Ad-hoc Sensor Networks. On Mobile Computing.2004, 3(4):366-379P
[123] Vijay R, Kansal A, Hsu J, et al. Design Considerations for Solar Energy Harvesting Wireless Embedded Systems. In Proc. of 2005 Fourth International Symposium on Information Processing in Sensor Networks,2005:457-462P
[124]Aman K, Dunny P, Mani B S. Performance Aware Tasking for Environmentally Powered Sensor Networks. Performance Evaluation Review. 2004, 32(1):223-34P
[125]Mhatre V P, Rosenberg C, Kofman D, et al. A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint. Mobile Computing. 2005,4(1): 4-15P
[126]Du X J, Lin F J. Improving Routing in Sensor Networks with Heterogeneous Sensor nodes. In Proc. of Vehicular Technology Conference 2005. IEEE Press, 2005:2528-2532P
[127] Zhang Z H, Ma M, Yang Y Y. Energy Efficient Multi-hop Polling in Clusters of Two-layered Heterogeneous Sensor Networks. In Proc. of Parallel and Distributed Processing Symposium. IEEE Press, 2005:81-83P
[128]Mhatre V, Rosenberg C. Homogeneous vs. Heterogeneous Clustered Sensor Networks: A Comparative Study. In Proc. of 2004 IEEE International Conference on Communications, 2004
[129] Doshi S, Bhandare S, Brown T. An On-demand Minimum Energy Routing Protocol for a Wireless Ad-hoc Network. ACM SIGMOBILE Mobile Computing and Communications Review. 2002, 6(3):50-66P
[2]Yang B,Garcia-Molina H.Designing a Super-peer Network.In Proc.of the Nineteenth International Conference on Data Engineering,IEEE Computer Society,2003:49-60P
[3]Napster.http://computer.howstuffworks.com/napster2.htm.
[4]Aimster.http://computer.howstuffworks.com/question587.htm
[5]Bolcer G A.Magi:An Architecture for Mobile and Disconnected Workflow.IEEE Internet Computing.2000,4(3):46-54P
[6]SoftWax.http://www.softwax.com/
[7]iMesh,http://www.imesh.com/
[8]Ganesh J A,Kermarrec A M,Massoulie L.Peer-to-Peer Membership Management for Gossip-Based Protocols.IEEE Transactions on Computers.2003,52(2):139-149P
[9]Clarke I,Sandberg O,Wiley,et al.Freenet:A Distributed Anonymous Information Storage and Retrieval System.In Proc.of Designing Privacy Enhancing Technologies:International Workshop on Design Issues in Anonymity and Unobservability,2001
[10]罗绪成,刘峤.RNP2P—一种基于复本网络的非结构化P2P系统.计算机应用.2007,27(8):1381-1388P
[11]曾碧卿,吕西红,陈志刚.OHQFS:一种非结构化P2P网络中数据查询搜索新策略.小型微型计算机系统.2007,28(9):1572-1578P
[12]Plaxton C C,Rajaraman R,Richa A W.Accessing Nearby Copies of Replicated Objects in a Distributed Environment.In Proc.of ACM Symposium on Parallel Algorithms and Architectures,1997
[13]Zhao B Y,Kubiatowicz J,Joseph A D.Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report No.UCB/CSD-01-1141, University of California Berkeley,2001
[14] Rowstron A, Druschel P. Pastry: Scalable, Decentralized Object Location and Routing for Large-scale Peer-to-peer Systems. In Proc. of IFIP/ACM International Conference on Distributed Systems Platforms,2001
[15] Stoica I, Morris R, Karger D, et al. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proc. of the 2001 Conference on Applications Technologies Architectures and Protocols for Computer Communications (SigComm). New York:ACM Press, 2001:149-160
[16] Manku G S, Bawa M, Raghavan P. Symphony: Distributed Hashing in a Small Wold. In Proc. of the 4th USENIX Symposium on Internet Technologies and Systems (USITS), 2003
[17] Ratnasamy S, Francis P, Handley M, et al. A Scalable Content-Addressable Network. In Proc. of ACM STGCOMM2001,USA, 2001
[18] Xu Z, Zhang Z. Building Low-maintenance Expressways for P2P systems.Technical report, Hewlett-Packard Labs: Palo Alto, 2001
[19] Maymounkov P, Mazieres D. Kademlia: A Peer-topeer Information System Based on the XOR Metric. In Proc. of IPTPS, 2002
[20] Malkhi D, Naor M, Ratajczak D. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proc. of Principles of Distributed Computing,2002:183-192P
[21] Fiat A, Saia J. Censorship Resistant Peer-to-Peer Content Addressable Networks. In Proc. of the 13rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002
[22] Saia J, Fiat A, Gribble S, et al. Dynamically Fault-Tolerant Content Addressable Networks. In Proc. of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), 2002
[23] Xu J, Kumar A, Yu X. On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks. IEEE Journal on Selected Areas in Communications. 2004,22(1):151-163P
[24] Law C, Siu K Y. Distributed Construction of Random Expander Graphs. In Proc. of IEEE Conference on Computer Communications (INFOCOM),2003.
[25] Aspnes J, Diamadi Z, Shah G. Fault-Tolerant Routing in Peer-to-Peer Systems. In Proc. of Twenty-First ACM Symposium on Principles of Distributed Computing, 2002:223-232P
[26] Fraigniaud P, Gauron P. An Overview of the Content-addressable Network D2B. In Proc. of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), 2003
[27] Kaashoek M F, Karger R. Koorde: A Simple Degree-optimal Distributed Hash table. In Proc. of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003
[28] Naor M, Mieder U. Novel Architectures for P2P Applications: the Continuous-Discrete Approach. In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2003
[29] Ganesan P, Sun S, Garcia-Molina H. YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology. In Proc. of IEEE Conference on Computer Communications (INFOCOM), 2003
[30] Ganesan P, Gummadi K, Garcia-Molina H. Canon in G Major: Designing DHTs with Hierarchical Structure. In Proc. of the Twenty-Fourth International Conference on Distributed Computing Systems,2004:263-272P
[31] Kermarrec A M, Massoulie L, Ganesh A J. Probabilistic Reliable Dissemination in Large-scale Systems. IEEE Transactions on Parallel and Distributed Systems. 2003, 14(3): 248-258P
[32] Zhang X Y, Zhang Q, Zhang Z, et al. A Construction of Locality-aware Overlay Network: mOverlay and its Performance. IEEE Journal on Selected Areas in Communications. 2004, 22(1): 18-28P
[33]Garces-Erice L,Biersack E W,Felber P A,et al.Hierarchical Peer-to-peer Systems.In Proc.of ACM/IFIP International Conference on Parallel and Distributed Computing,2003
[34]Castro M,Druschel P,Hu Y C,et al.Exploiting Network Proximity in Peer-to-peer Overlay Networks.Technich Report MSR-TR-2002-82,2002
[35]Zhao B Y,Duan Y,Huang L,et al.Brocade:Landmark Routing on Overlay Networks.In Proc.of IPTPS,2002
[36]Xu Z,Mahalingam M,Karlsson M,Turning Heterogeneity into an Advantage in Overlay Routing.In Proc.of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies,2003.
[37]Tian R,Xiong Y,Zhang Q,et al.Hybrid Overlay Structure Based on Random Walks.In Proc.of the Fourth International Workshop on Peer-to-Peer Systems,2005.3640:152-162P
[38]Mizrak A T,Cheng Y,Kumar V,et al.Structured Superpeers:Leveraging Heterogeneity to Provide Constanttime Lookup.In Proc.of the Third IEEE Workshop on Internet Applications,2003.IEEE Computer Society:104-111P
[39]陈东锋,杨寿保,彭小燕.TaChord:利用拓扑相关路由算法和超级节点的Chord系统.东南大学学报(英文版).2004,20(3):273-278页
[40]廖小伟,王敏,SE晓国.一种基于超级节点的半分布式P2P系统改进策略.计算机应用与软件.2007,24(11):139-141页
[41]高田,刘方爱.一种含超级节点的P2P模型在数据复制中的应用.山东科学.2007,20(5):57-60页
[42]PlanetLab.http://www.planet-lab.org
[43]曹佳,张国清,鲁士文.非结构的P2P网络拓扑模型.计算机工程与应用.2006,5:23-25页
[44]丁强,徐恪.Globe:低延时可扩展的P2P网络拓扑框架.计算机工程与应用.2006,26:123-128页
[45]Dmitri L,Anuj K,Vivek R,et al.Graph-theoretic Analysis of Structured Peer-to-peer Systems:Routing Distances and Fault Resilience.In Proc.of ACM SIGCOMM. Karlsruhe: ACM Press, 2003: 395-406
[46] Bellettini C, Capra L, Monga M. A Comparative Assessment of Peer-to-peer and Server-based Configuration Management Systems. In Proc. of the Workshop on Cooperative Support for Distributed Software Engineering Processes (CSSE'04), 2004:15-26页
[47] Klein M, Bar-Yam Y. Handling Emergent Dysfunctions in Open Peer-to-Peer Systems. Massachusetts Institute of Technology, 2001
[48] Bakhshi R, Gurov D. Verification of Peer-to-peer Algorithms: A Case Study. Electronic Notes in Theoretical Computer Science. 2007,181:35-47
[49] Guili T J, Barker M. Narses: A Scalable Flow Based Network Simulator.Technical Report cs.PF/0211024. California: Computer Science Department, Stanford University, 2002
[50] NeuroGrid. http://www.neurogridnet
[51] Peersim Simulator Home Page. http://sourceforge.net/projects/ peersim/
[52] P2PSim: a Simulator for Peer-to-peer Protocols. http://pdos.csail.mit.edu/p2psim/
[53] PlanetSim: an Overlay nNetwork Simulation Framework.http://planet.urv.es/planetsim/
[54] Overlay Weaver. http://overlayweaver.sourceforge.net/
[55] Jared Winick, Sugih Jamin. Inet-3.0: Internet topology generator[R]. Ann Arbor: University of Michigan, 2002
[56] Damien Magoni. nem: A Software for Network Topology Analysis and Modeling: Proceedings of the MASCOTS, 2000. Washington: IEEE Computer Society, 2002: 364-371P
[57] K Calvert, J Eagan, S Merugu, et al. Extending and enhancing GT-ITM:Proceedings of the ACM SIGCOMM, 2003. New York: ACM Press,2003:23-27P
[58] Medina A, Lakhina A, Matta I, et al. BRITE: An approach to universal topology generation: Proceedings of the MASCOTS, 2001. Washington:IEEE Computer Society, 2001: 346-353P
[59] AiSee Site. http://www.aisee.com/
[60] Otter Site. http://www.caida.org/tools/visualization/otter/
[61] Dabek F, Li J, Sit E, et al. Designing a DHT for Low Latency and High Throughput. In Proc. of NSDI, 2004
[62] Rhea S, Chun B G, Kubiatowicz J, et al. Fixing the Embarrassing Slowness of OpenDHT on PlanetLab. In Proc. of WORLDS, 2005
[63] Gu X, Nahrstedt K, Yu B. et al. An Integrated Peer-to-peer Service Composition Framework. In Proc. of the Int'l Symp. on High-Performance Distributed Computing (HPDC-13). 2004:110-119P
[64] Alima L, El-AnsaryS, Brand P, et al. DKS(N,k,f): a Family of Low Communication Scalable and Fault-tolerant Infrastructures for P2P Applications. In Proc. of 3rd IEEE/ACM Int'l Symposium on Cluster Computing and the Grid. 2003: 344-350P
[65] PlanetLab All-Pairs Pings, http://pdos.lcs.mit. edu/~strib/pl_app/
[66] Neel D. Cogent Level 3 in Standoff over Internet Access.http://www.crn.com/nerworking/171204130
[67] Dedinski I, Berl A, Hofmann A,et al. A Source Routing Solution to Non-Transistive Connectivity problems in Distributed Hash Tables. In Proc. of IEEE Symposium on Computers and Communications, 2007
[68] Gerding S, Stribling J. Examining the Tradeoffs of Structured Overlays in a Dynamic Non-transitive Network.http://pdos.csail.mit.edu/～strib/docs/projects/networkingfall2003.pdf
[69] Freedman M J, Lakshminarayanan K, Rhea S,et al. Non-transitive Connectivity and DHTs. In Proc. of USENIX WORLDS. 2005:55-60P
[70] Dabek F, Cox R, Kaahoek F, et al . Vivaldi: A Decentralized Network Coordinate System. In Proc. of SIGCOMM, 2004
[71] Rhea S, Geels D, Roscoe T, et al. Handling Churn in a DHT. In Proc. of USENIX Annual Tech. Conference, 2004
[72]Castro M,Costa M,Rowstron A.Performance and Dependability of Structured Peer-to-peer Overlays.Technical Report MSR-TR-2003-94,2003
[73]Muthitacharoen A,Gilbert S,Morris R.Etna:A Fault-tolerant Algorithm for Atomic Mutable DHT Data.Technical Report MIT-LCS-TR-993,2005
[74]Rodrigues R,Liskov B.Rosebud:A Scalable Byzantine-fault-tolerant Storage Architecture.Technical Report TR/932,MIT CSAIL,2003
[75]Cates J.Robust and Efficient Data Management for a Distributed Hash Table.Massachusetts Institute of Technology,2003
[76]Rhea S.OpenDHT:A Public DHT Service.PhD thesis,U.C.Berkeley,2005
[77]Paxson V.Measurements and Analysis of End-to-End Internet Dynamics.PhD thesis,U.C.Berkeley,1997
[78]Andersen D,Balakrishnan H,Kaashoek F,et al.Resilient Overlay Networks.In Proc.of SOSP,2001
[79]Gummadi K P,Madhyastha H V,Gribble S D,et al.Improving the Reliability of Internet Paths With One-hop Source Routing.In Proc.of OSDI,2002
[80]FreePastry Release Notes.http://freepastry.org/Free Pastry/README-2.0b.html
[81]Joung Y J,Wang J C.Chord2:A Two-layer Chord for Reducing Maintenance Overhead via Heterogeneity.Computer Networks,2007,51(3):712-731P
[82]Armstrong J,Virding R,Wikstr"om C,et al.Concurrent Programming in Erlang.Prentice Hall,2nd edition,1996
[83]Fredlund L A.Framework for Reasoning about Erlang Code.PhD thesis,Royal Institute of Technology,Kista,Sweden,2001
[84]Milgram S.The Small World Problem.Psychol Today.1967,2:60-67P
[85]Watts D J,Strogatz S H.Collective Dynamics of Small-world Networks.Nature.1998,393(4):440-442P
[86]Barrat A,Weight M.On the Properties of Small-world Network Models.The European Physical Journal.2000,13(3):547-560P
[87]Watts D.Small-Worlds:The Dynamics of Networks between Order and Randomness.Princeton University Press.1999,107(7):664-668P
[88]Comellas F,Mitjana M.Broadcasting in Small-world Communication Networks.Proc.of 9th Structure of Information Networks,2000
[89]Kleinberg J.Navigation in a Small-world.Nature.2000,406(8)
[90]Kleinberg J.The Small-world Phenomenon:an Algorithmic Perspective.Cornell Computer Science Technical Report.2000
[91]汤大权,贺明科,孟庆崧.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究.计算机研究与发展.2007,44(9):1566-1571
[92]周晋,路海明,李衍达.用Small-World设计无组织P2P系统的路由算法.软件学报.2004,15(6):915-923页
[93]Zhang H,Goel A,Govindan R.Using the Small-world Model to Improve Freenet Performance.In Proc.of IEEE Infocom,2002
[94]Shashidhar S S,Zegura E.Adding Structure to Unstructured Peer-to-peer Networks:the Use of Small-world Graphs.Parallel Distributed Compute.2005,65(2):142-153P
[95]Hui Y K K,Lui J C S,Yau D K Y.Small-world Overlay P2P Networks:Construction Management and Handling of Dynamic Flash Crowds.Computer Networks.2006,50:2727-2746P
[96]李玲娟,姬同亮,王汝传.小世界现象在P2P网络中的应用研究.南京邮电大学学报(自然科学版).2006,26(4):86-89页
[97]朱晓姝,周娅,黄桂敏.基于小世界层次分布式路由模型研究,计算机工程.2005,32(15):120-122页
[98]冯国富,毛莺池,陆桑璐等.SWAPS:一种基于Small World的文件搜索算法.计算机研究与发展.2006,43(3):395-401页
[99]李伟荣,吴国新,李建飞.Small-World在对等网络中的应用研究.计算机工程与应用.2006,06:158-161页
[100]吕锋,柴洁.基于小世界模型和对等代理的副本定位模型.武汉理工大 学学报.2007,29(7):130-132页
[101]周晋,李衍达.基于Small-World网络的非结构化DHT算法.计算机研究与发展.2005,42(1):109-117页
[102]Newman M E J,Watts D J.Scaling and Percolation in the Small-world Metwork Model.Physical Review.1999,60(6):7332-7342P
[103]Ozik J,Hunt B R,Ott E.Growing Networks with Geographical Attachment Preference:Emergence of Small Worlds.Physical Review.2004,69(2):1081-1085
[104]Zhang Z,Zhou S,Shen Z,et al.Form Regular to Growing Small-world Networks.Physical Review.2007,385:765-772P
[105]Kunzrnann G,Nagel R,Eberspacher J.Increasing the Reliability of Structured P2P Networks.Design of Reliable Communication Networks.2005:489-495P
[106]Akyildiz I F,Su W,Sankarasubramaniam Y,et al.A Survey on Sensor Networks.IEEE Communications Magazine.2002,40(8):102-114P
[107]Szewczyk R,Osterweil E,Polastre J,et al.Habitat Monitoring with Sensor Networks.Communications of the ACM.2004,47(6):34-40P
[108]Butler Z,Corke P,Peterson R,et al.Network Cows:Virtual Fences for Controlling Cows.In Proc.of WAMES,Boston,2004
[109]Schwiebert L,Gupta S K S,Weinmann J.Research Challenges in Wireless Networks of Biomedical Sensors.In Proc.of 7th Annual International Conference on Mobile Computing and Networking.Rome:ACM Press,2001:151-165P
[110]Meyer S,Rakomonirainy A.A Survey of Research on Context-aware Homes.In Proc.of Workshop on Wearable,Invisible,Context-Aware.Australia:Australian Computer Society,2003
[111]Wemer-Allen,Johnson J,Ruiz M,et al..Monitoring Volcanic Eruptions with a Wireless Sensor Network.In Proc of European Workshop on Senson Network,2005:108-120P
[112]Heinzelman W R,Chandrakasan A P,Balakrishnan H.Energy-Efficient Communication Protocol for Wireless Microsensor Networks.In Proc.of the 33rd HICSS,2000:3005-3014
[113]沈波,张世永,钟亦平.无线传感器网络分簇路由协议.软件学报.2006,17(7):1588-1600页
[114]Heinzelman W,Chandrakasan A,Balakrishnan H.An Application-specific Protocol Architecture for Wireless Microsensor Networks.Wireless Communication.2002,1(4):660-670P
[115]Smaragdakis G,Matta I,Bestavros A.SEP:A Stable Election Protocol for Clustered Heterogeneous Wireless Sensor Networks.In Porc.of the Int' 1Workshop on SANPA 2004.2004
[116]Mhatre V,Rosenberg C.Design Guidelines for Wireless Sensor Networks:Communication Clustering and Gggregation.Ad Hoe Network Journal.2004,2(1):45-63
[117]Ye M,Li C,Chen G,et al.EECS:An Energy Efficient Cluster Scheme in Wireless Sensor Networks.In Proc.of the IEEE IPCCC 2005.New York:IEEE Press,2005:535-540P
[118]Depedri A,Zanella A,Verdone R.An Energy Efficient Protocol for Wireless Sensor Networks.In Proc.of the AINS 2003.Menlo Park,2003:1-6P
[119]Lindsey S,Raghavendra C S.PEGASIS:Power-efficient Gathering in Sensor Information Systems.In Proc.of the IEEE Aerospace Conference.Montana:IEEE Aerospace and Electronic Systems Society,2002:1125-1130
[120]Manjeshwar A,Agrawal D P.TEEN:A Protocol for Enhanced Efficiency in Wireless Sensor Networks.In Proc.of the 15th Parallel and Distributed Processing Symposium.San Francisco:IEEE Computer Society,2001:2009-2015P
[121]卿利,朱清新,王明文.异构传感器网络的分布式能量有效成簇算法.软件学报.2006,17(3):481-489页
[122]Younis O, Fahmy S. Heed: A Hybrid, Energy-efficient, Distributed Clustering Approach for Ad-hoc Sensor Networks. On Mobile Computing.2004, 3(4):366-379P
[123] Vijay R, Kansal A, Hsu J, et al. Design Considerations for Solar Energy Harvesting Wireless Embedded Systems. In Proc. of 2005 Fourth International Symposium on Information Processing in Sensor Networks,2005:457-462P
[124]Aman K, Dunny P, Mani B S. Performance Aware Tasking for Environmentally Powered Sensor Networks. Performance Evaluation Review. 2004, 32(1):223-34P
[125]Mhatre V P, Rosenberg C, Kofman D, et al. A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint. Mobile Computing. 2005,4(1): 4-15P
[126]Du X J, Lin F J. Improving Routing in Sensor Networks with Heterogeneous Sensor nodes. In Proc. of Vehicular Technology Conference 2005. IEEE Press, 2005:2528-2532P
[127] Zhang Z H, Ma M, Yang Y Y. Energy Efficient Multi-hop Polling in Clusters of Two-layered Heterogeneous Sensor Networks. In Proc. of Parallel and Distributed Processing Symposium. IEEE Press, 2005:81-83P
[128]Mhatre V, Rosenberg C. Homogeneous vs. Heterogeneous Clustered Sensor Networks: A Comparative Study. In Proc. of 2004 IEEE International Conference on Communications, 2004
[129] Doshi S, Bhandare S, Brown T. An On-demand Minimum Energy Routing Protocol for a Wireless Ad-hoc Network. ACM SIGMOBILE Mobile Computing and Communications Review. 2002, 6(3):50-66P