6,963 research outputs found
Dynamic Multi-Arm Bandit Game Based Multi-Agents Spectrum Sharing Strategy Design
For a wireless avionics communication system, a Multi-arm bandit game is
mathematically formulated, which includes channel states, strategies, and
rewards. The simple case includes only two agents sharing the spectrum which is
fully studied in terms of maximizing the cumulative reward over a finite time
horizon. An Upper Confidence Bound (UCB) algorithm is used to achieve the
optimal solutions for the stochastic Multi-Arm Bandit (MAB) problem. Also, the
MAB problem can also be solved from the Markov game framework perspective.
Meanwhile, Thompson Sampling (TS) is also used as benchmark to evaluate the
proposed approach performance. Numerical results are also provided regarding
minimizing the expectation of the regret and choosing the best parameter for
the upper confidence bound
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
Data-driven design of intelligent wireless networks: an overview and tutorial
Data science or "data-driven research" is a research approach that uses real-life data to gain insight about the behavior of systems. It enables the analysis of small, simple as well as large and more complex systems in order to assess whether they function according to the intended design and as seen in simulation. Data science approaches have been successfully applied to analyze networked interactions in several research areas such as large-scale social networks, advanced business and healthcare processes. Wireless networks can exhibit unpredictable interactions between algorithms from multiple protocol layers, interactions between multiple devices, and hardware specific influences. These interactions can lead to a difference between real-world functioning and design time functioning. Data science methods can help to detect the actual behavior and possibly help to correct it. Data science is increasingly used in wireless research. To support data-driven research in wireless networks, this paper illustrates the step-by-step methodology that has to be applied to extract knowledge from raw data traces. To this end, the paper (i) clarifies when, why and how to use data science in wireless network research; (ii) provides a generic framework for applying data science in wireless networks; (iii) gives an overview of existing research papers that utilized data science approaches in wireless networks; (iv) illustrates the overall knowledge discovery process through an extensive example in which device types are identified based on their traffic patterns; (v) provides the reader the necessary datasets and scripts to go through the tutorial steps themselves
A Coalition Formation Game for Cooperative Spectrum Sensing in Cognitive Radio Network under the Constraint of Overhead
Cooperative spectrum sensing improves the sensing performance of secondary users by exploiting spatial diversity in cognitive radio networks. However, the cooperation of secondary users introduces some overhead also that may degrade the overall performance of cooperative spectrum sensing. The trade-off between cooperation gain and overhead plays a vital role in modeling cooperative spectrum sensing. This paper considers overhead in terms of reporting energy and reporting time. We propose a cooperative spectrum sensing based coalitional game model where the utility of the game is formulated as a function of throughput gain and overhead. To achieve a rational average throughput of secondary users, the overhead incurred is to be optimized. This work emphasizes on optimization of the overhead incurred. In cooperative spectrum sensing, the large number of cooperating users improve the detection performance, on the contrary, it increases overhead too. So, to limit the maximum coalition size we propose a formulation under the constraint of the probability of false alarm. An efficient fusion center selection scheme and an algorithm to select eligible secondary users for reporting are proposed to reduce the reporting overhead. We also outline a distributed cooperative spectrum sensing algorithm using the properties of the coalition formation game and prove that the utility of the proposed game has non-transferable properties. The simulation results show that the proposed schemes reduce the overhead of reporting without compromising the overall detection performance of cooperative spectrum sensing
Spectrum Estimation and Optimal Secondary User Selection in Cognitive Radio Networks
The high-speed development of wireless communication technology has emerged in the surging insistence on optimal spectrum resources. Nevertheless, in consonance to a contemporary study, most of the assigned frequency encounters notable underutilization as far as Cognitive Radio Network (CRN) is concerned. One important issue correlated with spectrum management is how to properly estimate and allocate the spectrum to a Secondary User (SU) for a highly dynamic environment in an optimal manner with minimum sensing delay. In this paper, a Chebyshev Vector Dynamic Spectrum and Kolmogorov-Smirnov Convolutional Network (CVDS-KSCN) method for dynamic spectrum estimation and optimal secondary user selection in CRN is developed. First, it is proposed to tackle the dynamic spectrum access issue with minimum sensing delay in CRN attaining robust spectrum channel throughput with minimum sensing delay. The spectrum estimation is modeled using the Chebyshev distance-based Harmonious Vector Spectrum Estimation model in a dynamic manner. With the dynamic spectrum estimated results, a Kolmogorov-Smirnov Convolutional Neural Network-based Secondary User Selection model is applied to retrieve optimal secondary users in CRN. The performance of CVDS-KSCN is assessed over numerous key aspects, where simulation results confirm the efficiency of the proposed method in achieving high reliable spectrum estimation and Secondary User selection. It is expressive in the simulation results that the proposed CVDS-KSCN method can achieve a good probability of throughput and reduction in sensing delay during Secondary User Selection with low probability of false alarm. The results show that the proposed method outperfroms the DRS and EFAHP algorithms quantitatively in terms of four parameters, namely throughput, sensing delay, false alarm percentage and Secondary User Selection Time
- …