Abstract
In this paper, we investigate the opportunistic spectrum access (OSA) of self-sustained secondary transmitters (STs) in cognitive radio (CR) network to improve both the spectral efficiency and energy efficiency. Particularly, by utilizing energy harvesting, the STs are assumed to be able to collect and store ambient powers for data transmission. An energy harvesting based OSA protocol, namely the EH-PRA protocol, is considered, under which a ST is eventually allowed to launch the transmission only if its battery level is larger than the transmit power and the estimated interference perceived at the active primary receivers (PRs) is lower than a threshold \(N_{ra}\). Given that the battery capacity of STs is infinite, we derive the transmission probability of STs. We then characterize the coverage performance of the CR network. Finally, simulation results are provided for the validation of our analysis.
Access provided by CONRICYT-eBooks. Download conference paper PDF
Similar content being viewed by others
Keywords
- Cognitive radio network
- Energy harvesting
- Opportunistic spectrum access
- Stochastic geometry
- Transmission probabilty
- Coverage probability
- Spatial throughput
1 Introduction
Energy harvesting [1,2,3,4,5], widely believed as a promising solution of power generation for next generation wireless networks, has attracted tremendous interests over recent years. By utilizing energy harvesting as energy sources for wireless networks, the corresponding energy costs as well as the adverse effects to the environment can be significantly reduced. Further, the wireless networks powered by energy harvesting can be flexibly deployed without the need of power grid [6].
In addition to energy efficiency, spectral efficiency is another important issue in mobile networking. Particularly, how to effectively exploiting the underutilized spectrum resources in mobile networks is consider to be the key challenges for the enhancement of spectral efficiency [7, 8]. To address this issue, technologies of CR [9, 10] based OSA [11,12,13] are proposed such that the under-utilized spectrum of the primary network can be effectively reused by the secondary network.
In this paper, to simultaneously improve the energy efficiency and spectral efficiency of the mobile networks [15,16,17], the energy harvesting based OSA is investigated under the CR paradigm. Particularly, with energy harvesting, the STs become self-sustained. The energy efficiency of the CR network is thereby significantly improved. On the other hand, thanks to the OSA of STs, the spectral efficiency of the CR network can also be improved.
Energy harvesting powered CR networks has been widely studied over recent years [18,19,20,21,22,23,24]. In [18], assuming perfect spectrum sensing, the myopic spectrum access policy was studied to maximize the throughput of self-sustained STs powered by energy harvesting. Further, in [19, 20], Park et al. evaluated the effect of sensing error and temporal correlation of the primary traffic on the throughput of CR network. In [21], Pappas et al. investigated the maximum stable throughput region for CR networks with self-sustained primary transmitters (PTs). In [22], Yin et al. optimized the cooperation strategy of self-sustained STs to maximize the achievable throughput of the CR network. Further, in [23], with STs powered by energy harvesting, Yin et al. proposed a generalized multi-slot spectrum sensing strategy which jointly optimized the save-ratio, sensing duration, sensing threshold as well as fusion rule to protect the primary transmissions. In [24], Chung et al. maximized the average throughput of the energy harvesting powered CR network by optimizing the sensing duration and energy detectors sensing threshold of STs. It is worth noting that [18,19,20,21,22,23,24] do not consider the impact of the locations of PTs and STs on the performance of the CR network.
In this paper, different from [18,19,20,21,22,23,24], we consider the CR networks powered by energy harvesting with Poisson distributed PTs and STs. By applying energy harvesting, the STs are assumed to be able to collect and store ambient powers for data transmissions. Given sufficient energy stored in the batteries, the corresponding STs (denoted by eligible STs) are then allowed to launch the transmissions only if its estimated inference perceived at the active PRs is lower than a predefined threshold \(N_{ra}\). We call this kind of OSA protocol as the energy harvesting based PRA protocol. Given that the battery capacity of STs is infinite, we derive the transmission probability for secondary network. We then characterize the coverage probability of the primary and secondary networks. Finally, simulation results are provided for the validation of our analysis.
2 System Model
We studied a CR network on \(\mathbb {R}^2\). The PTs have higher priority for utilizing the spectrum, while the STs can only opportunistically access the spectrum by exploiting the spatial holes of the primary network. The PTs and STs are modeled by two independent HPPPs with intensities given by \(\mu _0\) and \(\lambda _0\), respectively. For each PT, its associated PR is at a distance of \(d_p\) away in a random direction. Similarly, for each ST, its associated SR is at a distance of \(d_s\) away in a random direction. As such, the PRs and SRs also follow two independent HPPPs with their respective intensities given by \(\mu _0\) and \(\lambda _0\).
With energy harvesting, the STs are assumed to be able to collect and store ambient powers for data transmissions. Particularly, the energy harvested by the ST located at position \(\mathbf {y} \in \mathbb {R}^2\) in the t-th time slot is modeled by a nonnegative random variable \(Z_t^s(\mathbf {y})\) as
Further, it is assumed that the PTs, PRs and SRs are powered by reliable energy sources.
For the primary network, the PTs independently access the spectrum with probability \(\rho _p\) [27]. For the secondary network, the EH-PRA protocol is applied, under which a ST is allowed to transmit only if the battery level is larger than the transmit power \(P_s\) and the spatial spectrum hole of the primary network is detected.
Let \(\mathbf {B}_s\) denote the battery capacities for STs. Further, let \(P_p\) and \(P_s\) be the transmit powers of PTs and STs. Then, given \(S_t^s(\mathbf {y})\) as the battery level of ST located at positions \(\mathbf {y} \in \mathbb {R}^2\) in the t-th slot, it can be obtained that
where
\(\mathbf{{1}}_{\mathcal {A}}\) denotes the indicator function with respect to event \({\mathcal {A}}\).
For the primary network, the locations of active PTs/PRs follow a HPPP with density \(\mu _p = \mu _0 p_p\). For the secondary network, under the energy harvesting based PRA protocol, the density of the point process formed by the active STs in the t-th time slot is given by \(\mu _t^s = \eta _t^s \lambda _0\), where
The propagation channel is modeled by
where h denotes the exponentially distributed small-scale Rayleigh fading with unit mean, r denotes the transmission distance, and \(\alpha \) denotes the path-loss exponent [30]. The SIR targets for primary and secondary networks are denoted by \(\theta _p\) and \(\theta _s\), respectively.
3 Transmission Probability with Infinite Battery Capacity
In this section, assuming infinite battery capacity for STs, we derive the corresponding transmission probabilities \(\eta ^s\). Particularly, based on (3), by letting \(\mathbf {B}\rightarrow \infty \), it can be easily obtained that
where \(\mathcal {G}_t^s\) are defined in (4), respectively. Then, based on (5), we characterize the transmission probability \(\eta ^s\) of STs in the following theorems.
Theorem 1
For CR network with self-sustained STs, assuming infinite battery capacity and under the EH-PRA protocol, \(\eta ^s\) is given by
where
Proof
The proof is omitted due to space limitation.
Remark 3.1
Based on Theorem 1, the intensity of the point process formed by active STs can be immediately obtained as
4 Coverage Probability in Primary Network with Infinity Battery Capacity
4.1 Conditional Distribution of Active STs
To derive the coverage probability of primary transmission, we focus on a typical PR \({{\mathbf {R}}_p}\) at the origin with its associated PT \({{\mathbf {T}}_p}\) at a distance of \(d_p\) away in random direction. Then, by Slivnyak’s theorem [35], it can be easily verified that the rest of the active PRs/PTs follow a HPPP with intensity \(\mu _p\). For the secondary network, we denote \(\varPhi _{ra}^{{\mathbf {R}}_p}(u)\) as the point process formed by the active STs on a circle of radius u centered at \({\mathbf {R}}_p\). Then, we derive the conditional distribution of the active STs in the following lemma.
Lemma 1
For CR network with self-sustained STs, assuming infinite battery capacity and under the EH-PRA protocol, \(\varPhi _{ra}^{{\mathbf {R}}_p}(u)\) is isotropic with respect to \({\mathbf {R}}_p\) and its intensity \(\lambda _{ra}^{{\mathbf {R}}_p}(u)\) is given by
where
Proof
The proof is omitted due to space limitation.
It is worth noting that under the EH-PRA protocol, \(\varPhi _{ra}^{{\mathbf {R}}_p}(u)\) does not follow a HPPP. Then, due to the fact that the higher order statistics of \(\varPhi _{ra}^{{\mathbf {R}}_p}(u)\) are intractable, the coverage performance of the primary network is difficult to be completely characterized. To address this issue, similar to [13, 36,37,38,39], we make the following approximation on \(\varPhi _{ra}^{{\mathbf {R}}_p}(u)\).
Assumption 1
\(\varPhi _{ra}^{{\mathbf {R}}_p}(u)\) follows a HPPP with intensity given by \(\lambda _{ra}^{{\mathbf {R}}_p}(u)\).
Under Assumption 1, we then characterize the coverage performance of the primary network in the following subsection.
4.2 Coverage Probability with Energy Harvesting Based PRA Protocol
Theorem 2
For CR network with self-sustained STs, under Assumption 1, the coverage probability of the primary network is given by
where
and
Proof
See Appendix A.
5 Coverage Probability in Secondary Network with Infinity Battery Capacity
5.1 Conditional Distributions of Active PTs and STs
To derive the coverage probability of the secondary network, we focus on a typical SR \({\mathbf {R}}_s\) at the origin with its associated ST \({\mathbf {T}}_s\) at a distance of \(d_s\) away in random direction. Let \({\varPsi }_{ra}^{{\mathbf {T}}_s}(r)\) be the point process formed by the active PRs on a circle of radius r centered at \({\mathbf {T}}_s\) under the ER-PRA protocol. Then, \({\varPsi }_{ra}^{{\mathbf {T}}_s}(r)\) is characterized as follows.
Lemma 2
For CR network with self-sustained STs, under the ER-PRA protocol, \({\varPsi }_{ra}^{{\mathbf {T}}_s}(r)\) follows a HPPP with intensity \({\psi }_{ra}^{{\mathbf {T}}_s}(r)\) given by
where
Proof
Based on Lemma 5.1 in [13], it can be easily verified that \({\varPsi }_{ra}^{{\mathbf {T}}_s}(r)\) follows a HPPP with density \({\psi }_{ra}^{{\mathbf {T}}_s}(r)\) as given by (14).
Let \({\varUpsilon }_{ra}^{{\mathbf {T}}_s}(r)\) be the point process formed by the active PTs on a circle of radius r centered at \({\mathbf {T}}_s\) under the ER-PRA protocol. Then, with Lemma 2,\({\varUpsilon }_{ra}^{{\mathbf {T}}_s}(r)\) is derived in the following lemma.
Lemma 3
For CR network with self-sustained STs, under the ER-PRA protocol, \({\varUpsilon }_{ra}^{{\mathbf {T}}_s}(r)\) follows a HPPP with intensity \({\mu }_{ra}^{{\mathbf {T}}_s}(r)\), which is upper-bounded by
Proof
Based on Lemma 2, it can be easily verified that \({\varUpsilon }_{ra}^{{\mathbf {T}}_s}(r)\) follows a HPPP and the upper bound on \({\mu }_{ra}^{{\mathbf {T}}_s}(r)\) is given by \({\psi }_{ra}^{{\mathbf {T}}_s}(r + d_p)\).
For the secondary network, we denote \({\varPhi }_{ra}^{{\mathbf {T}}_s}(r)\) as the point process formed by the active STs on a circle of radius r centered at \({\mathbf {T}}_s\) under the energy harvesting based PRA protocol. Then, with Lemma 2, the conditional distribution of \({\varPhi }_{ra}^{{\mathbf {T}}_s}(r)\) under the energy harvesting based PRA protocol is characterized as follows.
Lemma 4
For an overlay CR network with self-sustained STs, under the energy harvesting based PRA protocol, conditioned on a typical SR at the origin, \({\varPhi }_{ra}^{{\mathbf {T}}_s}(r)\) is isotropic around \({\mathbf {T}}_s\), and the corresponding density, denoted by \({\lambda ^{{\mathbf {T}}_s}_{ra}}({r})\), is bounded by
where
and
Proof
Based on Lemma 5.3 in [13], (17) is immediately obtained. This thus completes the proof of Lemma 4.
It is worth noting that under the ER-PRA protocol, similar to the primary network case, \({\varPhi }_{ra}^{{\mathbf {T}}_s}(r)\) or does not follow a HPPP. As such, the coverage probability of the secondary network under the energy harvesting based PRA protocol is difficult to be derived. To tackle this difficulty, we make the following approximation on \({\varPhi }_{ra}^{{\mathbf {T}}_s}(r)\).
Assumption 2
Under the ER-PRA protocol, \(\varPhi _{ra}^{{\mathbf {T}}_s}(r)\) follows a HPPP with intensity \(\lambda _{ra}^{{\mathbf {T}}_s}(r)\).
With Assumption 2, we then derive the coverage probability of the secondary network under the ER-PRA protocol in the following subsection.
5.2 Coverage Probability with PRA Protocol
Under the energy harvesting based PRA protocol, we denote \({\varUpsilon }_{ra}^{{\mathbf {R}}_s}(u)\) as the point process formed by the active PTs on a circle of radius u centered at \({\mathbf {R}}_s\). Then, based on Lemma 3, it can be easily verified that \({\varUpsilon }_{ra}^{{\mathbf {R}}_s}(u)\) does not follow a HPPP. Let \({\mu }_{ra}^{{\mathbf {R}}_s}(u)\) be the average density of \({\varUpsilon }_{ra}^{{\mathbf {R}}_s}(u)\). Then, we characterize \({\mu }_{ra}^{{\mathbf {R}}_s}(u)\) in the following lemma.
Lemma 5
Under the ER-PRA protocol, \({\mu }_{ra}^{{\mathbf {R}}_s}(u)\) is upper bounded by
Proof
Based on Lemma 3, it can be easily verified that the highest density of \({\mu }_{ra}^{{\mathbf {R}}_s}(u)\) is \({\mu }_{ra}^{{\mathbf {T}}_s}(u + d_s)\).
Based on Lemma 5, we then derive the coverage probability of the secondary network under the ER-PRA protocol in the following theorem.
Theorem 3
For CR network with self-sustained STs, under the ER-PRA protocol, based on Assumption 2, the coverage probability of the secondary network is lower-bounded by
Proof
6 Numerical Results
In this section, simulation results are provided to validate our analytical results. Throughout this section, unless specified otherwise, we set \(\mu _p = 0.1\), \(\lambda _0 = 0.1\), \(P_p = 5\), \(P_s = 2\), \(d_p = d_s = 1\), \(\theta _p = \theta _s = 3\), and \(\alpha = 4\).
Figure 1 plots the analytical and simulation results on the transmission probability of the STs versus \(\mu _p\) under the EH-PRA protocol. It is observed that the transmission probability of STs under the EH-PRA protocol are piecewise functions with \(\mu _p\), which are intuitively expected from Theorem 1. It is also observed that the simulation results are in accordance with our analytical results.
Figure 2 shows the coverage probability of primary network under the EH-PRA protocol. It is observed that the simulated values fit closely to our analytical values, which thereby shows that Assumption 1 is valid.
Figure 3 plots the analytical and simulation results on the coverage probability of the secondary network under the EH-PRA protocol. As observed from Fig. 3, the lower bound on the coverage probability of the secondary network derived in Theorem 3 under Assumption 2 is effective.
7 Conclusions
This paper has studied the performance of CR networks with self-sustained STs. Upon harvesting sufficient energy, the STs opportunistically access the spectrum if the estimated interference at the active PRs is lower than a predefined threshold \(N_{ra}\). Assuming infinite battery capacity, we derived the transmission probability of STs. We then characterized the coverage probabilities of the primary and secondary networks. Simulation results are provided to validate our analysis.
References
Ellabban, O., Abu-Rub, H., Blaabjerg, F.: Renewable energy resources: current status, future prospects and their enabling technology. Renew. Sustain. Energy Rev. 39, 748–764 (2014)
Hasan, Z., Boostanimehr, H., Bhargava, V.K.: Green cellular networks: a survey, some research issues and challenges. IEEE Commun. Surv. Tutor. 13(4), 524–540 (2011)
Kwasinski, A., Kwasinski, A.: Increasing sustainability and resiliency of cellular network infrastructure by harvesting renewable energy. IEEE Commun. Mag. 53(4), 110–116 (2015)
Gunduz, D., Stamatiou, K., Michelusi, N., Zorzi, M.: Designing intelligent energy harvesting communication systems. IEEE Commun. Mag. 52(1), 210–216 (2014)
Han, T., Ansari, N.: Powering mobile networks with green energy. IEEE Wirel. Commun. 21(1), 90–96 (2014)
Zhao, N., Yu, F.R., Leung, V.C.M.: Wireless energy harvesting in interference alignment networks. IEEE Commun. Mag. 53(6), 72–78 (2015)
Zhang, H., Jiang, C., Beaulieu, N.C., Chu, X., Wen, X., Tao, M.: Resource allocation in spectrum-sharing OFDMA femtocells with heterogeneous services. IEEE Trans. Commun. 62(7), 2366–2377 (2014)
Zhang, H., Chu, X., Guo, W., Wang, S.: Coexistence of Wi-Fi and heterogeneous small cell networks sharing unlicensed spectrum. IEEE Commun. Mag. 53(3), 158–164 (2015)
Wang, B., Liu, K.J.R.: Advances in cognitive radio networks: a survey. IEEE J. Sel. Top. Sig. Process. 5(1), 5–23 (2011)
Zeng, Y.H., Liang, Y.-C., Hoang, A.T., Zhang, R.: A review on spectrum sensing for cognitive radio: challenges and solutions. EURASIP J. Adv. Sig. Process. (2010). Article ID 381465
Zhao, Q., Sadler, B.: A survey of dynamic spectrum access. IEEE Sig. Process. Mag. 24(3), 79–89 (2007)
Zhang, R., Liang, Y.C., Cui, S.: Dynamic resource allocation in cognitive radio networks. IEEE Sig. Process. Mag. 27(3), 102–114 (2010)
Song, X., Yin, C., Liu, D., Zhang, R.: Spatial throughput characterization in cognitive radio networks with threshold-based opportunistic spectrum access. IEEE J. Sel. Areas Commun. 32(11), 2190–2204 (2014)
Tandra, R., Mishra, S., Sahai, A.: What is a spectrum hole and what does it take to recognize one. Proc. IEEE 97(5), 824–848 (2009)
Zhang, H., Jiang, C., Beaulieu, N., Chu, X., Wang, X., Quek, T.: Resource allocation for cognitive small cell networks: a cooperative bargaining game theoretic approach. IEEE Trans. Wirel. Wirel. Commun. 14(6), 3481–3493 (2015)
Zhao, X., Yang, C., Yao, Y., Chen, Z., Xia, B.: Cognitive and cache-enabled D2D communications in cellular networks, November 2015. http://arxiv.org/abs/1509.04747
Wang, X., Chen, M., Taleb, T., Ksentini, A., Leung, V.C.M.: Cache in the air: exploiting content caching and delivery techniques for 5G systems. IEEE Commun. Mag. 52(2), 131–39 (2014)
Park, S., Lee, S., Kim, B., Hong, D., Lee, J.: Energy-efficient opportunistic spectrum access in cognitive radio networks with energy harvesting. In: Proceedings of ACM International Conference on Cognitive Radio and Advanced Spectrum Management, Barcelona, Spain (2011)
Park, S., Kim, H., Hong, D.: Cognitive radio networks with energy harvesting. IEEE Trans. Wirel. Commun. 12(3), 1386–1397 (2013)
Park, S., Hong, D.: Achievable throughput of energy harvesting cognitive radio networks. IEEE Trans. Wirel. Commun. 13(2), 1010–1022 (2014)
Pappas, N., Jeon, J., Ephremides, A., Traganitis, A.: Optimal utilization of a cognitive shared channel with a rechargeable primary source node. In: Proceedings of IEEE Information Theory Workshop, Paraty, Brazil (2011)
Yin, S., Zhang, E., Qu, Z., Yin, L., Li, S.: Optimal cooperation strategy in cognitive radio systems with energy harvesting. IEEE Trans. Wirel. Commun. 13(9), 4693–4707 (2014)
Yin, S., Qu, Z., Li, S.: Achievable throughput optimization in energy harvesting cognitive radio systems. IEEE J. Sel. Areas Commun. 33(3), 407–422 (2015)
Chung, W., Park, S., Lim, S., Hong, D.: Spectrum sensing optimization for energy-harvesting cognitive radio systems. IEEE Trans. Wirel. Commun. 13(5), 2601–2613 (2014)
Gallager, R.G.: Stochastic Processes Theory for Applications. Cambridge University Press, Cambridge (2013)
Baccelli, F., Błaszczyszyn, B.: Stochastic geometry and wireless networks. NOW Found. Trends Netw. (2010)
Baccelli, F., Błaszczyszyn, B., Mühlethaler, P.: Stochastic analysis of spatial and opportunistic aloha. IEEE J. Sel. Areas Commun. 27(7), 1029–1046 (2009)
Kingman, J.F.C.: Poisson Processes. Oxford University Press, Oxford (1993)
Stoyan, D., Kendall, W., Mecke, J.: Stochastic Geometry and Its Applications, 2nd edn. Wiley, Chichester (1996)
Weber, S., Andrews, J., Jindal, N.: The effect of fading, channel inversion, and threshold scheduling on ad hoc networks. IEEE Trans. Inf. Theor. 53(11), 4127–4149 (2007)
Vaze, R.: Transmission capacity of spectrum sharing ad hoc networks with multiple antennas. IEEE Trans. Wirel. Commun. 10(7), 2334–2340 (2011)
Huang, K., Lau, V.K.N., Chen, Y.: Spectrum sharing between cellular and mobile ad hoc networks: transmission-capacity trade-off. IEEE J. Sel. Areas Commun. 27(7), 1029–1046 (2009)
Lee, J., Andrews, J.G., Hong, D.: Spectrum-sharing transmission capacity. IEEE Trans. Wirel. Commun. 10(9), 3053–3063 (2011)
Lee, J., Andrews, J.G., Hong, D.: The effect of interference cancellation on spectrum-sharing transmission capacity. In: Proceedings of IEEE Conference on Communications, Kyoto, Japan (2011)
Haenggi, M., Andrews, J., Baccelli, F., Dousse, O., Franceschetti, M.: Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE J. Sel. Areas Commun. 27(7), 1029–1046 (2009)
Lee, C., Haenggi, M.: Interference and outage in Poisson cognitive networks. IEEE Trans. Wireless Commun. 11(4), 1392–1401 (2012)
Nguyen, T., Baccelli, F.: A probabilistic model of carrier sensing based cognitive radio. In: Proceedings of IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks, Singapore, April 2010
Hasan, A., Andrews, J.: The guard zone in wireless ad hoc networks. IEEE Trans. Wirel. Commun. 6(3), 897–906 (2007)
Lee, S.H., Huang, K.B., Zhang, R.: Opportunistic wireless energy harvesting in cognitive radio networks. IEEE Trans. Wirel. Commun. 12(9), 4788–4799 (2013)
Huang, K.: Spatial throughput of mobile ad hoc networks with energy harvesting. IEEE Trans. Inf. Theor. 59(11), 7597–7612 (2013)
Acknowledgements
This work is supported in part by Fundamental Research Funds for the Central Universities under Grant No. N150403001, the National Natural Science Foundation of China under Grant 61671141, U14331156, 1151002, 61401079, 61501038, and the Major Research Plan of the National Natural Science Foundation of China under Grant 91438117, 91538202.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
A Proof of Theorem 2
A Proof of Theorem 2
Proof
With the energy harvesting based PRA protocol, given a typical PR located at the origin, the received SIR is given by
It is worth noting that under the EH-PRA protocol, at the typical PR, the received interference from the j-th active ST is constrained as \(P_s g_j |\mathbf{{Y}}_j|^{- \alpha }\le \frac{P_s{N_{ra}}}{P_p}\). Therefore, under Assumption 1, the coverage probability of the primary network with the EH-PRA protocol is given by
where (a) follows from the fact that the probability density function of g conditioned on \(g \le t\) is given by
and (b) follows from (8). This thus completes the proof of Theorem 2.
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Song, X., Meng, X., Geng, Y., Ye, N., Liu, J. (2018). Coverage Performance in Cognitive Radio Networks with Self-sustained Secondary Transmitters. In: Long, K., Leung, V., Zhang, H., Feng, Z., Li, Y., Zhang, Z. (eds) 5G for Future Wireless Networks. 5GWN 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 211. Springer, Cham. https://doi.org/10.1007/978-3-319-72823-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-72823-0_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72822-3
Online ISBN: 978-3-319-72823-0
eBook Packages: Computer ScienceComputer Science (R0)