As a new sort of mobile ad hoc network(MANET), aeronautical ad hoc network(AANET) has fleet-moving airborne nodes(ANs) and suffers from frequent network partitioning due to the rapid-changing topology. In this work, t...As a new sort of mobile ad hoc network(MANET), aeronautical ad hoc network(AANET) has fleet-moving airborne nodes(ANs) and suffers from frequent network partitioning due to the rapid-changing topology. In this work, the additional relay nodes(RNs) is employed to repair the network and maintain connectivity in AANET. As ANs move, RNs need to move as well in order to re-establish the topology as quickly as possible. The network model and problem definition are firstly given, and then an online approach for RNs' movement control is presented to make ANs achieve certain connectivity requirement during run time. By defining the minimum cost feasible moving matrix(MCFM), a fast algorithm is proposed for RNs' movement control problem. Simulations demonstrate that the proposed algorithm outperforms other control approaches in the highly-dynamic environment and is of great potential to be applied in AANET.展开更多
A lot of work has been focused on desig-ning and analyzing various cooperative diversity pro-tocols for wireless relay networks. To provide a uni-fied queuing analytic framework, we fonmlate an em-bedded Markov chain,...A lot of work has been focused on desig-ning and analyzing various cooperative diversity pro-tocols for wireless relay networks. To provide a uni-fied queuing analytic framework, we fonmlate an em-bedded Markov chain, which rams out to be a Quasi-Birth-and-Death （QBD） process. Using the Matrix-Ce-ometric method, we can analyze the average delay in a unified way. Theoretical analysis is validated by simu-lation results. We show that the delay performances of Amplify-and-Forward or Decode-and-Forwaxd （AF/ DF） and incremental AF/DF schemes can be analyzed in the unified way. Thus, we can always choose the best cooperative diversity scheme in different scenari-os for delay minimization.展开更多
文摘As a new sort of mobile ad hoc network(MANET), aeronautical ad hoc network(AANET) has fleet-moving airborne nodes(ANs) and suffers from frequent network partitioning due to the rapid-changing topology. In this work, the additional relay nodes(RNs) is employed to repair the network and maintain connectivity in AANET. As ANs move, RNs need to move as well in order to re-establish the topology as quickly as possible. The network model and problem definition are firstly given, and then an online approach for RNs' movement control is presented to make ANs achieve certain connectivity requirement during run time. By defining the minimum cost feasible moving matrix(MCFM), a fast algorithm is proposed for RNs' movement control problem. Simulations demonstrate that the proposed algorithm outperforms other control approaches in the highly-dynamic environment and is of great potential to be applied in AANET.
基金This work was supported by the National Basic Research Program of China under Crant No. 2012CB316001 the National Science Foundation of China under Crants No. （：13832008, No. 03902001.
文摘A lot of work has been focused on desig-ning and analyzing various cooperative diversity pro-tocols for wireless relay networks. To provide a uni-fied queuing analytic framework, we fonmlate an em-bedded Markov chain, which rams out to be a Quasi-Birth-and-Death （QBD） process. Using the Matrix-Ce-ometric method, we can analyze the average delay in a unified way. Theoretical analysis is validated by simu-lation results. We show that the delay performances of Amplify-and-Forward or Decode-and-Forwaxd （AF/ DF） and incremental AF/DF schemes can be analyzed in the unified way. Thus, we can always choose the best cooperative diversity scheme in different scenari-os for delay minimization.
