On the 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 a wireless multi-hop network where n nodes are randomly and uniformly distributed in [0, 1]d (d = 1, 2) and any two nodes can communicate directly with each other iff their Euclidean distance is not larger than the transmission range r. We investigate the probability that the size of the giant component is at least a given threshold p with 0.5 < p ≤ 1. For d = 1, we derive a...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of IEEE Wireless Communications and Networking Conference (WCNC 2009)|
|01_Ta_On_the_Giant_Component_in_2009.pdf||344.76 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.