Peng Lin

Peng Lin

Auto-generated profile, based on publicly available information

Peng Lin

Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China; and School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100190, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 March 2021 in IEEE Transactions on Control Systems Technology
Verified
Journal Article
Open access
SSShan Sun
Shan Sun
Yifan ZhangYifan Zhang
Yifan Zhang
PLPeng Lin
Peng Lin
WRWei Ren
Wei Ren
JFJay A. Farrell
Jay A. Farrell
This brief addresses distributed continuous-time optimization problems with time-varying objective functions. The goal is for multiple agents to cooperatively minimize the sum of local time-varying objective functions with only local interaction and information while explicitly taking into account distributed adaptive gain design. Here, the optimal point is time varying and creates an optimal trajectory. First, for the unconstrained case, a distributed nonsmooth algorithm coupled with a state-dependent gain is proposed. It is shown that the interaction gain for each agent can be computed according to the variation of the Hessian and gradient information of the convex local objective functions so that the algorithm can solve the time-varying optimization problem without imposing a bound on any information about the local objective functions. Second, for the case where there exist common time-varying linear equality constraints, an extended algorithm is presented, where local Lagrangian functions are introduced to address the equality constraints. The asymptotic convergence of both algorithms to the optimal solution is proved. Numerical simulations are presented to illustrate the theoretical results. In addition, the one proposed algorithm is experimentally implemented and validated on a multi-Crazyflie platform.

21 October 2014 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YCYanjiao Chen
Yanjiao Chen
PLPeng Lin
Peng Lin
QZQian Zhang
Qian Zhang
In the spectrum auction, if a buyer locates in a “critical” place, interfering with a lot of other buyers, his occupancy of the spectrum may deprive many other transmission opportunities. In this paper, we propose a Location-aware Online Truthful doUble auction Scheme (LOTUS), which incorporates the buyers' location information into auction mechanism design. In the online auction, the biggest challenge is how to allocate the spectrums based on the knowledge in the current time slot, without knowing the spectrum requests that may come afterward. To solve this problem, we propose considering the opportunity cost of allocating the spectrum to a buyer based on his local interference conditions. We introduce the “interference discount” to markdown a buyer's bid if he induces a wide range of interference. Furthermore, we take into account the spectrum heterogeneity and design mechanisms that guarantee the economic robustness of the auction. The simulation results show that LOTUS outperforms the existing online auction mechanism, significantly improving buyers' and sellers' utility.

1 June 2011
Verified
Conference Paper
Closed access
YCYanjiao Chen
Yanjiao Chen
AZAndrew Zhang
Andrew Zhang
PLPeng Lin
Peng Lin
QZQian Zhang
Qian Zhang
Femtocell technology is regarded as a promising way to deal with poor indoor coverage and increase spectrum spatial reuse. In this paper, we focus on the scenario that macro and femto base stations are deployed by the same Wireless Service Provider (WSP), which treats the revenue maximization as its ultimate target. In such a system, there are several design factors which will affect the overall revenue, including price decision and resource allocation between macrocell and femtocell. In this paper, we propose an economic framework, where users choose either macrocell or femtocell service to optimize their own utility and the monopolistic WSP tries to maximize its revenue via pricing and spectrum allocation strategy. Theoretical results of optimal prices for macrocell and femtocell are given. Extensive theoretical analysis is carried out to determine the spectrum allocation strategy and evaluate the revenue of the WSP. The system capacity and the ratio of macrocell and femtocell users are also discussed. The results have indicated that the revenue of the WSP is significantly improved by combining the pricing strategy and the spectrum allocation strategy.

1 December 2007
Verified
Conference Paper
Closed access
LPLin Peng
Lin Peng
CRCheng-Li Ruan
Cheng-Li Ruan
YZYun Zhang
Yun Zhang
This paper presents a novel compact broad- band patch antenna. The antenna resonance at 0.915, 0.980 and 1.007 GHz, is only 30% area of a conventional design, and a 12.6% bandwidth is achieved. The reduction in area and broadband are achieved by introducing a shorting wall and slot-loaded at the radiating edge of the E-Shaped patch antenna. Details of the proposed compact and broadband design is presented and discussed in this paper.

20 August 2012 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
PLPeng Lin
Peng Lin
AZAndrew Zhang
Andrew Zhang
QZQian Zhang
Qian Zhang
MHMounir Hamdi
Mounir Hamdi
Femto base stations (FBSs) are cost-effective choices for wireless service providers (WSPs) to provide better indoor coverage and capacity in cellular networks. With the introduction of femtocells, spectrum allocation among macro base stations (MBSs) and numerous FBSs becomes challenging. WSPs will allocate resources among hierarchical infrastructures to mitigate mutual interference and maximize WSPs' revenue from service provisioning. In this paper, we propose a channel allocation and service provision framework to help WSPs allocate resources and increase revenue. The spectrum allocation and revenue maximization problem is formulated as a convex problem, and a centralized method is proposed to efficiently solve it. We also propose a distributed algorithm called LD (based on Lagrangian decomposition) to achieve a near-optimal solution with low computational and communication complexity, which can be used when the system is on a large scale. The simulation results show that our scheme can significantly improve the system's revenue.

27 August 2025 in Artificial Intelligence
Verified
Journal Article
Closed access
PLPeng Lin
Peng Lin
SCShaowei Cai
Shaowei Cai
MZMengchuan Zou
Mengchuan Zou
JLJinkun Lin
Jinkun Lin