期刊文献+

机会网络中基于节点社会性的数据转发策略 被引量:9

Nodal Sociality-based Data Forwarding for Opportunistic Networks
在线阅读 下载PDF
导出
摘要 合理地选择代理节点是实现机会信息高效的转发和交付的关键问题。为了避免机会网络中,由于节点的移动性、交替活跃及网络拓扑动态变化等因素造成的传输限制,从社会网络与机会网络相结合的角度出发,提出了一种基于节点社会性的机会网络中的转发策略SNOP(data forwarding algorithm based on the sociality of node in opportunity network)。SNOP利用网络中的社团结构、社团间相似性及节点的社团活跃,有针对性地选择移动代理节点(agents),以离线的方式计算节点的社会性,在线完成转发,以此实现信息的高效和可靠交付。在真实数据集上的实验结果表明,与现有的转发算法相比,SNOP能够有效地提高信息交付的效率,降低端到端的传输延迟及网络开销。 It is a key problem to choose proper agents for forwarding opportunistic messages. In order to avoid the transmission limits caused by the characteristics mobility,active alternatively of nodes and dynamic changes of network topology in opportunistic networks,a data forwarding algorithm—SNOP( data forwarding algorithm based on the sociality of node in opportunistic networks) was proposed from the perspective of combining social network with opportunistic network. SNOP takes community,similarity between societies and activity of nodes in the network into consideration to choose the targeted agents. It calculates nodal sociality in offline mode and implements messages forwarding online to reach the goal of high efficiency and reliability. The experimental results on real-world datasets showed that compared with the existing algorithm of data transmission,SNOP has a higher delivery success ratio,smaller transmission delay and with lower network overhead.
出处 《四川大学学报(工程科学版)》 EI CAS CSCD 北大核心 2013年第5期57-63,共7页 Journal of Sichuan University (Engineering Science Edition)
基金 四川省科技支撑计划资助项目(2012GZX0088-1 2011GZ0188) 四川省产学研创新联盟合作项目(2012ZZ0010) 四川省科技创新苗子工程资助项目(2011-005)
关键词 机会网络 社会网络 社团发现 数据转发 opportunistic networks social networks community detection data forwarding
  • 相关文献

参考文献17

  • 1Pelusi L. Opportunistic networking: data forwarding in dis- connected mobile ad hoc networks [ J ]. Communications Magazine,2006,44 ( 11 ) : 134 - 141.
  • 2Kevin F. A delay-tolerant network architecture for challenged internets [ C ]//Proceedings of the 2003 conference on Ap- plications, technologies, architectures, and protocols for computer New York, ACM,2003 : 27 - 34.
  • 3朱敏,肖震,刘昊霖,高弘博.WSN中基于虚拟网格的分簇路由算法[J].四川大学学报(工程科学版),2012,44(5):143-148. 被引量:12
  • 4刘唐,彭舰,杨进.异构延迟容忍移动传感器网络中基于转发概率的数据传输[J].软件学报,2013,24(2):215-229. 被引量:30
  • 5苏金树,胡乔林,赵宝康,彭伟.容延容断网络路由技术[J].软件学报,2010,21(1):119-132. 被引量:73
  • 6Hui P, Crowcrofi J, Yoneki E. BUBBLE rap: Social-based forwarding in delay tolerant networks [ J ]. Mobile Compu- ting,2011,10 ( 11 ) : 1576 - 1589.
  • 7Daly E, Haahr M. Social network analysis for routing in dis- connected delay-Tolerant Manets [ J ]. ACM MobiHoc, 2007:32 - 40.
  • 8Steven H. Strogatz. Exploring complex networks [ J ]. Na- ture,2001,410:268 - 276.
  • 9Costa P, Mascolo C, Musolesi M, et al. Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc net- works [ J ]. IEEE Journal,2008,26 (5) :748 - 760.
  • 10Mei A, Morabito G, Santi P, et al. Social-aware stateless for- warding in pocket switched networks [ C ]//Proceedings of IEEE INFOCOM. Rome, IEEE ,2011:251 - 255.

