Increased Connectivity at Lower Cost: The Case for Multi-Radio Nodes in Multi-Hop Wireless Networks
暂无分享,去创建一个
András Faragó | Maurizio A. Nanni | Stefano Basagni | Dung T. Tran | A. Faragó | S. Basagni | M. A. Nanni | Dung T. Tran
[1] Babak Hassibi,et al. Communication over a wireless network with random connections , 2006, IEEE Transactions on Information Theory.
[2] Marco Miozzo,et al. ns2-MIRACLE: a modular framework for multi-technology and cross-layer support in network simulator 2 , 2007, ValueTools '07.
[3] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[4] Mechthild Stoer,et al. A simple min-cut algorithm , 1997, JACM.
[5] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[6] A. Bonato,et al. Graphs and Hypergraphs , 2022 .
[7] András Faragó. On the fundamental limits of topology control , 2004, DIALM-POMC '04.
[8] András Faragó,et al. On the Fundamental Limits of Topology Control in Ad Hoc Networks , 2007, Algorithmica.
[9] Mathew D. Penrose,et al. Random Geometric Graphs , 2003 .
[10] David Eppstein,et al. On Nearest-Neighbor Graphs , 1992, ICALP.
[11] Piet Van Mieghem,et al. Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model , 2006, Mob. Networks Appl..
[12] Béla Bollobás,et al. Random Graphs, Second Edition , 2001, Cambridge Studies in Advanced Mathematics.