期刊文献+

传输速率感知的机会路由候选路由节点选择和排序 被引量:1

Selection and ordering of transmission-rate-aware candidate forwarders for opportunistic routing
下载PDF
导出
摘要 以期望传输时延为度量指标,提出了传输速率感知的机会路由候选路由节点选择和排序算法。分解机会路由为节点到其候选路由节点集的anycast传输和候选路由节点集到目的节点的剩余机会路由传输,迭代计算节点的机会路由最小期望传输时延,根据最小期望传输时延选择和排序候选路由节点。模拟实验结果表明,提出的机会路由候选路由节点选择和排序算法能明显提高机会路由的传输性能。 A transmission rate aware candidate forwarder selection and ordering algorithm based on expected transmission delay of nodes was proposed.It first separated opportunistic route forwarding into two components: the anycast forwarding from source node to its candidate forwarders set,and the remaining forwarding from that candidate forwarders set to destination,and then the shortest expected transmission delay of opportunistic routing was computed iteratively.Finally,candidate forwarders were selected and ordered according to the shortest expected transmission delay of nodes.The simulation results indicate that the proposed algorithm can improve the performance of opportunistic routing obviously.
出处 《计算机应用》 CSCD 北大核心 2011年第11期2895-2897,共3页 journal of Computer Applications
关键词 多跳无线网络 无线路由 机会路由 候选路由节点 传输速率 期望传输时延 multi-hop wireless network wireless routing opportunistic routing candidate forwarder transmission rate expected transmission delay
  • 相关文献

参考文献16

  • 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.
  • 4胡海峰,杨震.无线传感器网络中基于协同的机会路由[J].通信学报,2009,30(8):116-123. 被引量:14
  • 5田克,张宝贤,马建,姚郑.无线多跳网络中的机会路由[J].软件学报,2010,21(10):2542-2553. 被引量:32
  • 6YAN 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.
  • 7HAN 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.
  • 8ZHANG 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.
  • 9CHEN 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.
  • 10陈伟,刘峤,靳京,秦志光.基于数据包序列号集合的机会路由传输协调机制[J].计算机应用,2010,30(6):1455-1458. 被引量:1

二级参考文献68

  • 1XU Y, HEIDEMANN J, ESTRIN D. Geography-informed energy conservation for ad hoc routing[A]. Proc MobiCom 2001[C]. Rome, Italy, 2001.70-84.
  • 2CHEN B, JAMIESON K, BALAKRISHNAN H, et al. Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks[A]. Proc MobiCom 2001[C]. Rome, Italy, 2001 85-96.
  • 3KOUSHANFAR F, DAVARE A, NGUYEN D, et al. Low power coordination in wireless ad-hoc networks[A]. International Symposium on Low Power Electronics and Design(ISLPED)[C]. Seoul, Korea, 2003. 475- 480.
  • 4SCHURGERS C, TSIATSIS V, GANERIWAL S, et al. Optimizing sensor networks in the energy-latency-density design space[J]. IEEE Trans Mobile Computing, 2002, 1(1):70-80.
  • 5VAN GREUEN J, PETROVI'C D, et al. Adaptive sleep discipline for energy conservation and robusmess in dense sensor networks[A]. ICC'2004[C]. Paris, France, 2004. 3657-3662.
  • 6BONIVENTO A, FISCHIONE C, SANGIOVANNI-VINCENTELLI A. Randomized protocol stack for ubiquitous networks in indoor environment[A]. CCNC'2006[C]. Las Vegas, NV, 2006. 152- 156.
  • 7LIN E, WOLISZ A, RABAEY J. Power efficient rendezvous schemes for dense wireless sensor networks[A]. ICC '2004[C]. Paris, France, 2004. 3769-3776.
  • 8TSE D, HANLY S. Multi-access fading channels: part Ⅰ: polymatroid structure, optimal resource allocation and throughput capacities[J]. IEEE Trans on Information Theory, 1998, 44(7): 2796-2815.
  • 9SHAH R C, BONIVENTO A D, et al. Joint optimization of a protocol stack for sensor networks[A]. MILCOM 2004[C]. Monterey, CA, 2004. 480- 486.
  • 10ZORZI M, RAO R R. Geographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance[J]. IEEE Trans on Mobile Computing, 2003, 2(4): 349-365.

共引文献43

同被引文献13

  • 1熊志强,黄佳庆,刘威,杨宗凯.无线网络编码综述[J].计算机科学,2007,34(3):6-9. 被引量:23
  • 2Rozner E,Seshadri J,Mehta Y,et al.Simple opportunistic routing protocol for wireless mesh networks[C]//Proc of the 2nd IEEE wireless mesh networks.Reston:IEEE Computer Society Press,2006:48-54.
  • 3Douglas S J,Couto D,Aguayo D,et al.A high-throughput path metric for multi-hop wireless routing[J].Wireless Networks,2005,11(4):419-434.
  • 4Katti S,Rahul H,Hu Wenjun,et al.XORs in the air:practical wireless network coding[C]//Proc of ACM SIGCOMM '06.Pisa,Italy:[s.n.],2006:243-254.
  • 5Biswas S,Morris R.ExOR:opportunistic routing in multi-hop wireless networks[C]//Proc of ACM SIGCOMM '05.Philadelphia,PA;[s.n.],2005:133-144.
  • 6Yan Y,Zhang B X,Zheng J,et al.CORE;a coding-aware opportunistic routing mechanism for wireless mesh networks[J].IEEE Wireless Communications,2010,17(3):96-103.
  • 7Biswas S,Morris R.Opportunistic routing in multihop wireless networks[J].ACM SIGCOMM Computer Communication Re-view,2004,34(1):69-74.
  • 8Couto D D,Aguayo D,Bicket J,et al.A high-throughput path metric for multi-hop wireless routing[C]//Proc of the ACM/ IEEE MobiCom 2003.Washington:IEEE Computer Society Press,2003:134-146.
  • 9陶少国,黄佳庆,杨宗凯,乔文博,熊志强.网络编码研究综述[J].小型微型计算机系统,2008,29(4):583-592. 被引量:39
  • 10吴永华,刘广钟.基于NS-2网络仿真协议的功能扩展[J].计算机技术与发展,2009,19(12):63-66. 被引量:5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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