二级参考文献17

  • 1林闯,雷蕾.下一代互联网体系结构研究[J].计算机学报,2007,30(5):693-711. 被引量:65
  • 2Cullar D, Estrin D, Strvastava M. Overview of sensor network [ J]. Computer,2009,37 (8) :41 - 49.
  • 3u Haibing ,Zeng Peng, Wang Zongfeng, et al. Study of com- munication agorithm of distributed sensor network [J]. Journal of China Institute and Communications, 2010,25 (10) : 102 - 110.
  • 4Haas Z J, Halpem J Y, Li L. Gossip based on Ad hoc Rou- ting[ C]. 21st Annual Joint Conference of the IEEE Computer and Communications Societies, New York, 2007 : 1707 - 1716.
  • 5Heinzelman W R, Chandrakasan A, Balakrishna H. Energyefficient communication algorithm for wireless micro sensor networks [ C ]//Proceedings of the 33rd Hawaii International Conference on System Sciences. Washington:IEEE Computer Society,2002 : 660 - 670.
  • 6Lindsey S, Raghavendra C. PEGASIS : Power-efficient gather- ing in sensor information systems [ C]//PJoceeding of the IEEE Aerospace Conference. Montana:IEEE Aerospace and Electronic Systems Society ,2002,3:1125 - 1 130.
  • 7Pawlak R, Wojciechowski B, Nikodem M. New simplified HEED algorithm for wireless sensor networke[ J 1. Communi- cations in Computer and Information Science,2010,79( 1 ) : 332 - 341.
  • 8Callaway E H. Wireless sensor network: architecture and al- gorithms [ M ]. Boca Raton, Florida : CRC Pless, 2004 : 41 - 62.
  • 9Karl H, Willig A. Protocol and architectures for wireless sennor networks [ M ]. Beijing : Publishing House of Electron- ics Industry,2007 : 175 - 177,.
  • 10熊永平,孙利民,牛建伟,刘燕.机会网络[J].软件学报,2009,20(1):124-137. 被引量:327

共引文献112

同被引文献65

  • 1Liu Zhou,Wang Bingwen,Guo Lejiang. A survey on con- nected set construction algorithm for wireless sensor net- works [ J ]. Information Technology Journal, 2010,9 ( 6 ) : 1081 - 1092.
  • 2Wu J. Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links [ J ]. IEEE Transmissions on Parallel and Distributed Computing, 2002,22 (4) :327 - 340.
  • 3Wu Jie, Dai Fei. Iterative local solutions for connected dominating sets in ad hoc wireless networks [ J]. IEEE Transactions on Computers ,2008,57(5 ) : 1 - 14.
  • 4Wan Pengjun, Alzoubi K M. Distributed construction of connected dominating set in wireless ad hoc networks [ C]//Proceeding of INFOCOM' 04. Netherlands: Kluwer Academic Publishers ,2004 : 141 - 149.
  • 5Clark B N, Colboum C J, Johnson D S. Unit disk graphs, discrete mathmatics [ M ]. Pennsylvania: Prentice Hall, 1990 : 165 - 177.
  • 6Yin Jianhong, Wu Kalya. Graph theory and its algorithm [ M ]. New York :Taylor & Francis Group,2005 : 168 - 179.
  • 7Park M,Wang C, Willson J, et al. A dominating and ab- sorbent set in wireless ad-hoc networks with different transmission range[ C]//Proceeding of 8th ACM Interna- tional Symposium on Mobile Ad Hoc Networking and Computing(MOBIHOC). New York : ACM ,2007 :22 - 31.
  • 8Thai M T,Wang F,Liu D,et al. Connected dominating sets in wireless networks with different transmission ranges [ j]. IEEE Transaction on Mobile Computing,2007,6(7): 721 - 730.
  • 9Du D Z,Thai M T,Li Y,et al. Strongly connected dominating sets in wireless sensor networks with unidirectional links [C]//Proeeeding of APWEB06. Berlin:LNCS,20136:13 -24.
  • 10Rosen K H. Discrete mathematics and its applications [ M]. 6th ed. Beijing:China Machine Press,2012.

引证文献9

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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