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

Zhengrong Ji

dblp:09/5685 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2007
—ORCID · none

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

Computer networks · 6 · 3 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
4 papers
Wireless networking · 44% Network performance modeling · 16% Internet of things and sensor networks · 15%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking
WLAN
0.122007
Point-Casting Service in Wireless Networks · INFOCOM 2007
TWINE: A Hybrid Emulation Testbed for Wireless Networks and Applications · INFOCOM 2006
Internet of things and sensor networks › sensing coverage
coverage control
0.112007
Point-Casting Service in Wireless Networks · INFOCOM 2007
Physical-layer communications › radio propagation
signal attenuation
0.112007
Point-Casting Service in Wireless Networks · INFOCOM 2007
Network performance modeling
network emulation
0.112006
TWINE: A Hybrid Emulation Testbed for Wireless Networks and Applications · INFOCOM 2006
Wireless networking
medium access control
0.012004
Exploiting medium access diversity in rate adaptive wireless LANs · MobiCom 2004
Wireless networking › multiuser wireless systems
multiuser diversity
0.012004
Exploiting medium access diversity in rate adaptive wireless LANs · MobiCom 2004
Embedded and real-time systems
mobile computing
0.012003
iMASH: Interactive Mobile Application Session Handoff · MobiSys 2003
Cellular and mobile networks › power control
power and rate control
0.012007
Point-Casting Service in Wireless Networks · INFOCOM 2007
Content delivery and video streaming
adaptive video streaming
0.012006
TWINE: A Hybrid Emulation Testbed for Wireless Networks and Applications · INFOCOM 2006
Network performance modeling
protocol performance analysis
0.012006
TWINE: A Hybrid Emulation Testbed for Wireless Networks and Applications · INFOCOM 2006
Wireless networking › opportunistic scheduling
channel-aware scheduling
0.012004
Exploiting medium access diversity in rate adaptive wireless LANs · MobiCom 2004
Wireless networking › link adaptation
rate adaptation
0.012004
Exploiting medium access diversity in rate adaptive wireless LANs · MobiCom 2004
Edge and fog computing › mobile edge computing › computation offloading › mobile computation offloading
cyber foraging
0.012003
iMASH: Interactive Mobile Application Session Handoff · MobiSys 2003

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

