[CPCC] TALK TODAY 11AM: Wireless Networks

Ender Ayanoglu ayanoglu at uci.edu
Wed Jun 9 09:33:16 PDT 2004


Dr. Elif Uysal

Massachusetts Institute of Technology

Bounds, Algorithms and Protocols
for Information Flow in Wireless Networks

Wednesday, June 9, 2004, 11:00AM
Engineering Tower 331

Abstract:
There are many open questions related to the design of new and envisioned
wireless data networks. These questions are increasingly on the boundary of
networking and information theories. This is the case not only in networks
with little or no pre-established infrastructure, such as ad-hoc networks
and sensor networks, but also in centralized wireless networks, due to the
packetized and bursty nature of data, and different service demands from
multiple streams of data accessing common resources. Conventional
treatments of wireless communication do not adequately address the design
of such networks.

This talk will have three parts. The first will be on packet scheduling for
optimal energy. We present a formulation that, unlike conventional approaches,
captures the discreteness in the packet generation process and delay
constraints, while being directly analyzable. The offline analysis of our
model yields an explicit schedule for point-to-point communication, and an
iterative algorithm for determining optimal schedules in multi-user
settings, which provide lower bounds on any online algorithm. The model
also suggests a simple but effective online heuristic.

The second part will be on ad-hoc and sensor networks. We will present an
improvement of the known achievable no-relaying throughput in an ad-hoc
network. We then talk about the design of an actual sensor network, and
point to some critical issues for such networks that are not adequately
studied in the theoretical literature. We give examples from a measurement
study of link quality on a testbed, and present an efficient protocol for
making link quality assessments.

Lastly, we will talk about recent work on downlink scheduling. Downlink
scheduling has usually been studied in a TDMA setting. We consider the use
of broadcast coding in a MIMO downlink system, and notice that scheduling
plays a major role in approaching network capacity.

Speaker's Biography:

Elif Uysal received the Ph.D. degree in Electrical Engineering from
Stanford University in 2003, the S.M. degree in Electrical Engineering and
Computer Science from the Massachusetts Institute of Technology (MIT) in
1999, and the B.S. degree from ODTU, Ankara, Turkey, in 1997. Since
September of 2003, she has been a postdoctoral lecturer at MIT, and a
member of the MIT Research Laboratory for Electronics. Her research
interests are in networking, particularly at the junction of networking and
information theory in the context of wireless networks. She has received
the MIT Vinton Hayes Fellowship and the Stanford Graduate Fellowship.


More information about the CPCC mailing list