Peilong Li

University of Science and Technology of China, Luchow, Anhui Sheng, China

Are you Peilong Li?

Claim your profile

Publications (7)5.14 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: Future mobile broadband networks are characterized with high data rate and improved coverage, which will enable real-time video multicast and broadcast services. Scalable video coding (SVC), combined with adaptive modulation and coding schemes (MCS) and wireless multicast, provides an excellent solution for streaming video to heterogeneous wireless devices. By choosing different MCSs for different video layers, SVC can provide good video quality to users in good channel conditions while maintaining basic video quality for users in bad channel conditions. A key issue to apply SVC to wireless multicast streaming is to choose appropriate MCS for each video layer and to determine the optimal resource allocation among multiple video sessions. We formulate this problem as total utility maximization, subject to the constraint of available radio resources. We prove that the formulated problem is NP-hard and propose an optimal, two-step dynamic programming solution with pseudo-polynomial time complexity. Simulation results show that our algorithm offers significant improvement on the video quality over a naive algorithm and an adapted greedy algorithm, especially in the scenarios with multiple real video sequences and limited radio resources.
    IEEE/ACM Transactions on Networking 01/2012; 20:57-68. · 2.01 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Inter-cell interference mitigation is a key challenge in the next generation wireless networks which are expected to use an aggressive frequency reuse factor and a high-density base station deployment to improve coverage and spectral efficiency. In this work, we consider the problem of maximizing the weighted sum-rate of a wireless cellular network via coordinated scheduling and discrete power control. We present two distributed iterative algorithms which require limited information exchange and data processing at each base station. Both algorithms provably converge to a solution where no base station can unilaterally modify its status (i.e., transmit power and user selection) to improve the weighted sum-rate of the network. Numerical studies are carried out to assess the performance of the proposed schemes in a realistic system based on the IEEE 802.16m specifications. Simulation results show that the proposed algorithms achieve a significant rate gain over uncoordinated transmission strategies for both cell-edge and inner users.
    IEEE Journal on Selected Areas in Communications 07/2011; · 3.12 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Scalable video coding (SVC), together with adaptive modulation and coding (AMC), can improve wireless multicast streaming video by jointly performing radio resource allocation and modulation and coding scheme (MCS) selection. However, the existing schemes in the literature allocate radio resources for different video layers separately, which leads to a waste of radio resources. In this work, we introduce the notion of joint layer resource allocation which allows to jointly allocate resources to multiple video layers that are assigned the same MCS. We formulate this problem and prove it to be NP-hard. Then we develop a pseudo-polynomial algorithm that finds the optimal total system utility. Our algorithm assumes a very generic utility function and flexible video layer rates. To reduce the complexity of the algorithm, we also propose Fully Polynomial Time Approximation Schemes (FPTAS) for the same problem. Simulation results show that our optimal algorithm offers significant improvement on system utility over a previous optimal algorithm and a greedy algorithm both of which do not support joint layer resource allocation. The proposed approximation algorithm provides controllable tradeoff between performance and computational complexity and, with appropriately chosen parameters, it outperforms the greedy algorithm with 40% less running time.
    Network Protocols (ICNP), 2010 18th IEEE International Conference on; 11/2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: Scalable video coding (SVC) and Adaptive Modulation and Coding (AMC) are two key techniques for video multicast in broadband wireless networks. They can improve the system performance by enhancing the wireless resource allocation schemes and assigning appropriate modulation and coding schemes (MCS) to different layers of scalable video sequences. We formulate the problem as maximizing the total system utility subject to the total resource constraint, where the utility of each user is a generic non-negative, non-decreasing function of received rate. We then propose a fast intra-session MCS assignment algorithm based on dynamic programming. This algorithm can be integrated with an existing inter-session resource allocation algorithm and applied to multi-session scenarios. Simulation results show that our algorithm achieves significant improvement on the video quality over a naive algorithm and an adapted greedy algorithm, and greatly reduces the running time in both single-session and multi-session scenarios compared to a former optimal algorithm.
    Proceedings of IEEE International Conference on Communications, ICC 2010, Cape Town, South Africa, 23-27 May 2010; 01/2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: Future 4G cellular networks are featured with high data rate and improved coverage, which will enable realtime video multicast and broadcast services. Scalable video coding is very appropriate for wireless multicast service because it allows to choose different modulation and coding schemes (MCSs) for different video layers and can provide good video quality to users in good channel conditions while still maintaining reasonable video quality for other users. In order to apply scalable video coding to wireless multicast streaming, it is important to choose appropriate MCS for each video layer and to determine the right resource allocation among multiple video sessions. In this paper we propose a two-step dynamic programming algorithm that finds the optimal total system utility of all users where the system utility can be a generic non-negative, non-decreasing function of received rate. Our algorithm supports variable layer size and thus allows flexibility during the video encoding process. Simulation results show that our algorithm offers significant improvement on the video quality over a naive algorithm and an adapted greedy algorithm, especially in the scenarios with multiple real video sequences and limited radio resources.
    Network Protocols, 2009. ICNP 2009. 17th IEEE International Conference on; 11/2009
  • Peilong Li, Yu Gu, Baohua Zhao
    [Show abstract] [Hide abstract]
    ABSTRACT: Many applications in wireless sensor networks like video surveillance have the requirement of timely data delivery. Real-time routing is needed in these applications. Because of the limitation of node energy, energy efficiency is also an important concern in routing protocol design in order to increase the network lifetime. In this paper, we propose a global-energy-balancing routing scheme (GEBR) for real-time traffic based on directed diffusion (DD), which balances node energy utilization to increase the network lifetime. GEBR can find an optimal path in sensor networks for data transfer considering global energy balance and limited delivery delay. Simulation results show that GEBR significantly outperforms DD in uniform energy utilization. GEBR achieves better global energy balance and longer network lifetime. The time for real-time service of the sensor networks using GEBR is prolonged by about 4.37% and the network lifetime is prolonged by 44.6%.
    Asia-Pacific Service Computing Conference, The 2nd IEEE; 01/2008
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper focuses at the problem that the existing methods of passive testing can not accomplish the fault detection of embedded communication systems. A passive testing approach to fault detection is proposed, in which an observer is placed in an external channel. Global states are used to describe the possible states of the system, the observed input and output information is employed and combined with model conversion to presume the system state transitions. Based on the approach, a hierarchical method of fault diagnosis is further designed, in which the system conversion trace are recorded in passive testing, then mutant analysis method is utilized to generate fault candidates. The size of fault set can be reduced by passive observations, and distinguishing sequence and cross verification are used to locate the fault. Experiments of a real protocol H.245 show that the proposed approach can detect the fault in embedded communication systems in limited steps and can locate the system fault effectively. Its backtracing algorithm can reduce the length of the fault symptom sequence significantly.
    Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University 01/2007; 41(6).