Weiwei Chen

Weiwei Chen

Auto-generated profile, based on publicly available information

Weiwei Chen

School of Computer Engineering and Science, Shanghai University, Shanghai, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
13 April 2018 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
WCWeiwei Chen
Weiwei Chen
WDWang Dong
Wang Dong
Keqin LiKeqin Li
Keqin Li
Mobile Edge Cloud Computing (MECC) has becoming an attractive solution for augmenting the computing and storage capacity of Mobile Devices (MDs) by exploiting the available resources at the network edge. In this work, we consider computation offloading at the mobile edge cloud that is composed of a set of Wireless Devices (WDs), and each WD has an energy harvesting equipment to collect renewable energy from the environment. Moreover, multiple MDs intend to offload their tasks to the mobile edge cloud simultaneously. We first formulate the multi-user multi-task computation offloading problem for green MECC, and use Lyaponuv Optimization Approach to determine the energy harvesting policy: how much energy to be harvested at each WD; and the task offloading schedule: the set of computation offloading requests to be admitted into the mobile edge cloud, the set of WDs assigned to each admitted offloading request, and how much workload to be processed at the assigned WDs. We then prove that the task offloading scheduling problem is NP hard, and introduce centralized and distributed Greedy Maximal Scheduling algorithms to resolve the problem efficiently. Performance bounds of the proposed schemes are also discussed. Extensive evaluations are conducted to test the performance of the proposed algorithms.

30 August 2018 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
YTYang Tian
Yang Tian
WCWeiwei Chen
Weiwei Chen
CLChin-Tau Lea
Chin-Tau Lea
Accurate traffic matrix estimation is critical to solving many networking problems, such as routing and network provisioning, etc. This task in a traditional IP network is tackled with link load measurements. But the accuracy of such an approach is low because the underlying system of linear equations governing the traffic estimation problem is highly under-determined in this approach. A software-defined network (SDN) provides measurements of more types of flows, and thus opens up new opportunities for tackling the traffic matrix estimation problem. Furthermore, the controller of an SDN can dynamically install flows in the flow table of an SDN router for traffic measurement. But there is one constraint: the number of entries in a flow table for traffic measurement is limited because the flow table in an SDN node is usually constructed with expensive ternary content addressable memory (TCAM) devices. How to use the limited number of entries in a flow table for traffic measurement is a challenging task in SDNs. In this paper, we present a new framework for solving the traffic matrix estimation problem in an SDN-based IP network. An important feature of the proposed framework is that any flow added to the flow table of an SDN router can increase the rank of the underlying equations governing the traffic matrix estimation problem. This greatly improves the utilization efficiency of TCAM entries for traffic measurement. Detailed performance evaluation given in this paper demonstrates that the proposed approach can achieve significant performance gains over other approaches.

31 October 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
WCWeiwei Chen
Weiwei Chen
CLChin-Tau Lea
Chin-Tau Lea
SHShiming He
Shiming He
ZXZhe XuanYuan
Zhe XuanYuan
In spatial time division multiple access wireless mesh networks, not all links can be activated simultaneously, as links scheduled for transmission must satisfy the specified SINR requirements. Previously, slot assignment has been done on a link basis, where a set of links is selected for transmission in a given slot. However, if selected links are in deep fade or have no traffic to transmit, the slot is wasted. Thus, a node-based scheme was proposed, where a set of nodes is selected for transmission. Which link to be used by a node depends on the links' instantaneous traffic load. Although this allows us to exploit multi-user diversity, it creates a planning discrepancy: slot assignment is designed based on long-term channel statistics, but scheduling on short-term channel fading conditions. Consequently, the performance gain of the node-based scheme is not consistent: it is marginal under certain scenarios. To avoid the design discrepancy, we develop a new slot-assignment and routing framework in this paper. The new approach incorporates short-term channel fading statistics to optimize the long term slot assignment, routing and scheduling simultaneously. Hence, multi-user diversity can be exploited more efficiently. Not only is the performance gain of the resulting system significant (can be as much as 64% higher throughput than the scheme introduced by Chen and Lea), it is also less topology dependent compared with the one by Chen and Lea.

3 March 2025 in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
Verified
Journal Article
Open access
KSKai Sun
Kai Sun
SWShuai Wang
Shuai Wang
RZRenjie Zhao
Renjie Zhao
RLRuofeng Liu
Ruofeng Liu
WCWeiwei Chen
Weiwei Chen
wei gongwei gong
wei gong
Wireless localization, especially using ubiquitous Wi-Fi devices, has been studied for decades. However, due to complex signal propagation, resolving multiple reflected paths and further achieving accurate localization face great challenges in the localization precision and localization range, which are caused by the limited bandwidth and sensitivity of Wi-Fi signals respectively. Straightforwardly solving these challenges by employing wide bandwidth Wi-Fi is only helpful for improving precision, while the localization range is still short due to Wi-Fi's intrinsic vulnerability to SNR drop. This paper presents Wi-Fi-UWB Localization (WULoc) to achieve both precise and long-range localization for Wi-Fi devices. Specifically, WULoc leverages the picosecond level timestamp information that is extracted from the links of the Wi-Fi device to multiple UWB anchors, innovatively created by the proposed Wi-Fi-UWB connection establishment, which overcomes the incompatibility between Wi-Fi and UWB physical layers. WULoc further calculates the TDoA of Wi-Fi-UWB links, from which the location of the Wi-Fi device is estimated. Extensive experiments show that WULoc locates a Wi-Fi device at a range of 240 meters with a precision of 5.3 meters.

4 July 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
WCWeiwei Chen
Weiwei Chen
SWShuai Wang
Shuai Wang
THTian He
Tian He
LoRa Wide Area Network (LoRaWAN) is famous for its low power consumption and wide coverage area. A critical issue that constrains the scalability of LoRaWAN is how to support concurrent packet reception efficiently. To this end, our work first carefully investigates all the hardware imperfections between a LoRa transceiver pair and studies their impacts on the received signal's temporal patterns with fine granularity. Such imperfections and the associated temporal patterns are intrinsic and unique for any transceiver pair in a wireless system. Therefore, they provide a brand-new and highly influential perspective for identifying different packets. Motivated by this, we propose Magnifier, which integrates the two factors mentioned above for LoRa concurrent decoding. Though some prior work leverage partial hardware imperfections, they fail to systematically study and exploit the temporal patterns caused by the imperfections for concurrent packet reception. We also evaluate the performance of Magnifier with 40 transmitters (commodity LoRa chips) and one receiver (USRP B210). Both critical complexity analysis and extensive experiments show that with the same hardware settings and the same scale of complexity, Magnifier can support 3× to 8× throughput of other existing schemes.

28 October 2025
Verified
Conference Paper
Open access
WCWenchang Chai
Wenchang Chai
JLJinhong Liu
Jinhong Liu
ZZZiyue Zhang
Ziyue Zhang
XXXianjin Xia
Xianjin Xia
YZYuanqing Zheng
Yuanqing Zheng
TGTao Gu
Tao Gu