places emphasis on naming
the data instead of their location. This design hopes to adapt to the
current Internet's usage patterns due to the majority of internet's
traffic being data retrieval and service access. It may result in stronger network security, routing scalability, and
built-in support for conferencing applications. Content-Centric Networking is especially attractive in mobile wireless networks because of the decoupling of hosts and locations.
More importantly, local sharing is natively supported, thus eliminate the need for redundant data dissemination.
To this end, CCNx,
Haggle, NetInf, and among
others, are giving serious attempts at implementing the future Internet
architecture. Currently, we are building conferencing tools on CCNx and integrating it with Junction.
J. Wei, D. Nguyen, C. Tzeng, S. Ramaswamy. "Collaborative Conference Applications in Content Centric Networks." Demo and Poster
presented at The 1st CCNx Community
Conference, Sept.9, 2011, Palo Alto, CA

Collision-Free Asynchronous Multi-Channel Access

Transmission over multiple
channels raises a
number of challenges including hidden terminals over multiple
channels and node synchronization. The main question is: how do I
assure that my neighbors aware of my channel selection in a multi-hop
environment. In this work, we present a
collision-free asynchronous
multi-channel access protocol for Ad Hoc wireless
networks using a single transceiver. This is accomplished
through an asynchronous split phase together with an
observation phase as well as an unique handshake. Nodes observe
the control channel for a period of time before asynchronously
switching to the negotiated channel
D. Nguyen, J.J. Garcia-Luna-Aceves, and K. Obraczka, "Collision-Free Asynchronous Multi-Channel Access
in Ad Hoc Networks," (Update: fixed analysis errors) Proc.
IEEE
Globecom 2009 Ad Hoc, Sensor and Mesh Networking Symposium, 30 Nov. - 4 Dec., 2009, Honolulu, HI. slides
Source Code: ns-2 Implementation

Minstrel Linux Port (Google Summer Code)

Minstrel is a widely deployed and popular Linux rate
control algorithm based on the Sample Rate Adaptation approach.
Using exponentially weighted moving average (EWMA) statistics,
it sorts out the best throughput, second best throughput
and the highest probability of success for adapting rates. I ported the Minstrel implementation from Linux Kernel to
ns-3 simulator
Collaborators: Ruben Merz (mentor), Tom Henderson, and Mathieu Lacage

Part of the Pacific Rim Undergraduate Experiences (PRIME) funded by
National Science Foundation. I spent one summer doing research at
Monash University in Australia. I worked on the Nimrod Grid Software as well
as setting it on Rocks Clusters.
Collaborators: David Abramson (Monash University), Kim Baldridge (SDSC
and UCSD), Philip Papadopoulos (SDSC), Slavisa Garic, Colin Enticott, and
Tom Peachey.

BOINC (Berkeley Open Infrastructure for Network Computing) is used for harnessing computer power for
computational and scientific research.
GAMESS is a computational software for quantum chemistry. I set up a working BOINC-GAMESS
application and was the main developer behind the project.
Collaborators: Kim Baldridge (mentor), Karan Bhatia, Sriram Krisman, and Jerry Greenberg