TY - JOUR
T1 - New results on connectivity in wireless network
AU - Chang, Min Kuan
AU - Chen, Ting Chen
AU - Shen, Che An
AU - Huang, Wan Jen
AU - Kuo, Chih Hung
AU - Kuo, Chia Chen
N1 - Publisher Copyright:
© 2015 Elsevier Inc.
PY - 2015/10/13
Y1 - 2015/10/13
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84939185222&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84939185222&partnerID=8YFLogxK
U2 - 10.1016/j.jvcir.2015.07.013
DO - 10.1016/j.jvcir.2015.07.013
M3 - Article
AN - SCOPUS:84939185222
SN - 1047-3203
VL - 32
SP - 74
EP - 82
JO - Journal of Visual Communication and Image Representation
JF - Journal of Visual Communication and Image Representation
M1 - 1566
ER -