Optimal scaling of multicommodity flows in wireless ad hoc networks: Beyond the Gupta-Kumar barrier
暂无分享,去创建一个
[1] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.
[2] Hamid R. Sadjadpour,et al. Many-to-Many Communication: A New Approach for Collaboration in MANETs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[3] Oktay Günlük. A New Min-Cut Max-Flow Ratio for Multicommodity Flows , 2007, SIAM J. Discret. Math..
[4] David Tse,et al. Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[5] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[6] Hamid R. Sadjadpour,et al. Challenges: towards truly scalable ad hoc networks , 2007, MobiCom '07.
[7] Donald F. Towsley,et al. Bounds on the Gain of Network Coding and Broadcasting in Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[8] Nitin H. Vaidya,et al. Capacity of multi-channel wireless networks: impact of number of channels and interfaces , 2005, MobiCom '05.
[9] Devavrat Shah,et al. Product Multicommodity Flow in Wireless Networks , 2006, IEEE Transactions on Information Theory.
[10] Sachin Katti,et al. Embracing wireless interference: analog network coding , 2007, SIGCOMM.
[11] Andrea J. Goldsmith,et al. Capacity regions for wireless ad hoc networks , 2003, IEEE Trans. Wirel. Commun..
[12] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[13] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[14] Philip N. Klein,et al. Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.
[15] Massimo Franceschetti,et al. Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.
[16] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[17] Sanjeev R. Kulkarni,et al. A deterministic approach to throughput scaling in wireless networks , 2002, IEEE Transactions on Information Theory.
[18] Manfred Kunde. Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound , 1993, ESA.
[19] Oktay Günlük,et al. A New Min-Cut Max-Flow Ratio for Multicommodity Flows , 2002, SIAM J. Discret. Math..
[20] Yunnan Wu,et al. Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast , 2004 .
[21] Ayfer Özgür,et al. Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.