期刊文献+

相遇时间感知的机会网络社区路由策略 被引量:3

Meeting time aware community routing mechanism in opportunistic network
下载PDF
导出
摘要 利用节点运动过程中带来的相遇机会,机会网络中的节点以"存储、携带、转发"的方式来完成消息的传输。由于采用这种特殊传输机制,机会网络比传统自组织无线网络传输延迟较大。在当前以相遇历史信息或者链路状态感知为基础的转发机制中大多以牺牲延迟为代价,片面追求传输率。根据机会网络中节点的社会特性,提出了一种节点相遇时间估计方法,以分布式的方式预测到达目的节点的间隔时间,进而,节点以相遇时间估计值为依据,选择到达目的节点间隔时间较短的节点作为中继节点,最终完成消息转发。结果表明,所提出的相遇时间估计方法比较准确,与广泛采用的路由策略相比较,所提出的方法能够将消息传输延迟性能提高30%以上。 Making use of the meeting opportunity raised by the movement of nodes,the messages are transmitted with the manner of "store-carry-forward" in opportunistic network.So these networks have a feature of longer delay than conventional ad hoc network.Current routing schemes try their best to deliver packet but leading to definitely network delay and are based on random movement model.According to the social character of nodes in network,the distributed predicting scheme on the expectation of meeting time between nodes is proposed;moreover,according to the estimating results,the relay node can be selected reasonably.With this manner,the message can be forwarded to the destination.Simulations show that the proposed estimating method is accurate;furthermore,comparing with the widely used routing mechanism,the performance on the delay can be improved more than 30%.
出处 《重庆大学学报(自然科学版)》 EI CAS CSCD 北大核心 2013年第6期137-142,共6页 Journal of Chongqing University
基金 国家自然科学基金资助项目(60772109 61001105) 重庆市自然科学重点基金资助项目(cstc2013jjB40001 cstc2013jjB40006)
关键词 机会网络 社区模型 相遇时间 路由策略 opportunistic network community model meeting interval routing mechanism
  • 相关文献

参考文献16

  • 1吴大鹏,张普宁,王汝言.节点连接态势感知的低开销机会网络消息传输策略[J].通信学报,2013,34(3):44-52. 被引量:18
  • 2Samuel N, Mehedi B,Robin K. Encounter- based routing inDTNs [C]. In: Proc. of IEEE Infocom,2009,846-854.
  • 3Zhang J B, Luo G C, Qin K, Sun H F. Encounter-Basedrouting in delay tolerant Networks[C]//In:Proc. of ICCP,2011:338-341.
  • 4张翼,周四望.基于历史相遇间隔的机会网络路由协议[J].计算机工程,2011,37(14):85-87. 被引量:4
  • 5Prodhan MAT,Das R,Kabir M H. Probabilistic quotabased adaptive routing in opportunistic networks [ J ].IEEE,2011.
  • 6Lindgren A,Doria A,Schelen O. Probabilistic routingin intermittently connected networks [ J]. ACMSigmobile Mobile Computing and CommunicationsReview, 2003,7(3): 19-20.
  • 7Amin V,David B. Epidemic routing for partiallyconnected ad hoc networks [R]. Durham NC,USA:Duke University, 2000.
  • 8Hui P,Crowcroft J,Yoneki E. Bubble Rap: Social-Basedforwarding in delay tolerant networks [ J]. IEEETransactions on Mobile Computing, 2010,1536-1550.
  • 9Lin W S,Zhao H V,Liu K. Cooperation stimulationstrategies for peer-to-peer wireless live video-sharingsocial networks [J]. IEEE Transactions on ImageProcessing, 2010, 19(7): 1768-1784.
  • 10牛建伟,周兴,刘燕,孙利民,马建.一种基于社区机会网络的消息传输算法[J].计算机研究与发展,2009,46(12):2068-2075. 被引量:38

二级参考文献34

  • 1Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait: Efficient routing in intermittently connected mobile networks [C] //Proc of ACM SIGCOMM Workshop on Delay Tolerant Networking (WDTN). New York: ACM, 2005: 45-53.
  • 2Spyropoulos T, Psounis K, Raghavendra C S, et al. Spray and focus : Efficient mobility-assisted routing for heterogeneous and correlated mobility [C]//Proc of the 5th Annual IEEE Int Conf on Pervasive Computing and Communications Workshops. New York: IEEE, 2007: 79- 85.
  • 3Lindgren, Doria A, Schelen O. Probabilistic routing in intermittently connected networks [C] //Proc of ACM SIGMOBILE Mobile Computing and Communications. New York: ACM, 2003:239-254.
  • 4Pan Hui, Jon Crowcroft, Eiko Yoneki. BUBBLE Rap: Socia-based forwarding in delay tolerant networks [C] //Proc of the 9th ACM Int Symp on Mobile Ad Hoc Networking and Computing. New York: ACM, 2008:241-250.
  • 5Musolesi M, Mascolo C. A community based mobility model for ad hoc network research [C] //Proc of the 2nd Int Workshop on Multi-hop Ad Hoc Networks: From Theory to Reality. New York: ACM, 2006:26-26.
  • 6Newman M E J. Analysis of weighted networks [J]. Physical Review E, 2004, 70(5): 70-78.
  • 7Spyropoulos T, Psounis K, Raghavendra C S. Performance analysis of mobility assisted routing [C] //Proc of the 7th ACM Int Symp on Mobile Ad Hoc Networking and Computing. New York: ACM, 2006:49-60.
  • 8Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks, CS-200006 [R]. Durham, North Carolina: Duke University, 2000.
  • 9Vahdat A, Becker D. Epidemic Routing for Partially Connected Ad Hoc Networks[R]. Durham, USA: Department of Computer Science, Duke University, Tech. Rep.: CS-2000-06, 2000.
  • 10Lindgren A, Doria A, Schelen O. Probabilistic Routing in Intermittently Connected Networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3): 19-20.

共引文献55

同被引文献52

引证文献3

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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