期刊文献+

Tree-Based Proactive Routing Protocol for Wireless Mesh Network 被引量:2

Tree-Based Proactive Routing Protocol for Wireless Mesh Network
在线阅读 下载PDF
导出
摘要 Wireless Mesh Network (WMN) is seen as an effective Intemet access solution for dynamic wireless applications. For the low mobility of mesh routers in WMN, the backbone topography can be effectively maintained by proactive routing protocol. Pre-proposals like Tree Based Routing (TBR) protocol and Root Driven Routing (RDR) protocol are so centralized that they make the gateway becorre a bottleneck which severely restricts the network performance. We proposed an Optimized Tree-based Routing (OTR) protocol that logically separated the proactive tree into pieces. Route is partly computed by the branches instead of root. We also discussed the operation of multipie Intemet gateways which is a main issue in WMN. The new proposal lightens the load in root, reduces the overhead and improves the throughput. Numerical analysis and simulation results confirm that the perforrmnce of WMN is improved and OTR is more suitable for large scale WMN. Wireless Mesh Network (WMN) is seen as an effective Internet access solution for dynamic wireless applications. For the low mobility of mesh routers in WMN, the backbone topography can be effectively maintained by proactive routing protocol. Pre-proposals like Tree Based Routing (TBR) protocol and Root Driven Routing (RDR) protocol are so centralized that they make the gateway become a bottleneck which severely restricts the network performance. We proposed an Optimized Tree-based Routing (OTR) protocol that logically separated the proactive tree into pieces. Route is partly computed by the branches instead of root. We also discussed the operation of multiple Internet gateways which is a main issue in WMN. The new proposal lightens the load in root, reduces the overhead and improves the throughput. Numerical analysis and simulation results confirm that the performance of WMN is improved and OTR is more suitable for large scale WMN.
出处 《China Communications》 SCIE CSCD 2012年第1期25-33,共9页 中国通信(英文版)
基金 Acknowledgements This paper was supported by the Major National Science and Technology program under Grant No. 2011ZX03005-002 the National Natural Science Foundation of China under Grant No. 61100233 the Fundamental Universities under Grant No Research Funds for the Central K50510030010.
关键词 wireless mesh network 802. lls routing protocol tree-based routing 无线Mesh网络 路由协议 因特网接入 无线网状网 无线应用 网络性能 仿真结果 数值分析
作者简介 Ji Wenjiang, is currently a Ph.D. candidate of Xidian University, Xi'an, China. His research in- terests include wireless networking, routing pro- tocols, information security and network simulation. Email: wenj_ji@ 163.comMa Jianfeng, is a professor and Ph.D. supervisor in the School of Computer Science at Xidian University, Xi'an, China. His current research interests include infortmtion and network Security, cryptography. E-mail: jfma@mail. xidian.edu.cn
  • 相关文献

参考文献2

二级参考文献21

  • 1Yi Ping,Hou Yafei,Zhong Yiping,Zhang Shiyong,Dai Zhoulin.Flooding attack and defence in Ad hoc networks[J].Journal of Systems Engineering and Electronics,2006,17(2):410-416. 被引量:5
  • 2Fragouli C, Boudec J, Widmer J. Network coding: an in- stant primer. ACM SIGCOMM Computer Communication Review, 2006, 36(1): 63-68.
  • 3Ahlswede R, Cai Ning, Li S Y R, et al. Network information flow. IEEE Trans. Inform. Theory, 2000, 46(4): 1204-1216.
  • 4Wu Y, Chou P A, Kung S Y. Information exchange in wireless networks with network coding and physical-layer broadcast. Microsoft Technical Report, MSR-TR-2004-78, 2004.
  • 5S. Katti, H. Rahul, W. Hu, et al. XOR in the air: Practical wireless network coding. ACM SIGCOMM, Pisa, 2006.
  • 6Nguyen D, Tran T, Nguyen T, et al. Wireless broadcast using network coding. IEEE Trans. on Vehicular Technology, 2009, 58(2): 914-925.
  • 7Chi K K, Jiang X H, Ye B L, et al. Efficient network coding-based loss recovery for reliable multicast in wireless networks. Accepted by IEICE Trans. Commun.
  • 8Wikipedia. Hypergraph. http://en.wikipedia.org/wiki/ Hypergraph#Terminology.
  • 9Reinhard Diestel. Graph theory. Springer-Verlag, Heidelberg. Third edition, 2005.
  • 10Welsh D J A, Powell M B. An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10: 85-86, 1967.

共引文献5

同被引文献5

引证文献2

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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