Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lu Chen 0010

dblp:69/157-10 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 7 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
7 papers
Wireless networking · 36% Physical-layer communications · 31% Cellular and mobile networks · 15%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 22 heaviest of 25, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › interference management
interference-averaging MAC
0.622019
EMIT: An Efficient MAC Paradigm for the Internet of Things · IEEE/ACM Trans. Netw. 2019
EMIT: An efficient MAC paradigm for the Internet of Things · INFOCOM 2016
Wireless networking
medium access control
0.632019
EMIT: An Efficient MAC Paradigm for the Internet of Things · IEEE/ACM Trans. Netw. 2019
CoReCast: Collision Resilient Broadcasting in Vehicular Networks · MobiSys 2018
EMIT: An efficient MAC paradigm for the Internet of Things · INFOCOM 2016
Physical-layer communications › relaying › duplex relaying
full-duplex relaying
0.412019
Verification: Constructive and Destructive Full Duplex Relays · MobiCom 2019
Wireless networking › wireless link
full-duplex wireless
0.412019
Verification: Constructive and Destructive Full Duplex Relays · MobiCom 2019
Physical-layer communications › modulation › multicarrier modulation
OFDM
0.412019
Verification: Constructive and Destructive Full Duplex Relays · MobiCom 2019
Wireless networking
multi-channel communication
0.312018
High Throughput Low Delay Wireless Multicast via Multi-Channel Moving Window Codes · INFOCOM 2018
Vehicular, aerial and satellite networks
vehicular networks
0.312018
CoReCast: Collision Resilient Broadcasting in Vehicular Networks · MobiSys 2018
Wireless networking › wireless group communication
wireless multicast
0.312018
High Throughput Low Delay Wireless Multicast via Multi-Channel Moving Window Codes · INFOCOM 2018
Coding theory
network coding
0.312018
High Throughput Low Delay Wireless Multicast via Multi-Channel Moving Window Codes · INFOCOM 2018
Coding theory › constrained coding
sliding window codes
0.312018
High Throughput Low Delay Wireless Multicast via Multi-Channel Moving Window Codes · INFOCOM 2018
Physical-layer communications
full-duplex
0.312017
BiPass: Enabling End-to-End Full Duplex · MobiCom 2017
Physical-layer communications
interference cancellation
0.212016
BASIC: backbone-assisted successive interference cancellation · MobiCom 2016
Cellular and mobile networks
interference management
0.212016
BASIC: backbone-assisted successive interference cancellation · MobiCom 2016
Physical-layer communications › multiple access
multi-user uplink
0.212016
BASIC: backbone-assisted successive interference cancellation · MobiCom 2016
Physical-layer communications › interference cancellation
successive interference cancellation
0.212016
BASIC: backbone-assisted successive interference cancellation · MobiCom 2016
Wireless networking › medium access control
carrier sense multiple access
0.222019
EMIT: An Efficient MAC Paradigm for the Internet of Things · IEEE/ACM Trans. Netw. 2019
EMIT: An efficient MAC paradigm for the Internet of Things · INFOCOM 2016
Wireless networking › wireless link › full-duplex wireless
in-band full-duplex
0.112019
Verification: Constructive and Destructive Full Duplex Relays · MobiCom 2019
Network performance modeling
delay analysis
0.112018
High Throughput Low Delay Wireless Multicast via Multi-Channel Moving Window Codes · INFOCOM 2018
Network performance modeling
large deviations
0.112018
High Throughput Low Delay Wireless Multicast via Multi-Channel Moving Window Codes · INFOCOM 2018
Wireless networking
mobile ad hoc networks
0.112017
BiPass: Enabling End-to-End Full Duplex · MobiCom 2017
Content delivery and video streaming › bitrate adaptation
rate selection
0.112016
BASIC: backbone-assisted successive interference cancellation · MobiCom 2016
Wireless networking › wireless network optimization
throughput optimization
0.112016
BASIC: backbone-assisted successive interference cancellation · MobiCom 2016

Methods — techniques the papers use, named apart from their topics

