Throughput-Optimized Routing for Multi-Path Multi-Channel Wireless Mesh Network with Integrated Nodes

被引:0
作者
Tao, Ming-Hung [1 ]
Ma, Yugang [1 ]
Oh, Ser Wah [2 ]
机构
[1] ASTAR, Inst Infocomm Res, 1 Fusionoplis Way,21-01 Connexis South Tower, Singapore 138632, Singapore
[2] Whizpace Pte Ltd, Blk 77 Ayer Rajah Crescent 02-30, Singapore 139954, Singapore
来源
2019 IEEE VTS ASIA PACIFIC WIRELESS COMMUNICATIONS SYMPOSIUM (APWCS 2019) | 2019年
关键词
Multi-path routing; Mesh network; Cognitive radio networks; White space communications; Nonlinear optimization; Max-flow min-cut; Evolutionary algorithm; Simulation annealing; Cross-entropy; White spaces; METRICS;
D O I
10.1109/vts-apwcs.2019.8851660
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This work relates to form a self-organized mesh network in which each mesh node is equipped with multiple transceivers and is able to use as many channels as its number of transceivers to send data. This is for the communication systems consisting of integrated nodes including multiple standard transceivers, which can make use of multiple channels, to aggregate the bandwidth. The formed mesh network will fully utilize the radio resource and largely enhance the throughput for the existing wireless technologies while keeping the transmission latency reasonably short. The proposed algorithm is composed by two phases. The first phase is to determine all the possible forwarding neighbors in a topology with a given source and destination node. The second phase is to selectively link the forwarding nodes and determine the channels for these links. The simulation results show that the proposed multi-path routing algorithm provides much better end-to-end throughput than the conventional single-path routing algorithm does. Another simulation results show the performance difference by employing different evolutionary algorithms in the proposed algorithm. The results further suggest the best evolutionary algorithm to be employed in different situations.
引用
收藏
页数:5
相关论文
共 16 条
[1]  
Aburada K., 2006, AS PAC C COMM APCC 0, P1
[2]  
[Anonymous], 2008, P 3 INT C COGN RAD O
[3]  
[Anonymous], 1988, Simulated Annealing and Boltzmann Machines
[4]   Reactive routing for mobile cognitive radio ad hoc networks [J].
Cacciapuoti, Angela Sara ;
Caleffi, Marcello ;
Paura, Luigi .
AD HOC NETWORKS, 2012, 10 (05) :803-815
[5]  
Chowdhury M. F. K., 2009, SEARCH ROUTING PROTO
[6]   A tutorial on the cross-entropy method [J].
De Boer, PT ;
Kroese, DP ;
Mannor, S ;
Rubinstein, RY .
ANNALS OF OPERATIONS RESEARCH, 2005, 134 (01) :19-67
[7]   A node-disjoint multipath routing protocol based on AODV [J].
Ding, Shunli ;
Liu, Liping .
PROCEEDINGS OF THE NINTH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS TO BUSINESS, ENGINEERING AND SCIENCE (DCABES 2010), 2010, :312-316
[8]  
Habak K, 2013, INT CONF COMPUT NETW
[9]   Coolest Path: Spectrum Mobility Aware Routing Metrics in Cognitive Ad Hoc Networks [J].
Huang, Xiaoxia ;
Lu, Dianjie ;
Li, Pan ;
Fang, Yuguang .
31ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2011), 2011, :182-191
[10]  
Li XF, 2004, C LOCAL COMPUT NETW, P419