Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208106
A. Bastug, A. Ancora, D. Slock
Although a simple solution, pilot-symbols-trained LMS algorithm is not capable of tracking fast varying channels in UMTS FDD downlink due to insufficient adaptation rate. Pilot-chips-trained LMS adaptation is on the other hand much more prone to noise. These two phenomena manifest themselves in the two components of the adaptation excess mean square (EMSE). A compromise can be found by considering HSDPA symbol-level Griffiths or decision-directed equalization. These two methods enable adapting 16 times more frequently than the pilot-symbols-aided adaptation. They are also attractive for implementation since a modular approach can be adopted by exploiting either one or more of the available HSDPA code domains depending on the instantaneous channel quality and the performance requirements.
{"title":"Adaptive Equalization at HSDPA Symbol Level","authors":"A. Bastug, A. Ancora, D. Slock","doi":"10.1109/ICCW.2009.5208106","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208106","url":null,"abstract":"Although a simple solution, pilot-symbols-trained LMS algorithm is not capable of tracking fast varying channels in UMTS FDD downlink due to insufficient adaptation rate. Pilot-chips-trained LMS adaptation is on the other hand much more prone to noise. These two phenomena manifest themselves in the two components of the adaptation excess mean square (EMSE). A compromise can be found by considering HSDPA symbol-level Griffiths or decision-directed equalization. These two methods enable adapting 16 times more frequently than the pilot-symbols-aided adaptation. They are also attractive for implementation since a modular approach can be adopted by exploiting either one or more of the available HSDPA code domains depending on the instantaneous channel quality and the performance requirements.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124265021","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5207991
Bruce Denby, Y. Oussar, Iness Ahriz, G. Dreyfus
GSM trace mobile measurements are used to study indoor handset localization in an urban apartment setting. Nearest-neighbor, Support Vector Machine (SVM), and Gaussian Process classifiers are compared. A linear SVM is found to provide mean room-level classification efficiency near 100%, but only when the full set of GSM carriers is used. To our knowledge, this is the first study to use fingerprints containing all GSM carriers, and the first to suggest that GSM could be useful for very high-performance indoor localization.
{"title":"High-Performance Indoor Localization with Full-Band GSM Fingerprints","authors":"Bruce Denby, Y. Oussar, Iness Ahriz, G. Dreyfus","doi":"10.1109/ICCW.2009.5207991","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207991","url":null,"abstract":"GSM trace mobile measurements are used to study indoor handset localization in an urban apartment setting. Nearest-neighbor, Support Vector Machine (SVM), and Gaussian Process classifiers are compared. A linear SVM is found to provide mean room-level classification efficiency near 100%, but only when the full set of GSM carriers is used. To our knowledge, this is the first study to use fingerprints containing all GSM carriers, and the first to suggest that GSM could be useful for very high-performance indoor localization.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114318328","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208026
L. Falconetti, C. Hoymann, R. Gupta
Nowadays cellular systems operate with frequency reuse one, where adjacent cells use the same frequency band. Use equipments (UEs) located at cell edge are mostly affected by the resulting co-channel interference. In addition, cell edge UEs suffer from their weak carrier signal strength. This paper proposes a new method to increase the performance of cell edge UEs by means of information exchange between base stations (BSs). A BS serving a cell edge UE requests support from a co-channel BS. The supporting BS transfers demodulated or decoded bits received from the cell edge UE back to the serving BS. The serving BS then combines the information. The concept of cooperative BSs described in this paper is based on a request-response mechanism and does not require a central control node. Performance evaluation by means of simulation shows the capability of BS cooperation applied to 3GPP long-term evolution (LTE) in terms of user throughput and emphasizes the trade-off in terms of increased backhaul requirement due to BS-BS communication.
{"title":"Distributed Uplink Macro Diversity for Cooperating Base Stations","authors":"L. Falconetti, C. Hoymann, R. Gupta","doi":"10.1109/ICCW.2009.5208026","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208026","url":null,"abstract":"Nowadays cellular systems operate with frequency reuse one, where adjacent cells use the same frequency band. Use equipments (UEs) located at cell edge are mostly affected by the resulting co-channel interference. In addition, cell edge UEs suffer from their weak carrier signal strength. This paper proposes a new method to increase the performance of cell edge UEs by means of information exchange between base stations (BSs). A BS serving a cell edge UE requests support from a co-channel BS. The supporting BS transfers demodulated or decoded bits received from the cell edge UE back to the serving BS. The serving BS then combines the information. The concept of cooperative BSs described in this paper is based on a request-response mechanism and does not require a central control node. Performance evaluation by means of simulation shows the capability of BS cooperation applied to 3GPP long-term evolution (LTE) in terms of user throughput and emphasizes the trade-off in terms of increased backhaul requirement due to BS-BS communication.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122090867","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208055
P. Wang, X. Zhong, L. Xiao, S. Zhou, J. Wang
In OFDM-based cognitive radio systems, the interference power limits of the primary users (PUs) introduce subchannel transmit power constraints for the secondary user (SU). The power allocation among the subcarriers of SU should be subject to both the sum transmit power constraint as well as the transmit power constraint of each subchannel. Different from previous works, we deal with a more general case where the subcarrier sidelobes are specially considered. A general power allocation algorithm is proposed to obtain the optimal solution that maximizes the capacity while satisfying both the sum and subchannel transmit power constraints.
{"title":"A General Power Allocation Algorithm for OFDM-Based Cognitive Radio Systems","authors":"P. Wang, X. Zhong, L. Xiao, S. Zhou, J. Wang","doi":"10.1109/ICCW.2009.5208055","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208055","url":null,"abstract":"In OFDM-based cognitive radio systems, the interference power limits of the primary users (PUs) introduce subchannel transmit power constraints for the secondary user (SU). The power allocation among the subcarriers of SU should be subject to both the sum transmit power constraint as well as the transmit power constraint of each subchannel. Different from previous works, we deal with a more general case where the subcarrier sidelobes are specially considered. A general power allocation algorithm is proposed to obtain the optimal solution that maximizes the capacity while satisfying both the sum and subchannel transmit power constraints.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122171639","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208119
E. Glatz, U. Fiedler
Self-organizing multi-radio mesh networks can be used to establish metropolitan ad hoc telephony networks in disaster recovery situations and public safety settings such as after a flood or a terrorist attack. These networks can be employed to enable forces to extend the remaining circuit- switched communication infrastructure. This paper introduces a system architecture, a self-organized topology construction and channel allocation algorithm and its implementation in a distributed protocol. The architecture relies on commercially available IEEE 802.16-2004 (WiMAX) equipment that can be employed to build routers and gateways to a wired network. The topology construction and maintenance are based on a modified Dijkstra shortest path algorithm that maximizes a combined metric of path qualities and gateway load. Path qualities are derived from link qualities determined by SINR measurements. The channel allocation greedily allocates the locally least-interfered channel. The protocol includes four sub- protocols: a join protocol, a hello protocol, a leave protocol, and a conflict resolution protocol to resolve inconsistencies in topology data across the network. The proposed architecture, algorithms, and protocol have been assessed via extensive simulations and implemented on hardware. Both, simulation results and field tests confirm their applicability/usability.
{"title":"Telephony over Metropolitan Area Ad Hoc Networks: From Concept to Field Test","authors":"E. Glatz, U. Fiedler","doi":"10.1109/ICCW.2009.5208119","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208119","url":null,"abstract":"Self-organizing multi-radio mesh networks can be used to establish metropolitan ad hoc telephony networks in disaster recovery situations and public safety settings such as after a flood or a terrorist attack. These networks can be employed to enable forces to extend the remaining circuit- switched communication infrastructure. This paper introduces a system architecture, a self-organized topology construction and channel allocation algorithm and its implementation in a distributed protocol. The architecture relies on commercially available IEEE 802.16-2004 (WiMAX) equipment that can be employed to build routers and gateways to a wired network. The topology construction and maintenance are based on a modified Dijkstra shortest path algorithm that maximizes a combined metric of path qualities and gateway load. Path qualities are derived from link qualities determined by SINR measurements. The channel allocation greedily allocates the locally least-interfered channel. The protocol includes four sub- protocols: a join protocol, a hello protocol, a leave protocol, and a conflict resolution protocol to resolve inconsistencies in topology data across the network. The proposed architecture, algorithms, and protocol have been assessed via extensive simulations and implemented on hardware. Both, simulation results and field tests confirm their applicability/usability.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129478463","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208056
Y. Wu, H. Wang, P. Zhang
To improve the utilization of licensed spectrums, the IEEE 802.22 standard is designed to reuse the bandwidths allocated for TV and Wireless Microphones opportunistically for data communication. To avoid interference from equipments of 802.22 networks, beacon devices are designed to protect the Wireless Microphones. They generate beacons so that the devices in 802.22 networks can detect their existence. In this paper, we explore the details of beacon design in the IEEE 802.22 Task Group 1. As an active member of the group, we have made contributions on FEC design of the beacon. We also provide some simulation results of the designed beacon.
{"title":"Protection of Wireless Microphones in IEEE 802.22 Cognitive Radio Network","authors":"Y. Wu, H. Wang, P. Zhang","doi":"10.1109/ICCW.2009.5208056","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208056","url":null,"abstract":"To improve the utilization of licensed spectrums, the IEEE 802.22 standard is designed to reuse the bandwidths allocated for TV and Wireless Microphones opportunistically for data communication. To avoid interference from equipments of 802.22 networks, beacon devices are designed to protect the Wireless Microphones. They generate beacons so that the devices in 802.22 networks can detect their existence. In this paper, we explore the details of beacon design in the IEEE 802.22 Task Group 1. As an active member of the group, we have made contributions on FEC design of the beacon. We also provide some simulation results of the designed beacon.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127276412","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208057
M. Taki, F. Lahouti
In this paper, we consider a primary and a cognitive user transmitting over a wireless fading interference channel. The primary user transmits with a constant power and utilizes an adaptive modulation and coding (AMC) scheme satisfying a bit error rate requirement. We propose a link adaptation scheme to maximize the average spectral efficiency of the cognitive radio, while a minimum required spectral efficiency for the primary user is provisioned. The resulting problem is constrained to also satisfy a bit error rate requirement and a power constraint for the cognitive link. The AMC mode selection and power control at the cognitive transmitter is optimized based on the scaled signal to noise plus interference ratio feedback of both links. The problem is then cast as a nonlinear discrete optimization problem for which a fast and efficient suboptimum solution is presented. We also present a scheme with rate adaption and a constant power. An important characteristic of the proposed schemes is that no negotiation between the users is required. Comparisons with underlay and interweave approaches to cognitive radio with adaptive transmission demonstrate the efficiency of the proposed solutions.
{"title":"Spectral Efficiency Optimized Adaptive Transmission for Interfering Cognitive Radios","authors":"M. Taki, F. Lahouti","doi":"10.1109/ICCW.2009.5208057","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208057","url":null,"abstract":"In this paper, we consider a primary and a cognitive user transmitting over a wireless fading interference channel. The primary user transmits with a constant power and utilizes an adaptive modulation and coding (AMC) scheme satisfying a bit error rate requirement. We propose a link adaptation scheme to maximize the average spectral efficiency of the cognitive radio, while a minimum required spectral efficiency for the primary user is provisioned. The resulting problem is constrained to also satisfy a bit error rate requirement and a power constraint for the cognitive link. The AMC mode selection and power control at the cognitive transmitter is optimized based on the scaled signal to noise plus interference ratio feedback of both links. The problem is then cast as a nonlinear discrete optimization problem for which a fast and efficient suboptimum solution is presented. We also present a scheme with rate adaption and a constant power. An important characteristic of the proposed schemes is that no negotiation between the users is required. Comparisons with underlay and interweave approaches to cognitive radio with adaptive transmission demonstrate the efficiency of the proposed solutions.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130063027","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208063
K. Shafiee, Victor C. M. Leung
In this paper, we introduce an advanced vehicular networking architecture combining infrastructure and ad-hoc communications, which differentiates the global traffic information the vehicles use for determining the general routes to their destinations from the local traffic information used for avoiding congestion. While the vehicles obtain the real-time global information by accessing the infrastructure (high-speed backhaul network), they are provided with the updated local traffic information through direct vehicle-to-vehicle ad-hoc communications. The provisioning of the local traffic information is based on a novel scalable, efficient, reliable traffic information aggregation algorithm that is the main contribution of this paper. The effectiveness of the proposed algorithm is verified and the right values for the parameters in the algorithm are determined by means of simulations.
{"title":"A Novel Localized Data Aggregation Algorithm for Advanced Vehicular Traffic Information Systems","authors":"K. Shafiee, Victor C. M. Leung","doi":"10.1109/ICCW.2009.5208063","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208063","url":null,"abstract":"In this paper, we introduce an advanced vehicular networking architecture combining infrastructure and ad-hoc communications, which differentiates the global traffic information the vehicles use for determining the general routes to their destinations from the local traffic information used for avoiding congestion. While the vehicles obtain the real-time global information by accessing the infrastructure (high-speed backhaul network), they are provided with the updated local traffic information through direct vehicle-to-vehicle ad-hoc communications. The provisioning of the local traffic information is based on a novel scalable, efficient, reliable traffic information aggregation algorithm that is the main contribution of this paper. The effectiveness of the proposed algorithm is verified and the right values for the parameters in the algorithm are determined by means of simulations.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130395212","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208015
L. Xiao, L. Cuthbert, T. Zhang
The power allocation problem with co-channel interference is studied in multi-cell OFDMA cellular relay systems. Based on non-cooperative game theory and using a two-hop data rate balance, a distributed multi-cell power allocation (DMPA) algorithm is proposed, which reduces the transmission power cost and improves the system throughput. The non-cooperative power allocation game model is given in the first time subslot for base stations (BSs) and in the second time subslot for relay stations (RSs) respectively. Furthermore, the power is reduced by matching the data rate of the two-hop links for each RS. The simulation results of system throughput and transmission power of BS and RS are given with different numbers of users. Compared with equal power allocation on each subchannel, the system energy consumption is reduced and the throughput is improved.
{"title":"Distributed Multi-Cell Power Allocation Algorithm for Energy Efficiency in OFDMA Relay Systems","authors":"L. Xiao, L. Cuthbert, T. Zhang","doi":"10.1109/ICCW.2009.5208015","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208015","url":null,"abstract":"The power allocation problem with co-channel interference is studied in multi-cell OFDMA cellular relay systems. Based on non-cooperative game theory and using a two-hop data rate balance, a distributed multi-cell power allocation (DMPA) algorithm is proposed, which reduces the transmission power cost and improves the system throughput. The non-cooperative power allocation game model is given in the first time subslot for base stations (BSs) and in the second time subslot for relay stations (RSs) respectively. Furthermore, the power is reduced by matching the data rate of the two-hop links for each RS. The simulation results of system throughput and transmission power of BS and RS are given with different numbers of users. Compared with equal power allocation on each subchannel, the system energy consumption is reduced and the throughput is improved.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126215292","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208048
Vo Nguyen, Quoc Bao, Hyung-Yun Kong
Selection decode-and-forward (DF) relaying and incremental relaying were introduced as efficient relaying protocols to increase capacity and performance of cooperative diversity networks. This paper proposes an incremental relaying in conjunction with selection DF and provides its performance in terms of outage probability and bit error probability. Our proposed protocol offers a good trade off between performance and channel resource with an appropriate given threshold. Simulations are performed to confirm our theoretical analysis.
{"title":"Performance Analysis of Incremental Selection Decode-and-Forward Relaying over Rayleigh Fading Channels","authors":"Vo Nguyen, Quoc Bao, Hyung-Yun Kong","doi":"10.1109/ICCW.2009.5208048","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208048","url":null,"abstract":"Selection decode-and-forward (DF) relaying and incremental relaying were introduced as efficient relaying protocols to increase capacity and performance of cooperative diversity networks. This paper proposes an incremental relaying in conjunction with selection DF and provides its performance in terms of outage probability and bit error probability. Our proposed protocol offers a good trade off between performance and channel resource with an appropriate given threshold. Simulations are performed to confirm our theoretical analysis.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121620599","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
扫码关注我们
求助内容：
应助结果提醒方式：