期刊文献+

无线自组织网络覆盖网络资源发现算法研究

Research on a resource discovery algorithm of wireless self-organizing overlay network
在线阅读 下载PDF
导出
摘要 从无线自组织网络特点及其资源发布并发现的特性出发,提出了分布式的覆盖网络资源发现算法PARD.PARD以哈希资源名称作为路由地址,利用覆盖网络技术,使资源信息分布存储在多个节点上,提高了整个网络的负载均衡能力.通过代理及本地技术,使得对1个附近节点的资源查询尽量不需和远端节点通信,最大程度地避免了全网范围的信息洪泛,有助于网络的扩展和管理.实验结果表明,PARD算法具有良好的稳定性和可扩展性,与Broadcast算法相比,PARD算法能有效的降低网络流量,提高了网络的效用和性能. This essay, from the characteristics of the distributing and discovering of the wireless Ad Hoe network resources, further proposes PARD, a resource discovery algorithm based on Overlay Network. Under the Overlay Network technology, PARD distributes and stores information resources in multiple nodes of different domain according to the network conditions and nodes' state so that the que- ry of a nearby node could avoid as much communication with a remote one as possible. Using agent and local technology, it not only improves the overall network load balancing, but avoids the flooding of the whole network to the maximum, which is helpful for the network extension and management. The simulation experiment results show that PARD has good stability and scalability. Compared with other algorithms, PARD can reduce network traffic effectively. PARD also improves the network utility and performance.
作者 张丽 张扬
出处 《河南农业大学学报》 CAS CSCD 北大核心 2013年第1期108-112,共5页 Journal of Henan Agricultural University
基金 国家自然科学基金项目(51174263) 河南省科技厅重点科技攻关项目(122102210116) 河南省高等教育教学改革研究课题(2012SJGLX121)
关键词 覆盖网络 无线自组织网 资源发现 算法 overlay network wireless Ad Hoc network resource discovery algorithm
  • 相关文献

参考文献8

  • 1HELMY A. Efficient resource discovery in wireless ad- hoc networks: contacts do help book chapter in resource Management in wireless networking[ M ]. Boston: Kluw- er Academic Publishers, 2004.
  • 2ZAHN T, SCHILLER J. Performance evaluation of a dht-based approach to resource discovery in mobile ad hoc networks [ C ]. New Jersey : IEEE CPS, 2007.
  • 3TOUCH J. Overlay networks [ J ]. Computer Networks, 2001, 3(2) :115 -116.
  • 4RIDHAWI Y, KANDAVANAM G, KARMOUCH A. A dynamic hybrid service overlay network for service com- positions[C]. New Jersey:IEEE CPS, 2011.
  • 5ZHANG L, ZHANG Y. A wireless ad hoc overlay net- works indexing mechanism based on petri nets [ C ]. New Jersey:IEEE CPS, 2010.
  • 6张丽,余镇危,张扬.移动Ad Hoc网络的一种自适应权值分簇算法[J].西安电子科技大学学报,2008,35(3):572-576. 被引量:10
  • 7张丽,王健东,余镇危,张扬.移动Ad Hoc网络覆盖节点聚集问题研究[J].微计算机信息,2009,25(27):39-41. 被引量:4
  • 8YOON J, LIU M, NOBLE B. Random waypoint consid- ered harmful[C]. New Jersey:IEEE CPS, 2003.

二级参考文献16

  • 1张丽,余镇危,张杨.移动自组织网络应用层组播研究[J].微计算机信息,2005,21(09X):62-65. 被引量:6
  • 2吴迪,刘英学,冯永新,王光兴.Ad hoc网络中一种基于权值的分簇算法[J].小型微型计算机系统,2006,27(2):202-206. 被引量:13
  • 3李胜广,刘建伟,李晖,张其善.一种MANET加权自荐选簇分层IDS模型[J].西安电子科技大学学报,2007,34(2):279-284. 被引量:2
  • 4Y.C. Hu, S.M.Das, and H. Pucha . Exploiting the synergy between peer-to-peer and mobile ad hoc networks[C]. In Proceedings of HotOS-Ⅸ: Ninth Work shop on Hot Topics in Operating Systems, Lihue, Ka uai, Hawaii, May 2003.
  • 5R. Schollmeier and I. Gruber. Routing in Peer-to-peer and Mobile Ad Hoc Networks: A Comparison [C]. In International Workshop on Peer-to-Peer Computing, May 2002.
  • 6L. B. Oliveira, I. G. Siqueira, and A. A. Loureiro. Evaluation of Ad-hoc Routing Protocols under a Peer-to-Peer Application[C]. In IEEEWireless Communication and Networking Conference, 2003.
  • 7T. Grossman and A. Wool. Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research[J], no. 101, pp. 81-92, 1997.
  • 8K.Fall and K. Varadhan. ns Notes and Documents. The VINT Project.UC Berkeley,LBL, USC/ISI,and Xerox PARC,February 2000, Availableat http://www.isi.edu/nsnam/ns/ns-documentation.html.
  • 9Gerla M,Tsai J T C.Multicluster,Mobile,Multimedia Radio Network[J].Wireless Networks,1995,1(3):255-265.
  • 10Parekh A K.Selecting Routers in Ad-hoc Wireless Networks[C]//Proceedings of the SBT/IEEE International Telecommunications Symposium.Riode Janeiro (Brazil):IEEE,1994:420-424.

共引文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部