The search functionality is under construction.

Author Search Result

[Author] Haibo DAI(4hit)

1-4hit
  • Stochastic Channel Selection for UAV-Aided Data Collection

    Tianyu LU  Haibo DAI  Juan ZHAO  Baoyun WANG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E102-A No:3
      Page(s):
    598-603

    We investigate the uplink channel selection problem of unmanned aerial vehicle (UAV)-aided data collection system in delay-sensitive sensor networks. In the studied model, the fixed-wing UAV is dispatched to gather sensing information from terrestrial sensor nodes (SNs) and they contend for uplink channels for transmission. With the goal of minimizing the system-wide delay, we formulate a resource allocation problem. Encountered with the challenge that the flight trajectory of UAV is unknown to SNs and the wireless channel is time-varying, we solve the problem by stochastic game approach and further propose a fully distributed channel selection algorithm which is proved to converge to a pure strategy Nash Equilibrium (NE). Simulation results are presented to show that our proposed algorithm has good performance.

  • Energy-Efficient Optimization for Device-to-Device Communication Underlaying Cellular Networks

    Haibo DAI  Chunguo LI  Luxi YANG  

     
    LETTER-Numerical Analysis and Optimization

      Vol:
    E100-A No:4
      Page(s):
    1079-1083

    In this letter, we focus on the subcarrier allocation problem for device-to-device (D2D) communication in cellular networks to improve the cellular energy efficiency (EE). Our goal is to maximize the weighted cellular EE and its solution is obtained by using a game-theoretic learning approach. Specifically, we propose a lower bound instead of the original optimization objective on the basis of the proven property that the gap goes to zero as the number of transmitting antennas increases. Moreover, we prove that an exact potential game applies to the subcarrier allocation problem and it exists the best Nash equilibrium (NE) which is the optimal solution to optimize the lower bound. To find the best NE point, a distributed learning algorithm is proposed and then is proved that it can converge to the best NE. Finally, numerical results verify the effectiveness of the proposed scheme.

  • Proactive Eavesdropping for Suspicious Millimeter Wave Wireless Communications with Spoofing Relay

    Cheng CHEN  Haibo DAI  Tianwen GUO  Qiang YU  Baoyun WANG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E102-A No:4
      Page(s):
    691-696

    This paper investigates the wireless information surveillance in a suspicious millimeter wave (mmWave) wireless communication system via the spoofing relay based proactive eavesdropping approach. Specifically, the legitimate monitor in the system acts as a relay to simultaneously eavesdrop and send spoofing signals to vary the source transmission rate. To maximize the effective eavesdropping rate, an optimization problem for both hybrid precoding design and power distribution is formulated. Since the problem is fractional and non-convex, we resort to the Dinkelbach method to equivalently reduce the original problem into a series of non-fractional problems, which is still coupling. Afterwards, based on the BCD-type method, the non-fractional problem is reduced to three subproblems with two introduced parameters. Then the GS-PDD-based algorithm is proposed to obtain the optimal solution by alternately optimizing the three subproblems and simultaneously updating the introduced parameters. Numerical results verify the effectiveness and superiority of our proposed scheme.

  • Distributed Optimization with Incomplete Information for Heterogeneous Cellular Networks

    Haibo DAI  Chunguo LI  Luxi YANG  

     
    LETTER-Numerical Analysis and Optimization

      Vol:
    E100-A No:7
      Page(s):
    1578-1582

    In this letter, we propose two robust and distributed game-based algorithms, which are the modifications of two algorithms proposed in [1], to solve the joint base station selection and resource allocation problem with imperfect information in heterogeneous cellular networks (HCNs). In particular, we repeatedly sample the received payoffs in the exploitation stage of each algorithm to guarantee the convergence when the payoffs of some users (UEs) in [1] cannot accurately be acquired for some reasons. Then, we derive the rational sampling number and prove the convergence of the modified algorithms. Finally, simulation results demonstrate that two modified algorithms achieve good convergence performances and robustness in the incomplete information scheme.