Network Group Seminar
Every Thursday, 11:30 AM ~ 12:30 PM in Room DL 260
Schedule
- 11/19: Wenzhuo
- Topic:
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
- Papers:
- Alexander L. Stolyar, "Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm" [pdf]
- 11/05: Shuang [ppt]
- Topic:
Joint Power Allocation and Base-Station Assignment Based on Pricing for the Downlink in Multi-class CDMA Networks
- Papers:
- J. W. Lee, R. R. Mazumdar and N. B. Shroff, "Joint Power Allocation and Base-Station Assignment Based on Pricing for the Downlink in Multi-class CDMA Networks" [pdf]
- 10/22: Shengbo [ppt]
- Topic:
On Positive Harris Recurrence of Multiclass Queueing Networks: a Unified Approach via Fluid Limit Models
- Papers:
- J. G. Dai, "On Positive Harris Recurrence of Multiclass Queueing Networks: a Unified Approach via Fluid Limit Models" [pdf]
- 10/08: Ruogu
- Topic:
Delay Reduction via Lagrange Multipliers in Stochastic Network Optimization
- Papers:
- L. Huang and M. J. Neely, "Delay Reduction via Lagrange Multipliers in Stochastic Network Optimization" [pdf]
- 8/14: Zhoujia
- Topic:
Delay analysis for multi-hop wireless networks
- Papers:
- G. R. Gupta and N. B. Shroff, "Delay analysis for multi-hop wireless networks" [pdf]
- 7/22: Mohammad
- Topic:
Computation over Multiple-Access Channels
- Papers:
- B. Nazer and M. Gastpar, "Computation over Multiple-Access Channels" [pdf]
- B. Nazer and M. Gastpar, "The Case for Structured Random Codes in Network Capacity Theorems" [pdf]
- 7/15: Onur
- Topic:
Communication over Fading Channels with Delay Constraints
- Papers:
- R. Berry and R. Gallager, "Communication over Fading Channels with Delay Constraints" [pdf]
- 7/10: Arun
- Topic:
Energy Optimal Control in Time Varying Wireless Networks
- Papers:
- M. J. Neely, "Energy Optimal Control in Time Varying Wireless Networks" [pdf]
- 7/1: Haozhi
- Topic:
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
- Papers:
- P. Chaporkar, K. Kar, X. Luo and S. Sarkar, "Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks" [pdf]
- 5/21: Shengbo
- Topic:
Distributed Opportunistic Scheduling with Two-Level Channel Probing
- Papers:
- C. Thejaswi, J. Zhang, Man-On Pun and H. V. Poor, "Distributed Opportunistic Scheduling with Two-Level Channel Probing" [pdf]
- 5/14: Srikanth [ppt]
- Topic:
Computing and Communicating Functions over Sensor Networks
- Papers:
- A. Giridhar and P. R. Kumar, "Computing and Communicating Functions over Sensor Networks" [pdf]
- 4/30: Shuang [ppt]
- Topic:
Energy Aware Routing in Sensor Networks - A Large Systems Approach
- Papers:
- L. Lin, N. B. Shroff and R. Srikant, "Energy Aware Routing in Sensor Networks - A Large Systems Approach" [pdf]
- 4/23: Wenzhuo [ppt]
- Topic:
Insufficiency of Linear Coding in Network Information Flow
- Papers:
- R. Dougherty, C. Freiling and K. Zeger, "Insufficiency of Linear Coding in Network Information Flow" [pdf]
- 4/16: Swapna
- Topic:
The Benefits of Coding over Routing in a Randomized Setting
- Papers:
- Tracey Ho, Ralf Koetter, Muriel Medard, David R. Karger and Michelle Effros, "The Benefits of Coding over Routing in a Randomized Setting" [pdf]
- 4/9: Harsha
- Topic:
An Algebraic Approach to Network Coding
- Papers:
- Ralf Koetter and Muriel Medard, "An Algebraic Approach to Network Coding" [pdf]
- 3/5: Ruogu [ppt]
- Topic:
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
- Papers:
- Libin Jiang and Jean Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks" [pdf]
- 2/26: Subhash [ppt]
- Topic:
Congestion Control for Multicast Flows with Network Coding
- Papers:
- Lijun Chen, Tracey Ho, Mung Chiang, Steven H. Low, and John C. Doyle, "Congestion Control for Multicast Flows with Network Coding" [pdf]
- 2/19: Sugumar
- Topic:
An Index Policy for a Stochastic Scheduling Model with Improving/Deteriorating Jobs
- Papers:
- K. D. Glazebrook and H. M. Mitchell, "An Index Policy for a Stochastic Scheduling Model with Improving/Deteriorating Jobs" [pdf]
- 2/12: Bo
- Topic:
Delay and Capacity Trade-offs in Mobile Ad Hoc Networks: A Global Perspective
- Papers:
- G. Sharma, R. Mazumdar and N. B. Shroff, "Delay and Capacity Trade-offs in Mobile Ad Hoc Networks: A Global Perspective" [pdf]
- 1/29: Bea [ppt]
- Topic:
Mobility Increases the Capacity of Ad-hoc Wireless Networks
- Papers:
- M. Grossglauser and D. Tse, "Mobility Increases the Capacity of Ad-hoc Wireless Networks" [pdf]
- 11/20: Zhoujia [ppt]
- Topic:
The Capacity of Wireless Networks
- Papers:
- P. Gupta and P. R. Kumar, "The Capacity of Wireless Networks" [pdf]
- 11/13: Rahul
- Topic:
Critical Power for Asymptotic Connectivity in Wireless Networks
- Papers:
- P. Gupta and P. R. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks" [pdf]
- 10/30: Srikanth [ppt]
- Topic:
Low-complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks
- Papers:
- L. Lin, X. Lin and N. B. Shroff, "Low-complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks" [pdf]
- 05/27: Ruogu [ppt]
- Topic:
Dynamic Power Allocation and Routing for Time Varying Wireless Networks
- Papers:
- M. J. Neely, E. Modiano and C. E. Rohrs, "Dynamic Power Allocation and Routing for Time Varying Wireless Networks" [pdf]
- 05/13 and 05/20: Bo [Prof. Shroff's slides]
- Topic:
On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast
- Papers:
- J. Kim, X. Lin, N. B. Shroff and P. Sinha, "On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast" [pdf]
- 05/06: Sugumar [pdf]
- Topic:
Energy Efficient Sleep/Wake Scheduling in Wireless Sensor Networks
- Papers:
- Yan Wu, Sonia Fahmy and Ness B. Shroff, "Energy Efficient Sleep/Wake Scheduling for Multi-hop Sensor Networks: Non-convexity and Approximation Algorithm" [pdf]
- 04/29: Bea [ppt]
- Topic:
Delay Efficient Sleep Scheduling in Wireless Sensor Networks
- Papers:
- Gang Lu, Narayanan Sadagopan, Bhaskar Krishnamachari and Ashish Goel, "Delay Efficient Sleep Scheduling in Wireless Sensor Networks" [pdf]
- 03/25: Sriram [ppt]
- Topic:
Optimal Routing, Link Scheduling and Power Control in Multihop Wireless Networks
- Papers:
- R. L. Cruz and Arvind V. Santhanam, "Optimal Routing, Link Scheduling and Power Control in Multihop Wireless Networks" [pdf]
- 03/18: Arun
- Topic:
Dynamic Node Activation in Networks of Rechargeable Sensors
- Papers:
- Koushik Kar, Ananth Krishnamurthy and Neeraj Jaggi, "Dynamic Node Activation in Networks of Rechargeable Sensors" [pdf]
- 03/04: Haozhi [ppt]
- Topic:
Energy Efficient MAC Protocols
- Papers:
- Wei Ye, John Heidemann and Deborah Estrin, "Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks" [pdf]
- Tijs van Dam and Koen Langendoen, "An Adaptive Energy Efficient MAC Protocol for Wireless Sensor Networks" [pdf]
- Tao Zheng, Sridhar Radhakrishnan and Venkatesh Sarangan, "PMAC: An Adaptive Energy Efficient MAC Protocol for Wireless Sensor Networks" [pdf]
- Michael Buettner, Gary V. Yee, Eric Anderson and Richard Han, "X-MAC: A Short Preamble MAC Protocol for Duty-cycled Wireless Sensor Networks" [pdf]
- Further Reading:
- Amre El-Hoiydi and Jean-Dominique Decotignie, "WiseMAC: An Ultra Low Power MAC Protocol for Multi-hop Wireless Sensor Networks" [pdf]
- Joseph Polastre, Jason Hill and David Culler, "Versatile Low Power Media Access for Wireless Sensor Networks" [pdf]
- 02/12: Rahul [ppt]
- Topic:
Asymptotically Optimal Energy-Aware Routing for Multihop Wireless Networks with Renewable Energy Sources
- Papers:
- L. Lin, N. B. Shroff and R. Srikant, "Asymptotically Optimal Energy-Aware Routing for Multihop Wireless Networks with Renewable Energy Sources" [pdf]
- 02/05: Robert [ppt]
- Topic:
Energy-Aware Routing in Sensor Networks
- Papers:
- Li, Q., Aslam, J., and Rus, D., "Online power-aware routing in wireless Ad-hoc networks" [pdf]
- Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., and Cayirci, "Wireless sensor networks: a survey" [pdf]
- 01/29: Emad [ppt]
- Topic:
On-Demand Routing Protocols for Wireless Ad-hoc Networks
- Papers:
- D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks” [pdf]
- C. Perkins and E.M. Boyer, “Ad Hoc On Demand Distance Vector (AODV) algorithm” [ps]
- C-K. Toh, “A Novel Distributed Routing Protocol To Support Ad-Hoc Mobile Computing” [pdf]
- R. Dube et al., “Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks” [pdf]
- M. S. Corson and A. Ephremides, “A Distributed Routing Algorithm for Mobile Wireless Networks” [pdf]
- V. D. Park and M. S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks” [pdf]
- G. Aggelou, R. Tafazolli, “RDMAR: a bandwidth-efficient routing protocol for mobile ad hoc networks” [pdf]
- Y.-B. Ko, N.H. Vaidya, “Location-aided routing (LAR) in mobile ad hoc networks” [pdf]
- M. G€unes, U. Sorges, I. Bouazizi, “Ara––the ant-colony based routing algorithm for manets” [pdf]
- 12/12 and 12/19: Zhoujia [ppt]
- Topic:
- Shuo-Yen Robert Li, Raymond W. Yeung and Ning Cai, "Linear Network Coding " [pdf]
- Description:
Among the simplest coding schemes is linear coding, which regards a block of data as a vector over a certain base field and allows a node to apply a linear transformation to a vector before passing it on. This paper considers a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion and proves that linear coding suffices to achieve the max-flow from the source to each receiving node.
- 11/28 and 12/07: Bo [ppt]
- Topic:
- Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li and Raymond W. Yeung, "Network Information Flow " [pdf]
- Description:
Like many fundamental concepts, network coding is based on a simple basic idea which was first stated in its beautiful simplicity in the the seminal paper by R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network Information Flow", (IEEE Transactions on Information Theory, IT-46, pp. 1204-1216, 2000). The core notion of network coding is to allow and encourage mixing of data at intermediate network nodes. A receiver sees these data packets and deduces from them the messages that were originally intended for that data sink. The max-flow min-cut theorem for network information flow is addressed and is illustrated by a few examples in this paper.
- 11/14 and 11/21: Srikanth [ppt]
- Topic:
- Philip A. Chou and Yunnan Wu, "Network Coding for the Internet and Wireless Networks" [pdf]
- Description:
In today’s practical communication networks such as the Internet, information delivery is performed by routing. A promising generalization of routing is network coding. The potential advantages of network coding over routing include resource (e.g., bandwidth and power) efficiency, computational efficiency, and robustness to network dynamics. This tutorial article provides an overview of the theory, practice, and applications of network coding.
- Further Reading:
- Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li and Raymond W. Yeung, "Network Information Flow" [pdf]