Learning-based VANET Communication and Security Techniques by Liang Xiao & Weihua Zhuang & Sheng Zhou & Cailian Chen

Author:Liang Xiao & Weihua Zhuang & Sheng Zhou & Cailian Chen
Language: eng
Format: epub
ISBN: 9783030017316
Publisher: Springer International Publishing

(3.17)

(2) With x + = x − , the learning regret can be bounded as

(3.18)

where is the expectation of x t on the condition that x t ≤ x − , u m =supt,n u(t, n), and δ n = (μ n − μ ∗)∕u m.

Proof

When β 0 = 2 and B = 1, the utility function (3.13) can be simplified as

(3.19)

The decision making function in (3.14) can be written as

(3.20)

And the learning regret

(3.21)

Since , and , our task offloading problem is equivalent to the opportunistic bandit problem given in [11], equations (1–3), with equivalent definitions of utility function, decision making function and learning regret. By leveraging Lemma 7, Theorem 3 and Appendix C.2 in [11], we can get Theorem 3.1.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.