期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于数据包序列号集合的机会路由传输协调机制 被引量：1

Packet sequence set-based transmission coordination mechanism for opportunistic routing
下载PDF
导出
摘要 机会路由传输协调机制组织和协调候选路由节点间的数据包传输,通过减少端到端累计数据包传输次数提高机会路由端到端吞吐量。现有基于batchmap的批量分段式传输协调机制的协调成功率随批量传输的数据包数量的振荡而振荡。针对此问题,提出了基于数据包序列号集合的批量连续式传输协调机制,通过维持每轮批量传输的数据包数量确保传输协调成功率,提高机会路由端到端吞吐量。实验结果显示,基于数据包序列号集合的机会路由传输协调机制能平均提高约18%的端到端吞吐量。 Transmission Coordination Mechanisms （TCM） for Opportunistic Routing （OR） is used to arrange and coordinate transmissions of OR,and improves end-to-end throughput by reducing the total number of packet transmissions for delivering packets to destination.The existing paradigms are based on batch map partition communication session into packet segments,and transmit each segment in batch mode sequentially.However,the successful rate of transmission coordination is oscillated due to the oscillation of the number of packets transmitted in batch.A packet sequence set-based TCM for OR transmitting packets in continuous batch mode was proposed.The proposed TCM can keep the high successful rate of transmission coordination by maintaining the number of packets transmitted in batch,and therefore improve end-to-end throughput of OR.The simulation results show that the average end-to-end throughput gain of the proposed packet sequence set-based TCM is about 18% over the existing batch map-based TCM.
作者 陈伟 刘峤 靳京 秦志光
机构地区 电子科技大学计算机科学与工程学院
出处 《计算机应用》 CSCD 北大核心 2010年第6期1455-1458,共4页 journal of Computer Applications
基金 国家自然科学基金资助项目(60903157) 国家863计划项目(2009AA01Z422)
关键词 无线路由 机会路由 数据包序列号 传输协调 多跳无线网络 wireless routing opportunistic routing packet sequence transmission coordination multi-hop wireless network
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献11

  • 1ZENG K,LOU W,ZHAI H.Capacity of opportunistic routing in multi-rate and multi-hop wireless networks[J].IEEE Transactions on Wireless Communications,2008,7(12):5118 -5128.
  • 2BISWAS S,MORRIS R.ExOR:Opportunistic multi-hop routing for wireless networks[J].ACM SIGCOMM Computer Communication Review,2005,35(4):133-144.
  • 3SHAH R C,WIETHOLTER S,WOLISZ A,et al.When does opportunistic routing make sense?[C]// Proceedings of the 3rd IEEE International Conference on Pervasive Computing.Washington,DC:IEEE,2005:350-356.
  • 4RADUNOVIC B,CKANTSIDIS C,KEY P,et al.An optimization framework for opportunistic multipath routing in wireless mesh networks[C]// Proceedings of the IEEE INFOCOM 2008.Phoenix,USA:IEEE,2008:2252 -2260.
  • 5WESTPHAL C.Opportunistic routing in dynamic Ad Hoc networks:the OPRAH protocol[C]// MASS:Proceedings of the 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.Vancouver,Canada:IEEE,2006:570 -573.
  • 6ZENG K,LOU W,ZHAI H.On end-to-end throughput of opportunistic routing in multirate and multihop wireless networks[C]//Proceedings of the IEEE INFOCOM 2008.Phoenix,USA:IEEE INFOCOM,2008:816 -824.
  • 7YUAN Y,YANG H,WONC S H Y,et al.Romer:Resilient opportunistic mesh routing for wireless mesh networks[C]// Proceedings of the 1st IEEE Workshop on Wireless Mesh Networks (WiMesh).Washington,DC:IEEE,2005.
  • 8BACCELLI F,BLASZCZYSZYN B,ERMEL E,et al.An optimized relay self selection technique for opportunistic routing in mobile Ad Hoc networks[C]// EW2008:Proceedings of European Wireless Conference 2008.Prague.Czech Republic:[s.n.],2008:1-7.
  • 9LUK C P,LAU W C,YUE O C.An analysis of opportunistic routing in wireless mesh network[C]// Proceedings of IEEE International Conference on Communications.Beijing:IEEE,2008:2877-2883.
  • 10霍广城,王晓东.移动传感网中一种基于RSSI的机会主义路由设计[J].电子学报,2009,37(3):608-613. 被引量：11

