diff --git "a/data_all_eng_slimpj/shuffled/split2/finalzzlqzv" "b/data_all_eng_slimpj/shuffled/split2/finalzzlqzv" new file mode 100644--- /dev/null +++ "b/data_all_eng_slimpj/shuffled/split2/finalzzlqzv" @@ -0,0 +1,5 @@ +{"text":"\\section{Introduction}\n\\IEEEPARstart{T}{elecommunication} research so far has tended to become technology-centric and focused excessively on quality of service (QoS) metrics. On the other hand, due to the rapid emergence of end-user controllable and programmable devices in communication networks, quality of experience (QoE) and user experience (UE) have increasingly attracted researchers' attention in both academia and industry in recent years \\cite{kilkki2008quality,6679038,8447199,finley2017does,boz2019mobile}. Furthermore, the development of human-centric communications in the 6G network requires not only technological factors but also UE to be considered when modeling, analyzing, and optimizing communication systems \\cite{Dang2019FromAH}. This paradigm shift necessitates the interdisciplinary collaboration among telecommunications, economics, and psychology. \n\nThe first attempt to propose an ecosystem incorporating multiple stakeholders and end users is presented in \\cite{kilkki2008quality}, based on which several advanced versions of ecosystems are proposed in \\cite{6178834,dong2014quality,reichl2010charging,8701705}. However, due to the absence of a quantitative basis, existing ecosystems can hardly be utilized to carry out performance analysis for communication systems. To facilitate quantitative analysis, a standard approach is to measure UE via utility functions, such as logarithmic, sigmoid, and exponential functions \\cite{reichl2013logarithmic,6891176,5430142}. However, most QoE measurements are confined to simple quantitative relationships between QoS and QoE metrics. So far, no analytical framework has been proven to be generic and theoretically practicable for modeling UE in a human-centric manner. \n\n\nIn the area of economics, researchers resort to the prospect theory for accurately predicting decision-making behaviors of human beings \\cite{kahneman1979prospect,tversky1992advances}. The prospect theory is a Nobel prize winning theory and the founding pillar of behavioral economics. It is widely perceived as the most satisfactory descriptive theory of quantity perception currently available. Since its proposal in 1979, this theory has been extensively applied in pricing strategy, labor supply, tax policy making, and finance related topics. Due to its generality and versatility, the prospect theory is also introduced as a nexus to connect the disciplines of telecommunications, economics, and psychology. In \\cite{6747282}, the user behavior interference in networking protocols is modeled and analyzed according to the prospect theory. Specific resource allocation strategies using the prospect theory are investigated in \\cite{7560647}. Data pricing problems relying on the prospect theory for licensed and unlicensed communications are investigated in \\cite{7869340} and \\cite{7294655,8746552}, respectively. The prospect theory has also been applied to provide secure protection mechanisms for communication systems by formulating dynamic defense games \\cite{7842178,7835168}. Incorporating game theory, the prospect theory can also help communication systems equip with better anti-jamming and random access functions \\cite{7036897,6310922}. A generic but simplistic prospect theoretic analytical framework of UE is proposed in \\cite{7346204}. Even though instructive and creative, the inappropriate and oversimplified modeling and assumptions in \\cite{7346204} result in a huge mismatch between the quantitative UE and resource utilization. In these interdisciplinary applications, however, the prospect theory serves only as a replacement for the utility or probability functions formulated in specific problems (e.g., game theoretic communications). This, to some extent, undervalues the prospect theory's implications and application aspects for human-centric communications. \n\n\nIn light of this, we summarize the contributions of this paper as follows:\n\\begin{itemize}\n\\item We outline five essential attributes of the prospect theory considering user psychology that should be taken into consideration for wireless system modeling.\n\\item We construct a comprehensive analytical framework for modeling UE and perceptual measurements for human-centric communications.\n\\item We detail how modeling and analysis of communication systems will be reshaped under the novel analytical framework with several exemplary cases. The proposed analytical framework can be directly applied to carry out performance analysis for most communication systems when non-technological factors are taken into consideration and can be easily tailored to fit a broader range of communication applications. \n\\end{itemize}\nBy the contributions given in this paper, we aim to provide a guideline for improving communication services and articulate a new interdisciplinary research area for further investigation. \n\nThe remainder of this paper is as follows. In Section \\ref{fpt}, we present the fundamentals of the prospect theory, including its economic background, concepts, intuitions, and five key attributes of human psychology. Based on the five key attributes, we formulate the prospect theoretic analytical framework in Section \\ref{ptbaf}. In Section \\ref{cs}, we utilize several case studies to demonstrate how the analytical framework can be used to evaluate the subjective perception of communication systems. We outline the challenges and promising research directions for further investigations in Section \\ref{fird} and conclude the paper in Section \\ref{c}.\n\n\n\n\n\n\\section{Fundamentals of the Prospect Theory}\\label{fpt}\n\nAs we are entering the 5G\/6G era, the development of human-centric communications is becoming increasingly important but faces tremendous challenges. The paradigm shift from technology-centric to human-centric applications necessitates the interdisciplinary collaboration among telecommunications, economics, and psychology. In the following subsections, we explain step by step how this interdisciplinary collaboration is enabled by the prospect theory.\n\n\\subsection{Existing Problems with Classic Telecommunication Research}\nResearchers employ different approaches to establish linkages between QoS (e.g., bandwidth and loss rate) and QoE. Perceptual measurements such as the mean opinion score (MOS) and the pseudo-subjective quality assessment (PSQA) have been developed to quantify user experience \\cite{streijl2016mean,5070785}. There are also multi-dimensional evaluation systems designed to assess network performance from end-user perspectives \\cite{6178834}. Although the QoE research is gaining strong momentum in recent years, the literature remains scattered, inconsistent, and excessively technology-centric \\cite{kilkki2008quality,reichl2010charging,de2010proposed}. So far, no analytical framework has been proven sufficiently generic and theoretically practicable for modeling UE in a user-oriented manner. \n\nClassic communication research focuses on technology-centric network optimization and bypasses the model of UE. In such settings, researchers have actually made an implicit assumption: the optimization process maximizes both network capacity and user's subjective utility simultaneously \\cite{barakovic2013survey}. Conventionally, for $n$ mutually exclusive outcomes $y_i$ with occurrence probability $p_i$, the subjective utility can be considered as a linear function of probabilistic outcomes: $U=\\sum_{i=1}^{n}p_iy_i$, given $\\sum_{i=1}^{n}p_i=1$. However, the linear utility function is difficult to reconcile with human psychology due to its unrealistic attributes:\n\\begin{itemize}\n\\item Subjective utility is solely determined by the state of the final outcome.\n\\item Marginal utility is constant.\n\\item Quantity perception over gains and losses is symmetric.\n\\item There is indifference between objective and perceived probabilities.\n\\end{itemize}\nUnder the erroneous characterization of human psychology, the optimization process does not necessarily guarantee optimal UE, and the derived theories would be of limited practical usefulness. As an applied discipline, communications become human-centric only if UE can be properly introduced and optimized in the modeling process, which should be the very foundation of communication science. Overall, there is an urgent need to incorporate UE into the modeling of telecommunication theories.\n\n\\subsection{Prospect Theory}\nIn the past decades, the rapid development of behavioral economics has greatly enriched our understanding of human psychology and proposed promising analytical frameworks for modeling UE. As the founding pillar of behavioral economics, the prospect theory is widely perceived as the most satisfactory descriptive theory of quantity perception and decision making currently available \\cite{tversky1992advances,kahneman1979prospect}. The prospect theory is also a Nobel Prize winning theory, and the research article \\cite{kahneman1979prospect} is the second most cited paper in economics. The prospect theory provides a well-established theoretical framework and mathematical tools for modeling real-life UE, and its gist is that the human perception of quantity and probability are non-linear.\n\nIn the current literature, most QoE measurements for telecommunication studies are confined to quantity perception of discrete states, i.e., quantitative relationships between UE and QoS \\cite{5430142,reichl2013logarithmic}. As a major advantage, the prospect theory characterizes two indispensable dimensions of UE, i.e., quantity and probability, and can help to model and analyze UE in the continuous state. Under the prospect theory, the perception of quantity and probability perception can be expressed in Fig. \\ref{lizi}. This figure is believed to be the most important pictorial illustration of the prospect theory and can help with the mapping from QoS to QoE for telecommunication studies. A value function and a probability weighting function are employed to model the human perception, which can be characterized by the two-part functional form of \\cite{tversky1992advances} and the Prelec function given in \\cite{prelec1998probability}, respectively.\n\n\\begin{figure*}[!t]\n \\centering\n \\begin{subfigure}[t]{0.5\\textwidth}\n \\centering\n \\includegraphics[width=3.5in]{value_perception.eps}\n \\caption{}\n \\end{subfigure}%\n~\n \\begin{subfigure}[t]{0.5\\textwidth}\n \\centering\n \\includegraphics[width=3.5in]{prob_perception.eps}\n \\caption{}\n \\end{subfigure}\n \\caption{(a) Perceptual quantity under the prospect theory; (b) Perceptual probability under the prospect theory \\cite{dhami2016foundations}.}\n \\label{lizi}\n\\end{figure*}\n\n\n\n\n\n\n\\subsection{Five Key Attributes}\nIn this subsection, we introduce the features of the prospect theory in shaping human psychological foundations and discuss the insights into modeling UE. According to Fig. \\ref{lizi}, we can observe five important features of human psychology, captured by the prospect theory as follows.\n\n\\subsubsection{Reference dependence}\nThe prospect theory states that individuals perceived value through changes (i.e., quantity deviations from a reference point) instead of states. There is always a reference point in each dimension of quantity perception. This can be explained by the following thought experiment. Communication operators upgrade Jack's mobile network from 3G to 4G but downgrade Jim's from 5G to 4G. Jack and James now have the same network capacity but markedly different quantity perception (gains versus losses), due to reference dependence. This characterization is consistent with the advanced notion of QoE: users' perceived value can be either positive (delight) or negative (annoyance) \\cite{le2012qualinet}. As a fundamental trait in human psychology, reference dependence casts doubts on optimization approaches that focus merely on the level of final outcomes, which has also attracted research attention in recent QoE literature \\cite{5430142}.\n\\subsubsection{Diminishing marginal utility}\nIndividuals have diminishing sensitivity towards the scale of changes. This means that the subjective difference between the data packages of 50 Mb and 100 Mb is more salient than that between the data packages of 950 Mb and 1000 Mb. Diminishing marginal utility, also known as diminishing sensitivity and utility curvature, is a widely recognized psychological feature shared by living creatures. Under proper assumptions (e.g., exponential or logarithmic utility functions \\cite{5430142,reichl2013logarithmic}), the concept of diminishing sensitivity can be readily incorporated into the modeling process to improve the practical significance of telecommunication theories.\n\\subsubsection{Loss aversion}\nIndividuals are more sensitive to losses than equivalent gains. Ample experimental evidence suggests that the magnitude of loss aversion is context-dependent, but losses are generally twice as significant as equivalent gains in quantity perception \\cite{dhami2016foundations}. The phenomenon of loss aversion is captured by the value function in Fig. \\ref{lizi}(a), where quantity perception is steeper in the domain of losses. This asymmetry calls for a reconsideration of conventional approaches that weight gains and losses equally.\n\\subsubsection{Asymmetric risk attitudes}\nUnder diminishing marginal utility and loss aversion, individuals are risk seeking in the domain of losses but risk averse in the domain of gains. A prime example is the behavior of compulsive gambling: money-winning gamblers tend to play safely and prefer low-risk-low-return options, whereas money-losing gamblers prefer high-risk-high-return options and expect a grand slam home run. Asymmetric risk attitudes indicate that users have different risk preferences for improvement and deterioration in communication services, which calls for revisions of risk modeling in the QoE research. \n\\subsubsection{Probability distortion}\nIndividuals tend to overweight small probabilities and underweight moderate and high probabilities. Consider the thought experiment as follows:\n\\begin{problem}\n\\textbf{1} \\textit{How much would you pay to reduce the dropping probability from 5\\% to 0\\%.}\n\\end{problem}\n\\begin{problem}\n\\textbf{2} \\textit{How much would you pay to reduce the dropping probability from 55\\% to 50\\%.}\n\\end{problem}\n\n\nThe two problems seem identical because they are about the perceived value of 5\\% risk of dropping call. However, the great majority of people in real life are willing to pay much higher in \\textbf{Problem 1} than in \\textbf{Problem 2}. This phenomenon suggests a non-linear subjective probability weighting, in contrast to the linear probability weighting that equates objective probability with perceptual probability\\footnote{Similarly, one can consider the acceptable amount of compensation if the dropping probability increases by 5\\%. In most cases, people would not allow an increase of dropping probability from 0\\% to 5\\% but might be willing to negotiate over the compensation if the dropping probability increases from 50\\% to 55\\%. Again, the contrast between the increase and decrease of dropping probability is due to loss aversion, i.e., loss is subjectively more significant than equivalent gain.}. In probability perception, probability changes such as 0-5\\% and 95-100\\% are subjectively more salient than other changes of the same magnitude, since they are qualitative changes between non-existence, probabilistic outcome, and certainty. Extensive experimental evidence indicates that people are rather sensitive to the edges of probability interval [0,1], as documented by the inverse S-shaped probability weighting in Fig. \\ref{lizi}. \n\n\\subsection{Summary}\nUnder the prospect theory, the five psychological features transform into the fourfold pattern of risk attitudes in quantity perception: for low probabilities, individuals are risk seeking in the domain of gains but risk averse in the domain of losses; for moderate and high probabilities, individuals are risk averse in the domain of gains but risk seeking in the domain of losses. In summary, the prospect theory formulates the non-linear quantity and probability perception of human psychology, which has profound implications for developing human-centric communications in both academia and industry. \n\n\\section{Prospect Theoretic Analytical Framework}\\label{ptbaf}\nThe basic mathematical formulation based on the prospect theory enables the mapping from objective QoS to subjective QoE, capturing the behavioral, psychological, and contextual factors. In the process of quantity and probability perception, the QoE or UE is dependent on two metrics: the quantity metric and the probability metric. \n\n\n\\subsection{Quantity Metric and Value Function}\nThe quantity metric denotes conventional QoS parameters such as bandwidth and latency. According to the prospect theory, individuals perceived value through state transition (i.e., quantity deviations from a reference point) instead of the current quantity. In various disciplines, utility\/value functions serve as the standard approach for modeling UE. Following the two-part functional form of \\cite{tversky1992advances}, the value function for telecommunications taking the reference dependence, diminishing marginal utility, and loss aversion into consideration can be modeled as\\footnote{Note that, there is a prerequisite for using this value model, the quantity metric of interest must be a \\textit{desirable} metric. A desirable metric is a metric that will be preferable with a larger value, e.g., transmission rate and network coverage. In this paper, we only consider desirable metrics without special notes, because of the limitation of the prospect theory originally dealing with the monetary benefit that is also a desirable metric.}$^{,}$\\footnote{For simplicity, we mainly analyze the single-metric scenario, in which only a single quantity metric $x$ with its reference point $x_0$ is taken into consideration.}\n\\begin{equation}\\label{valuefunc}\nv(x,x_0)=\\begin{cases}\n\\lambda_1(x-x_0)^{\\alpha_1},~~~~~~x\\geq x_0\\\\\n-\\lambda_2(x_0-x)^{\\alpha_2},~~~~x< x_0,\\\\\n\\end{cases}\n\\end{equation}\nwhere $\\alpha_1$, $\\alpha_2$, $\\lambda_1$, and $\\lambda_2$ are positive and user specific parameters; $x_0>0$ is the reference point with respect to $x$, which captures the reference dependence. The reference point $x_0$ can be a previous quantity, expected quantity, or contractual quantity for different application scenarios. For generality, we model the process of quantity perception as a function of both $x$ and $x_0$ so as to emphasize the equal importance of the actual quantity $x$ and the reference point $x_0$. Both dimensions are indispensable in determining user perception of quantity metrics. It is worth noting that all the parameters, including the reference point $x_0$ are specific in terms of user preferences and socio-economic contexts and could change over time. Obviously, if $\\alpha_1=\\alpha_2=1$, $\\lambda_1=\\lambda_2=1$, and $x_0=0$, we have $v(x,x_0)=x$, $\\forall~x\\geq 0$, and the formulated analytical framework reduces to the classic QoS analytical framework. \n\n\n\n\nWithout loss of generality, the value model given in (\\ref{valuefunc}) is called the four-parameter value model, which is different from the classic two-parameter value model widely used in behavioral economics that assumes $\\alpha_1=\\alpha_2$ and fixes $\\lambda_1=1$. For the four-parameter value model, it is worth inspecting and discussing the constraints on parameters that should jointly ensure the key attributes retrieved from the prospect theory. It has been summarized in \\cite{dhami2016foundations} that any value function $v(x,x_0)$ complying with the prospect theory must satisfy the following fundamental properties:\n\\begin{itemize}\n\\item $v(x,x_0)$ is continuous and strictly increasing with respect to $x$;\n\\item $v(x_0,x_0)=0$ (reference dependence);\n\\item With respect to $x$, $v(x,x_0)$ is concave when $x\\geq x_0$ and is convex when $x0$ (loss aversion).\n\\end{itemize}\nThe first two fundamental properties of $v(x,x_0)$ are axiomatic for the four-parameter value model. To investigate the concavity and convexity, it is straightforward to derive the second-order piecewise partial derivative of $v(x,x_0)$ with respect to $x\\geq x_0$ as $\\frac{\\partial^2v(x,x_0)}{\\partial x^2}\\vert_{x\\geq x_0}=\\alpha_1(\\alpha_1-1)\\lambda_1(x-x_0)^{\\alpha_1-2}$ and $x0$ yields $0<\\alpha_1<1$ and $0<\\alpha_2<1$, respectively. For the last property stipulating $v(x_0+\\delta,x_0)<-v(x_0-\\delta,x_0)$, $\\forall~\\delta>0$, we can simplify the inequality to $\\frac{\\lambda_2}{\\lambda_1}\\delta^{\\alpha_2-\\alpha_1}>1$, $\\forall~\\delta>0$. By rigorous analysis, it can be proven that the only approach to ensure the validity of the inequality regardless of the value of $\\delta$ is to let $\\alpha_1=\\alpha_2$ and $\\lambda_1<\\lambda_2$, which reduce the four-parameter model constructed in (\\ref{valuefunc}) to a three-parameter model regulating $\\alpha=\\alpha_1=\\alpha_2\\in(0,1)$ and $\\lambda_1<\\lambda_2$. Rigorous and comprehensive discussions and proofs regarding the parameters of value model in the prospect theory can be found in \\cite{al2008note}. \n\nFor illustration purposes, we plot $v(x,x_0)$ with different sets of parameters in Fig. \\ref{valuefuncplot} by referring to the suggested parameter ranges yielded by empirical evidence given in \\cite{dhami2016foundations}. We also plot Fig. \\ref{referenceplot} to illustrate the effects of reference point on the value function. In these figures, we can confirm that the key attributes related to the value function from the prospect theory hold and inspect how these key attributes and the relevant parameters jointly affect the user perception of quantity metrics.\n\n\n\n \\begin{figure*}\n \n \\begin{subfigure}[t]{0.3\\textwidth}\n \\includegraphics[width=2.5in]{perceivedvalue1.eps}\n \\caption{}\n \\label{}\n \\end{subfigure}\n ~~\n \n \\begin{subfigure}[t]{0.3\\textwidth}\n \\includegraphics[width=2.5in]{perceivedvalue2.eps}\n \\caption{}\n \\label{}\n \\end{subfigure}\n ~~\n \n \\begin{subfigure}[t]{0.3\\textwidth}\n \\includegraphics[width=2.5in]{perceivedvalue3.eps}\n \\caption{}\n \\label{}\n \\end{subfigure}\n \\caption{Perceived values of state transitions with different sets of parameters. }\n \\label{valuefuncplot}\n\\end{figure*}\n \n \n \n \n \n\\begin{figure}[!t]\n\\centering\n\\includegraphics[width=3.5in]{referenceplot.eps}\n\\caption{Perceived value vs. quantity metric with different reference points, given $\\alpha=0.5$, $\\lambda_1=1.0$, and $\\lambda_2=2.0$.}\n\\label{referenceplot}\n\\end{figure}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\\subsection{Probability Metric and Probability Weighting Function}\nThe probability metric in the context of telecommunications denotes the measurement of opportunistic performance, which encompasses outage probability, error probability, collision probability, handover probability, and etc. An objective probability will be distorted when being perceived by end users, corresponding to the last key attribute of the prospect theory: non-linear probability perception. Introducing the Prelec probability weighting function \\cite{prelec1998probability}, we model the perception of a probability metric $0\\leq p\\leq 1$ under psychological distortion as\n\\begin{equation}\\label{vpxeq}\nw(p)=\\mathrm{exp}(-\\gamma(-\\log(p))^\\theta),\n\\end{equation}\nwhere $\\gamma>0$ and $0<\\theta<1$ are user specific parameters used to characterize the subjective perception of probability metric. The ranges $\\gamma$ and $\\theta$ are derived by the necessary conditions for maintaining the basic properties of probability weighting function, especially its inverse S-shape. Detailed discussions on the functionality and property of $\\gamma$ and $\\theta$ can be found in \\cite{dhami2016foundations}. If $\\gamma=1$ and $\\theta=1$, we have $w(p)=p$, $\\forall~p\\in[0,1]$, and thus the formulated analytical framework for probability perception reduces to the classic QoS analytical framework. \n\nIn a general case with a continuous random variable $X$, the probability argument in (\\ref{vpxeq}) could be any cumulative distribution function (CDF) $F_X(s)=\\mathbb{P}\\{X\\leq s\\}$, where $\\mathbb{P}\\{\\cdot\\}$ denotes the objective probability of the random event enclosed. Following the definition of CDF and the attribute of probability distortion, we gives the perceptual CDF (PCDF) by\n\\begin{equation}\n\\tilde{F}_X(s)=w(F_X(s)).\n\\end{equation}\nDenoting $f_X(s)=\\frac{\\mathrm{d}F(s)}{\\mathrm{d}s}$ as the probability density function (PDF) of $X$, we can define the perceptual PDF (PPDF) as \n\\begin{equation}\n\\begin{split}\n\\tilde{f}_X(s)&=\\frac{\\mathrm{d}\\tilde{F}_X(s)}{\\mathrm{d}s}=\\frac{\\mathrm{d}w(F_X(s))}{\\mathrm{d}s}\\\\\n&=\\gamma\\theta w(F_X(s))(-\\log(F_X(s)))^{\\theta-1}f_X(s)\/F_X(s).\n\\end{split}\n\\end{equation}\n\n\n\nFor illustration purposes, we plot $w(p)$, $\\tilde{F}_X(s)$, and $\\tilde{f}_X(s)$ in Fig. \\ref{probfuncplot} by referring to the suggested parameter ranges yielded by empirical evidence given in \\cite{dhami2016foundations}, ditto. In this figure, we can testify that the attribute of probability distortion from the prospect theory hold and inspect how this attribute and the parameters $\\gamma$ and $\\theta$ jointly affect the user perception of probability metrics. \n\n\\begin{figure*}\n \n \\begin{subfigure}[t]{0.3\\textwidth}\n \\includegraphics[width=2.5in]{perceivedprobability.eps}\n \\caption{}\n \\label{}\n \\end{subfigure}\n ~~\n \n \\begin{subfigure}[t]{0.3\\textwidth}\n \\includegraphics[width=2.5in]{perceivedcdf.eps}\n \\caption{}\n \\label{}\n \\end{subfigure}\n ~~\n \n \\begin{subfigure}[t]{0.3\\textwidth}\n \\includegraphics[width=2.5in]{perceivedpdf.eps}\n \\caption{}\n \\label{}\n \\end{subfigure}\n \\caption{Perceived probability, PCDF, and PPDF with different sets of parameters. Here, we take the normalized exponential distribution as an example to illustrate PCDF and PPDF, i.e., $F_X(s)=1-\\mathrm{exp}(-s)$ and $f_X(s)=\\mathrm{exp}(-s)$ for $s\\geq0$.}\n \\label{probfuncplot}\n\\end{figure*}\n\n\n\\subsection{Summary of the Proposed Analytical Framework}\nHaving obtained $v(x,x_0)$, $w(p)$, $\\tilde{F}_X(s)$, and $\\tilde{f}_X(s)$, we can reevaluate a set of advanced and composite performance metrics for communication systems incorporating non-technological factors. For example, given a composite metric $\\Omega(g)$ that is a function of a random variable $g$, and the PDF of $g$ is denoted as $f_G(g)$, we can define the perceptual utility (PU) of the composite metric by $\\tilde{\\Omega}=\\int_{0}^{\\infty}v(\\Omega(g),\\Omega_0)\\tilde{f}_G(g)\\mathrm{d}g$, where $\\Omega_0$ is the reference point of the composite metric. $\\tilde{\\Omega}$ can be employed to appraise the subjective performance pertaining to the composite variable. Different from objective performance evaluation metrics, the PU based on the prospect theory is allowed to be negative, which implies a negative user impression\/perception of the objective performance provided. Fig. \\ref{implementationsys} depicts the complete implementation process of the prospect theoretic analytical framework for perceptual performance analysis. Specific case studies for applying the analytical framework are given in the next section. \n\n\n\\begin{figure}[!t]\n\\centering\n\\includegraphics[width=3.5in]{implementationsys.png}\n\\caption{Implementation process of the prospect theoretic analytical framework for perceptual performance analysis.}\n\\label{implementationsys}\n\\end{figure}\n\n\n\n\n\\section{Case Studies}\\label{cs}\nConsider a simplistic point-to-point (P2P) wireless communication system consisting of a transmitter, a receiver, and a time-variant fading channel obeying the Rayleigh distribution, in which received signals are attenuated by multi-path fading and contaminated by a complex additive white Gaussian noise (AWGN). However, different from the classic communication system model, we add an \\textit{observer} and a \\textit{perceptor} after the receiving module, as shown in Fig. \\ref{sys}\\footnote{Note that, the proposed communication system model with the perceptor is different from the user-in-the-loop (UIL) model given in \\cite{6736762}, which relies on incentives (e.g., dynamic pricing) to change user behaviors and responses.}. The observer is responsible for evaluating received signals on an objective basis, so that the QoS metrics can be retrieved, whereas the perceptor is employed to assess the QoS metrics on a subjective basis to obtain the perceptual metrics.\n\n\n\\begin{figure*}[!t]\n\\centering\n\\includegraphics[width=5.5in]{sys.png}\n\\caption{Communication system model considered in this paper.}\n\\label{sys}\n\\end{figure*}\n\n\n\nIn such a simplistic P2P wireless communication system, the equivalent baseband input-output relation in the time domain can be written as \\cite{proakis2008digital}\n\\begin{equation}\\label{redasdas}\n\\begin{split}\n&R(t)\\\\\n&=\\sqrt{P_t}\\sum_{k=1}^{K}\\left(A_k(t)\\mathrm{exp}(-j2\\pi f_c \\tau_k(t))T(t-\\tau_k(t))\\right)+N(t),\n\\end{split}\n\\end{equation}\nwhere $T(t)$ and $R(t)$ represent the baseband transmitted and received signals at time $t$, respectively; $K$ is the number of propagation paths yielded by direct propagation, reflection, refraction, and scattering; $A_k(t)$ and $\\tau_k(t)$ characterize the attenuation and delay of the $k$th propagation path; $f_c$ is the central carrier frequency of the transmitted signal; $P_t$ is the transmit power; $N(t)$ represents the AWGN sample at the receiver with an average noise power $N_0$. In telecommunications, $\\tau_k(t)$ is generally assumed to be an exponentially distributed random variable and $f_c\\gg 1$. As a result, $\\theta_k(t)=2\\pi f_c\\tau_k(t)$ is approximated to be a uniform distributed random variable between 0 to $2\\pi$ rad. When the transmission is within a signaling interval, we can write the channel coefficient as\n\\begin{equation}\nH(t)=\\sum_{k=1}^{K}A_k(t)\\mathrm{exp}(-j\\theta_k(t))),\n\\end{equation}\nwhere $H(t)$ is a zero-mean complex Gaussian distributed random variable according to the central limit theorem when $K\\rightarrow\\infty$. For simplicity, we can assume that $G(t)=|H(t)|^2$ is exponentially distributed with CDF $F_G(g)=1-\\mathrm{exp}(-g\/\\mu)$ and PDF $f_G(g)=\\mathrm{exp}(-g\/\\mu)\/\\mu$ for $g\\geq 0$, where $\\mu$ is the average channel power gain \\cite{8344837}.\n\n\nBased on this simplistic model, we analyze the perceptual metrics corresponding to three fundamental but important QoS metrics: signal-to-noise ratio (SNR), transmission rate, and outage probability as follows, through the prospect theoretic analytical framework built in the last section.\n\n\n\\subsection{PU of Signal-to-Noise Ratio}\nFirst of all, the instantaneous SNR can be expressed as\n\\begin{equation}\\label{instantsnrexp}\n\\Gamma(t)={P_tG(t)}\/{N_0}.\n\\end{equation}\nTo analyze the average perception of continuous outcomes instead of discrete values, researchers in \\cite{rieger2006cumulative} generalize the original formulation of utility given in \\cite{tversky1992advances} and provide a new utility metric termed the \\textit{subjective utility}. Tailoring the subjective utility proposed by \\cite{rieger2006cumulative}, we define the PU of SNR in the context of the prospect theory as follows:\n\\begin{definition}\n\\textit{The prospect theoretic PU of SNR is the average perceived value of SNR from the user's perspective, complying with the human psychology of non-linear quantity and probability perception.}\n\\end{definition}\nWith the proposed analytical framework and the definition given above, the prospect theoretic PU of SNR can be written as \n\\begin{equation}\\label{snreq}\n\\begin{split}\n\\widetilde{\\Gamma}&=\\int_{0}^{\\infty} v(\\Gamma(t),\\Gamma_0)\\tilde{f}_G(G(t))\\mathrm{d}G(t)\\\\\n&=-\\lambda_2\\int_{0}^{\\frac{N_0\\Gamma_0}{P_t}} \\left(\\Gamma_0-\\Gamma(t)\\right)^{\\alpha}\\tilde{f}_G(G(t))\\mathrm{d}G(t)\\\\\n&~~~~+\\lambda_1\\int_{\\frac{N_0\\Gamma_0}{P_t}}^{\\infty} \\left(\\Gamma(t)-\\Gamma_0\\right)^{\\alpha}\\tilde{f}_G(G(t))\\mathrm{d}G(t),\n\\end{split}\n\\end{equation}\nwhere $\\Gamma_0$ is a predetermined reference point of SNR. The PU of SNR can be used to characterize the QoE\/UE regarding the reliability of communication networks. For illustration purposes, we plot the PU of SNR versus $P_t\/N_0$ with different sets of parameters for the normalized channel configuration (i.e., $\\mu=1$) in Fig. \\ref{pusnr}.\n\n\n\n\\begin{figure}[!t]\n\\centering\n\\includegraphics[width=3.5in]{PUSNR.eps}\n\\caption{PU of SNR with different sets of parameters, given $\\mu=1$.}\n\\label{pusnr}\n\\end{figure}\n\n\n\n\n\\subsection{PU of Transmission Rate}\nBased on the formulation of the instantaneous SNR given in (\\ref{instantsnrexp}), the instantaneous transmission rate for the normalized bandwidth is given by \\cite{7809043}\n\\begin{equation}\n\\Psi(t)=\\log_2(1+\\Gamma(t)).\n\\end{equation}\nSimilarly, according to the formulation of the subjective utility, we can define the PU of transmission rate in the context of the prospect theory infra:\n\\begin{definition}\n\\textit{The prospect theoretic PU of transmission rate is the average perceived value of transmission rate from the user's perspective, complying with the human psychology of non-linear quantity and probability perception.}\n\\end{definition}\nThe prospect theoretic PU of transmission rate can be explicitly expressed as\n\\begin{equation}\\label{rateeq}\n\\begin{split}\n\\widetilde{\\Psi}&=\\int_{0}^{\\infty} v(\\Psi(t),\\Psi_0)\\tilde{f}_G(G(t))\\mathrm{d}G(t)\\\\\n&=-\\lambda_2\\int_{0}^{\\frac{N_0\\Psi_0}{P_t}} \\left(\\Psi_0-\\Psi(t)\\right)^{\\alpha}\\tilde{f}_G(G(t))\\mathrm{d}G(t)\\\\\n&~~~~+\\lambda_1\\int_{\\frac{N_0\\Psi_0}{P_t}}^{\\infty} \\left(\\Psi(t)-\\Psi_0\\right)^{\\alpha}\\tilde{f}_G(G(t))\\mathrm{d}G(t),\n\\end{split}\n\\end{equation}\nwhere $\\Psi_0$ is a predetermined reference point of transmission rate. The PU of transmission rate can be used to characterize the QoE\/UE pertaining to the efficiency of communication networks. We plot the PU of transmission rate versus $P_t\/N_0$ with different sets of parameters for normalized channel configuration in Fig. \\ref{putr}. \n\n\n\n\n\n\n\\begin{figure}[!t]\n\\centering\n\\includegraphics[width=3.5in]{PUTR.eps}\n\\caption{PU of transmission rate with different sets of parameters, given $\\mu=1$.}\n\\label{putr}\n\\end{figure}\n\n\n\n\n\n\n\n\n\n\n\n\\subsection{Perceptual Outage Probability}\n\\begin{figure}[!t]\n\\centering\n\\includegraphics[width=3.5in]{POP.eps}\n\\caption{POP with different sets of parameters, given $\\mu=1$ and $\\epsilon=1$.}\n\\label{pop}\n\\end{figure}\n\n\n\nFollowing the formulation of the instantaneous transmission rate, we model the outage probability infra \\cite{8703169}:\n\\begin{equation}\n\\begin{split}\nP_{\\mathrm{out}}(\\epsilon)&=\\mathbb{P}\\left\\lbrace\\Psi(t)<\\epsilon\\right\\rbrace\\\\\n&=\\mathbb{P}\\left\\lbrace \\Gamma(t)<2^{\\epsilon}-1\\right\\rbrace\\\\\n&=\\mathbb{P}\\left\\lbrace G(t) 78\\ifmmode^\\circ\\else$^\\circ$\\fi$). This change in the\nantenna configuration is known to introduce changes in the source number\ndensity above $2.5$\\,mJy, as first pointed out by\n\\citet{Blake2002}. \nThe NVSS map at $2.5$\\,mJy is corrected for this\ndeclination systematic using the following procedure: the sky is divided into\nequatorial strips and the mean number of sources in each strip is\nre-normalised to the full sky mean~\\citep[see e.g.,][]{Vielva2006}.\nWith this procedure\nthe average number of sources in the NVSS map is the same as before the\ncorrection, and hence the shot noise level does not change. The number of\nstrips into which the map is divided is $70$, \nbut the results are independent of this choice.\n\nRegarding the galaxy bias,\nin this work we adopt the Gaussian bias evolution model of\n\\citet{Xia2011}. If $n(M,z)$ is the halo mass function and $b(M,z)$ is\nthe bias of halos with comoving mass $M$, then the bias of the survey is\ngiven by a mass-weighted integral,\n\\begin{equation}\nb(z) = \\frac{\\int_{M_{\\rm min}}^\\infty \\mathrm{d}M \\ b(M,z) \\ M \\\nn(M,z)}{\\int_{M_{\\rm min}}^\\infty \\mathrm{d}M \\ M \\ n(M,z)} \\ .\n\\label{eq:biasxia}\n\\end{equation}\nThis model depends on the minimum mass $M_{\\rm min}$ of halos present in\nthe survey. The upper limit in the mass is taken to be infinity\nbecause the effect of the high mass end on the bias is negligible.\n\\citet{MarcosCaballero2013} proposed a theoretical\nmodel for the NVSS angular power spectrum, which also takes into account the\ninformation of the redshift distribution given by CENSORS data\n\\citep{Brookes2008}. The redshift distribution is parametrized by\n\\begin{equation}\n\\frac{\\mathrm{d}n}{\\mathrm{d}z} =\nn_0 \\left( \\frac{z}{z_0} \\right)^\\alpha e^{-\\alpha z \/ z_0} \\ ,\n\\label{eqn:bias}\n\\end{equation}\nwhere $z_0=0.33$ and $\\alpha=0.37$. The parameter $n_0$ is a constant\nin order to have a distribution normalized to unity. This function is\nrepresented in Fig.~\\ref{fig:surveys_dndz}. \nThe bias follows the prescription of Eq.~\\ref{eq:biasxia}, with \n$M_{\\rm min}$ equal to $10^{12.67} {\\rm M}_{\\odot}$, where the\nSheth-Tormen~\\citep{Sheth1999} mass function is adopted. \nHereafter this model will be regarded as our fiducial model for NVSS.\n\n\\subsubsection{SDSS luminous galaxies}\n\nFor this analysis we use the photometric luminous galaxy (LG) catalogue from\nthe Baryonic Oscillation Spectroscopic Survey (BOSS) of the SDSS III.\nThe data used consist of two sub-samples: CMASS; and LOWZ. Both samples are\ncombined to form a unique LG map (see Fig.~\\ref{fig:surveys_maps},\nsecond panel). Hereafter, these samples will be referred to as SDSS-CMASS,\nSDSS-LOWZ, and SDSS-CMASS\/LOWZ, for the combination.\n\n\\subsubsection*{SDSS-CMASS}\n\nWe use the BOSS targets chosen to have roughly constant stellar mass and known\nas the photometric ``CMASS'' sample. This sample is mostly contained in the\nredshift range $z=0.4$--0.7, with a galaxy number density close to\n$110\\,{\\rm deg}^{-2}$, and is selected after applying the colour cuts\nexplained in \\citet{Ross2011}.\n\nWhile such color selection yields a catalogue of about $1{,}600{\\,},000$\ngalaxies, further cuts needed to be applied in order to account for dust\nextinction (based on the maps by \\citealt{Schlegel1998} with the\ncriterion $E(B-V) < 0.08$), for seeing in the $r$ band (required to be\n$<2.0^{\\prime\\prime}$) and for the presence of bright stars, similar to\n\\citet{Ho2012}. Finally, we neglected all pixels with a mask value inferred\nfrom the footprint below $0.9$ on a {\\tt HEALPix} map of resolution\n$N_\\mathrm{side}$=64. This procedure left about one million sources\n$10{,}500\\,{\\rm deg}^2$. Photometric redshifts of this sample are\ncalibrated using a selection of about 100{,}000 BOSS spectra as a training\nsample for the photometric catalogue.\nThese LGs are among the most luminous galaxies in the Universe and\ntherefore allow for a good sampling of the largest scales.\nGiven the large number of such sources included in the sample,\nshot-noise does not dominate clustering errors. According to \\citet{Ross2011},\nabout 3.7\\,\\% of these objects are either stars or quasars, and this\nmakes further corrections necessary, as explained at the end of this section.\n\n\\subsubsection*{SDSS-LOWZ}\n\nThe photometric LOWZ sample is one of the two galaxy samples targeted by the\nBOSS of Sloan III. It selectd luminous, highly biased, mostly red galaxies,\nplaced at an average redshift of $\\langle z\\rangle \\sim 0.3$ and below the\nredshifts of the CMASS sample ($z<0.4$). Our selection criteria in terms of\nthe Sloan five model magnitudes $ugriz$ follow those given in Sect.~2 of\n\\citet{Parejkoetal2012}.\nWith a total number of sources close to 600{,}000, this photometric sample\ncontains a higher number density of galaxies in the southern part of the\nfootprint than in the northern one (by more than 3\\,\\%), which seems to be\nat odds with $\\Lambda$CDM predictions. However, most of this effect vanishes\nwhen we subtract the dipole in the effective area under analysis, in such a\nway that the low $\\ell$ range of the auto power spectrum is consistent\nwith a $\\Lambda$CDM model and a constant bias $b\\simeq 2$\n\\citep{Hernandez2013}.\n\nBoth SDSS-CMASS and SDSS-LOWZ samples are further corrected for any\nscaling introduced by possible systematics like stars, mask value, seeing,\nsky emission, airmass and dust extinction. Following exactly the same\nprocedure as in \\citet{Hernandez2013}, we find that both LG samples are\ncontaminated by stars, in the sense that the galaxy number density decreases\nin areas with higher star density, since the latter tend to ``blind''\ngalaxy detection algorithms.\n\n\n\\subsubsection{Main photometric SDSS galaxy sample}\n\nWe use a sample of photometrically-selected galaxies from the SDSS-DR8\ncatalogue, which covers a \ntotal sky area of $14{,}555\\,{\\rm deg}^2$ \\citep{Aihara2011}.\nThe total number of objects labelled as \ngalaxies in this data release is 208 million. From this catalogue, and\nfollowing~\\cite{Cabre2006}, we \ndefine a subsample by selecting only objects within the range $18= \\frac{(C_\\ell^\\mathrm{gs})^2\\left(\\left|C(\\ell)\\right|+C_\\ell^\\mathrm{g}\nC_\\ell^\\mathrm{n}\\right)+\\left|\nC(\\ell)\\right|^2}{C_\\ell^\\mathrm{g}\\left(\\left|C(\\ell)\\right|+C_\\ell^\\mathrm{g} C_\\ell^\\mathrm{n}\\right)},\n\\end{equation}\nwhere $|C(\\ell)|$ is the determinant of the tracer-ISW covariance\nmatrix at each multipole, and $C_\\ell^\\mathrm{gs}$ and\n$C_\\ell^\\mathrm{g}$ are the\nassumed cross-spectrum and gravitational potential tracer\nspectra, respectively. Note that the recovered\nISW power spectrum will not contain the full ISW signal, since it can\nonly account for the part of the ISW signal probed by the tracer being\nconsidered. It is also worth noting that in detail the expected\ncross-correlation depends on the assumed model. However, in practice,\ngiven the weakness of the signal, it would be difficult to distinguish\nbetween two mild variants of the standard $\\Lambda$CDM model.\nNevertheless this approach still provides a useful consistency check.\n\n\\subsection{Results}\n\\label{subsec:iswmapresults}\n\n\\begin{figure*}\n\\centering\n\\includegraphics[width=17.cm]{.\/section_6.0\/figs\/rec_isw_nvss_lensing_masked_n0064.pdf}\n\\caption[fig:nvsssky]{Reconstructed ISW map from the \\textit{Planck}\\ CMB\n and NVSS data (left) and from the \\textit{Planck}\\ CMB and lensing potential maps\n (right). Note that the maps are not expected to look exactly the same,\n since each of them provides a partial reconstruction of the noisy ISW\n signal (see Sect.~\\ref{subsec:iswmapresults} for details). }\n\\label{fig:iswmap}\n\\end{figure*}\nWe have applied the filter described above to two different cases:\ncombining information from the CMB and the NVSS\ngalaxy catalogue; and applying the filter to\nthe CMB and the recovered lensing potential map described in\n\\ref{subsub:lens}. Results have been obtained for the four \\textit{Planck}\\ maps,\n{\\tt C-R}, {\\tt NILC}, {\\tt SEVEM}, and {\\tt SMICA}. For simplicity, we show the\nreconstructions only for the {\\tt SEVEM}\\\nCMB map, since the four methods give very similar results. The\nresolution considered for both analyses is $N_\\mathrm{side}=64$.\n\nFor the first case, we are using the \\textit{Planck}\\ fiducial\nmodel for the CMB and cross-power spectrum, while for the NVSS map we\nassume the model described in Sect.~\\ref{subsub:nvss}. We also take\ninto account the presence of Poissonian noise. We have excluded\nthe area obtained from combining the CMB mask at\n$N_\\mathrm{side}=64$ (described in Sect.~\\ref{subsubsec:cmbmaps})\nas well as the\narea which has not been observed by NVSS. The final mask keeps around\n62\\% of the sky. Since the filter is constructed in harmonic space, we\nhave used an apodized version of the mask in order to reduce the\nmask-induced correlations. In any case, the degradation\nintroduced by the presence of a mask is small \\citep{Barreiro2008}.\n\nFor the second case, the lensing map involved\napplying a high-pass filter, which removed all\nmultipoles with $\\ell < 10$. This filtering was done in harmonic\nspace with the presence of a mask. To take this effect into\naccount we used a direct estimation of the pseudo-power spectrum of these\ndata for the power spectrum of the lensing map,\nafter applying the corresponding apodized mask.\nWe used the \\textit{Planck}\\ fiducial model for the other\npower spectra involved, but setting to zero the cross-power for $\\ell < 10$.\nA mask has been constructed by combining the CMB mask plus that\nprovided for the lensing potential map (described in\n\\citealt{planck2013-p12}), which keeps around 67\\% of the sky. The\ncorresponding apodized version of this mask was applied before\nreconstructing the ISW map. Note that the map given in\nFig.~\\ref{fig:cmb_lensing_maps} (right panel) corresponds, to a good\napproximation, to the first term of the right hand side of\nEq.~\\ref{eq:rec}.\n\nFigure~\\ref{fig:iswmap} shows the reconstructed ISW map using the \\textit{Planck}\\ CMB\nmap and NVSS (left panel) and that obtained combining the CMB with the\nlensing potential map (right panel).\nThere are similar structures present in both maps, but they are\nnot expected to look exactly the same, since each of them provides only a\npartial reconstruction of the ISW signal.\nThis is due to the fact that the reconstruction accounts for\nthe part of the ISW effect probed by the considered tracer, which is\ndifferent (although correlated) for each case. Moreover,\ndue to the high-pass filter applied to the lensing potential map, the\npower at $\\ell < 10$ for this case corresponds to the Wiener-filtered\nmap of the CMB (to which the filter given by Eq.~\\ref{eq:rec} defaults,\nif the cross-correlation is set to zero, as in this case), without\nadditional information from the considered tracer.\n\nFor both cases, we have tested that the power spectrum of the\nrecovered ISW signal, as well as that of the cross-power between the\nreconstructed ISW and the considered gravitational potential tracer,\nare consistent with the corresponding expected values. This indicates\nthe compatibility between the assumed fiducial model and the\nunderlying statistical properties of the data.\n\n\\section{Conclusions}\\label{sec:discussion}\n\nThis paper presents the first study of the ISW effect using \\textit{Planck}\\ data.\nWe derived results based on three different approaches: the detection of the\ninterplay between weak lensing of the CMB and the ISW effect, by looking at\nnon-Gaussian signatures; the conventional cross-correlations with tracers of\nlarge-scale structure; and aperture photometry on stacks of the CMB field at\nthe positions of known superstructures. A reconstruction of the ISW map\ninferred from the CMB and LSS tracers was also provided.\n\nThe correlation with lensing allows, for the first time, the detection of the\nISW effect using only CMB data. This is an effective approach, because the\ngravitational potential responsible for deflecting CMB photons also generates\nISW temperature perturbations. Using different estimators, we investigated\nthe correlation of the \\textit{Planck}\\ temperature map with a reconstruction of the\nlensing potential on the one hand, and the estimation of the ISW-lensing\ngenerated non-Gaussian signature on the other. \nWe found that the signal strength is close to $2.5\\,\\sigma$, for several\ncombinations of estimator implementation and foreground-cleaned CMB maps.\n\nWe computed cross-correlations between the \\textit{Planck}\\ CMB temperature map,\nand tracers of large-scale structure, namely: the NVSS survey of radio\nsources; and the SDSS-CMASS\/LOWZ, and SDSS-MphG\\ galaxy samples. As estimators we considered\nthe angular cross-correlation function, the angular cross-spectra,\nand the variance of wavelet coefficients as a function of angular scale. \nWe performed a comparison on different component-separation maps, where we\nconsidered {\\tt C-R}, {\\tt NILC}, {\\tt SEVEM}, and {\\tt SMICA}, and found remarkable agreement\nbetween the results, indicating that the the low multipoles are robustly\nreconstructed. Covariance matrices between the cross-correlation quantities\nwere estimated for a set of Gaussian realizations of the CMB for the \\textit{Planck}\\\nfiducial model. For the ISW effect, we report detection significance levels\nof $2.9\\,\\sigma$ (NVSS), $1.7\\,\\sigma$ (SDSS-CMASS\/LOWZ), and $2.0\\,\\sigma$ (SDSS-MphG), which\nare consistent among the different estimators considered. Although these\nnumbers are compatible with previous claims which used \\textit{WMAP}\\ data, they are\ngenerally smaller. We believe that this discrepancy is mainly due to the\ndifferent characterization of the surveys and treatment of uncertainties,\nsince the measurement of the CMB fluctuations at the scales which contribute\nto the ISW detection are very similar for \\textit{Planck}\\ and \\textit{WMAP}. Only a fraction\nof these differences (around $0.3\\,\\sigma$) could be understood in terms of the different cosmological models used by each experiment -- in particular, the\nlower values of $H_0$ and $\\Omega_\\Lambda$ reported by \\textit{Planck}\\ compared with\n{\\it WMAP}.\n\nA strength of our new study lies in the fact that the amplitudes derived for\nthe expected signals are largely consistent with unity (i.e., the model\nexpectation), which indicates good modelling of the surveys.\nThe CMB and LSS cross-correlation has also been tested against the null\nhypothesis, i.e., whether the observed signal is compatible with a null\ncorrelation. As expected for such a weak signal, there is no strong evidence\nof incompatibility with the lack of correlation. In this respect, the CAPS\napproach seems to provide better constraints than the other estimators\ninvestigated here (CCF and the SMHWcov).\n\nWe explored the aperture photometry of stacked CMB patches at the positions\nof superstructures identified in the SDSS galaxy distribution. Our analysis\nof the \\citet{Granett2008a} catalogue (50 supervoids and 50 superstructures)\nreproduced previous results, with similarly strong amplitude and significance\nlevels (somewhat above and below $3\\,\\sigma$ for voids and clusters,\nrespectively). While the most plausible source of this signal is the ISW\neffect associated with these structures, it shows some tension with\nexpectations, both in terms of amplitude and scale. \nThe same type of analysis was carried on the latest and much larger void\ncatalogues of \\citet{Sutter2012} (about $1\\,500$ voids) and \\citet{Pan2012}\n(about $1\\,000$ voids). The results range from negligible to evidence at the\n2--2.5\\,$\\sigma$ level, with a more moderate amplitude and a smaller scale,\nin better agreement with theoretical predictions found in the literature.\nThe broad spectral coverage of \\textit{Planck}\\ allows us to confirm the achromatic\nnature of these signals over the 44 to 353\\,GHz range, supporting their\ncosmological origin. \n\nWe reconstructed maps of the ISW effect using a linear filter, by combining\nthe \\textit{Planck}\\ CMB and a gravitational potential tracers. In particular, we\nconsidered both the NVSS catalogue and the reconstructed CMB lensing map as\nLSS tracers. Again we found good agreement between different component\nseparation methods, as well as consistency between the expected and\nreconstructed auto- and cross-power spectra for the recovered ISW map.\n\nWe conclude that the ISW effect is present in \\textit{Planck}\\ data\nat the level expected for $\\Lambda$CDM-cosmologies,\nusing a range of measurement methods, although there is\na possible tension with the results from stacking of CMB fields centred on\nsuperstructures. Generally, our results are more conservative than previous\nclaims using \\textit{WMAP}\\ data, but the agreement with the expected signal is better.\nFuture \\textit{Planck}\\ data releases, including polarization information, as well as\nimproved understanding of foregrounds, could improve on these results, in\nparticular for ISW-lensing correlation and ISW-lensing map reconstruction.\n","meta":{"redpajama_set_name":"RedPajamaArXiv"}} +{"text":"\n\\section{\\label{sec:Adaptive-Channel-Recommendation}Adaptive Channel Recommendation\nScheme}\n\nWe first study the optimal channel recommendation in the homogeneous channel environment, i.e., each channel $m$ has the same data rate $B_{m}=B$ and identical channel state changing probabilities $p_{m}=p,q_{m}=q$. The generalization to the heterogeneous channel setting will be discussed in Section \\ref{sec:Adaptive-Channel-RecommendationII}. To find the optimal adaptive spectrum access strategy, we formulate the system as a Markov Decision Process\n(MDP). For the sake of simplicity, we assume that the recommendation\nbuffer size $W=1$, i.e., users only consider the recommendations received in the last time slot. Our method also applies to the case when $W>1$ by using\na high-order MDP formulation, although the analysis is more involved.\n\n\\begin{table*}[tt]\n\\begin{align}\nP{}_{R,R'}^{P_{rec}}= & \\sum_{m_{r}+m_{u}=R'\\ }\\sum_{R\\geq\\bar{m}_{r}\\geq m_{r},M-R\\geq\\bar{m}_{u}\\geq m_{u}\\ }\\sum_{n_{r}+n_{u}=N,n_{r}\\geq\\bar{m}_{r},n_{u}\\geq\\bar{m}_{u}}\\left(\\begin{array}{c}\nN\\\\\nn_{r}\\end{array}\\right)P_{rec}^{n_{r}}(1-P_{rec})^{n_{u}} \\nonumber \\\\\n & \\cdot\\left(\\begin{array}{c}\n\\bar{m}_{r}\\\\\nm_{r}\\end{array}\\right)(1-q)^{m_{r}}q^{\\bar{m}_{r}-m_{r}}\\frac{R!}{(R-\\bar{m}_{r})!}\\left(\\begin{array}{c}\nn_{r}-1\\\\\n\\bar{m}_{r}-1\\end{array}\\right)R{}^{-n_{r}} \\nonumber \\\\\n & \\cdot\\left(\\begin{array}{c}\n\\bar{m}_{u}\\\\\nm_{u}\\end{array}\\right)(\\frac{p}{p+q})^{m_{u}}(\\frac{q}{p+q})^{\\bar{m}_{u}-m_{u}}\\frac{(M-R)!}{(M-R-\\bar{m}_{u})!}\\left(\\begin{array}{c}\nn_{u}-1\\\\\n\\bar{m}_{u}-1\\end{array}\\right)(M-R){}^{-n_{u}}. \\label{eq:2565} \\end{align}\n\\hrule\n\\end{table*}\n\n\\subsection{MDP Formulation For Adaptive Channel Recommendation}\nWe model the system as a MDP as follows:\n\\begin{itemize}\n\\item \\emph{System state}: $R\\in\\mathcal{R}\\triangleq\\{0,1,...,\\min\\{M,N\\}\\}$ denotes the number of recommended channels at the end of time slot $t$. Since we assume that all channels are statistically identical, then there is no need to keep track of the recommended channel IDs\\footnote{Users need to know the IDs of the recommended channels in order to access them. However, the IDs are not important in terms of MDP analysis.}.\n\\item \\emph{Action}: $P_{rec}\\in\\mathcal{P}\\triangleq(0,1)$ denotes the branching probability of choosing the set of recommended channels.\n\\item \\emph{Transition probability}: The probability that action $P_{rec}$ in system state $R$ in time slot $t$ will lead to system state $R'$ in the next time\nslot is\n\\[P{}_{R,R'}^{P_{rec}}=Pr\\{R(t+1)=R'|R(t)=R,P_{rec}(t)=P_{rec}\\}.\\]\nWe can compute this probability as in (\\ref{eq:2565}), with detailed derivations given in Appendix \\ref{Derivation}.\n\\item \\emph{Reward}: $U(R,P_{rec})$ is the expected system throughput in the next time slot when the action $P_{rec}$ is taken under the current system state $R$, i.e.,\n\\[\nU(R,P_{rec})=\\sum_{R\\in\\mathcal{R'}}P{}_{R,R'}^{P_{rec}}U_{R'},\\]\nwhere $U_{R'}$ is the system throughput in state $R'$. If $R'$ idle channels are utilized by the secondary users in a time slot, then these $R'$ channels will be recommended at the end of the time slot. Thus, we have \\[\nU_{R'}=R'B.\\]\nRecall that $B$ is the data rate that a single user can obtain on an\nidle channel.\n\\item \\emph{Stationary Policy:} $\\pi\\in\\Omega\\triangleq\\mathcal{P}{}^{|\\mathcal{R}|}$ maps each state $R$ to an action $P_{rec}$, i.e., $\\pi(R)$ is the action $P_{rec}$ taken when the system is in state $R$. \\rev{The mapping is stationary and does not depend on time $t$.}\n\\end{itemize}\n\nGiven a stationary policy $\\pi$ and the initial state $R_{0}\\in\\mathcal{R}$,\nwe define the network's value function as the time average system throughput,\ni.e. \\[\n\\Phi_{\\pi}(R_{0})=\\lim_{T\\rightarrow\\infty}\\frac{1}{T}E_{\\pi}\\left[\\sum_{t=0}^{T-1}U(R(t),\\pi(R(t)))\\right].\\]\nWe want to find an optimal stationary policy $\\pi^{*}$ that maximizes the value function $\\Phi_{\\pi}(R_{0})$ for any initial state $R_{0}$, i.e.\\[\n\\pi^{*}=\\arg\\max_{\\pi}\\Phi_{\\pi}(R_{0}),\\forall R_{0}\\in\\mathcal{R}.\\]\n\\rev{Notice that this is a system wide optimization, although the optimal solution can be implemented in a distributed fashion. This is because every user knows the number of recommended channels $R$, and it can determine the same optimal access probability locally.} For example, each user can calculate the optimal spectrum access policy off-line, and determine the real-time optimal channel access probability $P_{rec}$ locally by observing the number of recommended channels $R$ after entering the network.\n\n\n\\subsection{Existence of Optimal Stationary Policy}\n\nMDP formulation above is an average reward based MDP. We can prove that an optimal stationary policy that is independent of initial system state always exists in our MDP formulation. The proof relies on the following lemma from \\cite{key-4}.\n\\begin{lem} \\label{lemmaA}\nIf the state space is finite and every stationary policy leads\nto an irreducible Markov chain, then there exists a stationary policy\nthat is optimal for the average reward based MDP.\n\\end{lem}\nThe irreducibility of Markov chain means that it is possible to get to any state from any state. For the adaptive channel recommendation scheme, we have\n\\begin{lem}\\label{lemmaB}\nGiven a stationary policy $\\pi$ for the adaptive channel recommendation\nMDP, the resulting Markov chain is irreducible.\n\\end{lem}\n\\begin{proof}\nWe consider the following two cases:\n\nCase I, when $00$ for all $R'\\in\\mathcal{R}$. Thus, any two states communicate with each other.\n\nCase II, when $q=1$: for all $R\\in\\mathcal{R}$, the transition probability $P{}_{R,R'}^{P_{rec}}>0$ if $R'\\in\\{0,...,\\min\\{M-R,N\\}\\}$. It follows that the state $R'=0$ is accessible from any other state\n$R\\in\\mathcal{R}$. By setting $R=0$, we\nsee that $P{}_{R,R'}^{P_{rec}}>0$, for all $R'\\in\\{0,...,\\min\\{M,N\\}\\}$. That\nis, any other state $R'\\in\\mathcal{R}$ is also accessible from the state\n$R=0$. Thus, any two states communicate with each other.\n\nSince any two states communicate with each other in all cases and\nthe number of system state $|\\mathcal{R}|$ is finite, the resulting\nMarkov chain is irreducible.\n\\end{proof}\nCombining Lemmas \\ref{lemmaA} and \\ref{lemmaB}, we have\n\\begin{thm}\nThere exists an optimal stationary policy for the adaptive channel\nrecommendation MDP.\n\\end{thm}\n\nFurthermore, the irreducibility of the adaptive channel\nrecommendation MDP also implies that the optimal stationary policy $\\pi^{*}$ is independent of the initial state $R_{0}$ \\cite{key-4}, i.e.\n\\[\n\\Phi_{\\pi^{*}}(R_{0})=\\Phi_{\\pi^{*}}, \\forall R_{0}\\in\\mathcal{R},\n\\]where $\\Phi_{\\pi^{*}}$ is the maximum time average system throughput.\nIn the rest of the paper, we will just use \\textquotedblleft{}optimal policy\\textquotedblright{} to refer \\textquotedblleft{}optimal stationary policy that is independent of the initial system state\\textquotedblright{}.\n\n\n\n\\subsection{Structure of Optimal Stationary Policy}\n\nNext we characterize the structure of the optimal policy without using the closed-form expressions of the policy (which is generally hard to achieve). The key idea is to treat the average\nreward based MDPs as the limit of a sequence of discounted reward MDPs with discounted\nfactors going to one. Under the irreducibility condition, the average reward based MDP thus inherits the\nstructure property from the corresponding discounted reward MDP \\cite{key-4}.\nWe can write down the Bellman equations of the discounted version of our MDP problem as:\n\\begin{equation}\nV_{t}(R)=\\max_{P_{rec}\\in\\mathcal{P}}\\sum_{R'\\in\\mathcal{R}}P{}_{R,R'}^{P_{rec}}[U_{R'}+\\beta V_{t+1}(R')],\\forall R\\in\\mathcal{R},\\label{eq:5647}\\end{equation}\nwhere $V_{t}(R)$ is the discounted maximum expected system throughput starting from time\nslot $t$ when the system in state $R$.\n\nDue to the combinatorial complexity of the transition probability\n$P{}_{R,R'}^{P_{rec}}$ in (\\ref{eq:2565}), it is difficult to obtain\nthe structure results for the general case. We further limit our attention to the following two asymptotic cases.\n\n\n\\subsubsection{Case One, the number of channels $M$ goes to infinity while the number of users $N$ stays finite}\n\nIn this case, the number of channels is much larger than the number of secondary users, and thus heavy congestion rarely happens on any channel. Thus it is safe to emphasizing on accessing the recommended channels. Before proving the main result of Case One in Theorem \\ref{thmM>N}, let us first characterize the property of discounted maximum expected system payoff $V_t(R)$.\n\\begin{proposition}\n\\label{lem:When-,-i.e.II}When $M=\\infty$ and $N<\\infty$\n, the value function $V_{t}(R)$ for the discounted adaptive\nchannel recommendation MDP is nondecreasing in $R$ .\\end{proposition}\n\nThe proof of Proposition \\ref{lem:When-,-i.e.II} is given in the Appendix.\nBased on the monotone property of the value function $V_{t}(R)$, we prove the following main result.\n\\begin{thm}\n\\label{thmM>N}\nWhen $M=\\infty$ and $N<\\infty$, for the adaptive channel\nrecommendation MDP, the optimal stationary policy $\\pi^{*}$ is monotone,\nthat is, $\\pi^{*}(R)$ is nondecreasing on $R\\in\\mathcal{R}$.\\end{thm}\n\\begin{proof}\nFor the ease of discussion, we define \\[\nQ_{t}(R,P_{rec})=\\sum_{R'\\in\\mathcal{R}}P{}_{R,R'}^{P_{rec}}[U_{R'}+\\beta V_{t+1}(R')],\\]\nwith the partial cross derivative being \\begin{eqnarray*}\n\\frac{\\partial^{2}Q_{t}(R,P_{rec})}{\\partial R\\partial P_{rec}} & = & \\frac{\\partial\\sum_{R'\\in\\mathcal{R}}P{}_{R+1,R'}^{P_{rec}}[U_{R'}+\\beta V_{t+1}(R')]}{\\partial P_{rec}}\\\\\n & & -\\frac{\\partial\\sum_{R'\\in\\mathcal{R}}P{}_{R,R'}^{P_{rec}}[U_{R'}+\\beta V_{t+1}(R')]}{\\partial P_{rec}}.\\end{eqnarray*}\nBy Lemma $6$ in the Appendix, we know the reverse cumulative distribution\nfunction $\\sum_{R'\\in\\mathcal{R}}P{}_{R,R'}^{P_{rec}}$ is supermodular on $\\mathcal{R}\\times\\mathcal{P}$.\nIt implies \\[\n\\frac{\\partial\\sum_{R'\\in\\mathcal{R}}P{}_{R+1,R'}^{P_{rec}}}{\\partial P_{rec}}-\\frac{\\partial\\sum_{R'\\in\\mathcal{R}}P{}_{R,R'}^{P_{rec}}}{\\partial P_{rec}}\\geq0.\\]\nSince $V_{t+1}(R')$ is nondecreasing in $R'$ by Proposition \\ref{lem:When-,-i.e.II} and $U_{R'}=R'B$, we know that $U_{R'}+\\beta V_{t+1}(R')$ is also nondecreasing in $R'$.\nThen we have\\begin{eqnarray*}\n & & \\frac{\\partial\\sum_{R'\\in\\mathcal{R}}P{}_{R+1,R'}^{P_{rec}}[U_{R'}+\\beta V_{t+1}(R')]}{\\partial P_{rec}}\\\\\n & \\geq & \\frac{\\partial\\sum_{R'\\in\\mathcal{R}}P{}_{R,R'}^{P_{rec}}[U_{R'}+\\beta V_{t+1}(R')]}{\\partial P_{rec}},\\end{eqnarray*}\ni.e.,\\[\n\\frac{\\partial^{2}Q_{t}(R,P_{rec})}{\\partial R\\partial P_{rec}}\\geq0,\\]\nwhich implies that $Q_{t}(R,P_{rec})$ is supermodular on $\\mathcal{R}\\times\\mathcal{P}$.\nSince \\[\n\\pi^{*}(R)=\\arg\\max_{P_{rec}}Q_{t}(R,P_{rec}),\\]\nby the property of super-modularity, the optimal policy $\\pi^{*}(R)$\nis nondecreasing on $R$ for the discounted MDP above. Since the average\nreward based MDP inherits its structure property, this result is also\ntrue for the adaptive channel recommendation MDP.\n\\end{proof}\n\n\\subsubsection{Case Two, the number of users $N$ goes to infinity while the number of channels $M$ stays finite}\nIn this case, the number of secondary users is much larger than the number of channels, and thus congestion becomes a major concern. However, since there are infinitely many secondary users, all the idle channels at each time slot can be utilized as long as users have positive probabilities to access all channels. From the system's point of view, the cognitive radio network operates in the saturation state. Formally, we show that\n\\begin{thm}\\label{InfN}\nWhen $N=\\infty$ and $M<\\infty$, for the adaptive channel\nchannel recommendation MDP, any stationary policy $\\pi$ satisfying\\[\n0<\\pi(R)<1,\\forall R\\in\\mathcal{R},\\]\nis optimal. \\end{thm}\n\\begin{proof}\nWe first define the sets of policies $\\Delta\\triangleq\\{\\pi:0<\\pi(R)<1,\\forall R\\in\\mathcal{R}\\}$\nand $\\Delta^{c}=\\Omega\\backslash\\Delta$. Recall that the value of $\\pi(R)$ equals the probability of choosing the set of recommended channels, i.e., $P_{rec}$.\n\nThen it is easy to check that the probability of accessing an arbitrary channel\n$m$ is positive under any policy $\\pi\\in\\Delta$. Since\nthe number of secondary users $N=\\infty$, it implies that all the\nchannels will be accessed by the secondary users. In this case, the\ntransition probability from a system state $R$ to $R'$ of the resulting\nMarkov chain is given by\\begin{eqnarray}\n & & P_{R,R'}^{\\pi(R)}\\nonumber \\\\\n & = & \\sum_{m_{r}+m_{u}=R',m_{r}\\le R,m_{u}\\le M-R}\\left(\\begin{array}{c}\nR\\\\\nm_{r}\\end{array}\\right)(1-q)^{m_{r}}q^{R-m_{r}}\\nonumber\\\\\n & & \\cdot\\left(\\begin{array}{c}\nM-R\\\\\nm_{u}\\end{array}\\right)(\\frac{p}{p+q})^{m_{u}}(\\frac{q}{p+q})^{M-R-m_{u}},\\label{eq:215.1}\\end{eqnarray}\nwhich is independent of the branching probability $\\pi(R)$. It implies\nthat any policy $\\pi\\in\\Delta$ leads to a Markov chain with\nthe same transition probabilities $P_{R,R'}^{P_{rec}}$. Thus, any\npolicy $\\pi\\in\\Delta$ offers the same time average system throughput.\n\nWe next show that any policy $\\pi'\\in\\Delta^{c}$ leads to a payoff no better than the payoff of a policy $\\pi\\in\\Delta$. For a policy $\\pi'$ where there exists some states $\\bar{R}$\nsuch that $\\pi'(\\bar{R})=0$, the transition probability from\nthe system state $\\bar{R}$ to $R'$ is\\begin{eqnarray*}\nP_{\\bar{R},R'}^{\\pi'(\\bar{R})} & = & \\begin{cases}\n\\left(\\begin{array}{c}\nM-\\bar{R}\\\\\nR'\\end{array}\\right)(\\frac{p}{p+q})^{R'}(\\frac{q}{p+q})^{M-\\bar{R}-R'}\\\\\n\\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\mbox{If}\\ R'\\le M-\\bar{R},\\\\\n0\\mbox{\\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ If}\\ R'>M-\\bar{R}.\n\\end{cases}\\end{eqnarray*}\nIf there exists some states $\\hat{R}$ such that $\\pi'(\\hat{R})=1$,\nwe have the transition probability as\\begin{eqnarray*}\nP_{\\hat{R},R'}^{\\pi'(\\hat{R})} & = & \\begin{cases}\n\\left(\\begin{array}{c}\n\\hat{R}\\\\\nR'\\end{array}\\right)(1-q)^{R'}q^{\\hat{R}-R'} & \\mbox{If\\ }R'\\le\\hat{R},\\\\\n0 & \\mbox{If\\ }R'>\\hat{R}.\\end{cases}\\end{eqnarray*}\nSince \\begin{eqnarray*}\n & & \\left(\\begin{array}{c}\nM-\\bar{R}\\\\\nR'\\end{array}\\right)(\\frac{p}{p+q})^{R'}(\\frac{q}{p+q})^{M-\\bar{R}-R'}\\\\\n & = & \\sum_{j=0}^{\\bar{R}}\\left(\\begin{array}{c}\n\\bar{R}\\\\\nj\\end{array}\\right)(1-q)^{j}q^{\\bar{R}-j}\\\\\n & & \\cdot\\left(\\begin{array}{c}\nM-\\bar{R}\\\\\nR'\\end{array}\\right)(\\frac{p}{p+q})^{R'}(\\frac{q}{p+q})^{M-\\bar{R}-R'},\\end{eqnarray*}\nand\\begin{eqnarray*}\n & & \\left(\\begin{array}{c}\n\\hat{R}\\\\\nR'\\end{array}\\right)(1-q)^{R'}q^{\\hat{R}-R'}\\\\\n & = & \\sum_{j=0}^{M-\\hat{R}}\\left(\\begin{array}{c}\nM-\\hat{R}\\\\\nj\\end{array}\\right)(\\frac{p}{p+q})^{j}(\\frac{q}{p+q})^{M-\\hat{R}-j}\\\\\n & & \\cdot\\left(\\begin{array}{c}\n\\hat{R}\\\\\nR'\\end{array}\\right)(1-q)^{R'}q^{\\hat{R}-R'},\\end{eqnarray*}\ncompared with (\\ref{eq:215.1}), we have\\[\n\\sum_{R'=i}^{M}P_{R,R'}^{\\pi(R)}\\geq\\sum_{R'=i}^{M}R_{R,R'}^{\\pi'(R)},\\forall i,R\\in\\mathcal{R},\\pi\\in\\Delta,\\pi'\\in\\Delta^{c}.\\]\n\n\nSuppose that the time horizon consists of any $T$ time slots, and $V_{t}^{\\pi}(R)$\ndenotes the expected system throughput under the policy $\\pi$ by starting from\ntime slot $t$ when the system in state $R$.\n\nWhen $t=T$, \\begin{eqnarray*}\nV_{T}^{\\pi}(R) & = & V_{T}^{\\pi'}(R)\\\\\n & = & U_{R}\\\\\n & = & RB,\\forall R\\in\\mathcal{R},\\pi\\in\\Delta,\\pi'\\in\\Delta^{c}.\\end{eqnarray*}\nIt follows that $U_{R}+\\beta V_{T}^{\\pi}(R)=U_{R}+\\beta V_{T}^{\\pi'}(R)$,\nand hence \\begin{eqnarray*}\n & & \\sum_{R'=0}^{M}P_{R,R'}^{\\pi(R)}[U(R)+\\beta V_{T}^{\\pi}(R)]\\\\\n & \\geq & \\sum_{R'=0}^{M}R_{R,R'}^{\\pi'(R)}[U(R)+\\beta V_{T}^{\\pi'}(R)],\\end{eqnarray*}\ni.e., \\[\nV_{T-1}^{\\pi}(R)\\geq V_{T-1}^{\\pi'}(R),\\forall R\\in\\mathcal{R},\\pi\\in\\Delta,\\pi'\\in\\Delta^{c}.\\]\nRecursively, for any time slots $t\\leq T$, we can show that\\[\nV_{t}^{\\pi}(R)\\geq V_{t}^{\\pi'}(R),\\forall R\\in\\mathcal{R},\\pi\\in\\Delta,\\pi'\\in\\Delta^{c}.\\]\nThus, if there exists a policy $\\pi'\\in\\Delta^{c}$ that is optimal, then\nall the policies $\\pi\\in\\Delta$ is also optimal. If there does not\nexist such a policy $\\pi'$, then we conclude that only the policy\n$\\pi\\in\\Delta$ is optimal.\n\\end{proof}\n\n\n\n\\section{\\label{sec:Adaptive-Channel-RecommendationII}Adaptive Channel Recommendation With Channel Heterogeneity}\n\\rev{\nWe now generalize the adaptive channel recommendation to the heterogeneous\nchannel setting. Recall that the system state $R$ in the homogeneous\nchannel case only keeps track of how many\nchannels are recommended. In a heterogeneous channel environment,\neach channel has different a data rate $B_{m}$ and channel state changing\nprobabilities $p_{m}$ and $q_{m}$. Keeping track of the number of recommend channels is not enough for optimal decision. Intuitively, if a channel\nwith higher data rate $B_{m}$ is recommended, users should choose this channel with a higher weight. The new system state for the heterogeneous channel case should be defined as a vector $\\vec{R}\\triangleq(I_{1},...,I_{M})$,\nwhere $I_{m}=1$ if channel $m$ is recommended and $I_{m}=0$ otherwise.\nThe objective of the heterogeneous channel recommendation MDP is then\nto find the optimal channel access probabilities $\\{P_{m}(\\vec{R})\\}_{m=1}^{M}$\nfor each system state $\\vec{R}$ where $P_{m}(\\vec{R})$ is the probability\nof selecting channel $m$. \n\nSimilarly with the homogeneous channel\ncase, we can apply the MRAS method to obtain the optimal\nsolutions with the new formulation. However, the number of decision variables $\\{P_{m}(\\vec{R})\\}_{m=1}^{M}$\nin the heterogeneous channel model equals to $M2^{M}$,\nwhich causes exponential blow up in the computational complexity. We next\nfocus on developing a low complexity efficient heuristic algorithm to solve the MDP.\n\nRecall that in the heuristic algorithm in Lemma \\ref{lemma12s} for the homogeneous\nchannel recommendation, the weight of selecting each recommended channel\nis $\\frac{1}{N}$ and total weights of choosing recommended channels\nare $R\\frac{1}{N}$. Similarly, we can design a low complexity heuristic\nalgorithm for the heterogeneous channel recommendation. More specifically,\nwe set the weight of selecting channel $m$ is $P_{1}^{m}$ ($P_{0}^{m}$, respectively)\nwhen the channel is recommended (the channel is not recommended, respectively).\nGiven the system is in state $\\vec{R}$, the probability of choosing\nchannel $m$ is proportional to its weight of its state $I_{m}$,\ni.e.,\\begin{equation}\nP_{m}(\\vec{R})=\\frac{P_{I_{m}}^{m}}{\\sum_{m'=1}^{M}P_{I_{m'}}^{m}}.\\label{eq:hcp}\\end{equation}\nIn this case, the total number of decision variables $P_{I_{m}}^{m}$ is\nreduced to $2M$, which grows linearly in the number of channels $M$. Let $\\vec{\\pi}=\\{(P_{1}^{m},P_{0}^{m})\\}_{m=1}^{M}\\in(0,1)^{2M}$denote\nthe set of corresponding decision variables. Our objective is to find\nthe optimal $\\vec{\\pi}$ that maximizes the time average throughput\n$\\Phi_{\\vec{\\pi}}$. We can again apply the MRAS method to find the optimal\nsolution, which is given in Algorithm \\ref{alg:MRAS-Method-ForII}.\nThe procedures of derivation is very similar with the MRAS method\nfor the homogeneous channel recommendation; we omit the details due to\nspace limit. \n\nNote that the optimal policy $\\vec{\\pi}^{*}$ for the\nheuristic heterogeneous channel recommendation is also a feasible policy for\nthe heterogeneous channel recommendation MDP. The performance of the\noptimal policy for the heterogeneous channel recommendation MDP thus\ndominates the heuristic heterogeneous channel recommendation. However,\nnumerical results show that the heuristic heterogeneous channel recommendation\nhas a small performance loss comparing to the optimal policy while gaining a significant computation complexity\nreduction.\n}\n\n\\begin{algorithm}[tt]\n\\begin{algorithmic}[1]\n\\State \\textbf{initialize} parameters for the elite ratio $\\rho$, Gaussian distributions $\\boldsymbol{\\mu}(0)=\\{(\\mu_{1}^{m}(0),\\mu_{0}^{m}(0))\\}_{m=1}^{M},\\boldsymbol{\\sigma}(0)=\\{(\\sigma_{1}^{m}(0),\\sigma_{0}^{m}(0))\\}_{m=1}^{M}$,\nand the stopping criterion $\\xi$. Set initial elite threshold $\\gamma_{0}=0$ and iteration index $k=0$.\n\\Repeat{:}\n\\State \\textbf{increase} iteration index $k$ by 1.\n\\State \\textbf{generate} $L$ candidate policies $\\vec{\\pi}_{1},...,\\vec{\\pi}_{L}$\nfrom the random policy generation mechanism $f(\\vec{\\pi},\\boldsymbol{\\mu}(k-1),\\boldsymbol{\\sigma}(k-1))$.\n\\State \\textbf{select} elite policies by setting the elite threshold $\\gamma_{k}=\\max\\{\\Phi_{\\hat{\\vec{\\pi}}_{\\lceil(1-\\rho)L\\rceil}},\\gamma_{k-1}\\}.$\n\\State \\textbf{update} the random policy generation mechanism by (for any $I_{m}\\in\\{0,1\\},m\\in\\mathcal{M}$) \\begin{align}\n\\mu_{I_{m}}^{m}(k) & = \\frac{\\sum_{i=1}^{L}e^{(k-1)\\Phi_{\\vec{\\pi}}}I_{\\{\\Phi_{\\vec{\\pi}_{i}}\\geq\\gamma_{k}\\}}P_{I_{m}}^{m}}{\\sum_{i=1}^{L}e^{(k-1)\\Phi_{\\vec{\\pi}}}I_{\\{\\Phi_{\\vec{\\pi}_{i}}\\geq\\gamma_{k}\\}}},\\label{eq:525-1}\\\\\n\\sigma_{I_{m}}^{m}(k) & = \\left(\\frac{\\sum_{i=1}^{L}e^{(k-1)\\Phi_{\\vec{\\pi}}}I_{\\{\\Phi_{\\vec{\\pi}_{i}}\\geq\\gamma_{k}\\}}(P_{I_{m}}^{m}-\\mu_{I_{m}}^{m}(k))^{2}}{\\sum_{i=1}^{L}e^{(k-1)\\Phi_{\\vec{\\pi}}}I_{\\{\\Phi_{\\vec{\\pi}_{i}}\\geq\\gamma_{k}\\}}}\\right)^{\\frac{1}{2}}.\\label{eq:525-2}\\end{align}\n\\Until{$\\max_{I_{m}\\in\\{0,1\\},m\\in\\mathcal{M}}\\sigma_{I_{m}}^{m}(k)<\\xi.$}\n\\end{algorithmic}\n\\caption{\\label{alg:MRAS-Method-ForII}MRAS-based Algorithm For Optimizing Heuristic Heterogeneous Channel Recommendation}\n\\end{algorithm} \n\\subsection{Proof of Lemma \\ref{lemma11s}}\\label{ProofLemma1}\nWhen $S_{m}(t)=0$, this trivially holds. We focus on the case that\n$S_{m}(t)=1$.\n\nLet $\\mathcal{K}_{m}=\\{1,...,k_{m}(t)\\}$ be the set of secondary\nusers accessing the channel $m$, $\\tau_{m}^{i}$ be the backoff time\nbe generated by secondary user $i$ and $\\tau_{m}^{(1)}=\\min\\{\\tau_{m}^{i}|i\\neq n,i\\in\\mathcal{K}_{m}\\}$.\nThe probability that the user $n$ captures the channel $m$ is given\nas\\begin{eqnarray*}\nPr_{n,m} & = & P\\{\\tau_{m}^{(1)}>\\tau_{m}^{n}\\}\\\\\n & = & (1-\\frac{\\tau_{m}^{n}}{\\tau_{max}})^{k_{m}(t)-1}.\\end{eqnarray*}\nThus, the expected throughput of user $n$ is\\begin{eqnarray*}\nu_{n}(t) & = & \\int_{0}^{\\tau_{max}}BPr_{n,m}\\frac{1}{\\tau_{max}}d\\tau_{m}^{n}\\\\\n & = & \\int_{0}^{\\tau_{max}}B(1-\\frac{\\tau_{m}^{n}}{\\tau_{max}})^{k_{m}(t)-1}\\frac{1}{\\tau_{max}}d\\tau_{m}^{n}\\\\\n & = & \\frac{B}{k_{m}(t)}.\\\\\n & = & \\frac{BS_{m}(t)}{k_{m}(t)}.\\end{eqnarray*} \\qed \n \n \n\\subsection{Proof of Lemma \\ref{lemma12s}}\\label{ProofLemma2}\nLet $\\Lambda_{C}$ denote the event that $C$ secondary users choose\nthe recommended channels, and $Pr(c_{1},...,c_{R})$ denote probability\nmass function that the number of secondary users on these $R$ recommended\nchannels equal to $c_{1},...,c_{R}$ respectively. Given the event\n$\\Lambda_{C}$, we have \\[\nPr(c_{1},...,c_{R}|\\mbox{\\ensuremath{\\Lambda_{C}}})=\\left(\\begin{array}{c}\nn\\\\\nc_{1},...,c_{R}\\end{array}\\right)R^{-C},\\]\nwhich is a Multinomial mass function. By the property of Multinomial\ndistribution, we have\\[\nE[c_{m}|\\Lambda_{C}]=\\frac{C}{R}.\\]\nIt follows that the expected number of users choosing a recommended\nchannel $m$ is\\begin{eqnarray*}\nE[c_{m}] & = & \\sum_{C=0}^{N}E[c_{m}|\\Lambda_{C}]Pr(\\Lambda_{C})\\\\\n & = & \\sum_{C=0}^{N}\\frac{C}{R}\\left(\\begin{array}{c}\nN\\\\\nC\\end{array}\\right)P_{rec}^{C}(1-P_{rec})^{N-C}\\\\\n & = & \\frac{P_{rec}N}{R}.\\end{eqnarray*}\nThen $E[c_{m}]=1$ requires that\\[\nP_{rec}=\\frac{R}{N}.\\] \\qed\n\n\\subsection{Derivation of Transition Probability}\\label{Derivation}\nWhen the system state transits from $R$ to $R'$, we assume that\n$m_{r}$ and $m_{u}$ recommendations, out of $R'$ recommendations,\nare channels that have been recommended and have not been recommended\nat time slot $t$ respectively. Obviously, $m_{r}+m_{u}=R'$. We assume\nthat $\\bar{m}_{r}$ recommended channels and $\\bar{m}_{u}$ unrecommended\nchannels have been accessed by the secondary users at time slot $t+1$.\nWe thus have $R\\geq\\bar{m}_{r}\\geq m_{r}$ and $M-R\\geq\\bar{m}_{u}\\geq m_{u}$.\nWe also assume that there are $n_{r}$ secondary users have accessed\nthese $\\bar{m}_{r}$ recommended channels and $n_{u}$ secondary users\nhave accessed those $\\bar{m}_{u}$ unrecommended channels at time\nslot $t+1$. Obviously, we have $n_{r}+n_{u}=N$ , $n_{r}\\geq\\bar{m}_{r}$\nand $n_{u}\\geq\\bar{m}_{u}$.\n\nFor the first term, the probability that the user distribution $(n_{r},n_{u})$\nhappens follows the Binomial distribution as $\\left(\\begin{array}{c}\nN\\\\\nn_{r}\\end{array}\\right)P_{rec}^{n_{r}}(1-P_{rec})^{n_{u}}$.\n\nFor the second term, when $\\bar{m}_{r}\\ge1$, it is easy to check\nthat there are $\\left(\\begin{array}{c}\nn_{r}-1\\\\\n\\bar{m}_{r}-1\\end{array}\\right)$ ways for $n_{r}$ secondary users to choose $\\bar{m}_{r}$ recommended\nchannels and there are $\\frac{R!}{(R-\\bar{m}_{r})!}$ possibilities\nfor these $\\bar{m}_{r}$ recommended channels out of the $R$ recommended\nchannels, each of which has probability $(\\frac{1}{R})^{n_{r}}$.\nAmong these $\\bar{m}_{r}$ recommended channels that have been accessed\nby the secondary users, the probability that $m_{r}$ channels turn\nout to be idle is given as $\\left(\\begin{array}{c}\n\\bar{m}_{r}\\\\\nm_{r}\\end{array}\\right)(1-q)^{m_{r}}q^{\\bar{m}_{r}-m_{r}}$. When $\\bar{m}_{r}=0$, it requires that $u_{r}=0$. Thus, we define\n\\[\n\\left(\\begin{array}{c}\nn_{r}-1\\\\\n-1\\end{array}\\right)=\\begin{cases}\n1 & \\mbox{If \\ensuremath{n_{r}}=0,}\\\\\n0 & \\mbox{Otherwise.}\\end{cases}\\]\n\n\nSimilarly, we can obtain the third term for the unrecommended channels\ncase.\n\n\\subsection{Lemma 5}\\label{proof_for_lemma1}\nSince the operation $\\sum_{R'\\in\\mathcal{R}}P{}_{R,R'}^{P_{rec}}[\\cdot]$\nplays a key role in the Bellman equation, to facilitate the study,\nwe first define the following function \\begin{eqnarray*}\nf_{r}(R,P_{rec}) & \\triangleq & \\sum_{i=r}^{\\min\\{M,N\\}}P{}_{R,i}^{P_{rec}},\\forall r\\in\\mathcal{R}.\\end{eqnarray*}\nSince\\begin{eqnarray*}\n & & f_{r}(R,P_{rec})\\\\\n & & =Pr(R(t+1)\\geq r|R(t)=R,P_{rec}(t)=P_{rec})\\\\\n & & =1-Pr(R(t+1)1,\\forall\\pi\\in\\Theta,\\]\nwe thus have\\[\n\\lim_{k\\rightarrow\\infty}g_{k}(\\pi)=\\infty,\\forall\\pi\\in\\Theta.\\]\nBy Fatou's lemma, we have\\begin{eqnarray*}\n & & \\lim_{k\\rightarrow\\infty}\\inf\\int_{\\pi\\in\\Omega}g_{k}(\\pi)d\\pi\\\\\n & = & 1\\\\\n & \\geq & \\lim_{k\\rightarrow\\infty}\\inf\\int_{\\pi\\in\\Theta}g_{k}(\\pi)d\\pi\\\\\n & \\geq & \\int_{\\pi\\in\\Theta}\\lim_{k\\rightarrow\\infty}\\inf g_{k}(\\pi)d\\pi\\\\\n & = & \\infty,\\end{eqnarray*}\nwhich forms a contradiction. Hence, we have\\[\n\\lim_{k\\rightarrow\\infty}E_{g_{k}}[e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}]=e^{\\Phi_{\\pi^{*}}}.\\]\n\nSince $e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}$ is a monotone\nfunction of $\\Phi_{\\pi}$ and one-to-one map over the field $\\{\\pi:\\Phi_{\\pi}\\geq\\gamma\\}$,\nthe result above implies that\\begin{eqnarray}\n\\lim_{k\\rightarrow\\infty}E_{g_{k}}[\\pi] & = & \\pi^{*},\\label{eq:lemma11-1}\\\\\n\\lim_{k\\rightarrow\\infty}Var_{g_{k}}[\\pi] & = & \\boldsymbol{0}.\\label{eq:lemma11-2}\\end{eqnarray} \\qed\n\nTo complete the proof of the theorem, we next show that \\[\nE_{g_{k}}[\\pi(R)]=E_{f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})}[\\pi(R)],\\forall R\\in\\mathcal{R},\\]\n\\[E_{g_{k}}[\\pi^{2}(R)]=E_{f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})}[\\pi^{2}(R)],\\forall R\\in\\mathcal{R}.\\]\nFor the sake of simplicity, we first define a function \\[\nH(\\boldsymbol{\\mu},\\boldsymbol{\\sigma},\\gamma_{k})\\triangleq\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}\\ln f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})d\\pi.\\]\nSince \\begin{eqnarray*}\nf(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma}) & = & \\prod_{R=0}^{\\min\\{M,N\\}}f(\\pi(R),\\mu_{R},\\sigma_{R})\\\\\n & = & \\prod_{R=0}^{\\min\\{M,N\\}}\\frac{1}{\\sqrt{2pi\\sigma_{R}^{2}}}e^{-\\frac{(\\pi(R)-\\mu_{R})^{2}}{2\\sigma_{R}^{2}}},\\\\\n & = & \\prod_{R=0}^{\\min\\{M,N\\}}e^{\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}-\\frac{\\mu_{R}^{2}}{2\\sigma_{R}}}\\frac{1}{\\sqrt{2pi\\sigma_{R}^{2}}}e^{-\\frac{\\pi(R)^{2}}{2\\sigma_{R}^{2}}}\\\\\n & = & \\prod_{R=0}^{\\min\\{M,N\\}}e^{\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}-\\frac{\\mu_{R}^{2}}{2\\sigma_{R}}}f(\\pi(R),0,\\sigma_{R})\\\\\n & = & \\prod_{R=0}^{\\min\\{M,N\\}}[e^{\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}}f(\\pi(R),0,\\sigma_{R})\\\\\n & & \\cdot\\int_{\\pi(R)\\in\\mathcal{P}}\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}f(\\pi(R),0,\\sigma_{R})d\\pi(R)],\\end{eqnarray*}\nwe then obtain\\begin{eqnarray*}\n & & H(\\boldsymbol{\\mu},\\boldsymbol{\\sigma},\\gamma_{k})\\\\\n & = & \\sum_{R=0}^{\\min\\{M,N\\}}\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}d\\pi\\\\\n & & + \\sum_{R=0}^{\\min\\{M,N\\}}\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}\\ln f(\\pi(R),0,\\sigma_{R})d\\pi\\\\\n & & - \\sum_{R=0}^{\\min\\{M,N\\}}\\{\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}\\\\\n & & \\cdot\\ln[\\int_{\\pi(R)\\in\\mathcal{P}}\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}f(\\pi(R),0,\\sigma_{R})d\\pi(R)]d\\pi\\}.\\end{eqnarray*}\nSince the optimization problem in (\\ref{eq:235-1}) is to solve\\[\n\\max_{\\boldsymbol{\\mu},\\boldsymbol{\\sigma}}H(\\boldsymbol{\\mu},\\boldsymbol{\\sigma},\\gamma_{k}),\\]\nthe updated parameters ($\\boldsymbol{\\mu}_{k},\\boldsymbol{\\sigma}_{k}$)\nthus maximizes $H(\\boldsymbol{\\mu},\\boldsymbol{\\sigma},\\gamma_{k})$.\nIt means that \\[\n\\nabla H(\\boldsymbol{\\mu}_{k},\\boldsymbol{\\sigma}_{k},\\gamma_{k})=0.\\]\nThat is \\begin{eqnarray*}\n & & \\nabla H(\\boldsymbol{\\mu},\\boldsymbol{\\sigma},\\gamma_{k})\\\\\n & = & \\frac{\\int_{\\pi(R)\\in\\mathcal{P}}e^{\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}}f(\\pi(R),0,\\sigma_{R})\\frac{\\pi(R)}{\\sigma_{R}^{2}}d\\pi(R)}{\\int_{\\pi(R)\\in\\mathcal{P}}e^{\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}}f(\\pi(R),0,\\sigma_{R})d\\pi(R)}\\\\\n & & \\cdot\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}d\\pi\\\\\n & & - \\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}\\frac{\\pi(R)}{\\sigma_{R}^{2}}d\\pi,\\\\\n & = & 0.\\end{eqnarray*}\nIt follows that\\begin{eqnarray*}\n & & \\frac{\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}\\pi(R)d\\pi}{\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}d\\pi}\\\\\n & =\\\\\n & & \\frac{\\int_{\\pi(R)\\in\\mathcal{P}}e^{\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}}f(\\pi(R),0,\\sigma_{R})\\pi(R)d\\pi(R)}{\\int_{\\pi(R)\\in\\mathcal{P}}e^{\\frac{\\mu_{R}\\pi(R)}{\\sigma_{R}}}f(\\pi(R),0,\\sigma_{R})d\\pi(R)},\\forall R\\in\\mathcal{R}.\\end{eqnarray*}\nBy multiplying the same constant on the numerator and denominator\nof the terms on both sides, we have\\begin{eqnarray*}\n & & \\frac{\\int_{\\pi\\in\\Omega}\\frac{e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}g_{k-1}(\\pi)}{E_{g_{k-1}}[e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}]}\\pi(R)d\\pi}{\\int_{\\pi\\in\\Omega}\\frac{e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}g_{k-1}(\\pi)}{E_{g_{k-1}}[e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}]}d\\pi}\\\\\n & =\\\\\n & & \\frac{\\int_{\\pi(R)\\in\\mathcal{P}}f(\\pi(R),\\mu_{R},\\sigma_{R})\\pi(R)d\\pi(R)}{\\int_{\\pi(R)\\in\\mathcal{P}}f(\\pi(R),\\mu_{R},\\sigma_{R})d\\pi(R)},\\forall R\\in\\mathcal{R},\\end{eqnarray*}\nSince \\begin{eqnarray*}\n & & \\int_{\\pi(R)\\in\\mathcal{P}}f(\\pi(R),\\mu_{R},\\sigma_{R})d\\pi(R)\\\\\n & = & \\int_{\\pi\\in\\Omega}\\frac{e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}g_{k-1}(\\pi)}{E_{g_{k-1}}[e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}]}d\\pi\\\\\n & = & 1,\\end{eqnarray*}\nwe obtain\\begin{eqnarray*}\n & & \\int_{\\pi\\in\\Omega}\\frac{e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma_{k}\\}}g_{k-1}(\\pi)}{E_{g_{k-1}}[e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}]}\\pi(R)d\\pi\\\\\n & = & \\int_{\\pi(R)\\in\\mathcal{P}}f(\\pi(R),\\mu_{R},\\sigma_{R})\\pi(R)d\\pi(R),\\forall R\\in\\mathcal{R},\\end{eqnarray*}\ni.e.\\[\nE_{g_{k}}[\\pi(R)]=E_{f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})}[\\pi(R)],\\forall R\\in\\mathcal{R}.\\]\n\nSimilarly, we can show that\\[\nE_{g_{k}}[\\pi^{2}(R)]=E_{f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})}[\\pi^{2}(R)],\\forall R\\in\\mathcal{R}.\\]\n\nFrom (\\ref{eq:lemma11-1}), it follows that\\begin{eqnarray*}\n\\lim_{k\\rightarrow\\infty}E_{f(\\pi,\\boldsymbol{\\mu}_{k},\\boldsymbol{\\sigma}_{k})}[\\pi] & = & \\lim_{k\\rightarrow\\infty}E_{g_{k}}[\\pi]\\\\\n & = & \\pi^{*}.\\end{eqnarray*}\nand,\n\\begin{eqnarray*}\n & & \\lim_{k\\rightarrow\\infty}Var_{f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})}[\\pi(R)]\\\\\n & = & \\lim_{k\\rightarrow\\infty}\\{E_{f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})}[\\pi^{2}(R)]-E_{f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})}[\\pi(R)]^{2}\\}\\\\\n & = & \\lim_{k\\rightarrow\\infty}\\{E_{g_{k}}[\\pi^{2}(R)]-E_{g_{k}}[\\pi(R)]^{2}\\}\\\\\n & = & \\lim_{k\\rightarrow\\infty}Var_{g_{k}}[\\pi(R)]\\\\\n & = & 0.\\end{eqnarray*} \\qed\n\\section{\\label{sec:Conclusion}Conclusion}\nIn this paper, we propose an adaptive channel recommendation scheme for efficient spectrum sharing. We formulate the problem as an average reward based Markov decision process. We first prove the existence of the optimal stationary spectrum access policy, and then characterize the structure of the optimal policy in two asymptotic cases. Furthermore, we propose a novel MRAS-based algorithm that is provably convergent to the optimal policy. Numerical results show that our proposed algorithm outperforms the static approach in the literature by up to $18\\%$ and the Q-learning method by up to $10\\%$ in terms of system throughput. Our algorithm is also more robust to the channel dynamics compared to the static counterpart.\n\nIn terms of future work, we are currently extending the analysis by taking the heterogeneity of channels into consideration. We also plan to consider the case where the secondary users are selfish. Designing an incentive-compatible channel recommendation mechanism for that case will be very interesting and challenging. \n\\section{Introduction}\nCognitive radio technology enables unlicensed secondary wireless users to opportunistically share the spectrum with licensed primary users, and thus offers a promising solution to address the spectrum under-utilization problem \\cite{key-6}. Designing an efficient spectrum access mechanism for cognitive radio networks, however, is challenging for several reasons: (1) \\emph{time-variation}: spectrum opportunities available for secondary users are often time-varying due to primary users' stochastic activities \\cite{key-6}; and (2) \\emph{limited observations}: each secondary user often has a limited view of the spectrum opportunities due to the limited spectrum sensing capability \\cite{key-7}. Several characteristics of the wireless channels, on the other hand, turn out to be useful for designing efficient spectrum access mechanisms: (1) \\emph{temporal correlations}: spectrum availabilities are correlated in time, and thus observations in the past can be useful in the near future \\cite{key-19}; and (2) \\emph{spatial correlation}: secondary users close to one another may experience similar spectrum availabilities \\cite{key-1}. In this paper, we shall explore the time and space correlations and propose a recommendation-based collaborative spectrum access algorithm, which achieves good communication performances for the secondary users.\n\nOur algorithm design is directly inspired by the recommendation system in the electronic commerce industry. For example, existing owners of various products can provide recommendations (reviews) on Amazon.com, so that other potential customers can pick the products that best suit their needs. Motivated by this, Li in \\cite{key-2} proposed a static channel recommendation scheme, where secondary users recommend the channels they have\nsuccessfully accessed to nearby secondary users. Since each secondary user originally only has a limited view of spectrum availability, such information exchange enables secondary users to take advantages of the correlations in time and space, make more informed decisions, and achieve a high total transmission rate.\n\nThe recommendation scheme in \\cite{key-2}, however, is rather static and does not dynamically change with network conditions. In particular, the static scheme ignores two important characteristics of cognitive radios. The first one is the \\emph{time variability} we mentioned before. The second one is the \\emph{congestion effect}. As depicted in Figure \\ref{ChannelRec}, too many users accessing the same good channel leads to congestion and a reduced rate for everyone.\n\n\\begin{figure}[tt]\n\\begin{center}\n\\includegraphics[scale=0.5]{channel_scheme.eps}\n\\caption{\\label{ChannelRec}Illustration of the channel recommendation scheme. User D recommends channel 4 to other users. As a result, both user A and user C access the same channel 4, and thus lead to congestion and a reduced rate for both users.}\n\\end{center}\n\\end{figure}\n\n\nTo address the shortcomings of the static recommendation scheme, in this paper we propose an adaptive channel recommendation\nscheme, which adaptively changes the spectrum access probabilities based on users' latest channel recommendations. We formulate and analyze the system as a Markov decision process (MDP), and propose a numerical algorithm that always converges to the optimal spectrum access policy.\n\nThe main results and contributions of this paper include:\n\\begin{itemize}\n\\item \\emph{Markov decision process formulation}: we formulate and analyze the optimal recommendation-based spectrum access as an average reward MDP.\n\\item \\emph{Existence and structure of the optimal policy}: we show that there always exists a stationary optimal spectrum access policy, which requires only the channel recommendation information of the most recent time slot. We also explicitly characterize the structure of the optimal stationary policy in two asymptotic cases (either the number of users or the number of users goes to infinity).\n\\item \\emph{Novel algorithm for finding the optimal policy}: we propose\nan algorithm based on the recently developed Model Reference Adaptive Search method \\cite{key-5} to find the optimal stationary spectrum access policy.\nThe algorithm has a low complexity even when dealing with a continuous action space of the MDP. We also show that it always converges to the optimal stationary policy.\n\\item \\rev{\\emph{Superior Performance}: we show that the proposed algorithm achieves up to $18\\%$ performance improvement than the static channel recommendation scheme and $10\\%$ performance improvement than the Q-learning method, and is also robust to channel dynamics.}\n\n\\end{itemize}\n\nThe rest of the paper is organized as follows. We introduce the system\nmodel and the static channel recommendation scheme in Sections \\ref{sec:System-Model} and \\ref{sec:Static-Channel-Recommendation}, respectively. We then discuss the motivation for designing an adaptive channel recommendation scheme in Section \\ref{sec:Motivation-Adaptive}. The Markov decision\nprocess formulation and the structure results of the optimal policy\nare presented in Section \\ref{sec:Adaptive-Channel-Recommendation},\nfollowed by the Model Reference Adaptive Search based algorithm in Section\n\\ref{sec:Model-Reference-Adaptive}. We illustrate the performance of the algorithm through numerical results in\nSection \\ref{sec:Numerical-Results}. We discuss the related\nwork in Section \\ref{sec:Related-Work} and conclude in Section \\ref{sec:Conclusion}. \n\\section{\\label{sec:Model-Reference-Adaptive}Model Reference Adaptive Search\nFor Optimal Spectrum Access Policy}\nNext we will design an algorithm that can converge to the optimal policy under general system parameters (not limiting to the two asymptotic cases).\nSince the action space of the adaptive channel recommendation MDP\nis continuous (i.e., choosing a probability $P_{rec}$ in $(0,1)$), the traditional method of discretizing the action space\nfollowed by the policy, value iteration, or Q-learning cannot guarantee to converge to the optimal policy. To overcome this difficulty, we propose a new algorithm developed from the Model Reference Adaptive Search method, which was recently developed in the Operations Research community \\cite{key-5}. We will show that the proposed algorithm is easy to implement and is provably convergent to the optimal policy.\n\n\\subsection{Model Reference Adaptive Search Method}\nWe first introduce the basic idea of the Model Reference Adaptive Search (MRAS) method. Later on, we will show how the method can be used to obtain optimal spectrum access policy for our problem.\n\n\nThe MRAS method is a new randomized\nmethod for global optimization \\cite{key-5}. The key idea is to randomize the original optimization problem over the feasible region according\nto a specified probabilistic model. The method then generates candidate solutions\nand updates the probabilistic model on the basis of elite solutions\nand a reference model, so that to guide the future search toward better solutions.\n\n\nFormally, let $J(x)$ be the objective function to maximize. The\nMRAS method is an iterative algorithm, and it includes three phases in each iteration $k$:\n\\begin{itemize}\n\\item \\emph{Random solution generation}: generate a set of random solutions \\rev{$\\{x\\}$ in the feasible set $\\chi$} according to a parameterized probabilistic model $f(x,v_{k})$, which is a probability density function (pdf) with parameter $v_{k}$. \\rev{The number of solutions to generate is a fixed system parameter.}\n\\item \\emph{Reference distribution construction}: select elite solutions among the randomly generated set in the previous phase, such that the chosen ones satisfy $J(x)\\geq\\gamma$. Construct a reference probability distribution as\\begin{eqnarray}\ng_{k}(x) & =\\begin{cases}\n\\frac{I_{\\{J(x)\\geq\\gamma\\}}}{E_{f(x,v_{0})}[\\frac{I_{\\{J(x)\\geq\\gamma\\}}}{f(x,v_{0})}]} & k=1,\\\\\n\\frac{e^{J(x)}I_{\\{J(x)\\geq\\gamma\\}}g_{k-1}(x)}{E_{g_{k-1}}[e^{J(x)}I_{\\{J(x)\\geq\\gamma\\}}]} & k\\geq2,\\end{cases}\\label{eq:2546-1}\\end{eqnarray}\nwhere $I_{\\{\\varpi\\}}$ is an indicator function, which equals $1$ if the event $\\varpi$ is true and zero otherwise. Parameter $v_{0}$ is the initial parameter for the probabilistic model (used during the first iteration, i.e., $k=1$),\nand $g_{k-1}(x)$ is the reference distribution in the previous iteration (used when $k\\geq 2$).\n\\item \\emph{Probabilistic model update}: update the parameter $v$ of the probabilistic\nmodel $f(x,v)$ by minimizing the Kullback-Leibler divergence between\n$g_{k}(x)$ and $f(x,v)$, i.e.\\begin{equation}\nv_{k+1}=\\arg\\min_{v}E_{g_{k}}\\left[\\ln\\frac{g_{k}(x)}{f(x,v)}\\right].\\label{eq:12567}\\end{equation}\n\n\\end{itemize}\n\nBy constructing the reference distribution according to\n(\\ref{eq:2546-1}), the expected performance of random elite solutions can be improved under the new reference distribution, i.e.,\\begin{eqnarray}\nE_{g_{k}}[e^{J(x)}I_{\\{J(x)\\geq\\gamma\\}}] & = & \\frac{\\int_{x\\in\\chi}e^{2J(x)}I_{\\{J(x)\\geq\\gamma\\}}g_{k-1}(x)dx}{E_{g_{k-1}}[e^{J(x)}I_{\\{J(x)\\geq\\gamma\\}}]}\\nonumber \\\\\n & = & \\frac{E_{g_{k-1}}[e^{2J(x)}I_{\\{J(x)\\geq\\gamma\\}}]}{E_{g_{k-1}}[e^{J(x)}I_{\\{J(x)\\geq\\gamma\\}}]}\\nonumber \\\\\n & \\geq & E_{g_{k-1}}[e^{J(x)}I_{\\{J(x)\\geq\\gamma\\}}].\\label{eq:2354}\\end{eqnarray}\nTo find a better solution to the optimization problem, it is natural to update the probabilistic model (from which random solution are generated in the first stage) as close to the new reference probability as possible, as done in the third stage.\n\n\\subsection{Model Reference Adaptive Search For Optimal Spectrum Access Policy}\n\nIn this section, we design an algorithm based on the MRAS method to find the optimal\nspectrum access policy. Here we treat the adaptive channel recommendation MDP as a global optimization problem over the policy space. The key challenge is the choice of proper probabilistic model $f(\\cdot)$, which is crucial for the convergence of the MRAS algorithm.\n\n\n\\subsubsection{Random Policy Generation}\n\nTo apply the MRAS method, we first need to set up a random policy generation\nmechanism. Since the action space of the channel recommendation MDP\nis continuous, we use the Gaussian distributions.\nSpecifically, we generate sample actions $\\pi(R)$ from a Gaussian\ndistribution for each system state $R\\in\\mathcal{R}$ independently,\ni.e. $\\pi(R)\\sim\\mathcal{N}(\\mu_{R},\\sigma_{R}^{2})$.\\footnote{Note that the Gaussian distribution has a support over $(-\\infty,+\\infty)$, which is larger than the feasible region of $\\pi(R)$. This issue will be handled in Section \\ref{STE}.} In this case,\na candidate policy $\\pi$ can be generated from the joint distribution\nof $|\\mathcal{R}|$ independent Gaussian distributions, i.e.,\\begin{eqnarray*}\n(\\pi(0),...,\\pi(\\min\\{M,N\\})) & \\sim & \\mathcal{N}(\\mu_{0},\\sigma_{0}^{2})\\times\\cdots\\\\\n & & \\times\\mathcal{N}(\\mu_{\\min\\{M,N\\}},\\sigma_{\\min\\{M,N\\}}^{2}).\\end{eqnarray*}\nAs shown later, Gaussian distribution has nice analytical and convergent\nproperties for the MRAS method.\n\nFor the sake of brevity, we denote $f(\\pi(R),\\mu_{R},\\sigma_{R})$\nas the pdf of the Gaussian distribution $\\mathcal{N}(\\mu_{R},\\sigma_{R}^{2})$,\nand $f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})$ as random policy\ngeneration mechanism with parameters $\\boldsymbol{\\mu}\\triangleq(\\mu_{0},...,\\mu_{\\min\\{M,N\\}})$ and $\\boldsymbol{\\sigma}\\triangleq(\\sigma_{0},...,\\sigma_{\\min\\{M,N\\}})$,\ni.e.,\\begin{eqnarray*}\nf(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma}) & = & \\prod_{R=0}^{\\min\\{M,N\\}}f(\\pi(R),\\mu_{R},\\sigma_{R})\\\\\n & = & \\prod_{R=0}^{\\min\\{M,N\\}}\\frac{1}{\\sqrt{2\\varphi\\sigma_{R}^{2}}}e^{-\\frac{(\\pi(R)-\\mu_{R})^{2}}{2\\sigma_{R}^{2}}},\\end{eqnarray*}\nwhere $\\varphi$ is the circumference-to-diameter ratio. \\com{change $pi$ to a single Greek letter.}\n\n\n\\subsubsection{System Throughput Evaluation}\\label{STE}\n\nGiven a candidate policy $\\pi$ randomly generated based on $f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})$, we need to evaluate the expected system\nthroughput $\\Phi_{\\pi}$. From (\\ref{eq:2565}), we obtain the\ntransition probabilities $P{}_{R,R'}^{\\pi(R)}$ for any system state\n$R,R'\\in\\mathcal{R}$. Since a policy $\\pi$ leads to a finitely\nirreducible Markov chain, we can obtain its stationary distribution.\nLet us denote the transition matrix of the Markov chain as $Q\\triangleq[P{}_{R,R'}^{\\pi(R)}]_{|\\mathcal{R}|\\times|\\mathcal{R}|}$\nand the stationary distribution as $\\boldsymbol{p}=(Pr(0),...,Pr(\\min\\{M,N\\}))$.\nObviously, the stationary distribution can be obtained by solving\nthe following equation\\[\n\\boldsymbol{p}Q=\\boldsymbol{p}.\\]\nWe then calculate the expected system throughput $\\Phi_{\\pi}$ by\n\\[\n\\Phi_{\\pi}=\\sum_{R\\in\\mathcal{R}}Pr(R)U_{R}.\\]\n\n\nNote that in the discussion above, we assume that $\\pi\\in\\Omega$\nimplicitly, where $\\Omega$ is the feasible policy space. Since Gaussian distribution has a support over\n$(-\\infty,+\\infty)$, we thus extend the definition of expected system throughput $\\Phi_{\\pi}$ over $(-\\infty,+\\infty)^{|\\mathcal{R}|}$\nas\\[\n\\Phi_{\\pi}=\\begin{cases}\n\\sum_{R\\in\\mathcal{R}}Pr(R)U_{R} & \\pi\\in\\Omega,\\\\\n-\\infty & \\mbox{Otherwise.}\\end{cases}\\]\nIn this case, whenever any generated policy $\\pi$ is not feasible, we have $\\Phi_{\\pi}=-\\infty$. \\rev{As a result, such policy $\\pi$ will not be selected as an elite sample (discussed next) and will not used for probability updating.} Hence the search of MRAS algorithm will not bias towards any unfeasible policy space.\n\n\\subsubsection{Reference Distribution Construction}\n\nTo construct the reference distribution, we first need to select the\nelite policies. Suppose $L$ candidate policies, $\\pi_{1},\\pi_{2},...,\\pi_{L}$,\nare generated at each iteration. We order them based on an increasing order of the expected system throughputs\n$\\Phi_{\\pi}$, i.e., $\\Phi_{\\hat{\\pi}_{1}}\\le\\Phi_{\\hat{\\pi}_{2}}\\le...\\le\\Phi_{\\hat{\\pi}_{L}}$, and set the elite threshold as\n\\begin{equation*}\n\\gamma=\\Phi_{\\hat{\\pi}_{\\lceil(1-\\rho)L\\rceil}},\n\\end{equation*}\nwhere $0<\\rho<1$ is the elite ratio. \\rev{For example, when $L=100$ and $\\rho=0.4$, then $\\gamma=\\Phi_{\\hat{\\pi}_{60}}$ and the last $40$ samples in the sequence will be selected as elite samples.}\nNote that as long as $L$ is sufficiently large, we shall have $\\gamma<\\infty$ and hence only feasible policies $\\pi$ are selected. According to (\\ref{eq:2546-1}),\nwe then construct the reference distribution as\n\n\\begin{eqnarray}\ng_{k}(\\pi) & =\\begin{cases}\n\\frac{I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}{E_{f(\\pi,\\boldsymbol{\\mu}_{0},\\boldsymbol{\\sigma}_{0})}[\\frac{_{I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}}{f(\\pi,\\boldsymbol{\\mu}_{0},\\boldsymbol{\\sigma}_{0})}]} & k=1,\\\\\n\\frac{e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}g_{k-1}(\\pi)}{E_{g_{k-1}}[e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}]} & k\\geq2.\\end{cases}\\label{eq:8975}\\end{eqnarray}\n\n\n\n\\subsubsection{Policy Generation Update}\n\nFor the MRAS algorithm, the critical issue is the updating of random\npolicy generation mechanism $f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})$,\nor solving the problem in (\\ref{eq:12567}). The optimal update rule is described as follow.\n\\begin{thm}\nThe optimal parameter $(\\boldsymbol{\\mu},\\boldsymbol{\\sigma})$ that\nminimizes the Kullback-Leibler divergence between the reference distribution\n$g_{k}(\\pi)$ in (\\ref{eq:8975}) and the new policy generation mechanism\n$f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})$ is \\begin{eqnarray}\n\\mu_{R} & = & \\frac{\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}\\pi(R)d\\pi}{\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}d\\pi},\\forall R\\in\\mathcal{R},\\label{eq:524-1}\\\\\n\\sigma_{R}^{2} & = & \\frac{\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}[\\pi(R)-\\mu_{R}]^{2}d\\pi}{\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}d\\pi},\\forall R\\in\\mathcal{R}.\\nonumber \\\\ \\nonumber\n\\label{eq:524-2}\\\\\\end{eqnarray}\n\\end{thm}\n\\linespread{0.9}\n\\begin{proof}\nFirst, from (\\ref{eq:8975}), we have\\begin{eqnarray*}\ng_{1}(\\pi) & = & \\frac{I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}{E_{f(\\pi,\\boldsymbol{\\mu}_{0},\\boldsymbol{\\sigma}_{0})}[\\frac{_{I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}}{f(\\pi,\\boldsymbol{\\mu}_{0},\\boldsymbol{\\sigma}_{0})}]}\\\\\n & = & \\frac{I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}{\\int_{\\pi\\in\\Omega}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}d\\pi},\\end{eqnarray*}\nand,\n\\begin{eqnarray*}\ng_{2}(\\pi) & = & \\frac{e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}g_{1}(\\pi)}{E_{g_{1}}[e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}]}\\\\\n & = & \\frac{e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}{E_{g_{1}}[e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}]\\int_{\\pi\\in\\Omega}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}d\\pi}\\\\\n & = & \\frac{e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}{\\int_{\\pi\\in\\Omega}e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}\\frac{I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}{\\int_{\\pi\\in\\Omega}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}d\\pi}d\\pi\\int_{\\pi\\in\\Omega}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}d\\pi}\\\\\n & = & \\frac{e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}{\\int_{\\pi\\in\\Omega}e^{\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}d\\pi}.\\end{eqnarray*}\nRepeat the above computation iteratively, we have%\n\\begin{equation}\ng_{k}(\\pi)=\\frac{e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}}{\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}d\\pi},k\\geq1.\\label{eq:23589}\\end{equation}\nThen, the problem in (\\ref{eq:12567}) is equivalent to solving \\begin{eqnarray}\n\\max_{\\boldsymbol{\\mu},\\boldsymbol{\\sigma}} & \\int_{\\pi\\in\\Omega}g_{k}(\\pi)\\ln f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})d\\pi,\\label{eq:235}\\\\\n\\mbox{subject to} & \\boldsymbol{\\mu},\\boldsymbol{\\sigma}\\succeq0,\\nonumber\\end{eqnarray}\nSubstituting (\\ref{eq:23589}) into (\\ref{eq:235}), we have\\begin{eqnarray}\n\\max_{\\boldsymbol{\\mu},\\boldsymbol{\\sigma}} & \\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}\\ln f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})d\\pi,\\label{eq:235-1}\\\\\n\\mbox{subject to} & \\boldsymbol{\\mu},\\boldsymbol{\\sigma}\\succeq0,\\nonumber\\end{eqnarray}\n\nFunction $f(\\pi(R),\\mu_{R},\\sigma_{R})$ is log-concave, since it is the pdf of the Gaussian distribution. Since the log-concavity is closed under multiplication,\nthen $f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})=\\prod_{R=0}^{\\min\\{M,N\\}}f(\\pi(R),\\mu_{R},\\sigma_{R})$\nis also log-concave. It implies the problem in (\\ref{eq:235}) is\na concave optimization problem. Solving by the first order condition,\nwe have \\begin{eqnarray*}\n\\frac{\\partial\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}\\ln f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})d\\pi}{\\partial\\mu_{R}} & = & 0,\\forall R\\in\\mathcal{R},\\\\\n\\frac{\\partial\\int_{\\pi\\in\\Omega}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi}\\geq\\gamma\\}}\\ln f(\\pi,\\boldsymbol{\\mu},\\boldsymbol{\\sigma})d\\pi}{\\partial\\sigma_{R}} & = & 0,\\forall R\\in\\mathcal{R},\\end{eqnarray*}\nwhich leads to (\\ref{eq:524-1}) and (\\ref{eq:524-2}).\nDue to the concavity of the optimization problem in (\\ref{eq:235}),\nthe solution is also the global optimum for the random policy generation updating.\n\\end{proof}\n\\linespread{1.0}\n\n\\subsubsection{MARS Algorithm For Optimal Spectrum Access Policy}\n\nBased on the MARS algorithm, we generate $L$ candidate polices\nat each iteration. Then the updates in (\\ref{eq:524-1}) and\n(\\ref{eq:524-2}) are replaced by the sample average version in (\\ref{eq:525-1})\nand (\\ref{eq:525-2}), respectively. As a summary, we describe the MARS-based\nalgorithm for finding the optimal spectrum access policy of adaptive\nchannel recommendation MDP in Algorithm \\ref{alg:MRAS-Method-For}.\n\n\n\n\\subsection{Convergence of Model Reference Adaptive Search}\n\nIn this part, we discuss the convergence property of the MRAS-based\noptimal spectrum access policy. For ease of exposition, we\nassume that the adaptive channel recommendation MDP has a unique global\noptimal policy. Numerical studies in \\cite{key-5} show that the MRAS\nmethod also converges where there are multiple global optimal solutions.\nWe shall show that the\nrandom policy generation mechanism $f(\\pi,\\boldsymbol{\\mu}_{k},\\boldsymbol{\\sigma}_{k})$ will eventually generate the optimal policy.\n\\begin{thm}\n\\label{theorem1}\nFor the MRAS algorithm, \\rev{the limiting point of the policy sequence} $\\{\\pi_{k}\\}$ generated by the sequence\nof random policy generation mechanism $\\{f(\\pi,\\boldsymbol{\\mu}_{k},\\boldsymbol{\\sigma}_{k})\\}$ converges point-wisely to\nthe optimal spectrum access policy $\\pi^{*}$ for the adaptive channel\nrecommendation MDP, i.e., \\begin{eqnarray}\n\\lim_{k\\rightarrow\\infty}E_{f(\\pi,\\boldsymbol{\\mu}_{k},\\boldsymbol{\\sigma}_{k})}[\\pi(R)] & = & \\pi^{*}(R),\\forall R\\in\\mathcal{R},\\label{eq:lemma12}\\\\\n\\lim_{k\\rightarrow\\infty}Var_{f(\\pi,\\boldsymbol{\\mu}_{k},\\boldsymbol{\\sigma}_{k})}[\\pi(R)] & = & 0,\\forall R\\in\\mathcal{R}.\\label{eq:lemma12-2}\\end{eqnarray}\n\\end{thm}\nThe proof is given in the Appendix.\n\nFrom Theorem \\ref{theorem1}, we see that parameter $(\\mu_{R,k},\\sigma_{R,k})$\nfor updating in (\\ref{eq:525-1}) and (\\ref{eq:525-2}) also converges, i.e.,\\begin{eqnarray*}\n\\lim_{k\\rightarrow\\infty}\\mu_{R,k} & = & \\pi^{*}(R),\\forall R\\in\\mathcal{R},\\\\\n\\lim_{k\\rightarrow\\infty}\\sigma_{R,k} & = & 0,\\forall R\\in\\mathcal{R}.\\end{eqnarray*}\nThus, we can use $\\max_{R\\in\\mathcal{R}}\\sigma_{R,k}<\\xi$ as the stopping\ncriterion in Algorithm \\ref{alg:MRAS-Method-For}.\n\n\\begin{algorithm}[tt]\n\\begin{algorithmic}[1]\n\\State \\textbf{Initialize} parameters for Gaussian distributions $(\\boldsymbol{\\mu}_{0},\\boldsymbol{\\sigma}_{0})$,\nthe elite ratio $\\rho$, and the stopping criterion $\\xi$. Set initial elite threshold $\\gamma_{0}=0$ and iteration index $k=0$.\n\\Repeat{:}\n\\State \\textbf{Increase} iteration index $k$ by 1.\n\\State \\textbf{Generate} $L$ candidate policies $\\pi_{1},...,\\pi_{L}$ from the random policy generation mechanism $f(\\pi,\\boldsymbol{\\mu}_{k-1},\\boldsymbol{\\sigma}_{k-1})$.\n\\State \\textbf{Select} elite policies by setting the elite threshold $\\gamma_{k}=\\max\\{\\Phi_{\\hat{\\pi}_{\\lceil(1-\\rho)L\\rceil}},\\gamma_{k-1}\\}.$\n\\State \\textbf{Update} the random policy generation mechanism by \\begin{align}\n\\mu_{R,k}&=\\frac{\\sum_{i=1}^{L}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi_{i}}\\geq\\gamma_{k}\\}}\\pi_{i}(R)}{\\sum_{i=1}^{L}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi_{i}}\\geq\\gamma_{k}\\}}},&\\forall R\\in\\mathcal{R},\\label{eq:525-1}\\\\\n\\sigma_{R,k}^{2}&=\\frac{\\sum_{i=1}^{L}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi_{i}}\\geq\\gamma_{k}\\}}[\\pi_{i}(R)-\\mu_{R}]^{2}}{\\sum_{i=1}^{L}e^{(k-1)\\Phi_{\\pi}}I_{\\{\\Phi_{\\pi_{i}}\\geq\\gamma_{k}\\}}},&\\forall R\\in\\mathcal{R}. \\nonumber \\\\ \\label{eq:525-2}\\end{align}\n\\Until{$\\max_{R\\in\\mathcal{R}}\\sigma_{R,k}<\\xi.$}\n\\end{algorithmic}\n\\caption{\\label{alg:MRAS-Method-For}MRAS-based Algorithm For Adaptive Recommendation Based Optimal Spectrum Access}\n\\end{algorithm}\n\n\n\\section{\\label{sec:Motivation-Adaptive}Motivations For Adaptive Channel Recommendation}\nThe static channel recommendation mechanism is simple to implement due to a fixed value of $P_{rec}$. However, it may lead to significant congestions when the number of recommended channels is small. In the extreme case when only $R=1$ channel is recommended, calculation (\\ref{eq:SCR-1}) suggests that every user will access that channel with a probability $P_{rec}$. When the number of users $N$ is large, the expected number of users accessing this channel $NP_{rec}$ will be high. Thus heavy congestion happens and each secondary user will get a low expected throughput.\n\nA better way is to adaptively change the value of $P_{rec}$ based on the number of recommended channels. This is the key idea of our proposed algorithm.\nTo illustrate the advantage of adaptive algorithms, let us first consider a simple heuristic adaptive algorithm. In this algorithm, we choose the branching probability such that the expected number of secondary users choosing a single recommended channel is one. To achieve this, we need to set $P_{rec}$ as in Lemma 2.\n\\begin{lem}\\label{lemma12s}\nIf we choose the branching probability $P_{rec}=\\frac{R}{N}$, then the expected number of secondary users choosing\nany one of the $R$ recommended channels is one.\n\\end{lem}\n\nPlease refer to the Appendix for the detailed proof of Lemma \\ref{lemma12s}.\n\n\nWithout going through detailed analysis, it is straightforward to show the benefit for such adaptive approach through simple numerical examples. Let us consider a network with $M=10$ channels and $N=5$ secondary users. For each channel $m$, the initial channel state probability vector is $\\boldsymbol{p}_{m}(0)=(0,1)$\nand the transition matrix is \\[\n\\Gamma=\\left[\\begin{array}{cc}\n1-0.01\\epsilon & 0.01\\epsilon\\\\\n0.01\\epsilon & 1-0.01\\epsilon\\end{array}\\right],\\]\nwhere $\\epsilon$ is called the dynamic factor. A larger value of $\\epsilon$ implies that the channels are more dynamic over time.\nWe are interested in the time average system throughput\n\\[U=\\frac{\\sum_{t=1}^{T}\\sum_{n=1}^{N}u_{n}(t)}{T},\\]\nwhere $u_{n}(t)$ is the throughput of user $n$ at time slot $t$. In the simulation, we set the total number of time slots $T=2000$.\n\nWe implement the following three channel access schemes:\n\\begin{itemize}\n\\item Random access scheme: each secondary user selects a channel randomly.\n\\item Static channel recommendation scheme as in \\cite{key-2} with the \\emph{optimal} constant branching\nprobability $P_{rec}=0.7$.\n\\item Heuristic adaptive channel recommendation scheme with the variable branching probability\n$P_{rec}=\\frac{R}{N}$.\n\\end{itemize}\n\nFigure \\ref{fig:Comparison-of-three} shows that the heuristic adaptive channel recommendation scheme outperforms the static channel recommendation scheme, which in turn outperforms the\nrandom access scheme. Moreover, the heuristic adaptive scheme is more robust to the dynamic channel environment, as it decreases slower than the static scheme when $\\epsilon$ increases.\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.5]{Recommendation_System_Comparisons.eps}\n\\end{center}\n\\caption{\\label{fig:Comparison-of-three}Comparison of three channel access\nschemes}\n\n\\end{figure}\n\n\nWe can imagine that an optimal adaptive scheme (by setting the right $P_{rec}(t)$ over time) can further increase the network performance. However, computing the optimal branching probability in closed-form is very difficult. In the rest of the paper, we will focus on characterizing the structures of the optimal spectrum access strategy and designing an efficient algorithm to achieve the optimum.\n\n\\section{\\label{sec:Related-Work}Related Work}\n\n\nThe spectrum access by multiple secondary users can be either \\emph{uncoordinated} or \\emph{coordinated}.\nFor the uncoordinated case, multiple secondary users compete with other for the resource. Huang \\emph{et al.} in \\cite{ key-28 } designed two auction mechanisms to allocate the interference budget among selfish users. Southwell and Huang in \\cite{key-88} studied the largest and smallest convergence time to an equilibrium when secondary users access multiple channels in a distributed fashion.\n Liu \\emph{et al.} in \\cite{key-16} modeled the interactions among spatially separated users as congestion games with resource reuse. Li and Han in \\cite{key-29} applied the graphic game theory to address the spectrum access problem with limited range of mutual interference. Anandkumar \\emph{et al.} in \\cite{key-25} proposed a learning-based approach for competitive spectrum access with incomplete spectrum information. Law \\emph{et al.} in \\cite{key-15} showed that uncoordinated spectrum access may lead to poor system performance.\n\nFor the coordinated spectrum access, Zhao \\emph{et al.} in \\cite{key-26} proposed a dynamic group formation algorithm to distribute secondary users' transmissions across multiple channels. Shu and Krunz proposed a multi-level spectrum opportunity framework in \\cite{key-27}. The above papers assumed that each secondary user knows the entire channel occupancy information. We consider the case where each secondary user only has a limited view of the system, and improve each other's information by recommendation.\n\n\n\\rev{Our algorithm design is partially inspired by the recommendation systems in the electronic commerce industry, where analytical methods such as collaborative filtering \\cite{key-10} and\nmulti-armed bandit process modeling \\cite{key-14} are useful. However, we cannot directly apply the existing methods to analyze cognitive radio networks due to the unique congestion effect in our model.}\n\n\\section{\\label{sec:Numerical-Results}Simulation Results}\n\nIn this section, we investigate the proposed adaptive channel recommendation scheme by simulations. The results show that the adaptive channel recommendation scheme\nnot only achieves a higher performance over the static channel recommendation\nscheme and random access scheme, but also is more robust to the dynamic\nchange of the channel environments.\n\n\n\n\\subsection{Simulation Setup}\n\nWe first consider a cognitive radio network consisting of multiple independent\nand stochastically homogeneous primary channels. The data rate of each channel is normalized to be $1$ Mbps. In order to take\nthe impact of primary user's long run behavior into account, we consider the following two types of channel state transition matrices: \\begin{eqnarray}\n\\mbox{Type 1: } \\Gamma^{1} & = & \\left[\\begin{array}{cc}\n1-0.005\\epsilon & 0.005\\epsilon\\\\\n0.025\\epsilon & 1-0.025\\epsilon\\end{array}\\right],\\label{T1}\\\\\n\\mbox{Type 2: } \\Gamma^{2} & = & \\left[\\begin{array}{cc}\n1-0.01\\epsilon & 0.01\\epsilon\\\\\n0.01\\epsilon & 1-0.01\\epsilon\\end{array}\\right],\\label{T2}\\end{eqnarray}\nwhere $\\epsilon$ is the dynamic factor. Recall that a larger $\\epsilon$ means that the channels are more dynamic over time. Using (\\ref{eq:sd-2}), we know that channel models $\\Gamma^{1}$ and $\\Gamma^{2}$ have the stationary channel idle probabilities of ${1}\/{6}$\nand ${1}\/{2}$, respectively. In other words, the primary activity level is much higher with the Type 1 channel than with the Type 2 channel.\n\nWe initialize the parameters of MRAS algorithm as follows. We set $\\mu_{R}=0.5$ and $\\sigma_{R}=0.5$ for the Gaussian distribution, which has 68.2\\% support over the feasible region $(0,1)$. We found that the performance of the MRAS algorithm is insensitive to the elite ratio $\\rho$ when $\\rho\\leq0.3$. We thus choose $\\rho=0.1$.\n\nWhen using the MRAS-based algorithm, we need to determine how many (feasible) candidate policies to generate in each iteration. Figure \\ref{fig:MRAS-algorithm-with}\nshows the convergence of MRAS algorithm with $100$, $300$, and $500$ candidate policies per iteration, respectively. We have two observations. First,\nthe number of iterations to achieve convergence reduces as the number\nof candidate policies increases. Second, the convergence speed is insignificant when the number changes from $300$ to $500$. We thus choose\n$L=500$ for the experiments in the sequel.\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{Number_of_candidate_policy.eps}\n\\caption{\\label{fig:MRAS-algorithm-with}The convergence of MRAS-based algorithm with different number\nof candidate policies per iteration}\n\\end{center}\n\\end{figure}\n\n\n\\subsection{Simulation Results}\nWe implement the adaptive channel recommendation\nscheme with $M=10$ channels and $N=5$ secondary users. We also benchmark the adaptive channel recommendation\nscheme with the static channel recommendation scheme in \\cite{key-2} and the random access scheme as the benchmark. We choose the dynamic factor $\\epsilon$ within a wide range to investigate the\nrobustness of the schemes to the channel dynamics. The results are shown in Figures \\ref{fig:Type-1-Transition1} -- \\ref{fig:Performance_Gain2}. From these figures, we see that\n\\begin{itemize}\n\\item \\emph{Superior performance of adaptive channel recommendation scheme (Figures \\ref{fig:Type-1-Transition1} and \\ref{fig:Type-2-Transition1})}: the adaptive channel recommendation scheme performs better than the random\naccess scheme and static channel recommendation scheme. Typically,\nit offers 5\\%$\\scriptsize{\\sim}$18\\% performance gain over the static\nchannel recommendation scheme.\n\\item \\emph{Impact of channel dynamics (Figures \\ref{fig:Type-1-Transition1} and \\ref{fig:Type-2-Transition1})}: the performances of both adaptive and static channel recommendation schemes degrade as the dynamic factor\n$\\epsilon$ increases. The reason is that both two schemes rely on\nthe recommendation information from previous time slots to make decisions.\nWhen channel states change rapidly, the value of recommendation information\ndiminishes. However, the adaptive channel recommendation is much more robust to the dynamic channel environment changing (See Figure \\ref{fig:Performance_Gain2}). This\nis because the optimal adaptive policy takes the channel dynamics into account while the static one does not.\n\\item \\emph{Impact of channel idleness level (Figures \\ref{fig:Performance_Gain} and \\ref{fig:Performance_Gain2})}: Figure \\ref{fig:Performance_Gain} shows the performance gain of the adaptive channel recommendation scheme over the random access scheme under two different types of transition matrix scenarios. We see that the performance gain decreases with the idle probability of the channel. This shows that the information of channel recommendations can enhance the spectrum access more efficiently when the primary activity level increases (i.e., when the channel idle probability is low). Interestingly, Figure \\ref{fig:Performance_Gain2} shows that the performance gain of the adaptive channel recommendation scheme over the static channel recommendation scheme trends to increase with the channel idleness probability. This illustrates that the adaptive channel recommendation scheme can better utilize the channel opportunities given the information of channel recommendations.\n\\end{itemize}\n\n\n\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{10Channels_5Users_1.eps}\n\\caption{\\label{fig:Type-1-Transition1}System throughput with $M=10$ channels and $N=5$ users under the Type 1 channel state transition matrix}\n\\end{center}\n\\end{figure}\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{10Channels_5Users_2.eps}\n\\caption{\\label{fig:Type-2-Transition1}System throughput with $M=10$ channels and $N=5$ users under the Type 2 channel state transition matrix}\n\\end{center}\n\\end{figure}\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{Performance_Gain.eps}\n\\caption{\\label{fig:Performance_Gain}Performance gain over random access scheme. The Type 1 and Type 2 channels have the stationary channel idle probabilities of ${1}\/{6}$ and ${1}\/{2}$, respectively.}\n\\end{center}\n\\end{figure}\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{Performance_Gain_Static.eps}\n\\caption{\\label{fig:Performance_Gain2}Performance gain over static channel recommendation scheme. The Type 1 and Type 2 channels have the stationary channel idle probabilities of ${1}\/{6}$ and ${1}\/{2}$, respectively.}\n\\end{center}\n\\end{figure}\n\n\n\n\\subsection{Comparison of MRAS algorithm and Q-Learning}\n\nTo benchmark the performance of the spectrum access\npolicy based on the MRAS algorithm, we compare it\nwith the policy obtained by Q-learning algorithm \\cite{key-22}.\n\nSince the Q-learning can only be used over the discrete action space, we\nfirst discretize the action space $\\mathcal{P}$ into\na finite discrete action space $\\mathcal{\\hat{P}}=\\{0.1,...,1.0\\}$.\nThe Q-learning then defines a Q-value representing the estimated quality\nof a state-action combination as $\nQ:\\mathcal{R}\\times\\mathcal{\\hat{P}}_{rec}\\rightarrow\\mathbb{R}.$\nGiven a new reward $U(R(t),P_{rec}(t))$ is received, we can update the Q-value to be \\begin{multline*}\nQ(R(t),P_{rec}(t))= (1-\\alpha)Q(R(t),P_{rec}(t)),\\\\\n +\\alpha[U(R(t),P_{rec}(t))+\\max_{P_{rec}\\in\\mathcal{\\hat{P}}}Q(R(t+1),P_{rec})],\n \\end{multline*}\nwhere $0<\\alpha<1$ is the smoothing factor. Given a system\nstate $R$, the probability of choosing an action $P_{rec}$ is $\nP_{r}(P_{rec}(t)=P_{rec}|R(t)=R)=\\frac{e^{\\tau Q(R,P_{rec})}}{\\sum_{P_{rec}^{'}\\in\\mathcal{\\hat{P}}}e^{\\tau Q(R,P_{rec})}},$\nwhere $\\tau>0$ is the temperature.\n\nAfter the Q-learning converges, we obtain the corresponding spectrum\naccess policy $\\pi_{Q}$ over the discretized action space $\\mathcal{\\hat{P}}$.\nNote that $\\pi_{Q}$ is a sub-optimal policy for the adaptive channel\nrecommendation MDP over the continuous action space $\\mathcal{P}$.\n\nWe compare the Q-learning based policy with our MRAS-based optimal policy when there are $M=10$ channels and\n$N=5$ users, and show the simulation results in Figures \\ref{fig:Type-1-transition3} and \\ref{fig:Type-2-transition3}.\nFrom these figures, we see that the MRAS-based\nalgorithm outperforms Q-learning up to $10\\%$, which demonstrates the effectiveness of our proposed algorithm.\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{MRAS_and_Qlearning_1.eps}\n\\caption{\\label{fig:Type-1-transition3}Comparison of MRAS-based algorithm and Q-learning with Type 1 channel state transition matrix}\n\\end{center}\n\\end{figure}\n\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{MRAS_and_Qlearning_2.eps}\n\\caption{\\label{fig:Type-2-transition3}Comparison of MRAS-based algorithm and Q-learning with Type 2 channel state transition matrix}\n\\end{center}\n\\end{figure}\n\n\n\\subsection{Heuristic Heterogenous Channel Recommendation}\n\\rev{\nWe now evaluate the proposed heuristic heterogeneous channel recommendation mechanism in Section \\ref{sec:Adaptive-Channel-RecommendationII} with a network consisting of $M=10$ channels and $N=5$ users. We implement the heuristic heterogeneous channel recommendation mechanism in both homogeneous and heterogenous homogeneous environments.\n\\subsubsection{Homogeneous Channel Environment}\nWe first study how the heuristic heterogeneous channel recommendation mechanism performs in the homogeneous channel environment (which is a special case of the heterogeneous environment) in both types of $\\Gamma^{1}$ and $\\Gamma^{2}$ homogeneous channel environments, and simulate the optimal homogeneous channel recommendation (Algorithm \\ref{alg:MRAS-Method-For}) as a benchmark. . The data rate of each channel is normalized to be $1$ Mbps. The results are shown in Figures \\ref{fig:Type-1-transition3II} and \\ref{fig:Type-2-transition3II}. Comparing to the optimal channel access policy, the performance loss of the heuristic heterogeneous channel recommendation in the Type $1$ and Type $2$ channel environments are at most $12\\%$ and $5\\%$, respectively. This shows the efficiency of the heuristic heterogeneous channel recommendation in homogeneous channel environments.\n\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{HeurHomo1.eps}\n\\caption{\\label{fig:Type-1-transition3II}Comparison of heuristic heterogenous channel recommendation and optimal homogeneous channel recommendation in Type 1 homogeneous channel environment.}\n\\end{center}\n\\end{figure}\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{HeurHomo2.eps}\n\\caption{\\label{fig:Type-2-transition3II}Comparison of heuristic heterogenous channel recommendation and optimal homogeneous channel recommendation in Type 2 homogeneous channel environment.}\n\\end{center}\n\\end{figure}\n\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{HeurHeter1.eps}\n\\caption{\\label{fig:Type-1-transition3III}Comparison of heuristic heterogenous channel recommendation, optimal homogeneous channel recommendation and optimal homogeneous channel recommendation in the first kind of heterogenous channel environment.}\n\\end{center}\n\\end{figure}\n\n\\begin{figure}[ht]\n\\begin{center}\n\\includegraphics[scale=0.45]{HeurHeter2.eps}\n\\caption{\\label{fig:Type-2-transition3III}Comparison of heuristic heterogenous channel recommendation, optimal homogeneous channel recommendation and optimal homogeneous channel recommendation in the second kind of heterogenous channel environment.}\n\\end{center}\n\\end{figure}\n\n\\subsubsection{Heterogeneous Channel Environment}\nWe next implement the heuristic heterogeneous channel recommendation mechanism in heterogenous channel environments. The data rates of $M=10$ channels are $\\{B_{1}=0.2,B_{2}=0.6,B_{3}=0.8,B_{4}=1,B_{5}=2,B_{6}=4,B_{7}=6,B_{8}=8,B_{9}=10,B_{10}=20\\}$ Mbps. We consider two kinds of stochastic channel state changing environments:\n\\begin{align}&\\{\\Gamma_{1}=\\Gamma^{2},\\Gamma_{2}=\\Gamma^{2},\\Gamma_{3}=\\Gamma^{2},\\Gamma_{4}=\\Gamma^{2},\\Gamma_{5}=\\Gamma^{2},\\nonumber \\\\\n&~\\Gamma_{6}=\\Gamma^{1},\\Gamma_{7}=\\Gamma^{1},\\Gamma_{8}=\\Gamma^{1},\\Gamma_{9}=\\Gamma^{1},\\Gamma_{10}=\\Gamma^{1}\\},\\end{align}\nand\\begin{align}\n&\\{\\Gamma_{1}=\\Gamma^{1},\\Gamma_{2}=\\Gamma^{1},\\Gamma_{3}=\\Gamma^{1},\\Gamma_{4}=\\Gamma^{1},\\Gamma_{5}=\\Gamma^{1},\\nonumber \\\\ &~\\Gamma_{6}=\\Gamma^{2},\\Gamma_{7}=\\Gamma^{2},\\Gamma_{8}=\\Gamma^{2},\\Gamma_{9}=\\Gamma^{2},\\Gamma_{10}=\\Gamma^{2}\\}.\\end{align} Here subscript denotes channel index, and superscript denote channel type index. For the first kind of channel environment, a channel with low data rate tends to have a low primary transmission occupancy. While for the second kind, a channel with high data rate tends to have a high idleness probability. We also implement static channel recommendation, the optimal homogeneous channel recommendation (Algorithm \\ref{alg:MRAS-Method-For}) and optimal heterogeneous channel recommendation (obtained by adapting the MRAS algorithm to optimize the heterogeneous channel MDP, not shown in this paper) as benchmarks. The results are depicted in Figures \\ref{fig:Type-1-transition3III} and \\ref{fig:Type-2-transition3III}. From these figures, we see that:\n\\begin{itemize}\n\\item For the first kind of channel environment, the heuristic heterogeneous channel recommendation achieves up-to\n$40\\%$ and $100\\%$ performance improvement over the optimal homogeneous channel\nrecommendation and the static channel recommendation, respectively. Comparing with\nthe optimal heterogeneous channel recommendation, the performance\nloss of the heuristic heterogeneous channel recommendation is at most\n$35\\%$. Note that the number of decision variables in the optimal heterogeneous\nchannel recommendation is $M2^{M}=10240$, while the number of decision variables\nin the heuristic heterogeneous channel recommendation is only $2M=20$.\nThe convergence of the heuristic heterogeneous channel recommendation\nhence is much faster than the optimal heterogeneous channel recommendation.\n\\item For the second kind of channel environment, the heuristic heterogeneous\nchannel recommendation achieves up-to $70\\%$ and $100\\%$ performance improvement\nover the optimal homogeneous channel recommendation and static channel recommendation, respectively. The performance\nloss is at most\n$20\\%$ comparing with the the optimal heterogeneous channel recommendation. Comparing with Figure \\ref{fig:Type-1-transition3III}, we see that the heuristic heterogeneous channel recommendation\nperforms better if more channel opportunities are available for the\nsecondary users.\n\\end{itemize}\n} \n\\section{\\label{sec:Static-Channel-Recommendation1}Introduction To Channel Recommendation}\nIn this section, we first give a review of the static channel recommendation scheme in in \\cite{key-2} and then discuss the motivation for adaptive channel recommendation.\n\\subsection{\\label{sec:Static-Channel-Recommendation}Review of Static Channel Recommendation}\nThe key idea of the static channel recommendation scheme is that secondary users inform each other about the available channels they have just accessed. More specifically, each secondary user executes the following four stages synchronously during each time slot (See Figure \\ref{fig:Structure-of-Each}):\n\\begin{itemize}\n\\item \\emph{Spectrum sensing:} sense one of the channels based on channel selection result made at the end of the previous time slot.\n\\item \\emph{Channel Contention:} if the channel sensing result is idle, compete for the channel with the backoff mechanism described in Section \\ref{sec:System-Model}.\n\\item \\emph{Data transmission:} transmit data packets if the user successfully grabs the channel.\n\\item \\emph{Channel recommendation and selection:}\n\\begin{itemize}\n\\item \\emph{Announce recommendation:} if the user has successfully accessed an idle channel, broadcast this channel ID to all other secondary users.\n\\item \\emph{Collect recommendation:} collect recommendations\nfrom other secondary users and store them in a buffer. Typically,\nthe correlation of channel availabilities between two slots diminishes as the time difference increases.\nTherefore, each secondary user will only keep the recommendations received from the most recent $W$ slots and discard the out-of-date information. The user's own successful transmission history within $W$ recent time slots is also stored in the buffer. $W$ is a system design parameter and will be further discussed later.\n\\item \\emph{Select channel}: choose a channel to sense at the next time slot by putting more weights on the recommended channels according to a \\emph{static branching probability $P_{rec}$}. Suppose that the user has $0\\lambda|\\lambda_{n}=\\lambda\\}\\nonumber\\\\\n & = & \\frac{1}{k_{m}}\\sum_{\\lambda=1}^{\\lambda^{*}}\\frac{1}{\\lambda^{*}}\\left(\\frac{\\lambda^{*}-\\lambda}{\\lambda^{*}}\\right)^{k_{m}-1}.\\end{eqnarray}\nFor the ease of exposition, we focus on the asymptotic case where $\\lambda^{*}$ goes to $\\infty$. This is a good approximation when the number of mini-slots $\\lambda^{*}$ for backoff is much larger than the number of users $N$ and collisions rarely occur. It simplifies the analysis as \\begin{equation} \\lim_{\\lambda^{*}\\rightarrow\\infty}\\frac{1}{\\lambda^{*}}\\sum_{\\lambda=1}^{\\lambda^{*}}(\\frac{\\lambda^{*}-\\lambda}{\\lambda^{*}})^{k_{m}-1}=1,\\end{equation} and thus the expected throughput of user $n$ is \\begin{equation}\nu_{n}(t)=\\frac{B_{m}S_{m}(t)}{k_{m}}.\\label{eq:uu}\\end{equation}\n\\end{itemize}\n}\n\n\\begin{figure}[tt]\n\\begin{center}\n\\includegraphics[scale=0.6]{Time_Slot.eps}\n\\caption{\\label{fig:Structure-of-Each}Structure of each spectrum access time\nslot}\n\\end{center}\n\\end{figure}\n\n\\begin{figure}[tt]\n\\begin{center}\n\\includegraphics[scale=0.9]{Markov_Channel_Model.eps}\n\n\\caption{\\label{fig:Markovian-Channel-Model}Two states Markovian channel model}\n\\end{center}\n\\end{figure}\n\n","meta":{"redpajama_set_name":"RedPajamaArXiv"}} +{"text":"\\section{Introduction}\nIn order to understand to what extent non-spherical planetary nebulae (PNe) are shaped by binary interactions, a fundamental test is the determination of the PN binary fraction. This is a notoriously difficult quantity to determine.\nThe short period binary fraction is estimated to be 15-20\\% (\\cite{Bond2000}, \\cite{Miszalski2009}). This is biased to binaries with periods shorter than about $\\sim 3$ days. \n\nThe field of view of of the Kepler satellite of 14~x~14 square degrees, 4 PNe are known so far and 2 additional possible objects. We seek to detect periodic light variability due to binarity (irradiation effects, eclipses or ellipsoidal variablity) with an amplitude smaller than detectable by ground observations in order to quantify the extent of the bias. If the currently known short period binary fraction of 15-20\\% is accurate, we should see 1-2 binary PN in our Kepler sample.\n\n\n\\section{The PNe in the Kepler field}\n\n\\begin{figure}[!hbt]\n\\centering\n\\includegraphics[scale=0.16]{Kn61crop.png}\n\\caption{Kn 61, newly detected PN in the Kepler field. Credit: Gemini Observatory and T.~A.~Rector (University of Alaska Anchorage). http:\/\/www.gemini.edu\/node\/11656} \n\\label{kn61}\n\\end{figure}\nThere are four confirmed PNe in the Kepler field, including one (Pa 5) discovered by D.~Patchick in the framework of the Deep Sky Hunters (DSH) project (\\cite{Jacoby2010}).\nOne additional PN candidate, Kn 61 was discovered in the Kepler field by M. Kronberger using DSS false color images also in the context of the DSH search (\\cite{KronbergerIAU}), and then imaged by us in March 2011 with a 10 min exposure at the 2.1m NOAO Kitt Peak observatory. A Gemini Observatory image of the object is presented in Fig.~\\ref{kn61}. From its structure, that is similar to PN A 43, it is classified as a probable PN, although a spectrum of the nebula is required before considering Kn 61 as a confirmed PN. The sixth object, PaTe 1, is classified as possible PN due to its unusual morphology.\n\n\n\n\n\n\n\n\n\\begin{table}[!htb]\n\\begin{center}\n\\begin{tabular}{l c c c c}\n\\toprule\nName & PN status & Period (days) & Amplitude (mmag) & Notes \\\\\n\\midrule\nNGC 6826 & confirmed & 0.619 & 10 & Possible binary \\\\\nNGC 6742 & confirmed & 0.37: & 0.2: & Possible periodic variability \\\\\nPa 5 & confirmed & 1.12 & 4 & Possible binary, see \\cite{Ostensen2010} \\\\\nPaTe 1 & possible & 0.17 & 2 & Possible binary \\\\\nA 61 & confirmed & 1.47: & 2: & Variable \\\\\nKn 61 & probable & - & - & Recently discovered, no data \\\\\n\\bottomrule\n\n\\end{tabular}\n\\label{chart}\n\\caption{Preliminary results on the variability properties of the PNe in the Kepler field. The numbers followed by : are to be confirmed. Out of 5 possible or confirmed PNe, 4 show periodic light variations that could be attributed to binarity.}\n\\end{center}\n\n\\end{table}\n\n\n \n\n\n\\section{Early results and future work}\n\nWhile the smallest detectable amplitude for flux variability is 0.1 mag for ground-based observations, Kepler can detect light variability of about 1 mmag. In Table 1 we show that 4 of the 5 confirmed and possible PNe that have already been observed by Kepler have periodic light variations consistent with binarity (though a proper analysis is required to confirm that the perodic variability of these objects is due to binarity) with amplitudes less than the ground-based detection limit. \n\nWe will take thirty minute exposures of these six potential PNe in the Kepler field regularly throughout the year to detect potential long period flux variations. Wind and pulsations effects will be assessed with 1 minute sampling for each object over a single quarter. The advantages of this monitoring with respect to ground-based observations are a higher photometric precision (up to $1\\mu$mag for bright stars and well monitored objects) and a longer time baseline with no day, bad weather nor lunar interruptions insuring a constant coverage and a better time sampling.\n\n\n\n\nWhen the full data set is available, we will be able to impose some limits on how many short binaries may have avoided detection. Even with a small sample of PNe, we can put constraints on the actual short period binary fraction amongst the central stars of PNe.\n\n\n\n\n\n \n\n\n","meta":{"redpajama_set_name":"RedPajamaArXiv"}} +{"text":"\\section{Introduction}\n\nYoung supernova remnants (SNRs) are widely believed to be\nthe main source of Galactic cosmic rays.\n\\citet{koyama1995} discovered synchrotron X-rays\nfrom shells of SN~1006,\nwhich was the first observational clue of \ncosmic-ray electrons being accelerated up to the TeV energy range.\nLater, several young SNRs were found to have synchrotron X-ray shells\n\\citep[c.f.,][]{koyama1997,slane1999,bamba2000,vink2003}.\nAnother piece of evidence for cosmic-ray acceleration in SNRs \nwas obtained from gamma-ray observations.\nVery-high-energy (VHE) and GeV gamma-rays have been detected \nfrom several SNRs,\nalthough, it is still unclear whether their origin\nis hadronic or leptonic\n\\citep[e.g.,][]{aharonian2004,aharonian2007,\nabdo2010b,abdo2010c,abdo2011}.\n\nDespite these various pieces of evidence\nin favor of acceleration,\nit is still unclear how the acceleration process\nevolves in SNRs,\nin particular how the accelerated particles cool down and\nhow they escape from SNRs.\nOne reason for this lack of understanding is that\npast observational studies have concentrated on\nindividual sources alone.\nIn this paper, we investigate, for the first time,\nthe time evolution of SNR synchrotron X-rays,\nusing all available data in literature for sources\nin which this emission component is bright.\nIn section~\\ref{sec:sample},\nwe describe the evolution of synchrotron X-ray luminosity\nin our sample.\nAn interpretation and a simple model to support it\nare in section~\\ref{sec:model}.\nFinally, section~\\ref{sec:discuss} is devoted to\ndiscussion of the results.\n\n\\section{Sample selection and Results}\n\\label{sec:sample}\n\nWe searched the literature for reports of synchrotron X-ray emission\nfrom SNRs and found a total of 14 such sources.\nHowever, we could not use all of these for the current study,\nfor various reasons.\nKepler \\citep{bamba2005,reynolds2007}\nand G330.2+1.0 \\citep{park2009} had to be removed from our sample,\nbecause of the difficulty of estimating\nthe total synchrotron X-ray luminosity,\ncaused by a low detection significance or\nby contamination from thermal X-rays.\nThus our sample consists of the 12 SNRs\nlisted in Table~\\ref{tab:sample}.\nWe used the latest value of the 2--10~keV synchrotron X-ray unabsorbed flux\nfrom the references listed in the table.\nWhen the reported flux was not absorption-corrected or\nwas for a different energy band,\nwe normalized it unabsorbed flux in the 2--10~keV\nusing the best-fit model in the references.\nSynchrotron X-ray emission may have a spectral roll-off\nin the 2--10~keV band.\nWhen significant roll-off was reported in the references,\nwe took such a component into account while computing the flux.\nSome SNRs (Cas~A, Tycho, SN~1006)\nhave bright thermal X-ray emission,\nwhich makes it difficult to estimate the synchrotron X-ray flux.\nIn these cases,\nwe inferred the synchrotron X-ray flux\nbased on wide-band information and\/or detailed spectroscopy \nto isolate synchrotron X-rays from thermal component,\nas we believe such analysis can provide the most reliable \nresults currently available.\nTwo of the sample sources, W28 and G156.7+5.7, are largely extended but\nwere only partly observed with enough exposure in X-rays.\nAs the X-ray luminosities can be deduced only for \nthe observed regions\n(5\\% for W28 and 26\\% for G156.7+5.7, respectively),\npossible contributions from the unobserved regions\nare included in the upper error bars.\nWhen we estimated these contributions,\nwe assumed that the surface brightness of the unobserved region\nin each source is identical to that of the observed one.\nThe distance uncertainty is also included into the errors\non the luminosity.\nWe used a 10\\% distance uncertainty \nfor cases where \nno uncertainty was available in the literature.\nIn summary, we took into account the following uncertainties;\nstatistical errors given in literatures, systematic distance uncertainty,\nand the limited coverage of the SNR extension.\n\nIn order to study the time evolution, we need to know\nthe SNR ages.\nHowever, we have only four SNRs whose ages are historically known.\nAnother parameter, the ionization time scale of heated plasma,\nis also difficult to determine\nsince several SNRs show no thermal emission.\nWe thus use the physical radius of each SNR, $R_s$, as the age indicator.\n$R_s$ is taken from \\citet{green2009}.\nThe distance uncertainty is included in the error computation.\nSome SNRs have distorted shapes,\nas shown in Tab.~\\ref{tab:sample}.\nThis is also included in the errors on the radii.\nAll the derived parameters are shown in Tab.~\\ref{tab:sample}.\nThe radius of a SNR depends on the density of the interstellar medium,\nbut rather insensitively.\nFor remnants in the Sedov phase, $R_s\\propto n_0{}^{-1\/5}$\n(where $n_0$ is the upstream number density).\nThe radius changes by only a factor of $\\sim$2 \neven if the upstream density changes by 2~orders of magnitude.\nThe radius also has very weak dependency on the explosion energy $E_0$,\n$R_s\\propto E_0^{1\/5}$.\nOn the other hand, $R_s\\propto t_{\\rm age}{}^{2\/5}$\n(where $t_{\\rm age}$ is the age of the remnant).\nThus the radius is a good age indicator.\n\nFigure~\\ref{fig:r_Lx} shows the synchrotron X-ray luminosity\nas a function of the radius.\nOne can see that\nthe luminosity is in the order of $10^{34}$--$10^{36}$~ergs~s$^{-1}$\nwhen the SNRs are smaller than $R_s\\sim$5~pc,\nwhich corresponds to an age of a few hundred years,\nwhereas it decreses to $10^{32}$--$10^{35}$~ergs~s$^{-1}$\nbeyond $R_s\\sim$5~pc.\nit appears that the luminosity drops off rapidly\nat $R_s\\sim$5~pc,\nalthough the scatter is rather large.\nNote that all the SNRs with $R_s<5$~pc display\nsynchrotron X-rays brighter than $10^{34}$~ergs~s$^{-1}$ \\citep{green2009},\nwhereas most of larger SNRs do not have significant synchrotron X-rays.\nThis fact makes the difference of luminosities larger\nbetween the two regions.\nThe drop off in non-thermal X-ray luminosity reaches two or three\norders of magnitude,\nwhich is much larger than the errors on the individual luminosities.\nWe have carried out a similar analysis for the thermal X-ray luminosity\nfor SNRs in the Large Magellanic Cloud \\citep{williams1999}\nand the radio luminosity of Galactic SNRs \\citep{green2009,case1998}.\nHowever, no drop off like that observed for synchrotron X-rays\nhas been found.\n\n\n\\section{Evolution of Synchrotron X-rays}\n\\label{sec:model}\n\nHere we consider the cause of the decrease in synchrotron X-ray emission\nidentified in the previous section.\nThe $\\nu F_\\nu$-spectrum of synchrotron X-ray radiation \nhas a peak around the roll-off frequency, $\\nu_{\\rm roll}$,\nabove which the flux rapidly decays towards higher frequencies.\nAs SNRs evolve, $\\nu_{\\rm roll}$ is known to decrease\n\\citep[e.g.,][]{bamba2005}.\nThe observed rapid decay in synchrotron X-rays around \n$R_s\\sim10~{\\rm pc}$ could be caused by\n$\\nu_{\\rm roll}$ passing through the X-ray band\nto lower energies.\nIn this section, we discuss this possibility in detail.\nWe introduce essential argument first,\nand show a simple model to support it later.\n\nWe assume that the electron acceleration is energy-loss-limited,\nin which the maximum energy of electrons, $E_e{}^{\\max}$,\nis determined from \nthe balance of the synchrotron loss and acceleration:\n\\begin{equation}\nE_e{}^{max} = \\frac{24}{\\xi^{1\/2}}\\left(\\frac{v_s}{10^8~{\\rm cm~s^{-1}}}\\right)\n\\left(\\frac{B_d}{10~\\mu{\\rm G}}\\right)^{-1\/2}\\ \\ {\\rm (TeV)}\\ \\ ,\n\\label{eq:Emax_e}\n\\end{equation}\nwhere $\\xi$ is the gyro-factor.\nIn deriving Eq.~(\\ref{eq:Emax_e}), we equate the acceleration time,\n$t_{\\rm acc}(E)=20\\xi cE\/3ev_s{}^2B_d$ with the synchrotron cooling time, \n$t_{\\rm syn}(E)=125~{\\rm yr}(E\/10~{\\rm TeV})^{-1}(B_d\/100~\\mu{\\rm G})^{-2}$,\nwhere $v_s$ and $B_d$ are the shock velocity and the downstream\nmagnetic field, respectively.\nIn this case, we derive \n\\begin{equation}\nh\\nu_{\\rm roll}\\sim0.4~{\\rm keV}~\n\\xi^{-1}(v_s\/10^8~{\\rm cm}~{\\rm s}^{-1})^2 ~~,\n\\label{eq:rolloff}\n\\end{equation}\nwhich is independent of $B_d$ \\citep[e.g.,][]{aharonian1999,yamazaki2006}.\nThe roll-off frequency and the shock velocity have been measured\nin several SNRs\n\\citep[Cas~A, SN~1006;][]{reynolds1999,patnaude2009,bamba2008,ghavamian2002}.\nFor these SNRs, eq.(\\ref{eq:rolloff}) is consistent\nwith the observational values\nto within 1 order of magnitude\nassuming $\\xi = 1$.\nAlso note that the effect of particle escape from the shock region\n\\citep[e.g.,][]{reynolds1998,ohira2010} is not considered in this paper.\nThis effect might be important for older SNRs\n\\citep{ohira2011b}.\nHowever, our present model reproduces the observed trend well,\nsuggesting that particle escape is not yet significant for these SNRs\n(see also the last paragraph in section~4).\n\nThe X-ray spectrum of synchrotron radiation is well \napproximated analytically.\nIt is mainly determined by shock dynamics in the SNR\nif the synchrotron X-ray-emitting electrons with energy $E$ satisfy\n$t_{\\rm syn}(E)E_b$ suffer energy loss via\nsynchrotron cooling, which causes a steepening of the\nenergy spectrum \\citep[e.g.,][]{longair94}.\nWe also note that the shape of the cutoff is analytically obtained in\n\\citet{zirakashvilli2007}.\nGiven the electron distribution, we calculate the approximate\nformula of the X-ray luminosity, $L_\\nu$.\nThe characteristic frequency, $\\nu_{\\rm syn}(E)$, of the synchrotron radiation\nemitted by electrons with energy $E$ is given by\n\\begin{equation}\nh\\nu_{\\rm syn}(E)\\sim\n0.12~{\\rm keV}(B_d\/10~\\mu{\\rm G})(E\/10~{\\rm TeV})^2~~.\n\\label{eq:character}\n\\end{equation}\nThen, as long as $\\nu<\\nu_b=\\nu_{\\rm syn}(E_b)$,\nwe can apply the standard formula,\n$L_\\nu\\propto AB_d^{(p+1)\/2}\\nu^{-(p-1)\/2}$\n\\citep[e.g.,][]{longair94}.\nOn the other hand, if $\\nu_b<\\nu$, the spectral slope\nsteepens ($L_\\nu\\propto\\nu^{-p\/2}$) due to the \nsteepening of the electron distribution, and we derive\n\\begin{eqnarray}\nL_\\nu &\\propto& AB_d{}^{(p+1)\/2}\\nu_b{}^{-(p-1)\/2} (\\nu\/\\nu_b)^{-p\/2}\n\\exp(-\\sqrt{\\nu\/\\nu_{\\rm roll}})\n\\nonumber \\\\\n&\\propto&\nAB_d{}^{(p-2)\/2}\\nu^{-p\/2} \\exp(-\\sqrt{\\nu\/\\nu_{\\rm roll}})\n~~,\n\\label{eq:Luminoosity}\n\\end{eqnarray}\nwhere we assume that $L_\\nu$ is continuous at $\\nu = \\nu_b$,\nand we again use the result of \\citet{zirakashvilli2007}\nfor the cutoff shape.\nCalculating $\\nu_b$ as\n\\begin{equation}\nh\\nu_b \\sim 0.19~{\\rm keV}\n(B_d\/10~\\mu{\\rm G})^{-3}(t_{\\rm age}\/10^4{\\rm yr})^{-2}~~,\n\\end{equation}\nwe find that throughout the evolution of the SNR,\nthe X-ray band (2--10~keV) always lies above $\\nu_b$ because\nfor young SNRs ($t_{\\rm age}\\lesssim10^3$~yr),\nthe magnetic field may be amplified to $B_d\\gg10~\\mu$G\n\\citep[e.g.,][]{bamba2003,bamba2005,vink2003}.\nEquation.~(\\ref{eq:Luminoosity}) is thus a good approximation\nof the X-ray luminosity for any arbitrary epoch.\nIn particular, when $p\\approx2$, the X-ray luminosity\nis insensitive to the magnetic field,\ndepending instead mainly on $\\nu_{\\rm roll}$.\nAs the SNR ages, the shock velocity $v_s$ decreases and\n$\\nu_{\\rm roll}$ becomes smaller. \nEquation~(\\ref{eq:rolloff}) tells us that\n$\\nu_{\\rm roll}$ is below the X-ray band (2--10~keV)\nwhen $v_s\\lesssim10^8$cm~s$^{-1}$, \nso that the X-ray luminosity drops off.\n\n\nIn order to demonstrate the above argument,\nwe construct a simple model\nto calculate the synchrotron X-ray flux.\nIn our model, a simple shock dynamics scenario is considered.\nWe assume that the forward shock velocity of SNRs $v_s$ \nis a function of the age of SNR $t_{age}$ as follows:\n\\begin{eqnarray}\nv_s &=& \\left\\{\n\\begin{array}{ll}\nv_i & (t_{age}