On the Properties of Giant Component in Wireless Multi-hop Networks
In this paper, we study the giant component, the largest component containing a non-vanishing fraction of nodes, in wireless multi-hop networks in Rd (d =1, 2). We assume that n nodes are randomly, in dependently and uniformly distributed in [0, 1]d, and
|Collections||ANU Research Publications|
|Source:||Proceedings of IEEE Conference on Computer Communications (INFOCOM 2009)|
|01_Ta_On_the_Properties_of_Giant_2009.pdf||138.79 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.