2015 IEEE Global Communications Conference (GLOBECOM) 2015
DOI: 10.1109/glocom.2015.7417185
|View full text |Cite
|
Sign up to set email alerts
|

A QoS Monitor Selection Mechanism for Cellular Data Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…An example of an ontology structure is given in Figure 3. Details in regards to ontology syntax, semantics and the mathematical functions used for measuring semantic similarity and distance can all be found in [38] and is out of the scope of this article. A node's capability score is derived by comparing ontological property descriptions of node 6 and service request 8 as follows:…”
Section: A Node Capabilitesmentioning
confidence: 99%
“…An example of an ontology structure is given in Figure 3. Details in regards to ontology syntax, semantics and the mathematical functions used for measuring semantic similarity and distance can all be found in [38] and is out of the scope of this article. A node's capability score is derived by comparing ontological property descriptions of node 6 and service request 8 as follows:…”
Section: A Node Capabilitesmentioning
confidence: 99%
“…Nodes with higher residual power ( presidualMNi) and low power transmission requirements ( ptransmititalicM-.1emitalicNiMECj) are more likely to be selected as cache nodes. We assume that residual power is calculated as a percentage score according to McGuire and Al Ridhawi MN i to the MEC node that the MN is communicating with for services (ie, MEC j ).…”
Section: Cache Node Selectionmentioning
confidence: 99%
“…Given that two nodes are within communication distance of each other at previous time points, it is highly likely that those nodes will be within the communication distance at a future time point . Therefore, the relative velocities of the previous time points are considered using a forgetting weight factor ( δtki), where more significance to recent relative velocity measurements is given.…”
Section: Cache Node Selectionmentioning
confidence: 99%