Abstract In this work, we discuss when two users are able to exchange multimedia content and when that exchange is always possible. Two thresholds are of interest, a threshold for percolation and a threshold for full connectivity. To derive these thresholds, when discussing the bond percolation, we consider not only four directions, upper, right, left, and lower, but also more directions like upper-right, lower-right, upper-left, lower-left. In addition, small structures are proposed to help obtain the necessary conditions for percolation and full connectivity. We find that if the probability of four directions being open is greater than 0.3118 or the transmission radius of every node is longer than 1.52d/k, we can find a crossing path in our network and the percolation ensues. Furthermore, if that is greater than 0.3799 or the transmission radius of every node is longer than 1.579d/k, a fully-connected network graph exists for sure.
|頁（從 - 到）||74-82|
|期刊||Journal of Visual Communication and Image Representation|
|出版狀態||Published - 2015 10月 13|
All Science Journal Classification (ASJC) codes