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

Research output: Contribution to journalArticle

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 languageEnglish
Article number1566
Pages (from-to)74-82
Number of pages9
JournalJournal of Visual Communication and Image Representation
Volume32
DOIs
Publication statusPublished - 2015 Oct 13

Fingerprint

Wireless networks

All Science Journal Classification (ASJC) codes

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

Cite this

Chang, Min Kuan ; Chen, Ting Chen ; Shen, Che An ; Huang, Wan Jen ; Kuo, Chih-Hung ; Kuo, Chia Chen. / New results on connectivity in wireless network. In: Journal of Visual Communication and Image Representation. 2015 ; Vol. 32. pp. 74-82.
@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 Chih-Hung Kuo and Kuo, {Chia Chen}",
year = "2015",
month = "10",
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.",

}

New results on connectivity in wireless network. / Chang, Min Kuan; Chen, Ting Chen; Shen, Che An; Huang, Wan Jen; Kuo, Chih-Hung; Kuo, Chia Chen.

In: Journal of Visual Communication and Image Representation, Vol. 32, 1566, 13.10.2015, p. 74-82.

Research output: Contribution to journalArticle

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

VL - 32

SP - 74

EP - 82

JO - Journal of Visual Communication and Image Representation

JF - Journal of Visual Communication and Image Representation

SN - 1047-3203

M1 - 1566

ER -