二级参考文献15

  • 1Akyildiz F,Su W,et al.A survey on sensor networks[J]. IEEE Communication Magazine,2002,1(8) : 102 - 114.
  • 2Juang,H Old, Y Wang,M Martonosi, et al. Energy-efficient computing for wildlife traeldng: design tradeoffs and early experiences with ZebraNet [ A ]. Proceedings of the 2002 ACM ASPLOS[C] .San Jose:ACM Press,2002.542- 551.
  • 3Kulik J, Heinzelman WR, Balakrishnan H. Negotiation-based protocols for disseminating information in wireless sensor networks[J]. Wireless Networks, 2002, (8) : 169 - 185.
  • 4Manjeshwar A,Agrawal DP. TEEN:A muting protocol for enhanced efficiency in wireless sensor networks[ A] .Proceedings of thel5th Parallel and Dislributed Processing Symposium[ C]. San Francisco: IEEE Computer Society,2001.2009- 2015.
  • 5C Gomez, P Salvatella, et al. Adapting AODV for IEEE 802. 15.4 mesh sensor networks [ A ]. Proceedings of the 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks[ C ]. New York: IEEE Computer Society Press, 2006.337 - 345.
  • 6Luciana Pelusi, Andrea Passarlla, Marco Confi. Opportunistic networking:data forwarding in disconnected mobile ad hoc networks[ J ]. IEEE Communication Magazine, 2006, ( 5 ) : 84 - 91.
  • 7K Fall. A delay-tolerant network architecture for challenged intemets[A]. Proceedings of ACM SIGCOMM' 2003 [ C ]. Karlsruhe:ACM Press,2003.14- 27.
  • 8Amin Vahdat, David Becker. Epidemic routing for partiallyconnetcted ad hoc networks [ J]. IEEE. Communication Magazine,2000,3(4) :96 - 108.
  • 9Micro Musolesi, Stephen Hailes, et al. Adaptive muting for intermittently connected mobile ad hoc networks[ A]. Proceedings of WOWMOM' 2005 [ C ]. Taormina: IEF.E Computer Society Press, 2005.813 - 820.
  • 10Libo Song, David F Kotz. Evaluating opportunistic routing protocols with large realistic contact traces[ A ]. Proceedings of CHANTS' 2007 [ C ]. Montreal: ACM Press, 2007. 574 - 582.

共引文献10

同被引文献15

  • 1BISWAS S, MORRIS R. ExOR: Opportunistic multi-hop routing for wireless networks [ J]. ACM Computer Communication Review, 2005, 35(4) : 133 - 144.
  • 2ZENG KAI, LOU WENJING, ZHAI HONGQIANG. On end-to-end throughput of opportunistic routing in multirate and muhihop wireless networks[ C]//INFOCOM 2008: The 27th Conference on Computer Communications. Washington, DC: IEEE IEEE Computer and Communications Societies, 2008:816-824.
  • 3ZENG KAI, LOU WENJING, ZHAI HONGQIANG. Capacity of op- portunistic routing in multi-rate and multi-hop wireless networks[ J]. IEEE Transactions on Wireless Communications, 2008, 7( 12): 5118 -5128.
  • 4YAN Y, ZHANG B, J ZHENG. A coding-aware opportunistic rou- ting mechanism for wireless mesh networks[ J]. IEEE Wireless Com- munications. 2010. 17(3) : 1908 - 1919.
  • 5HAN M K, BHARTIA A, QIU L, et al. O3: Optimized overlay- based opportunistic routing [ C/OL]. [ 2011 - 05 - 01 ]. http:// www. cs. utexas. edu/- erozher/papers/03, pdf.
  • 6ZHANG R, GORCE J M, BERDER O. Lower bound of energy-la- tency tradeoff of opportunistic routing in muhihop networks[ J]. EURASIP Journal on Wireless Communications and Networking, 2011,2011:37 -54.
  • 7CHEN WEI, WANG JUAN, JIN JING. Batch sliding window based-transmission coordination mechanism for opportunistic routing [ J]. The Institute of Electronics, Information and Communication Engineers (IEICE) Transactions on Communications, 2011, 1(E94- B) : 77 - 85.
  • 8BACCELLI F, BLASZCZYSZYN B, ERMEL E, et al. An opti- mized relay self selection technique for opportunistic routing in mo- bile ad hoc networks[ C]//EW2008: European Wireless Conference 2008. Piscataway, NJ: IEEE, 2008:1-7.
  • 9ZHONG Z, NELAKUDITI S. On the efficacy of opportunistic routing [C]// 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. Piscat- away, NJ: IEEE, 2006:441-450.
  • 10DUBOIS-FERRIERE H, GROSSGLAUSER M, VETTERLI M. Least-cost opportunistic muting[ C]// Allerton Conference on Com- munication, Control, and Computing. Allerton House: University of Illinois, 2007:85 -98.

引证文献1

二级引证文献1

计算机应用
2010年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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