2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing 2014
DOI: 10.1109/iih-msp.2014.175
|View full text |Cite
|
Sign up to set email alerts
|

Computing the Probability of Specific Random Sector Graphs with Applications in Wireless Networks with Directional Antennas

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…Random sector directed graphs and random geometric graphs are identical in case of φ = 2π [13], [14], [48], [49].…”
Section: Definition 1 (Uowsns As Random Sector Directed Graphs)mentioning
confidence: 99%
See 2 more Smart Citations
“…Random sector directed graphs and random geometric graphs are identical in case of φ = 2π [13], [14], [48], [49].…”
Section: Definition 1 (Uowsns As Random Sector Directed Graphs)mentioning
confidence: 99%
“…Random sector directed graphs and random geometric graphs are identical in case of φ = 2π [13], [14], [48], [49]. 1 We assumed that floating relay nodes are fastened to the seabed in order to prevent their loss by drifting in case of strong deep currents.…”
Section: Network Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…On the contrary, such a model is not suitable for UOWNs because a node can only reach to the nodes within a certain beam scanning angle around their transmission trajectory, that is, optical wireless nodes are connected via unidirectional links. Directed communication networks are generally modeled by random scaled sector graphs [254] where a unidirectional communication link from node n i to n j (i.e., n i → n j ) is established if and only if n j is positioned within the beam scanning angle of n i . Notice that a directed reverse path is possible (i.e., n j → n i ) if n i is in the beam-width of n j or through other multi-hop path as illustrated in Fig.…”
Section: A Connectivity Analysis Of Uownsmentioning
confidence: 99%
“…Notice that E i,j = 1 only if n i → n j holds. Random sector directed graphs and random geometric graphs are identical in case of φ = 2π [248], [249], [254], [275]. Notice that two nodes i and j are connected when the distance between them is less than R in random geometric graphs, however, the connectivity of random directed sector graphs also depends on the beam scanning angle and its orientation.…”
Section: A Connectivity Analysis Of Uownsmentioning
confidence: 99%