| We study the problem of joint congestion control and scheduling in
wireless networks. We model the wireless network as a directed graph
$G=(V,E)$, where $V$ denotes the set of nodes and $E$ denotes the set of
wireless links between the nodes. We propose a joint congestion control
and scheduling scheme that achieves a fraction $K(G)$ of the capacity
region, where $K(G)$ depends on certain structural properties of the
graph $G$. For certain specific graphs, which can model a wide variety
of wireless networks, $K(G)$ has been upper bounded by a factor
independent of the number of nodes
in the network. The scheduling element of our joint congestion control
and scheduling scheme is the maximal scheduling policy considered in
many of the earlier works. Although, it is widely believed to be
amenable to distributed implementation, no algorithms have been proposed
for its implementation, except under the node-exclusive interference
model which is suitable for networks in which adjacent nodes can
transmit over non-interfering channels. We propose a randomized
algorithm for implementing maximal scheduling policy under a $2$-hop
interference model which is suitable for networks with a limited number
of non-interfering channels (e.g., IEEE 802.11 DSSS networks).
|
| Ness B. Shroff received his Ph.D. degree from Columbia University, NY in 1994. He joined Purdue University in November 1994, where he is currently Professor of Electrical and Computer Engineering and director of CWSA, a university-wide center on wireless systems and applications.
His research interests span the areas of wireless and wireline communication networks. He is especially interested in fundamental problems in the design, performance, pricing, and security of these networks. He serves on the editorial boards and the program and executive committees of various premier journal and conference papers in the field.
He received the NSF CAREER award in 1996, the 2003 best paper of the year award for Computer Networks, the 2005 best paper of the year award for the Journal of Commnications and Networking, and the 2006 best paper award for IEEE INFOCOM 2006 (his 2005 paper was also selected as one of two runner-up papers in IEEE INFOCOM 2005). |