Brooke Shrader

I'm currently a PhD student at the University of Maryland, College Park. My thesis advisor is Prof. Anthony Ephremides and my research is in the area of communication theory.


I was previously with the Royal Institute of Technology (KTH) in Stockholm, Sweden. I also spent a few years in Houston, Texas, although I'm a native of the state of Maryland.
You can find more info below:
Education Research Teaching Other Contact: bshrader @ umd.edu
Education

PhD Candidate
Electrical and Computer Engineering
University of Maryland, College Park

M.S. Wireless Systems, 2002
Radio Communication Systems
Royal Institute of Technology (KTH), Stockholm

B.S. Electrical and Computer Engineering, 2000
Rice University, Houston
Research publications

  • Journals

    • B. Shrader and H. Permuter, ``Feedback capacity of the compound channel,'' submitted to IEEE Transactions on Information Theory, Nov 2007. [link to arxiv]

    • B. Shrader and A. Ephremides, ``On the Shannon capacity and queueing stability of random access multicast,'' submitted to IEEE Transactions on Information Theory, May 2007.[link to arxiv]

    • B. Shrader and A. Ephremides, ``Random access broadcast: stability and throughput analysis,'' IEEE Transactions on Information Theory, vol. 53, no. 8, pp. 2915-2921, August 2007. [link to arxiv]

  • Conferences and Workshops

    • R. Cogill, B. Shrader and A. Ephremides, ``Stability analysis of random linear coding across multicast sessions,'' IEEE International Symposium on Information Theory (ISIT), July 2008.

    • B. Shrader and M. Andrews, ``Optimal multicast throughput in random access networks of general topology,'' International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), April 2008. [pdf]

    • B. Shrader and A. Ephremides, ``A queueing model for random linear coding,'' IEEE Military Communications Conference (MILCOM), October 2007.[pdf]

    • B. Shrader and A. Ephremides, ``On packet lengths and overhead for random linear coding over the erasure channel,'' International Wireless Communications and Mobile Computing Conference (IWCMC), August 2007. [link to arxiv]

    • B. Shrader and H. Permuter, ``On the compound finite state channel with feedback,'' IEEE International Symposium on Information Theory (ISIT), June 2007.

    • B. Shrader and A. Ephremides, ``On the queueing delay of a multicast erasure channel,'' IEEE Information Theory Workshop (ITW), October 2006. [pdf]

    • B. Shrader and A. Ephremides, ``The capacity of the asynchronous compound multiple access channel and results for random access systems,'' IEEE International Symposium on Information Theory (ISIT), July 2006.[pdf]

    • B. Shrader, ``Stability in random access networks,'' Melbourne Information Theory Workshop, Sept 2005. [pdf]

    • B. Shrader and A. Ephremides, ``Broadcast stability in random access,'' IEEE International Symposium on Information Theory (ISIT), Sept 2005. [pdf]

    • T. Giles, B. Shrader and M. Sanchez, ``Throughput-delay analysis of conflict-free scheduling in multihop adhoc networks,'' Swedish Workshop on Wireless Ad Hoc Networks, May 2003.

    • B. Shrader and T. Giles, ``Scheduling and performance of multihop radio networks with multiuser detection,'' Swedish Workshop on Wireless Ad Hoc Networks, May 2002.

    • B. Shrader, R. Karlsson, L.L.H. Andrew and J. Zander, "Power-control-based band allocation in multiband CDMA," IEEE GlobeCom, Nov 2001.[pdf]
Teaching experience

  • Teaching fellow, ENEE621: Estimation and Detection (graduate). University of Maryland. Spring 2006.
  • Guest lecturer, ENEE324: Engineering Probability (undergraduate). University of Maryland. Fall 2003, Fall 2005.
  • Teaching assistant, 2E1511: Radio communication (master's level). Royal Institute of Technology. Fall 2001.
Other

I'm a member and co-founder of the Engineering Graduate Student Council (EGSC) at the University of Maryland. Visit the EGSC page [here].

I'm a member of the student committee for the IEEE Information Theory Society. Visit the student resources page [here].