Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457849
R. Beckman, K. Channakeshava, Fei Huang, V. Vullikanti, A. Marathe, M. Marathe, Guanhong Pei
In this paper, we develop a microscopic, agent-based simulation tool, called SIGMA-SPECTRUM to study the dynamics of the primary wireless spectrum market. A detailed, synthetic demand model, is used to produce disaggregated spectrum demand profiles that vary spatially and temporally for each individual in the population. We implement a truthful and efficient auction mechanism, proposed by Ausubel, that results in more efficient allocations than the current auction mechanisms used by the FCC. This research analyzes the effect of recent advances in cognitive radio technology, the DSA (Dynamic Spectrum Access) and the possibility of active trading in the secondary market, on the allocation outcomes in the primary market. Provision of active trading in the secondary market invites speculators and sometimes encourages collusive behavior among bidders, which can significantly alter the primary market outcomes in terms of winners and their allocations.
{"title":"Implications of Dynamic Spectrum Access on the Efficiency of Primary Wireless Market","authors":"R. Beckman, K. Channakeshava, Fei Huang, V. Vullikanti, A. Marathe, M. Marathe, Guanhong Pei","doi":"10.1109/DYSPAN.2010.5457849","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457849","url":null,"abstract":"In this paper, we develop a microscopic, agent-based simulation tool, called SIGMA-SPECTRUM to study the dynamics of the primary wireless spectrum market. A detailed, synthetic demand model, is used to produce disaggregated spectrum demand profiles that vary spatially and temporally for each individual in the population. We implement a truthful and efficient auction mechanism, proposed by Ausubel, that results in more efficient allocations than the current auction mechanisms used by the FCC. This research analyzes the effect of recent advances in cognitive radio technology, the DSA (Dynamic Spectrum Access) and the possibility of active trading in the secondary market, on the allocation outcomes in the primary market. Provision of active trading in the secondary market invites speculators and sometimes encourages collusive behavior among bidders, which can significantly alter the primary market outcomes in terms of winners and their allocations.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116798958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457894
Z. Xiong, K. Cumanan, S. Lambotharan
A robust beamformer design is proposed for a spectrum sharing CR network consisting of multiple secondary users (SUs) in the presence of multiple primary users (PUs). The proposed algorithm aims to maximize the worst case signal-to-interference-plus-noise ratio (SINR) of the SUs while limiting the interference leakage to PUs. Since it may be difficult to obtain perfect information about the channels between the SU basestation and the PUs, we consider errors in the PU channel estimates and design beamformers to limit interference leakage to PU below a specific threshold with a certain probability. The simulation results demonstrate that the proposed beamformer design has the ability to maximize the worst case SINR (balanced SINR) while controlling the interference leakage to PUs.
{"title":"Robust SINR Balancing Technique for a Cognitive Radio Network Using Probability Based Interference Constraints","authors":"Z. Xiong, K. Cumanan, S. Lambotharan","doi":"10.1109/DYSPAN.2010.5457894","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457894","url":null,"abstract":"A robust beamformer design is proposed for a spectrum sharing CR network consisting of multiple secondary users (SUs) in the presence of multiple primary users (PUs). The proposed algorithm aims to maximize the worst case signal-to-interference-plus-noise ratio (SINR) of the SUs while limiting the interference leakage to PUs. Since it may be difficult to obtain perfect information about the channels between the SU basestation and the PUs, we consider errors in the PU channel estimates and design beamformers to limit interference leakage to PU below a specific threshold with a certain probability. The simulation results demonstrate that the proposed beamformer design has the ability to maximize the worst case SINR (balanced SINR) while controlling the interference leakage to PUs.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126784965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457875
Q. Zhang, O. Dobre, S. Rajan, R. Inkol
Cyclic prefix single carrier linear digital modulation (CP-SCLD) has been proposed as an alternative to orthogonal frequency division multiplexing (OFDM), and adopted in the IEEE 802.16 wireless metropolitan area network (WMAN) standard. In this paper we develop a cyclostationarity-based algorithm for joint blind estimation of the block transmission parameters of a CP-SCLD based system. The effectiveness of the proposed algorithm is shown for signals affected by time dispersive channels, additive Gaussian noise, carrier phase, and frequency and symbol timing offsets. This algorithm complements the signal detection and classification algorithms devised by the authors in [1]-[2], and represents an integral part of a suite of algorithms applicable to spectrum awareness for cognitive radio (CR).
{"title":"Cyclostationarity Approach to Joint Blind Estimation of CP-SCLD Block Transmission Parameters for Cognitive Radio","authors":"Q. Zhang, O. Dobre, S. Rajan, R. Inkol","doi":"10.1109/DYSPAN.2010.5457875","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457875","url":null,"abstract":"Cyclic prefix single carrier linear digital modulation (CP-SCLD) has been proposed as an alternative to orthogonal frequency division multiplexing (OFDM), and adopted in the IEEE 802.16 wireless metropolitan area network (WMAN) standard. In this paper we develop a cyclostationarity-based algorithm for joint blind estimation of the block transmission parameters of a CP-SCLD based system. The effectiveness of the proposed algorithm is shown for signals affected by time dispersive channels, additive Gaussian noise, carrier phase, and frequency and symbol timing offsets. This algorithm complements the signal detection and classification algorithms devised by the authors in [1]-[2], and represents an integral part of a suite of algorithms applicable to spectrum awareness for cognitive radio (CR).","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122726952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457873
F. Penna, R. Garello, M. Spirito
In this paper we propose a novel, versatile graph model to solve efficiently and in a fully distributed fashion problems of collaborative inference in Cognitive Networks. Specifically, we develop an algorithm that estimates the probabilities of channel occupation for secondary network nodes; the algorithm can be used either to compute multiple, location-dependent, soft probability estimates relative to each single node, or to make a global decision about the presence of primary users in the overall area where a cognitive network operates. These goals are achieved by exchanging messages among cognitive nodes without the need of any centralized controller or fusion center. The proposed approach is based on the representation of the network as a factor graph which incorporates in itself three elements: 1) spectrum sensing measurements collected by individual nodes; 2) spatial correlations existing between pairs of neighboring nodes; 3) temporal evolution of the probability of presence of primary users. Bayesian inference on the resulting graph is then performed by iterative Belief Propagation, using the Sum-Product rule. Thanks to the correspondence between graph nodes and physical network nodes, the algorithm is implemented according to a Network Message Passing strategy where messages are actual packets sent by network nodes to neighbors. To determine the spatial interaction coefficients, that are a key component in the model, we derive a learning procedure that allows to set the parameters according to empirical statistics (e.g., a set of past observations or training data). Again, this procedure is completely distributed and can be implemented by each node based on local (neighbors') information only.
{"title":"Distributed Inference of Channel Occupation Probabilities in Cognitive Networks via Message Passing","authors":"F. Penna, R. Garello, M. Spirito","doi":"10.1109/DYSPAN.2010.5457873","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457873","url":null,"abstract":"In this paper we propose a novel, versatile graph model to solve efficiently and in a fully distributed fashion problems of collaborative inference in Cognitive Networks. Specifically, we develop an algorithm that estimates the probabilities of channel occupation for secondary network nodes; the algorithm can be used either to compute multiple, location-dependent, soft probability estimates relative to each single node, or to make a global decision about the presence of primary users in the overall area where a cognitive network operates. These goals are achieved by exchanging messages among cognitive nodes without the need of any centralized controller or fusion center. The proposed approach is based on the representation of the network as a factor graph which incorporates in itself three elements: 1) spectrum sensing measurements collected by individual nodes; 2) spatial correlations existing between pairs of neighboring nodes; 3) temporal evolution of the probability of presence of primary users. Bayesian inference on the resulting graph is then performed by iterative Belief Propagation, using the Sum-Product rule. Thanks to the correspondence between graph nodes and physical network nodes, the algorithm is implemented according to a Network Message Passing strategy where messages are actual packets sent by network nodes to neighbors. To determine the spatial interaction coefficients, that are a key component in the model, we derive a learning procedure that allows to set the parameters according to empirical statistics (e.g., a set of past observations or training data). Again, this procedure is completely distributed and can be implemented by each node based on local (neighbors') information only.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123114309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457847
Husheng Li
Secondary users in cognitive radio networks need to learn the statistics of spectrum in order to achieve efficient communications. Due to the spatial correlation, the efficiency of learning is improved by letting secondary users collaborate and exchange information. Due to the similarity between the collaborative learning in cognitive radio networks and the recommendation systems of electronic commerce like Amazon, the technique of collaborative filtering is applied. Prediction oriented and reward oriented criteria are proposed to derive the procedure of collaborative filtering. For the former criterion, linear prediction is used for the parameter estimation, heuristic metric is derived for channel selection, and similarity based Boltzman distribution is used for collaborator selection. For the latter criterion, the technique of multi-armed bandit is applied to maximize the total reward of spectrum access. Numerical simulation shows that the proposed collaborative filtering scheme can significantly improve the performance of spectrum learning.
{"title":"Learning the Spectrum via Collaborative Filtering in Cognitive Radio Networks","authors":"Husheng Li","doi":"10.1109/DYSPAN.2010.5457847","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457847","url":null,"abstract":"Secondary users in cognitive radio networks need to learn the statistics of spectrum in order to achieve efficient communications. Due to the spatial correlation, the efficiency of learning is improved by letting secondary users collaborate and exchange information. Due to the similarity between the collaborative learning in cognitive radio networks and the recommendation systems of electronic commerce like Amazon, the technique of collaborative filtering is applied. Prediction oriented and reward oriented criteria are proposed to derive the procedure of collaborative filtering. For the former criterion, linear prediction is used for the parameter estimation, heuristic metric is derived for channel selection, and similarity based Boltzman distribution is used for collaborator selection. For the latter criterion, the technique of multi-armed bandit is applied to maximize the total reward of spectrum access. Numerical simulation shows that the proposed collaborative filtering scheme can significantly improve the performance of spectrum learning.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115110495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457868
H. Harada, H. Fujii, T. Furuno, S. Miura, T. Ohya
One of the important and widely used detection techniques is cyclostationarity-based feature detection, because the method does not need prior information such as signal bandwidth or frame format, and time and frequency synchronization are likewise not required. The original cyclostationarity cannot distinguish signals if several signals have the same signal format and parameters, but the cyclostationarity-inducing transmission method can overcome this problem by inducing different features in the OFDM signals that have the same parameters. Another problem of conventional cyclostationarity-based feature detection is that the detection probability of weak signals worsens if multiple signals with different received-power levels are captured simultaneously. This paper proposes iterative cyclostationarity-based feature detection to detect such weak signals. The proposed detection method suppresses the effects of previously-detected signals in the cyclic auto-correlation domain, and so improves the detection probability of the weak signals. The detection performances of the conventional and proposed detection methods are evaluated by computer simulations. The results reveal the effectiveness of the proposed detection in spectrum sharing scenarios.
{"title":"Iterative Cyclostationarity-Based Feature Detection of Multiple Primary Signals for Spectrum Sharing Scenarios","authors":"H. Harada, H. Fujii, T. Furuno, S. Miura, T. Ohya","doi":"10.1109/DYSPAN.2010.5457868","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457868","url":null,"abstract":"One of the important and widely used detection techniques is cyclostationarity-based feature detection, because the method does not need prior information such as signal bandwidth or frame format, and time and frequency synchronization are likewise not required. The original cyclostationarity cannot distinguish signals if several signals have the same signal format and parameters, but the cyclostationarity-inducing transmission method can overcome this problem by inducing different features in the OFDM signals that have the same parameters. Another problem of conventional cyclostationarity-based feature detection is that the detection probability of weak signals worsens if multiple signals with different received-power levels are captured simultaneously. This paper proposes iterative cyclostationarity-based feature detection to detect such weak signals. The proposed detection method suppresses the effects of previously-detected signals in the cyclic auto-correlation domain, and so improves the detection probability of the weak signals. The detection performances of the conventional and proposed detection methods are evaluated by computer simulations. The results reveal the effectiveness of the proposed detection in spectrum sharing scenarios.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132461619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457884
Daniel T. McCloskey, Phil Gossett
The opening of the TV bands to unlicensed use in the United States offers an opportunity to build very wideband systems, capable of dynamic spectrum access (DSA), high datarates, high capacity, and long range links. To take maximum advantage of the wide bandwidths available (up to 90 MHz of contiguous spectrum), novel wideband transceiver architectures are needed. This paper presents wideband transceiver architectures we have developed to operate in US UHF band, discussion of the requirements placed on this transceiver by regulations in the FCC order (spectrum sensing, adjacent channel mask, etc), and presentation of an architecture we implemented whose performance meets the FCC requirements.
{"title":"Wideband Transceiver Architectures for TV Whitespace Applications","authors":"Daniel T. McCloskey, Phil Gossett","doi":"10.1109/DYSPAN.2010.5457884","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457884","url":null,"abstract":"The opening of the TV bands to unlicensed use in the United States offers an opportunity to build very wideband systems, capable of dynamic spectrum access (DSA), high datarates, high capacity, and long range links. To take maximum advantage of the wide bandwidths available (up to 90 MHz of contiguous spectrum), novel wideband transceiver architectures are needed. This paper presents wideband transceiver architectures we have developed to operate in US UHF band, discussion of the requirements placed on this transceiver by regulations in the FCC order (spectrum sensing, adjacent channel mask, etc), and presentation of an architecture we implemented whose performance meets the FCC requirements.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133180606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457904
László Toka, A. Korosi, A. Vidács
We study the potential of a dynamic spectrum management framework that enables sequential allocation of frequency bands for wireless service providers. We present our distributed system design on allocation and pricing with the goal of achieving efficient spectrum utilization, flexible allocations and incentive-compatibility, considering physical interference model among frequency licensees. Our work provides insights on the emerging optimization problems related to the allocation. We show the analytic results that give ideas for well-established heuristics to these problems. We evaluate the proposed framework and algorithms numerically, and we arrive at the conclusion, that even by the simple proposed heuristics the system performs well, thus it is a suitable approach to a flexible distributed dynamic allocation framework.
{"title":"On Distributed Dynamic Spectrum Allocation for Sequential Arrivals","authors":"László Toka, A. Korosi, A. Vidács","doi":"10.1109/DYSPAN.2010.5457904","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457904","url":null,"abstract":"We study the potential of a dynamic spectrum management framework that enables sequential allocation of frequency bands for wireless service providers. We present our distributed system design on allocation and pricing with the goal of achieving efficient spectrum utilization, flexible allocations and incentive-compatibility, considering physical interference model among frequency licensees. Our work provides insights on the emerging optimization problems related to the allocation. We show the analytic results that give ideas for well-established heuristics to these problems. We evaluate the proposed framework and algorithms numerically, and we arrive at the conclusion, that even by the simple proposed heuristics the system performs well, thus it is a suitable approach to a flexible distributed dynamic allocation framework.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133674928","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The spectrum usage by a secondary user often happens in a certain geographical region and in a certain time interval, and the requests often come in an online fashion. Considering the selfish behaviors of primary users and secondary users, it is imperative to design online double spectrum auction methods. The most significant challenge is how to make the online double auction economic-robust (truthful in particular). Unfortunately, existing designs either do not consider the online requests or become untruthful when applied to scenarios when both primary users and secondary users could be selfish. In this paper, we address this problem by proposing TODA, a general framework for truthful online double auction for spectrum allocation. We assume that there is a central auctioneer, and the arrivals of secondary users' requests follow Poisson distribution. Upon receiving online spectrum requests, the central auctioneer will decide immediately which secondary and primary users will win the auction, and match winning primary users and secondary users, as well as decide how much secondary users should pay and primary users should get. To preempt existing spectrum usage is not allowed. We study the case in which the conflict graph of secondary users is a complete graph, which occurs in the urban area where the distribution of the secondary users is very dense. In this case, we design strategyproof (truthful) mechanisms for both the primary users and secondary users. To the best of our knowledge, we are the first to design truthful online double auction mechanisms for spectrum allocation. Our simulation results show that the expected social efficiency ratio of our mechanism is always above 80% compared with the off-line VCG mechanism and the spectrum utilization ratio is around 70% when the system is highly loaded.
{"title":"TODA: Truthful Online Double Auction for Spectrum Allocation in Wireless Networks","authors":"ShiGuang Wang, Ping Xu, Xiaohua Xu, Shaojie Tang, Xiangyang Li, Xin Liu","doi":"10.1109/DYSPAN.2010.5457905","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457905","url":null,"abstract":"The spectrum usage by a secondary user often happens in a certain geographical region and in a certain time interval, and the requests often come in an online fashion. Considering the selfish behaviors of primary users and secondary users, it is imperative to design online double spectrum auction methods. The most significant challenge is how to make the online double auction economic-robust (truthful in particular). Unfortunately, existing designs either do not consider the online requests or become untruthful when applied to scenarios when both primary users and secondary users could be selfish. In this paper, we address this problem by proposing TODA, a general framework for truthful online double auction for spectrum allocation. We assume that there is a central auctioneer, and the arrivals of secondary users' requests follow Poisson distribution. Upon receiving online spectrum requests, the central auctioneer will decide immediately which secondary and primary users will win the auction, and match winning primary users and secondary users, as well as decide how much secondary users should pay and primary users should get. To preempt existing spectrum usage is not allowed. We study the case in which the conflict graph of secondary users is a complete graph, which occurs in the urban area where the distribution of the secondary users is very dense. In this case, we design strategyproof (truthful) mechanisms for both the primary users and secondary users. To the best of our knowledge, we are the first to design truthful online double auction mechanisms for spectrum allocation. Our simulation results show that the expected social efficiency ratio of our mechanism is always above 80% compared with the off-line VCG mechanism and the spectrum utilization ratio is around 70% when the system is highly loaded.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133075821","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-04-06DOI: 10.1109/DYSPAN.2010.5457871
R. Bacchus, Tanim M. Taher, K. Zdunek, D. Roberson
Radios for public safety communication have some of the most stringent requirements for access, reliability and robustness. While wireless technology has seen tremendous strides in the past decade, large parts of the public safety infrastructure have unfortunately lagged behind. Today the majority of the Land Mobile Radios (LMR) used by police and fire departments, among others, utilize bandwidth inefficient analog FM radio systems, despite the limited available radio spectrum allocated for these applications. Additionally, numerous interoperability issues continue to exist between the various agencies, jurisdictions and disciplines; for example, radios from the state law enforcement authorities may not be able to communicate with Federal ones. This paper presents data from spectral measurements carried out over several public safety bands in the city of Chicago. Occupancy estimates over a period of several months are given and analyzed, and seasonal/event-driven variation and trends are discussed. The results demonstrate an imbalance in occupancy between public safety channels, which show high peak occupancy during normal day to day operations, and adjacent commercial LMR channels, which have much lower usage. This indicates potential opportunities for the application of dynamic spectrum access techniques to increase the capacity of public safety channels during emergencies. Furthermore, the spectrum utilization data may be useful for planning for the expansion or optimization of present-day systems.
{"title":"Spectrum Utilization Study in Support of Dynamic Spectrum Access for Public Safety","authors":"R. Bacchus, Tanim M. Taher, K. Zdunek, D. Roberson","doi":"10.1109/DYSPAN.2010.5457871","DOIUrl":"https://doi.org/10.1109/DYSPAN.2010.5457871","url":null,"abstract":"Radios for public safety communication have some of the most stringent requirements for access, reliability and robustness. While wireless technology has seen tremendous strides in the past decade, large parts of the public safety infrastructure have unfortunately lagged behind. Today the majority of the Land Mobile Radios (LMR) used by police and fire departments, among others, utilize bandwidth inefficient analog FM radio systems, despite the limited available radio spectrum allocated for these applications. Additionally, numerous interoperability issues continue to exist between the various agencies, jurisdictions and disciplines; for example, radios from the state law enforcement authorities may not be able to communicate with Federal ones. This paper presents data from spectral measurements carried out over several public safety bands in the city of Chicago. Occupancy estimates over a period of several months are given and analyzed, and seasonal/event-driven variation and trends are discussed. The results demonstrate an imbalance in occupancy between public safety channels, which show high peak occupancy during normal day to day operations, and adjacent commercial LMR channels, which have much lower usage. This indicates potential opportunities for the application of dynamic spectrum access techniques to increase the capacity of public safety channels during emergencies. Furthermore, the spectrum utilization data may be useful for planning for the expansion or optimization of present-day systems.","PeriodicalId":106204,"journal":{"name":"2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132282650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：