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

面向编码机会路由的无线Mesh网络广播信道接入 被引量：4

Broadcast Medium Access for Opportunistic Routing with Network Coding in Wireless Mesh Networks
下载PDF
导出
摘要 编码机会路由是有损无线Mesh网络中提供高吞吐量和高可靠性传输的理想方案.该路由机制建立在无线广播的多用户分集优势和随机网络编码的纠删特性之上,为广播MAC的设计引入了新的机会和挑战.基于最优停止理论,研究面向编码机会路由的机会广播信道接入问题,提出一种在接入延迟和信道交付能力之间加以折衷,以获得最优的平均有效速率的方法,并在IEEE 802.11 DCF协议基础上设计实现面向NCOR的广播MAC协议O-BCast.仿真结果表明,该协议显著提高了编码机会路由的端到端吞吐量,具有网络负载自适应的良好特性. Opportunistic routing with network coding （NCOR） has emerged as a promising approach to improve both the throughput and reliability in lossy wireless multi-hop networks. This new routing paradigm, which is based on the multi-user diversity advantage of wireless broadcast links and the erasure coding property of random linear network coding, brings opportunities and challenges for broadcast MAC designs. This paper carries out a study on the opportunistic broadcast channel access problem with the intent on appealing to the optimal stopping theory, the study proposes an access strategy to achieve the maximal average effective rate, which is a trade-off between the access delay and the instantaneous delivery ability. By extending IEEE 802.11 DCF, the study further presents a MAC protocol O-BCast to execute the proposed strategy. Simulation results show that O-BCast achieves notable improvement of NCOR＇s end-to-end throughput and is adaptive to various network loads.
作者 蔡顺 张三峰 董永强 吴国新
机构地区 计算机网络和信息集成教育部重点实验室(东南大学) 东南大学计算机科学与工程学院
出处 《软件学报》 EI CSCD 北大核心 2012年第9期2401-2415,共15页 Journal of Software
基金 国家自然科学基金(61272532) 江苏省自然科学基金(BK2011335) 东南大学计算机网络和信息集成教育部重点实验室开放研究基金(K93-9-2010-30)
关键词 机会路由 网络编码 广播MAC 最优停止理论 多用户分集 opportunistic routing network coding broadcast MAC optimal stopping theory multi-user diversity
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献1

二级参考文献36

  • 1Zhang Z.Routing in intermittently connected mobile ad hoc networks and delay tolerant networks:Overview and challenges.IEEE Communications Surveys & Tutorials,2006,8(1):24-37.[doi:10.1109/COMST.2006.323440].
  • 2Perkins C,Royer E.Ad-Hoc on-demand distance vector routing.In:Proc.of the IEEE WMCSA'99.Washington:IEEE Computer Society Press,1999.90-100.[doi:10.1109/MCSA.1999.749281].
  • 3Intanagonwiwat C,Govindan R,Estrin D.Directed diffusion:A scalable and robust communication paradigm for sensor networks.In:Proc.of the ACM MobiCom 2000.New York:ACM Press,2000.56-67.[doi:10.1145/345910.345920].
  • 4Biswas S,Morris R.Opportunistic routing in multihop wireless networks.ACM SIGCOMM Computer Communication Review,2004,34(1):69-74.[doi:10.1145/972374.972387].
  • 5Biswas S,Morris R.ExOR:Opportunistic routing in multi-hop wireless networks.In:Proc.of the ACM SIGCOMM 2005.New York:ACM Press,2005.133-143.http://www.sigcomm.org/sigcomm2005/paper-BisMor.pdf.
  • 6Rozner E,Seshadri J,Mehta Y,Qiu L.Simple opportunistic routing protocol for wireless mesh networks.In:Proc.of the IEEE WiMesh 2006.Washington:IEEE Computer Society Press,2006.48-54.[doi:10.1109/WIMESH.2006.288602].
  • 7Westphal C.Opportunistic routing in dynamic ad hoc networks:The OPRAH protocol.In:Proc.of the IEEE MASS 2006.Washington:IEEE Computer Society Press,2006.570-573.[doi:10.1109/MOBHOC.2006.278612].
  • 8Couto DD,Aguayo D,Bicket J,Morris R.A high-throughput path metric for multi-hop wireless routing.In:Proc.of the ACM/ IEEE MobiCom 2003.Washington:IEEE Computer Society Press,2003.134-146.[doi:10.1145/938985.939000].
  • 9Chachulski S,Jennings M,Katti S,Katabi D.Trading structure for randomness in wireless opportunistic routing.In:Proc.of the ACM SIGCOMM 2007.New York:ACM Press,2007.169-180.[doi:10.1145/1282427.1282400].
  • 10Zorzi M,Rao RR.Geographic random forwarding (GeRaF) for ad hoc and sensor networks:Multihop performance.IEEE Trans.on Mobile Computing,2003,2(4):337-348.[doi:10.1109/TMC.2003.1255648].

共引文献31

同被引文献33

  • 1Ahlswede R, Cai N, Li S Y R, ct al. Network infmnation flow [J]. lnfimnation Theory I EEE Transactions on, 000, 46(04): 1204-1216.
  • 2Ho T, M E Dard M, Koetter R. et al. A random linear network codingapproach to multicast [J]. hlformation Theory, IEEE Transactions on, 2006,52 (10) :4413- 4430.
  • 3Wang Y, Jain S, Martonosi M, et al. Erasure-coding based routing thr opportunistic networks [C]. Proceedings of the 2005 ACM SIGCOMM workshop oll Delay-tolerant networking,New York,NY,USA, 2005. 229-236.
  • 4Chen LJ, Yu C H, Sun T, et al. hua Chu, H. A hybrid muting approach for opportunistic networks [C]. Prweedings fACM SIGCOMM 2006-Conference on Applications, Technologies, Architectures, and Protocols for Computer communication, 2006. 213-220.
  • 5WidmerJ, ke Boudec J Y. Network coding for effcient communication in extreme networks [C]. Proceedings of ACM SIGCOMM 2005 Workshops: Conference oll Computer Communications, 21105:284-291.
  • 6Spympoulos T, Psounis K, Raghavendra C S. Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility[C]. Proceedings-Fifth Annual IEEE International Conference on Pervasive ('mllputing and Communicatimls Workshops, PerCom Workshops 2007:79-85.
  • 7Liao Y, Tan K, Zhang Z. et al. Estimation based erasure-coding routing in delay tolerant networks [C] IWCMC 21106 - Proceedin: of the 2006 International Wireless Communications Confrence and Mobile Computing Conference, 2006: 557-562.
  • 8Freeman k C. Centrality in social networks conceptual clarification[J]. Social networks, 1979,1(3):215-239.
  • 9Wang D, Zhang Q, kiu J. Partial network coding: Concept, perfornaance, and application for continuous data collection in sensor networks [J]. ACM Transactions on Sensor Networks (TOSN), 2008,4(3):14-22.
  • 10The Opportunistic Network Environment simulator [EB/OL]. http:// www.netlab.tkk.fi/tltkinlus/dtn/dleone/, 2012-12-15.

引证文献4

二级引证文献8

软件学报
2012年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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