CCCiyuan Chen

Ciyuan Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ciyuan Chen has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • AirLoc: A QoS-Aware Mobile Location Service Framework via UAV-Assisted LoRa Networks

    by Ciyuan Chen, Zhuqing Xu, Feng Shan, Runqun Xiong, Weizheng Wang, Zhimeng Yin, Ye Wei, Junzhou Luo, Xiaohua Jia

  • Enhancing Link Performance for Mobile LoRa Networks

    by Ciyuan Chen, Zhuqing Xu, Runqun Xiong, Dian Shen, Weizheng Wang, Junzhou Luo, Xiaohua Jia

    LoRa, as a typical representative of Low Power Wide Area Networks (LPWAN), has been widely used to connect massive IoT devices. However, in mobile applications, there is significant packet loss in LoRa transmission due to link performance degradation. Existing studies take little account of end-devices’ movement, particularly when the movement pattern is unknown. We propose LMLoRa to enhance the Link Performance for Mobile LoRa networks in general scenarios for both single-gateway and multi-gateway applications. The key observation is that, due to LoRa’s unique feature, repeating the original packet content enables the use of smaller, more energy-saving transmission parameters, which not only enhances link performance but also reduces energy consumption. Technically, we propose a link performance estimation model based on packet content repetition for both single-gateway and multi-gateway mobile networks. Then, we propose the corresponding channel frequency selection model to avoid transmission collisions. Finally, we design low-overhead communication mechanisms to operate the system. To evaluate the performance of LMLoRa in various scenarios, we design and implement real-world testbeds and a simulation platform for both single-gateway and multi-gateway scenarios. Extensive results show that LMLoRa improves packet delivery ratio by an average of 33.4$\%$ to 69.2$\%$ compared with the state-of-the-art.


  • Multi-AAV-Assisted On-Demand Charging in Dense Wireless Rechargeable Sensor Networks

    by Runqun Xiong, Ciyuan Chen, Jiajun Xu, Xirui Dong, Jiahang Pu

    Wireless rechargeable sensor networks (WRSNs) have emerged as a promising solution to overcome the energy bottleneck in traditional battery-powered sensor networks. However, the uncertain energy demands and dense deployment of sensor nodes pose significant challenges to efficient charging scheduling in WRSNs. To address these challenges, this paper proposes a novel Multi-UAV assisted On-demand Partial Charging Scheduling (MOPCS) algorithm. MOPCS integrates the advantages of one-to-many charging, partial charging, and dynamic multi-UAV coordination to maximize the network lifetime and energy utilization. The key contributions of this work include a real-time adaptive charging scheduling trigger mechanism, an energy-efficient charging cluster division method, a spatiotemporally balanced task allocation among multiple UAVs, and a hybrid priority-based charging path planning algorithm. Extensive simulations demonstrate that MOPCS significantly outperforms state-of-the-art algorithms in terms of charging request response timeliness, node survival rate, and UAV energy efficiency, especially in dense network deployments. This work provides valuable insights and practical solutions for the design and optimization of UAV-assisted charging scheduling in WRSNs, paving the way for more sustainable and scalable wireless sensor networks in various application scenarios.


  • Leveraging Imperfect-Orthogonality Aware Scheduling for High Scalability in LPWAN

    by Zhuqing Xu, Junzhou Luo, Zhimeng Yin, Shuai Wang, Ciyuan Chen, Jingkai Lin, Runqun Xiong, Tian He

    As an emerging Low-Power Wide Area Networks (LPWAN) technology, LoRa is dedicated to providing long-range connections for pervasive Internet-of-Things devices. As LoRa operates in the unlicensed spectrum with an ALOHA-based MAC-layer protocol stack, transmissions from multiple LoRa end-devices inevitably collide with each other, leading to packet losses and increased transmission delay. Targeting at collisions caused by interferences under the same spreading factor (SF) settings, researchers introduce multiple lines of techniques. Despite their efforts, these techniques commonly neglect the potential collisions caused by interferences under different SF settings, resulting in imperfect orthogonality. Given the disparate transmission power configurations and diverse deployed locations, the collisions under different SFs commonly exist in practical networks and significantly limit the LoRa reliability. This paper presents X-MAC, the first scheduler aware of imperfect orthogonality. Technically, X-MAC detects the collisions under different SFs via tracking historical transmissions, and performs dynamic channel scheduling to avoid collisions caused by interferences under the same and different SFs. Extensive evaluations on testbed devices show that, compared with the state-of-the-art methods, X-MAC boosts the network scalability (number of concurrent end-devices) by 1.26× to 2.41× with packet reception rate requirement of > 95%.


  • Open Access

    CH-MAC: Achieving Low-latency Reliable Communication via Coding and Hopping in LPWAN

    by Junzhou Luo, Zhuqing Xu, Jingkai Lin, Ciyuan Chen, Runqun Xiong

    Wireless sensing has emerged as a powerful environmental sensing technology that is vulnerable to the impact of all kinds of ambient noises. LoRa is a novel interference-resilient technology of low-power wide-area networks (LPWAN), which has attracted wide attention from scientific and industrial communities. However, LoRa transmission suffers from serious latency in those complex wireless sensing environments requiring transmission reliability. In this article, we present CH-MAC, the first MAC-layer protocol based on the local corruption nature of packets and the time-varying nature of channels to reduce end-to-end transmission latency in LPWAN with reliable communication requirements. Specifically, CH-MAC employs Luby Transform code to divide and encode the payload into several blocks such that the receiver can retain part of the coded information in the corrupted packets. In addition, CH-MAC utilizes hopping to transmit different blocks of a packet with various channels to avoid sudden noise collision. Moreover, CH-MAC adopts a dynamic packet length adjustment mechanism to mitigate network congestion. Extensive evaluations on a real-world hardware testbed and a simulation platform show that CH-MAC can reduce end-to-end transmission latency by 2.63× with a communication success rate requirement of >95% compared with state-of-the-art methods.


  • Enabling large-scale low-power LoRa data transmission via multiple mobile LoRa gateways

    by Ciyuan Chen, Junzhou Luo, Zhuqing Xu, Runqun Xiong, Dian Shen, Zhimeng Yin


  • Enabling Distributed and Optimal RDMA Resource Sharing in Large-Scale Data Center Networks: Modeling, Analysis, and Implementation

    by Dian Shen, Junzhou Luo, Fang Dong, Xiaolin Guo, Ciyuan Chen, Kai Wang, John C. S. Lui

    Remote Direct Memory Access (RDMA) suffers from unfairness issues and performance degradation when multiple applications share RDMA network resources. Hence, an efficient resource scheduling mechanism is urged to optimally allocates RDMA resources among applications. However, traditional Network Utility Maximization (NUM) based solutions are inadequate for RDMA due to three challenges: 1) The standard NUM-oriented algorithm cannot deal with coupling variables introduced by multiple dependent RDMA operations; 2) The stringent constraint of RDMA on-board resources complicates the standard NUM by bringing extra optimization dimensions; 3) Naively applying traditional algorithms for NUM suffers from scalability issues in solving a large-scale RDMA resource scheduling problem. In this paper, we present how to optimally share the RDMA resources in large-scale data center networks with a distributed manner. First, we propose Distributed RDMA NUM (DRUM) to model the RDMA resource scheduling problem as a new variation of the NUM problem. Second, we present distributed algorithms to efficiently solve the large-scale, interdependent RDMA resource sharing problem for different RDMA use cases. Through theoretical analysis, the convergence and parallelism of proposed algorithms are guaranteed. Finally, we implement the algorithms as a kernel-level indirection module in the real-world RDMA environment, so as to provide end-to-end resource sharing and performance guarantee. Through extensive evaluations by large-scale simulations and testbed experiments, we show that our method significantly improves applications’ performance under resource contention, achieving $1.7-3.1\times$ higher throughput, and in a dynamic context, the largest performance improvement reaches $98.1\%$ and $64.1\%$ in terms of latency and throughput, respectively.


  • A CPU Load-awared Virtual Router Placement Strategy in Cloud Network

    by Mingxuan Yang, Fang Dong, Dian Shen, Yi Zhai, Ciyuan Chen

    With the increment of the scale of users and networks, network virtualization technology has been widely used by service providers in cloud networks to address elastic network demands. As a fundamental network virtualization component realizing cross-tenant traffic routing, the placement of virtual routers has become a considerable factor influencing the network performance. And through in-depth experiments, we also found that CPU load augments may well incur a significant degradation in network throughput performance, revealing the problems of the placement of virtual routers in existing cloud network modes: 1) Ignore the bandwidth loss caused by the CPU load variation. 2) Lack of theoretical support for the optimal scheme. Based on these above, we propose a CPU load-aware virtual router placement strategy, which balances the computing load situation of each virtual router, and adopts branch and bound algorithm and convex optimization to achieve the approximate optimal placement within 0.1% error. We have evaluated our strategy in our cloud testbed, and find a 20% improvement in terms of cross-tenant throughput compared with the worst case of existing strategies,