Ke Xu

Ke Xu

Auto-generated profile, based on publicly available information

Ke Xu

College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 December 2019 in Journal of Nuclear Materials
Verified
Journal Article
Open access
CMChao Meng
Chao Meng
Fei GaoFei Gao
Fei Gao
KXKe Xu
Ke Xu
JHJiannan Hao
Jiannan Hao
Hong-Bo ZhouHong-Bo Zhou
Hong-Bo Zhou
CBC.S. Becquart
C.S. Becquart

25 September 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
KXKe Xu
Ke Xu
YXYouyun Xu
Youyun Xu
Xiaoming WangXiaoming Wang
Xiaoming Wang
Xianbin WangXianbin Wang
Xianbin Wang
Supporting massive access from Internet of Things (IoT) devices plays a pivotal role in the design of 6G networks. Nonetheless, concurrent massive access to the network deteriorates the quality of 6G communications. To overcome the challenge of massive access, our focus shifts to optimizing the age-critical frameless ALOHA (ACFA) random access protocol. The conventional ACFA suffers from high latency and unreliability when massive devices attempt to access the network. Consequently, we introduce an adaptive algorithm to address the transmission issues. This paper optimizes the random access channel (RACH) procedure by maximizing a long-term multi-objective function, which consists of the average age of information (AoI), normalized throughput, traffic load and the average number of successfully accessed machine -type communication devices. To achieve the optimal objective in ACFA, we apply deep reinforcement learning (DRL) algorithms. In our algorithms, agents take action in both distributed and centralized manners. In the distributed approach, each device learns the choice of the access probability and the slot, guided by feedback from the base station (BS). Simultaneously, in the centralized approach, the BS restricts a specific number of devices from accessing the network and dynamically adjusts the frame length based on the transmission results of devices. Our simulation results demonstrate that the proposed scheme surpasses benchmark schemes and exhibits significant potential to minimize AoI performance.

1 November 2008
Verified
Conference Paper
Closed access
WHWei Han
Wei Han
KXKe Xu
Ke Xu
An accurate map of the Internet is very important for studying the network¿s internal structure and network management. The main approach to map the Internet is to collect information from a set of sources by using traceroute-like probes. In a typical mapping project, active measurement sources are relatively scarce while traceroute destinations are plentiful, which makes the sampled graph quite different from the original one. So, it becomes very important to determine how to place these sources such that the sampled graph can be closer to the original one, especially in the case that the number of sources is limited. In this paper, we investigate the relationship between the placement of traceroute sources and their sampled result, which, to our knowledge, has not been systematically studied before. Based on the relationship, we propose a method on how to place the traceroute sources. We show that the graph sampled from sources selected by our method is more accurate than the ones randomly selected. We also validate our conclusion using the raw trace data of skitter project.