{"title":"Denial-of-Service Attacks on Dynamic Spectrum Access Networks","authors":"G. Jakimoski, K. P. Subbalakshmi","doi":"10.1109/ICCW.2008.105","DOIUrl":"https://doi.org/10.1109/ICCW.2008.105","url":null,"abstract":"Cognitive radio technologies have emerged as a platform to solve the problem of spectrum scarcity for wireless applications since cognitive radios have the potential to utilize the idle licensed spectrum bands in an intelligent way without interfering with other licensed devices. However, most of the proposed protocols for opportunistic usage of the licensed spectrum bands assume that the participants involved in the protocols are honest and that there are no malicious adversaries that will attack the network. Using two examples, we demonstrate that in the presence of a malicious adversary the systems designed making these assumptions will fail to fulfill their goals of minimal disruption of the primary users and efficient utilization of the unused spectrum. We also briefly discuss some security design goals of the future cognitive DSA networks.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133484842","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}
{"title":"Adaptive Multiple Time-Scale Power Allocation for Spectrum Sharing in DS-CDMA Networks","authors":"M. Khoshkholgh, K. Navaie, H. Yanikomeroglu","doi":"10.1109/ICCW.2008.94","DOIUrl":"https://doi.org/10.1109/ICCW.2008.94","url":null,"abstract":"In this paper, we propose adaptive multiple time- scale power allocation (AMTPA) method for opportunistic spectrum access (OSA) in the uplink of DS-CDMA networks. In AMTPA, the secondary service is facilitated by granting passive access to the power control commands transmitted by the primary network's base-station. AMTPA manages the secondary service transmission power in two phases, each in different time-scales. In the longer time-scale, Power Allocation Phase adaptively allocates the secondary service transmit power based on the medium-scale variations of the secondary channel, so that the achieved capacity is maximized. Then in the shorter time-scale, power adjustment phase exploits the power control commands transmitted in the primary network to adaptively adjust secondary service transmission power to reduce the effect of the secondary service transmission on the quality-of-service of the primary network. Simulation results show that maintaining a given collision probability constraint, AMTPA makes a significant improvement on the achieved capacity.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132176482","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}
{"title":"Single and Multiple Relay Selection Schemes and their Diversity Orders","authors":"Y. Jing, H. Jafarkhani","doi":"10.1109/ICCW.2008.72","DOIUrl":"https://doi.org/10.1109/ICCW.2008.72","url":null,"abstract":"This paper is on relay selection (RS) schemes for wireless relay networks. First, we derive the diversity of many single RS schemes in the literature. Then, we generalize the idea of RS by allowing more than one relay to cooperate. Several multiple RS schemes are proposed, which are proved to achieve full diversity. Simulation results show that they perform much better than the corresponding single RS methods and very close to the optimal multiple RS scheme. However, the computational complexity of the suboptimal schemes are linear in the number of relays, far superior to the optimal selection, which has exponential complexity. In addition, when the number of relays is large, the multiple RS schemes require the same amount of feedback bits from the receiver as single RS schemes.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127667378","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}
N. Wattanamongkhol, W. Srichavengsup, P. Vara-urairat, S. Siwamogsatham, L. Wuttisiittikulkij
{"title":"Analysis of a Multiple-Token Contention Scheme for Broadband Wireless Access Networks","authors":"N. Wattanamongkhol, W. Srichavengsup, P. Vara-urairat, S. Siwamogsatham, L. Wuttisiittikulkij","doi":"10.1109/ICCW.2008.18","DOIUrl":"https://doi.org/10.1109/ICCW.2008.18","url":null,"abstract":"In this paper, we present a mathematical analysis to evaluate the contention phase of a wireless system in which each contending station transmits multiple copies of the bandwidth reservation/request packet to increase the probability of successful transmissions using multiple slots randomly selected from the pool of available slots at the given moment. Here, we define this type of systems as a multi-token reservation scheme with uniform random backoff (MT-UNI). The proposed MT-UNI mechanism can be used in various broadband wireless access systems including IEEE 802.16, PRMA, C-TDMA and others. The simulation results show that the proposed performance formulae are very accurate, and the MT-UNI mechanism can improve the performance of the system at low load conditions. In addition, when each station uses 2 reservation tokens, the MT- UNI scheme seems to produce the near-optimal performance.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127821471","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}
{"title":"Swarm Intelligence Based Dynamic Control Channel Assignment in Cogmesh","authors":"Tao Chen, Honggang Zhang, M. Katz, Zheng Zhou","doi":"10.1109/ICCW.2008.28","DOIUrl":"https://doi.org/10.1109/ICCW.2008.28","url":null,"abstract":"In this paper we address the control channel assignment problem in a cognitive radio based wireless network, namely the CogMesh. Such a network is featured by the dynamic spectrum sharing of the secondary users coexisting with the primary users. The opportunistic nature of the spectrum utilization among the secondary users makes a global control channel infeasible. The self-coordination of the network, hence, becomes a challenge task. Considering the fact that common channels may temporarily exist among a local group of secondary users, we propose an adaptive approach that selects local common control channels independently by each secondary user according to the qualities of the detected spectrum holes and the choices of its neighbors. To achieve this, a swarm intelligence-based algorithm is used to facilitate the common control channel selection. The idea is to use HELLO messages periodically broadcasted by neighbors as the pheromone to rank the common channels so as to expedite the channel selection process. The algorithm is completely distributed and therefore scalable. Moreover, it is simple, flexible, adaptive, and well balanced on the exploitation and exploration of the radio resources. The behaviors and performance of the proposed algorithm are verified by simulation.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128992810","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}
{"title":"Use of Dedicated Broadband Sensing Receiver in Cognitive Radio","authors":"H. Zamat, B. Natarajan","doi":"10.1109/ICCW.2008.102","DOIUrl":"https://doi.org/10.1109/ICCW.2008.102","url":null,"abstract":"This paper proposes an architecture for a dedicated receiver that addresses real time and broadband operation challenges of broadband sensing receivers in cognitive radios. Fast response and accurate sensing is aided by the combination of power sensing at RF, baseband and in the digital domain. The proposed architecture provides the ability to perform adaptive coarse and fine sensing at different points in the receive chain. The impact of the proposed scheme is demonstrated using a realistic simulation set up.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115864124","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}
M. Amirijoo, P. Frenger, F. Gunnarsson, Harald Kallin, Johan Moe, K. Zetterberg
{"title":"Neighbor Cell Relation List and Physical Cell Identity Self-Organization in LTE","authors":"M. Amirijoo, P. Frenger, F. Gunnarsson, Harald Kallin, Johan Moe, K. Zetterberg","doi":"10.1109/ICCW.2008.12","DOIUrl":"https://doi.org/10.1109/ICCW.2008.12","url":null,"abstract":"Automation of radio network management is a key determinant to work reduction for wireless operators. By replacing time consuming and costly tasks with automatic mechanisms, operational expenditure can be reduced. In this paper we present a method for automatic configuration of locally-unique physical cell identities and neighbor cell relation lists in 3G long term evolution (LTE). This method makes use of mobile measurements to update the neighbor cell relation lists in the cells and to detect local cell identity conflicts, report the conflicts to the operation support systems (OSS) and resolve them. The performance of the approach is determined using simulations of realistically deployed macro networks. Conducted simulations illustrate the ability of the method to resolve local cell identity conflicts. In particular, the method is capable of both accommodating new cells and handling a worst case scenario where all cells are initiated with the same local cell identities and where neighbor cell relation lists are empty.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124429117","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}
{"title":"P-HIP: Paging Extensions for Host Identity Protocol","authors":"Shuigen Yang, Yajuan Qin, Hongbin Luo, Hongke Zhang","doi":"10.1109/ICCW.2008.86","DOIUrl":"https://doi.org/10.1109/ICCW.2008.86","url":null,"abstract":"In wireless networks, paging is widely used to reduce the signaling cost of the location management and save power consumption. Currently, Host Identity Protocol (HIP) does not support paging. In this paper, we propose P-HIP, paging extensions for HIP, and discuss the paging architecture, protocol, algorithm, and location management scheme. In addition, we develop an analytical model encompassing the arbitrary subnet technology and the mobile network movement history to study the performance of HIP with and without paging extensions. The performance results show that P-HIP outperforms HIP under various scenarios in terms of reducing the total signaling cost.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125283587","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}
{"title":"Radio Resource Management for Broadcast Services in OFDMA-Based Networks","authors":"Patrick Hosein, T. Gopal","doi":"10.1109/ICCW.2008.57","DOIUrl":"https://doi.org/10.1109/ICCW.2008.57","url":null,"abstract":"The next generation of wireless networks (LTE, WiMAX and UMB) will have sufficient capacity to support video broadcasts in addition to unicast services such as voice and data. Since broadcast services are resource intensive, radio resources must be carefully managed to ensure proper operation of the unicast services. One approach is to allocate a fixed set of resources (a zone) specifically for broadcast services. Therefore traffic shaping must be used to ensure that sufficient resources are available for all broadcast streams. In this paper we discuss one approach to this traffic shaping issue. We also address the issue of scheduling the broadcast streams over the zone allocated for broadcast services. This scheduler is designed for low terminal power utilization, low channel switching delay and high broadcast channel utilization. Simulations with video traces are used to illustrate the performance of the proposed scheduler.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131927476","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}
{"title":"MIMO Amplify-And-Forward Relaying: Spatial Gain and Filter Matrix Design","authors":"Miao Qingyu, A. Osseiran, Gan Jiansong","doi":"10.1109/ICCW.2008.10","DOIUrl":"https://doi.org/10.1109/ICCW.2008.10","url":null,"abstract":"In this paper we investigate and analyze the performance of multi-antenna amplify-and-forward (AF) relays for a future cellular system where the destination and the source form a MIMO system. Two scenarios are analyzed, modelled and compared: the multi-relay scenario i.e. distributed relays, each equipped with at least one antenna; and the one-relay scenario i.e. a single relay in a sector where each relay is equipped with multiple antennas. The optimal filter coefficients applied at the relays are derived and recommended for both cases. The channel ergodic capacity and by product the throughput of the single link shows that the AF relay matched filter based performs best in the multi-relay scenario. On other hand the relay based singular value decomposition (SVD) is more suitable for the one-relay scenario.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124742532","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}