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 d (d = 1, 2). We assume that n nodes are randomly, independently and uniformly distributed in [0, 1]d , and each node has a uniform transmission range of r = r(n) and any two nodes can communicate directly with each other iff their Euclidean distance is at most r. For d = 1, we derive a closed-form analytical formula for calculating the probability of having a giant component of order above pn

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson
• Keywords: Communications, Giant Component, INFOCOM 2009, Largest Component, Wireless Multi-hop Networks