An upper bound on multihop transmission capacity with dynamic routing selection

Y Chen, JG Andrews - IEEE Transactions on Information …, 2012 - ieeexplore.ieee.org
This paper develops upper bounds on the end-to-end transmission capacity of multihop
wireless networks. Potential source-destination paths are dynamically selected from a pool …
被引用次数：29 相关文章

An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection

Y Chen, JG Andrews - arXiv, 2010 - dml.mathdoc.fr
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop
wireless networks. Potential source-destination paths are dynamically selected from a pool …

An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection

Y Chen, JG Andrews - arXiv preprint arXiv:1004.3714, 2010 - arxiv.org
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop
wireless networks. Potential source-destination paths are dynamically selected from a pool …
[PDF] researchgate.net

[PDF][PDF] An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection

Y Chen, JG Andrews - researchgate.net
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop
wireless networks. Potential source-destination paths are dynamically selected from a pool …

An upper bound on multi-hop transmission capacity with dynamic routing selection

Y Chen, JG Andrews - 2010 IEEE International Symposium on …, 2010 - ieeexplore.ieee.org
This paper develops an upper bound on the end-to-end transmission capacity of multi-hop
wireless networks, in which all nodes are randomly distributed. Potential source-destination …

An Upper Bound on Multihop Transmission Capacity With Dynamic Routing Selection

Y Chen, JG Andrews - IEEE Transactions on Information Theory, 2012 - dl.acm.org
This paper develops upper bounds on the end-to-end transmission capacity of multihop
wireless networks. Potential source–destination paths are dynamically selected from a pool …
[PDF] github.io

[PDF][PDF] An Upper Bound on Multihop Transmission Capacity With Dynamic Routing Selection

Y Chen, JG Andrews - IEEE TRANSACTIONS ON …, 2012 - yuxinchen2020.github.io
This paper develops upper bounds on the end-to-end transmission capacity of multihop
wireless networks. Potential source–destination paths are dynamically selected from a pool …
[PDF] psu.edu

[PDF][PDF] An Upper Bound on Multihop Transmission Capacity With Dynamic Routing Selection

Y Chen, JG Andrews - IEEE TRANSACTIONS ON INFORMATION …, 2012 - Citeseer
This paper develops upper bounds on the end-to-end transmission capacity of multihop
wireless networks. Potential source–destination paths are dynamically selected from a pool …

An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection

Y Chen, JG Andrews - arXiv e-prints, 2010 - ui.adsabs.harvard.edu
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop
wireless networks. Potential source-destination paths are dynamically selected from a pool …

An upper bound on multi-hop transmission capacity with dynamic routing selection

Y Chen, JG Andrews - 2010 IEEE International …, 2010 - collaborate.princeton.edu
This paper develops an upper bound on the end-to-end transmission capacity of multi-hop
wireless networks, in which all nodes are randomly distributed. Potential source-destination …