期刊文献+

节点连接态势感知的低开销机会网络消息传输策略 被引量:18

Connection status aware cost efficient message transmission mechanism in opportunistic networks
在线阅读 下载PDF
导出
摘要 利用节点保存的相遇历史信息,提出一种节点连接态势感知的消息传输策略,通过建立时序图模型估计节点间的连接态势,以时延、投递率以及负载率为联合优化目标参数,采用均衡和量化方法,为消息分布式地选择最佳中继节点。仿真结果表明,所提出的消息传输策略能够有效降低网络负载48%以上,并改善消息投递率和平均时延性能。 A novel connection status aware cost efficient message transmission mechanism (CSAMT) was proposed. The presented mechanism constructed a dynamic temporal graph matrix based on historical data stored in the cache of the peers to estimate the connection status. Furthermore, the delay, delivery ratio and Overhead together were selected as ob ject optimizing parameters, and then the preferable relay peers could be distributively chosen by adopting equalization and quantification schemes proposed. Numerical results show that CSAMT mechanism can efficiently reduce overhead for more than 48% while the messaze delivery ratio and latency are improved also.
出处 《通信学报》 EI CSCD 北大核心 2013年第3期44-52,共9页 Journal on Communications
基金 国家自然科学基金资助项目(61001105 60972069) 重庆市教委基金资助项目(KJ100521)~~
关键词 机会网络 节点连接态势 时序图模型 消息转发效用值 opportunistic networks connection status temporal graph matrix message forwarding weight
  • 相关文献

参考文献18

  • 1董超,钱睿,陈贵海,王海.无线自组织网络中流间网络编码机会发现方法的研究[J].通信学报,2011,32(10):92-98. 被引量:4
  • 2MORGAN Y L. Notes on DSRC & WAVE standards suite: its archi- tecture, design, and characteristics[J]. IEEE Communications Surveys & Tutorials, 2010, 12(4): 504-518.
  • 3JUANG R OKI H, WAN(] Y, et al. Energy-efficient computing for wildlife tracking: design tradc-offs and etrly experiences with Ze- bra-Nct[J]. ACM SIGARCtt Computer Architecture News. 2002, 37( 1 0): 96-107.
  • 4SMALL T, HAADS Z J. The shared wireless infostation model: a new ad hoc networking paradigm[A]. Proceedings of the 4th ACM Interna- tional Symposium on Mobile Ad Hoc Networking and Computing. Annapolis[C]. Annapolis, MD, USA, 2003.233-244.
  • 5PENTLAND A, FLETCttER R, HASSON A. DakNet: rethinking connectivity ill developing nalions[J]. Computer. 2(104, 37(1): 78-83.
  • 6DOR1A A, UI)EN M, PANDEY D P. Providing connectivity to the saami nomadic community[A]. Proceedings of the 2nd International Conference on Open Collaborative Design for Sustainable Innova- lion[ C ] Bangalore, India, 2002.
  • 7NIE Z, LIU J, GAN X Y, eta/. A relay node selection technique for opportunistic routing in mobile ad hoc networks[J]. Journal of Chongqing University of Posts and Telecommunications, 2010, 22(4): 421 425.
  • 8XIONG Y P, SUN L M, NIU J W, et al. Opportunistic nelworks[J]. Journal of Software, 2009.20( 1 ): 124-137.
  • 9THRASYVOULOS S. KONSTANT1NOS P, CAUL1G1 S R. Efficient routing in imcrmittently connected mobile nelworks: the multiple-copy case[J]. IEF.E/ACM Transactions on Networking, 2008, 16(1): 77-90.
  • 10THRASYVOULOS S. KONSTANTINOS E CAULIGI S R. Efficient routing ill intcrmillently connecled mobile networks: the single-copy case[J]. 1EEE/ACM Transactions on Networking, 2008, 16(l): 63-76.

二级参考文献28

  • 1陈义,沈云中,刘大杰.适用于大旋转角的三维基准转换的一种简便模型[J].武汉大学学报(信息科学版),2004,29(12):1101-1105. 被引量:172
  • 2姚吉利.三维坐标转换的静态滤波模型[J].武汉大学学报(信息科学版),2005,30(9):825-828. 被引量:20
  • 3潘国荣,周莹,张德海.坐标转换模型在盾构姿态计算中的应用[J].大地测量与地球动力学,2006,26(3):84-87. 被引量:31
  • 4姚吉利,韩保民,杨元喜.罗德里格矩阵在三维坐标转换严密解算中的应用[J].武汉大学学报(信息科学版),2006,31(12):1094-1096. 被引量:102
  • 5李德仁,郑肇葆.解析摄影测量[M].北京:测绘出版社,1992.
  • 6AHLSWEDE R, CAI N, LI S R, et al. Network information flow[J]. IEEE Transaction on Information Theory, 2000, 46(4): 1204-1216.
  • 7ALIREZA K H, RUDOLF R. Bounds of benefit of network coding: throughput and energy saving in wireless networks[A]. Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM 2008)[C]. Phoenix, AZ, USA, 2008. 1683-1689.
  • 8MAJID G- DON T, JIM K. Reliability gain of network coding in lossy wireless networks[A]. Proceedings of the 27th IEEE International Conference on Computer Communications (1NFOCOM 2008)[C]. Phoenix, AZ, USA, 2008.2171-2179.
  • 9KATTI S, RAHUL H, HU W, et al. XORs in the air: practical wireless network coding[A]. Proceedings of International Conference on Special Interest Group on Data Communications (SIGCOMM 2006)[C]. Pisa, Italy, 2006.243-254.
  • 10CHAPORKAR P, PROUTIERE A. Adaptive network coding and scheduling for maximizing throughput in wireless networks[A]. Proceedings of International Conference on Mobile Computing and Networking (MOBICOM 2007)[C]. Montreal, Canada, 2007. 135-146.

共引文献23

同被引文献199

  • 1赵小虎,谭得健.ControlNet总线在煤矿综合自动化系统的应用[J].煤炭科学技术,2006,34(9):34-36. 被引量:2
  • 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.
  • 4Prodhan MAT,Das R,Kabir M H. Probabilistic quotabased adaptive routing in opportunistic networks [ J ].IEEE,2011.
  • 5Lindgren A,Doria A,Schelen O. Probabilistic routingin intermittently connected networks [ J]. ACMSigmobile Mobile Computing and CommunicationsReview, 2003,7(3): 19-20.
  • 6Amin V,David B. Epidemic routing for partiallyconnected ad hoc networks [R]. Durham NC,USA:Duke University, 2000.
  • 7Hui P,Crowcroft J,Yoneki E. Bubble Rap: Social-Basedforwarding in delay tolerant networks [ J]. IEEETransactions on Mobile Computing, 2010,1536-1550.
  • 8Lin 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.
  • 9Neel Y M, Modiano E. Capacity and delay tradeos forad-hoc mobile networks [J]. IEEE Transactions onInformation Theory, 2005, 51(6): 1917-1937.
  • 10Thrasyvoulos S,Konstantions P, Raghavendra C.Efficient routing in intermittently connected mobilenetworks: The Multiple-Copy Case [J]. IEEE/ACMTransactions on Networking, 2008, 16(1): 77-90.

引证文献18

二级引证文献82

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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