Scheduling Partition for Order Optimal Capacity in Large-Scale Wireless Networks
暂无分享,去创建一个
[1] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[2] Roger Wattenhofer,et al. Topology control meets SINR: the scheduling complexity of arbitrary topologies , 2006, MobiHoc '06.
[3] R. Srikant,et al. The Multicast Capacity of Large Multihop Wireless Networks , 2007, IEEE/ACM Transactions on Networking.
[4] Sanjeev R. Kulkarni,et al. A deterministic approach to throughput scaling in wireless networks , 2002, IEEE Transactions on Information Theory.
[5] Hamid R. Sadjadpour,et al. A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[6] Jean C. Walrand,et al. A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.
[7] Yunhao Liu,et al. Capacity of large scale wireless networks under Gaussian channel model , 2008, MobiCom '08.
[8] Xiang-Yang Li,et al. Efficient interference-aware TDMA link scheduling for static wireless networks , 2006, MobiCom '06.
[9] Massimo Franceschetti,et al. Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.
[10] Ness B. Shroff,et al. Performance of Random Access Scheduling Schemes in Multi-hop Wireless Networks , 2006 .
[11] Ness B. Shroff,et al. On the Complexity of Scheduling in Wireless Networks , 2006, MobiCom '06.
[12] Koushik Kar,et al. Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks , 2008, IEEE Transactions on Information Theory.
[13] Shaojie Tang,et al. Multicast capacity for large scale wireless ad hoc networks , 2007, MobiCom '07.
[14] Roger Wattenhofer,et al. Complexity in geometric SINR , 2007, MobiHoc '07.
[15] Eytan Modiano,et al. Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.
[16] Hongqiang Zhai,et al. An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks , 2008, MobiHoc '08.
[17] Mung Chiang,et al. Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[18] Aravind Srinivasan,et al. Capacity of Asynchronous Random-Access Scheduling in Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[19] Paolo Santi,et al. Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks , 2006, MobiCom '06.
[20] Rudolf H. Riedi,et al. Bounds for the capacity of wireless multihop networks imposed by topology and demand , 2007, MobiHoc '07.
[21] Patrick Thiran,et al. Connectivity vs capacity in dense ad hoc networks , 2004, IEEE INFOCOM 2004.
[22] Rong Zheng,et al. Information Dissemination in Power-Constrained Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[23] Ness B. Shroff,et al. The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[24] Ness B. Shroff,et al. Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.
[25] Devavrat Shah,et al. Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.
[26] Yi Xu,et al. Scheduling Partition for Order Optimal Capacity in Large-Scale Wireless Networks , 2013, IEEE Transactions on Mobile Computing.
[27] Alireza Keshavarz-Haddad,et al. Broadcast capacity in multihop wireless networks , 2006, MobiCom '06.