Pub Date : 2010-05-23DOI: 10.1109/ICCW.2010.5503933
A. Alonso, A. Paier, T. Zemen, N. Czink, F. Tufvesson
Reliability in Ricean multiple-input-multipleoutput (MIMO) channels is crucial for safety-related vehicle-tovehicle(V2V) applications. In Ricean channels, there is a signal-to-noise ratio-dependent critical data rate below which signaling with zero outage is possible. The link will be more reliable the higher this critical data rate is. We present results of spectral efficiency and outage probability from channel sounder measurements of V2V MIMO radio channels in the 5.2 GHz band. Our results show that MIMO channels with higher spatial correlation lead to lower ergodic capacity and a reduced critical data rate. However, for fixed output power the temporal evolution of the ergodic capacity and critical data rate shows that the channel with the strongest line of sight (LoS)component also has the highest capacity.
{"title":"Capacity Evaluation of Measured Vehicle-to-Vehicle Radio Channels at 5.2 GHz","authors":"A. Alonso, A. Paier, T. Zemen, N. Czink, F. Tufvesson","doi":"10.1109/ICCW.2010.5503933","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503933","url":null,"abstract":"Reliability in Ricean multiple-input-multipleoutput (MIMO) channels is crucial for safety-related vehicle-tovehicle(V2V) applications. In Ricean channels, there is a signal-to-noise ratio-dependent critical data rate below which signaling with zero outage is possible. The link will be more reliable the higher this critical data rate is. We present results of spectral efficiency and outage probability from channel sounder measurements of V2V MIMO radio channels in the 5.2 GHz band. Our results show that MIMO channels with higher spatial correlation lead to lower ergodic capacity and a reduced critical data rate. However, for fixed output power the temporal evolution of the ergodic capacity and critical data rate shows that the channel with the strongest line of sight (LoS)component also has the highest capacity.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130095766","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-05-23DOI: 10.1109/ICCW.2010.5503951
O. Kebkal, M. Komar, K. Kebkal
Physical properties of hydroacoustic communication channels differ essentially from those of conventional terrestrial radio channels, the former being characterized by the long propagation delays, limited bandwidth, extremely complex and quickly varying reverberation, and the half-duplex nature of underwater acoustic modems. This motivates a substantial redesign of the algorithms and techniques of the underwater data transfer concerning both physical and data link layers, especially concerning the development of underwater acoustic sensor networks. The recent studies of underwater acoustic sensor networks have caused the appearance of a variety of data link and network layers protocols intended to solve particular tasks for various types of networks. In this paper, we present a new media channel access protocol architecture combining two media access algorithms for the transfer of different data types, notably burst data and short instant messages, in order to provide the network layer with additional capabilities to solve problems in a wider range.
{"title":"D-MAC: Hybrid Media Access Control for Underwater Acoustic Sensor Networks","authors":"O. Kebkal, M. Komar, K. Kebkal","doi":"10.1109/ICCW.2010.5503951","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503951","url":null,"abstract":"Physical properties of hydroacoustic communication channels differ essentially from those of conventional terrestrial radio channels, the former being characterized by the long propagation delays, limited bandwidth, extremely complex and quickly varying reverberation, and the half-duplex nature of underwater acoustic modems. This motivates a substantial redesign of the algorithms and techniques of the underwater data transfer concerning both physical and data link layers, especially concerning the development of underwater acoustic sensor networks. The recent studies of underwater acoustic sensor networks have caused the appearance of a variety of data link and network layers protocols intended to solve particular tasks for various types of networks. In this paper, we present a new media channel access protocol architecture combining two media access algorithms for the transfer of different data types, notably burst data and short instant messages, in order to provide the network layer with additional capabilities to solve problems in a wider range.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131287474","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-05-23DOI: 10.1109/ICCW.2010.5503927
Eleni Stai, V. Karyotis, S. Papavassiliou
Several graph structures have emerged for describing different network types and the interactions among their entities. Various properties have been identified in each of these network graphs, with no single structure bearing all the desired features that would constitute it an optimal network graph. This work aims for the first time at infusing the desired properties of a small-world network into the core structure of a wireless multi-hop network, thus embedding social structure on an artificial network that emerges in the development of wireless communication services. In this paper, topology control based approaches are proposed, serving the purpose of adding communication links in a multi-hop network in an intelligent and effective manner. Through analysis and simulation, we demonstrate how the proposed methods decrease the average path length between randomly selected node pairs and properly scale the clustering coefficient of a multi-hop network, by exploiting social structure characteristics of small-world networks, thus allowing the development of more demanding services on top of wireless multi- hop networks.
{"title":"Socially-Inspired Topology Improvements in Wireless Multi-Hop Networks","authors":"Eleni Stai, V. Karyotis, S. Papavassiliou","doi":"10.1109/ICCW.2010.5503927","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503927","url":null,"abstract":"Several graph structures have emerged for describing different network types and the interactions among their entities. Various properties have been identified in each of these network graphs, with no single structure bearing all the desired features that would constitute it an optimal network graph. This work aims for the first time at infusing the desired properties of a small-world network into the core structure of a wireless multi-hop network, thus embedding social structure on an artificial network that emerges in the development of wireless communication services. In this paper, topology control based approaches are proposed, serving the purpose of adding communication links in a multi-hop network in an intelligent and effective manner. Through analysis and simulation, we demonstrate how the proposed methods decrease the average path length between randomly selected node pairs and properly scale the clustering coefficient of a multi-hop network, by exploiting social structure characteristics of small-world networks, thus allowing the development of more demanding services on top of wireless multi- hop networks.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116845274","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-05-23DOI: 10.1109/ICCW.2010.5503902
Yan Sun, Haiqin Liu, Min Sik Kim
Routing is critical in wireless sensor networks (WSNs). It has been widely studied in recent years and many new protocols have been proposed. In this paper, based on observations on event-driven wireless sensor networks, we propose algorithms to reduce power consumption and improve data quality in wireless sensor networks. In our algorithms, sensor nodes reduce the sampling frequency and number of hops when there is no event, and the positive feed-back scheme wakes up sensor nodes quickly to capture an event. Our algorithms add information in packets and use negative-ACK packets instead of ACK packets to reduce bandwidth consumption.
{"title":"Energy-Efficient Routing Protocol in Event-Driven Wireless Sensor Networks","authors":"Yan Sun, Haiqin Liu, Min Sik Kim","doi":"10.1109/ICCW.2010.5503902","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503902","url":null,"abstract":"Routing is critical in wireless sensor networks (WSNs). It has been widely studied in recent years and many new protocols have been proposed. In this paper, based on observations on event-driven wireless sensor networks, we propose algorithms to reduce power consumption and improve data quality in wireless sensor networks. In our algorithms, sensor nodes reduce the sampling frequency and number of hops when there is no event, and the positive feed-back scheme wakes up sensor nodes quickly to capture an event. Our algorithms add information in packets and use negative-ACK packets instead of ACK packets to reduce bandwidth consumption.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115612051","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-05-23DOI: 10.1109/ICCW.2010.5503930
Abdelhamid Salahbrahim, B. Le Grand, Matthieu Latapy
This paper explores new approaches and methods to characterize post and citation dynamics in different blog communities. In particular, evolution of post popularity over time is studied, as well as information spreading cascades. This methodology goes beyond traditional approaches by defining classes of dynamic behaviors based on topological features of the post network, and by investigating the impact of topical communities on post popularity dynamics and on information spreading cascades. This methodology has been applied to a corpus of active French blogs monitored during 4 months.
{"title":"Some Insight on Dynamics of Posts and Citations in Different Blog Communities","authors":"Abdelhamid Salahbrahim, B. Le Grand, Matthieu Latapy","doi":"10.1109/ICCW.2010.5503930","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503930","url":null,"abstract":"This paper explores new approaches and methods to characterize post and citation dynamics in different blog communities. In particular, evolution of post popularity over time is studied, as well as information spreading cascades. This methodology goes beyond traditional approaches by defining classes of dynamic behaviors based on topological features of the post network, and by investigating the impact of topical communities on post popularity dynamics and on information spreading cascades. This methodology has been applied to a corpus of active French blogs monitored during 4 months.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125402032","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-05-23DOI: 10.1109/ICCW.2010.5503955
L. Militano, F. Fitzek, A. Iera, A. Molinaro
Reference scenarios of the present research are clusters of cooperating wireless nodes, implementing random linear network coding to enhance the throughput performance of file downloading and information spreading services. In particular, a sub-set of cluster nodes will access, through their cellular link, parts of a file to be exchanged among all cluster members. The paper focus is on the "source election" issue. The novelty of the research lies in the main problem constraints, which make it far different from (and more exacting than) traditional cluster head election problems: the source number can cover the whole range of nodes and all the nodes must be considered data destinations. We propose a source election algorithm, only based on the knowledge of the number of nodes, which is fast in converging to either the optimal or, alternatively, a satisfactory sub-optimal solution. In so doing, we exploit a performing genetic algorithm. Its observed behaviour makes us confident that the followed approach can be the winning one in conditions of null/limited awareness of node position and type of relevant available cellular links.
{"title":"A Genetic Algorithm for Source Election in Cooperative Clusters Implementing Network Coding","authors":"L. Militano, F. Fitzek, A. Iera, A. Molinaro","doi":"10.1109/ICCW.2010.5503955","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503955","url":null,"abstract":"Reference scenarios of the present research are clusters of cooperating wireless nodes, implementing random linear network coding to enhance the throughput performance of file downloading and information spreading services. In particular, a sub-set of cluster nodes will access, through their cellular link, parts of a file to be exchanged among all cluster members. The paper focus is on the \"source election\" issue. The novelty of the research lies in the main problem constraints, which make it far different from (and more exacting than) traditional cluster head election problems: the source number can cover the whole range of nodes and all the nodes must be considered data destinations. We propose a source election algorithm, only based on the knowledge of the number of nodes, which is fast in converging to either the optimal or, alternatively, a satisfactory sub-optimal solution. In so doing, we exploit a performing genetic algorithm. Its observed behaviour makes us confident that the followed approach can be the winning one in conditions of null/limited awareness of node position and type of relevant available cellular links.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126974237","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-05-23DOI: 10.1109/ICCW.2010.5503945
Chi-Sheng Lin, Bo-Chuan Chen, Jia-Chin Lin
Ever since the emergence of Intelligent Transportation System (ITS), there has been a rapid integration of communications and automotive electronics industry, promoting developments and trends for the new generation of telematics. Apart from the development and standardization of telematics, its field test is however attracting less attention while being a most important aspect of the issue. The purposes of this research are to set up software/field tests and propose possible improvements for IEEE 802.11p standard. Then, obtaining information from software simulation to establish a controllable field for ground tests, and analyzing the indicative parameters of packet loss and latency of Dedicated Short Range Communication (DSRC) telematics system under mobile conditions, to complete a systematic testing procedure, statistics analysis as well as a transceiver design that will improve the transmission performance.
自智能交通系统(ITS)出现以来，通信和汽车电子产业迅速融合，推动了新一代远程信息处理的发展和趋势。除了远程信息处理技术的发展和标准化之外，其现场测试是其中最重要的一个方面，但却很少受到关注。本研究的目的是建立软件/现场测试，并对IEEE 802.11p标准提出可能的改进。然后，通过软件仿真获取信息，建立可控的地面测试场，分析移动条件下DSRC (Dedicated Short Range Communication)远程信息处理系统的丢包和时延指示参数，完成系统的测试流程、统计分析以及提高传输性能的收发器设计。
{"title":"Field Test and Performance Improvement in IEEE 802.11p V2R/R2V Environments","authors":"Chi-Sheng Lin, Bo-Chuan Chen, Jia-Chin Lin","doi":"10.1109/ICCW.2010.5503945","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503945","url":null,"abstract":"Ever since the emergence of Intelligent Transportation System (ITS), there has been a rapid integration of communications and automotive electronics industry, promoting developments and trends for the new generation of telematics. Apart from the development and standardization of telematics, its field test is however attracting less attention while being a most important aspect of the issue. The purposes of this research are to set up software/field tests and propose possible improvements for IEEE 802.11p standard. Then, obtaining information from software simulation to establish a controllable field for ground tests, and analyzing the indicative parameters of packet loss and latency of Dedicated Short Range Communication (DSRC) telematics system under mobile conditions, to complete a systematic testing procedure, statistics analysis as well as a transceiver design that will improve the transmission performance.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116486320","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-05-23DOI: 10.1109/ICCW.2010.5503880
S. Kadhe, M. Chandra, B. Janakiram
Cognitive radio is an emerging technology that allows secondary communication in a frequency band originally allocated to one or more primary users (PUs). Secondary user (SU) usually operates in a low power profile to avoid interference with the PU and sudden appearance of a PU causes loss of data of the SU. Appropriate erasure correction coding (also called as anti-jamming coding) is, thus, required to maintain the reliability of the link. In this paper, we propose the random linear coding (RLC), which is commonly used in network coding, to be used as an anti-jamming scheme. We also propose a variant of RLC anti-jamming scheme that requires reduced complexity decoding. The throughput of both the proposed schemes is analyzed and it is shown that high throughput can be obtained at the expense of very small redundancy by carefully selecting the Galois field size.
{"title":"Random Linear Coding Based Anti-Jamming Coding Techniques for Cognitive Radio Systems","authors":"S. Kadhe, M. Chandra, B. Janakiram","doi":"10.1109/ICCW.2010.5503880","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503880","url":null,"abstract":"Cognitive radio is an emerging technology that allows secondary communication in a frequency band originally allocated to one or more primary users (PUs). Secondary user (SU) usually operates in a low power profile to avoid interference with the PU and sudden appearance of a PU causes loss of data of the SU. Appropriate erasure correction coding (also called as anti-jamming coding) is, thus, required to maintain the reliability of the link. In this paper, we propose the random linear coding (RLC), which is commonly used in network coding, to be used as an anti-jamming scheme. We also propose a variant of RLC anti-jamming scheme that requires reduced complexity decoding. The throughput of both the proposed schemes is analyzed and it is shown that high throughput can be obtained at the expense of very small redundancy by carefully selecting the Galois field size.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116577162","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-05-23DOI: 10.1109/ICCW.2010.5503877
Jen-Ming Wu, Tsan-Fei Yang, Hsin-Jui Chou
In this paper, we present a novel scheme that aligns the interference from the antennas of the cognitive user (CU) such that the interference to the primary user (PU) is nullified or minimized. The two-user multiple-input multiple-output (MIMO) interference channel is considered. We assume that the transmission bandwidth of the CU is wider than that of the PU, and the spectrum of the PU is called victim band. Because of the unequal transmission bandwidth, the sampling rates of the two users are not necessarily equal. Two sources of interferences are considered in the alignment. One source is the spatial interference from different antennas of the CU. The other source is the intercarrier interference (ICI) from the un-victim band of CU to the victim band of PU. An active antenna of the cognitive user is used to align with the spatial interference from the other antennas of the cognitive user and ICI such that the interference to the PU is nullified. The simulation shows that the scheme creates a greater than -200dB notch on the transmission spectrum of the victim band. This scheme allows the CU to utilize the victim band simultaneously with the PU and leads to underlay cognitive radio transmission. We also present a successive interference cancellation scheme at the cognitive receiver to detect the signal within the victim band. The error performance at the cognitive receiver of this underlay cognitive radio system is presented as well.
{"title":"MIMO Active Interference Alignment for Underlay Cognitive Radio","authors":"Jen-Ming Wu, Tsan-Fei Yang, Hsin-Jui Chou","doi":"10.1109/ICCW.2010.5503877","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503877","url":null,"abstract":"In this paper, we present a novel scheme that aligns the interference from the antennas of the cognitive user (CU) such that the interference to the primary user (PU) is nullified or minimized. The two-user multiple-input multiple-output (MIMO) interference channel is considered. We assume that the transmission bandwidth of the CU is wider than that of the PU, and the spectrum of the PU is called victim band. Because of the unequal transmission bandwidth, the sampling rates of the two users are not necessarily equal. Two sources of interferences are considered in the alignment. One source is the spatial interference from different antennas of the CU. The other source is the intercarrier interference (ICI) from the un-victim band of CU to the victim band of PU. An active antenna of the cognitive user is used to align with the spatial interference from the other antennas of the cognitive user and ICI such that the interference to the PU is nullified. The simulation shows that the scheme creates a greater than -200dB notch on the transmission spectrum of the victim band. This scheme allows the CU to utilize the victim band simultaneously with the PU and leads to underlay cognitive radio transmission. We also present a successive interference cancellation scheme at the cognitive receiver to detect the signal within the victim band. The error performance at the cognitive receiver of this underlay cognitive radio system is presented as well.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133590178","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-05-23DOI: 10.1109/ICCW.2010.5503875
G. El-Howayek, S. Jayaweera, K. Hakim, Gonzalo Vazquez-Vilar, Carlos Mosquera
Dynamic Spectrum Leasing (DSL) was recently proposed in [1]-[4] as a new way to achieve dynamic spectrum sharing (DSS). Unlike previously considered dynamic spectrum access (DSA) proposals, DSL allows for the spectrum owner, called the primary user, to dynamically adjust the amount of interference it is willing to tolerate from secondary users. In response, the secondary users update their transmit powers to maximize a suitably chosen reward function. In previous work, it has been shown that the best response adaptations will converge to a unique Nash equilibrium under the assumptions of a quasi-static channel conditions and for a fixed number of secondary users. In this paper, we investigate the convergence and equilibrium performance of the proposed DSL-game in the presence of slow time-varying fading and time-varying secondary system size. Our results show that while the DSL best response adaptation algorithm is reasonably robust against these dynamics, there is a trade-off between performance and the CSI update rate.
{"title":"Dynamic Spectrum Leasing (DSL) in Dynamic Channels","authors":"G. El-Howayek, S. Jayaweera, K. Hakim, Gonzalo Vazquez-Vilar, Carlos Mosquera","doi":"10.1109/ICCW.2010.5503875","DOIUrl":"https://doi.org/10.1109/ICCW.2010.5503875","url":null,"abstract":"Dynamic Spectrum Leasing (DSL) was recently proposed in [1]-[4] as a new way to achieve dynamic spectrum sharing (DSS). Unlike previously considered dynamic spectrum access (DSA) proposals, DSL allows for the spectrum owner, called the primary user, to dynamically adjust the amount of interference it is willing to tolerate from secondary users. In response, the secondary users update their transmit powers to maximize a suitably chosen reward function. In previous work, it has been shown that the best response adaptations will converge to a unique Nash equilibrium under the assumptions of a quasi-static channel conditions and for a fixed number of secondary users. In this paper, we investigate the convergence and equilibrium performance of the proposed DSL-game in the presence of slow time-varying fading and time-varying secondary system size. Our results show that while the DSL best response adaptation algorithm is reasonably robust against these dynamics, there is a trade-off between performance and the CSI update rate.","PeriodicalId":422951,"journal":{"name":"2010 IEEE International Conference on Communications Workshops","volume":"126 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114011732","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
扫码关注我们
求助内容：
应助结果提醒方式：