New results on connectivity in wireless network

Min Kuan Chang; Ting Chen Chen; Che An Shen; Wan Jen Huang; Chih Hung Kuo; Chia Chen Kuo

doi:10.1016/j.jvcir.2015.07.013

New results on connectivity in wireless network

Min Kuan Chang, Ting Chen Chen, Che An Shen, Wan Jen Huang, Chih Hung Kuo, Chia Chen Kuo

Department of Electrical Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Article number	1566
Pages (from-to)	74-82
Number of pages	9
Journal	Journal of Visual Communication and Image Representation
Volume	32
DOIs	https://doi.org/10.1016/j.jvcir.2015.07.013
Publication status	Published - 2015 Oct 13

All Science Journal Classification (ASJC) codes

Signal Processing
Media Technology
Computer Vision and Pattern Recognition
Electrical and Electronic Engineering

Access to Document

10.1016/j.jvcir.2015.07.013

Cite this

@article{4e20fc47e4774f3391d5d343a01c8f92,

title = "New results on connectivity in wireless network",

abstract = "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.",

author = "Chang, {Min Kuan} and Chen, {Ting Chen} and Shen, {Che An} and Huang, {Wan Jen} and Kuo, {Chih Hung} and Kuo, {Chia Chen}",

note = "Publisher Copyright: {\textcopyright} 2015 Elsevier Inc.",

year = "2015",

month = oct,

day = "13",

doi = "10.1016/j.jvcir.2015.07.013",

language = "English",

volume = "32",

pages = "74--82",

journal = "Journal of Visual Communication and Image Representation",

issn = "1047-3203",

publisher = "Academic Press Inc.",

}

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

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 -

New results on connectivity in wireless network

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this