middleware · 0.1content adaptation · 0.1testbed experimentation · 0.1packet fragmentation · 0.1encoding · 0.1simulation · 0.1emulation · 0.1receiver scheduling · 0.0channel probing · 0.0analytical modeling · 0.0proxy · 0.0
YearPublicationVenuePosition
2007 Point-Casting Service in Wireless Networks
abstract
The broadcast nature of existing wireless LANs can produce excessive radio coverage which is often undesirable for applications like wireless IPTV or location-based service. To address this issue, we utilize the characteristics of signal attenuation common to all wireless communications and implement apoint-castingservice1(PCast) over existing wireless networks that can significantly restrict the coverage for transmissions. The principle of PCast is to split and encode the downlink traffic and deliver it to the client via a few surrounding access points (APs). Hence, an unintended client cannot decode a packet without all its fragments. Equivalently, the service area is bounded within the intersection of communication coverage of all APs. The result coverage area can be further reduced via rate and power control at the APs. In this paper, we present our design and implementation of the PCast service on top of an 802.11a wireless LAN. Experiments conducted in a lab environment show that PCast can bound the service region to be within 2 meters around a client, while incurring jitter of less than 1ms, and bandwidth capacity loss of less than 10%.
Zhengrong Ji, Maneesh Varshney, Junlan Zhou, Rajive L. Bagrodia
INFOCOM1
2006 TWINE: A Hybrid Emulation Testbed for Wireless Networks and Applications
abstract
In this paper, we present a high fidelity and efficient emulation framework called TWINE, which combines the accuracy and realism of emulated and physical networks and the scalability and repeatability of simulation in an integrated testbed, for evaluation of real protocols and applications. Our measurements show that the TWINE emulation kernel has a memory footprint of less than 100KB, and occupies no more than 3.5 % CPU cycles. Thanks to such small overhead and the accurate modelling of physical layer events(at microseconds level), application throughput measured in TWINE is within 5 % of the measured throughput from an equivalent physical wireless LAN. A single commodity PC in TWINE can emulate at least four wireless hosts or simulate sixty nodes in real time at microseconds granularity. This paper also illustrates TWINE’s novel capabilities via two case studies: a protocol to maintain fairness in mesh networks and an adaptive streaming media application operating in heterogeneous wireless networks. The results from the case studies clearly show the benefit of the TWINE evaluation methodology, by identifying a mismatch between the performance of the protocol or application based on actual user experience versus its performance as measured using traditional network performance metrics such as application throughput. 1.
Junlan Zhou, Zhengrong Ji, Rajive L. Bagrodia
INFOCOM2
2006 Modeling environmental mobility and its effect on network protocol stack
abstract
In this paper we address the effects of environmental mobility, that is, the ambient motion of entities like people and vehicles in the vicinity of wireless communication, on the channel characteristics and wireless network performance. We present a three step process of measurements, modeling and network simulations to quantify the significance of environmental mobility. Our field experiments show that presence of people not only cause deep fades but also distorts the fading distribution. We model the shadowing loss by three knife-edge diffraction model and propose a two-state Markov process channel fading behavior. The models are validated against measurement data and implemented in a network simulator. The models are scalable and incur execution overhead less than 15%. We also show the impact of environment mobility on protocol performance by means of two simulation case studies. We show that MAC layer data rate adaptation behavior is sensitive to environmental mobility and can result in 40% packets being delivered at lower rates. Second study on ad-hoc network performance show the throughput is decreased by 20%. We have identified that with environmental mobility the links are more sensitive to interference and the routes are less stable
Maneesh Varshney, Zhengrong Ji, Mineo Takai, Rajive L. Bagrodia
WCNC2
2004 Exploiting medium access diversity in rate adaptive wireless LANs
abstract
Recent years have seen the growing popularity of multi-rate wireless network devices (e.g., 802.11a cards) that can exploit variations in channel conditions and improve overall network throughput. Concurrently, rate adaptation schemes have been developed that selectively increase data transmissions on a link when it offers good channel quality. In this paper, we propose a Medium Access Diversity (MAD) scheme that leverages the benefits of rate adaptation schemes by aggressively exploiting multiuser diversity. The basic mechanism of MAD is to obtain instantaneous channel condition information from multiple receivers and selectively transmit data to a receiver that improves the overall throughput of the network, while maintaining temporal fairness among multiple data flows. We identify and address the challenges in the design and implementation of MAD's three phases: channel probing, data transmission, and receiver scheduling. We also use analytical models to examine the tradeoff between network performance improvement and overhead of channel probing, and derive an asymptotic performance bound for the receiver scheduling algorithms used by MAD. Results from the analysis and the extensive simulations demonstrate that, on average, MAD can improve the overall throughput of IEEE 802.11 wireless LANs by 50% as compared with the best existing rate adaptation scheme.
Zhengrong Ji, Yi Yang 0051, Junlan Zhou, Mineo Takai, Rajive L. Bagrodia
MobiCom1
2004 Scalable simulation of large-scale wireless networks with bounded inaccuracies
abstract
Discrete event network simulators have emerged as popular tools for verification and performance evaluation for various wireless networks. Nevertheless, the desire to model such networks at high fidelity implies high computational costs, prohibiting most researchers from simulating wireless networks with thousands of nodes. There have been attempts on performance optimizations for large-scale wireless network simulation, but they have not appropriately modeled accumulation of weak interference, thereby suffering inaccuracies which may be magnified by upper layer protocols. This paper presents analysis of the effects of common optimization techniques for large-scale wireless network simulation on the overall network performance and also proposes modifications and novel techniques that introduce only limited inaccuracies or no additional inaccuracy at all. The study quantifies the effects of those optimizations on the simulation results for given thresholds and network parameters, and also identifies thresholds tolerable to most network studies. The experimental results show that these optimizations can improve the runtime performance of an already efficient wireless network simulator substantially, by a factor of up to 55 for wireless networks with 3200 nodes without compromising accuracy of the simulation results.
Zhengrong Ji, Junlan Zhou, Mineo Takai, Rajive L. Bagrodia
MSWiM1
2003 iMASH: Interactive Mobile Application Session Handoff
abstract
Mobile computing research has often focused on untethering an in-use computing device, rather than enabling the mobility of the computation task itself. This paper presents an architecture, implementation, and experimental evidence that together validate a new continuous computing concept, application session handoff. The iMASH architecture leverages previous work on proxies, content adaptation, and client awareness to provide a unique, middleware-enable capability for continuous computing. Implementation in both socket- and RPC-based environments shows that very fast, secure session handoff of non-trivial client/server applications across heterogeneous client devices and network is feasible: experiments on a number of applications yielded handoff latencies ranging from 0.5s to 2s.
Rajive L. Bagrodia, S. Bhattacharyya, Fred Cheng, Steve Gerding, Glenn Glazer, Richard G. Guy, Zhengrong Ji, Jinsong Lin, Thomas Phan, Erik Skow, Maneesh Varshney, George Zorpas
MobiSys7