trace-driven simulation · 0.7large deviations theory · 0.7signal analysis · 0.4power-rate allocation · 0.4interference averaging · 0.4routing algorithms · 0.3interference cancellation · 0.3testbed experimentation · 0.2stochastic modeling · 0.2greedy algorithm · 0.2
YearPublicationVenuePosition
2019 Verification: Constructive and Destructive Full Duplex Relays
abstract
With recent advances in in-band full duplex techniques, full duplex capable relays have been shown feasible in many recent works. Instead of generating data itself to transmit, a full duplex relay can forward the received signal while receiving it. It also has the opportunity to properly modify the signal before forwarding it, which has been explored to enable constructive and destructive full duplex relaying recently. With these designs, the signal through the full duplex relay could constructively or destructively add up with the signal from the direct link at the receiver side. As a result, the received signal power may be boosted or greatly reduced, compared with direct forwarding. In this paper, we do detailed analysis on whether such constructive and destructive full duplex relays are possible. We find that for OFDM signals, such relays can not be achieved if the additional latency of the relayed path is more than one sample time than the direct link. Our analysis and results challenge the assumptions on the relay latency requirements of previous works to realize such systems.
Lu Chen 0010, Kannan Srinivasan 0001
MobiCom1
2019 EMIT: An Efficient MAC Paradigm for the Internet of Things
abstract
The future Internet of Things (IoT) networks are expected to be composed of a large population of low-cost devices communicating dynamically with access points or neighboring devices to communicate small bundles of delay-sensitive data. To support the high-intensity and short-lived demands of these emerging networks, we propose an efficient MAC paradigm for IoT (EMIT). Our paradigm bypasses the high overhead and coordination costs of existing MAC solutions by employing an interference-averaging strategy that allows users to share their resources simultaneously. In contrast to the predominant interference-suppressing approaches, EMIT exploits the dense and dynamic nature of IoT networks to reduce the spatio-temporal variability of interference to achieve low-delay and high-reliability in service. This paper introduces foundational ideas of EMIT by characterizing the global interference statistics in terms of single-device operation and develops power-rate allocation strategies to guarantee low-delay high-reliability performance. A significant portion of our work is aimed at validating these theoretical principles in experimental test beds and simulations, where we compare the performance of EMIT with a CSMA-based MAC protocol. Our comparisons confirm the beneficial characteristics of EMIT and reveal significant gains over CSMA strategies in the case of IoT traffic.
Arjun Bakshi, Lu Chen 0010, Kannan Srinivasan 0001, Can Emre Koksal, Atilla Eryilmaz
IEEE/ACM Trans. Netw.2
2018 High Throughput Low Delay Wireless Multicast via Multi-Channel Moving Window Codes
abstract
A fundamental challenge in wireless multicast has been how to simultaneously achieve high-throughput and low-delay for reliably serving a large number of users. In this paper, we show how to harness substantial throughput and delay gains by exploiting multi-channel resources. We develop a new scheme called Multi-Channel Moving Window Codes (MC-MWC) for multi-channel multi-session wireless multicast. The salient features of MC-MWC are three-fold. (i) High throughput: we show that MC-MWC achieves order-optimal throughput in the many-user many-channel asymptotic regime. Moreover, the number of channels required by a conventional channel-allocation based scheme is shown to be doubly-exponentially larger than that required by MC-MWC. (ii) Low delay: using large deviations theory, we show that the delay of MC-MWC decreases linearly with the number of channels, while the delay reduction of conventional schemes is no more than a finite constant. (iii) Low feedback overhead: the feedback overhead of MC-MWC is a constant that is independent of both the number of receivers in each session and the number of sessions in the network. Finally, our trace-driven simulation and numerical results validate the analytical results and show that the implementation complexity of MC-MWC is low.
Fei Wu 0008, Yin Sun 0001, Lu Chen 0010, Jackie Xu, Kannan Srinivasan 0001, Ness Shroff
INFOCOM3
2018 CoReCast: Collision Resilient Broadcasting in Vehicular Networks
abstract
Reliable and timely delivery of periodic V2V (vehicle-to-vehicle) broadcast messages is essential for realizing the benefits of connected vehicles. Existing MAC protocols for ad hoc networks fall short of meeting these requirements. In this paper, we present, CoReCast, the first collision embracing protocol for vehicular networks. CoReCast provides high reliability and low delay by leveraging two unique opportunities: no strict constraint on energy consumption, and availability of GPS clocks to achieve near-perfect time and frequency synchronization.
Tanmoy Das, Lu Chen 0010, Rupam Kundu, Arjun Bakshi, Prasun Sinha, Kannan Srinivasan 0001, Gaurav Bansal, Takayuki Shimizu
MobiSys2
2017 BiPass: Enabling End-to-End Full Duplex
abstract
Full duplex techniques can potentially double the channel capacity and achieve lower delays by empowering two radios to simultaneously transmit in thesame frequency band.However, full duplex is only available between two adjacent nodes within the communication range. In this paper, we present BiPass to break this limitation.With the help of full duplex capable relays, weenable simultaneous bidirectional in-band cut-through transmissions between two far apart nodes, so they can do full duplex communications as if they were within each other's transmission range.To design such a system, we analyze interference patterns and propose a loop-back interference cancellation strategy. We identify the power amplification problem at relay nodes and develop an algorithm to solve it. We also develop a routing algorithm, an opportunistic forwarding scheme, and a real-time feedback strategy to leverage this system in ad-hoc networks.To evaluate the real world performance of BiPass, we build a prototype and conduct experiments using software defined radios. We show that BiPass can achieve 1.6x median throughput gain over state-of-the-art one-way cut-through systems, and 4.09x gain over the decode-and-forward scheme. Our simulations further reveal that even when the data traffic is not bidirectional, BiPass has 1.36x throughput gain and 47\% delay reduction overone-way cut-through systemsin large networks.
Lu Chen 0010, Fei Wu 0008, Kannan Srinivasan 0001, Ness Shroff
MobiCom1
2016 EMIT: An efficient MAC paradigm for the Internet of Things
abstract
The future Internet of Things (IoT) networks are expected to be composed of a large population of low-cost devices communicating dynamically with access points or neighboring devices to communicate small bundles of delay-sensitive data. To support the high-intensity and short-lived demands of these emerging networks, we propose an Efficient MAC paradigm for IoT (EMIT). Our paradigm bypasses the high overhead and coordination costs of existing MAC solutions by employing an interference-averaging strategy that allow users to share their resources simultaneously. In contrast to the predominant interference-suppressing approaches, EMIT exploits the dense and dynamic nature of IoT networks to reduce the spatio-temporal variability of interference to achieve low-delay and high-reliability in service. This paper introduces foundational ideas of EMIT by characterizing the global interference statistics in terms of single-device operation and develops power-rate allocation strategies to guarantee low-delay high-reliability performance. A significant portion of our work is aimed at validating these theoretical principles in experimental testbeds, where we compare the performance of EMIT to a CSMA-based MAC protocol. Our comparisons confirm the beneficial characteristics of EMIT, and reveal significant gains over CSMA strategies in the case of IoT traffic.
Arjun Bakshi, Lu Chen 0010, Kannan Srinivasan 0001, Can Emre Koksal, Atilla Eryilmaz
INFOCOM2
2016 BASIC: backbone-assisted successive interference cancellation
abstract
To meet the growing demand for wireless data, it is time to move away from the age-old paradigm of prohibiting interfering nodes from transmissions. Instead, through proactive management of interference among multiple colliding packets, we can design high throughput wireless systems. This is well explored in the Information Theory community and there are also a few implementational efforts that have been recently reported. The existing solutions are nontrivial to use in real systems as they require either tight time/frequency synchronization or exchange of data between transmitters prior to the transmissions. These requirements are hard to meet in practice especially for uplink transmissions. This paper proposes BASIC, a lightweight multi-user uplink transmission strategy that does not require tight synchronization or exchange of samples among nodes, which makes it an attractive alternative compared to its counterparts. BASIC exploits receiver diversity by controlling the data rates of the clients. A novel greedy algorithm is proposed for data rate selection. We implement BASIC on a software-defined radio platform. Our experiments on a real testbed show that BASIC outperforms TDMA by 48% in terms of overall throughput. Our trace-driven simulations show up to 4.8x gain in throughput with similar flow fairness.
Tanmoy Das, Lu Chen 0010, Kannan Srinivasan 0001, Prasun Sinha
MobiCom3