Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952355
Yahia Hassan, A. Wittneben
Compact arrays are known to be associated with antenna coupling and noise correlation. The noise can be either antenna noise, LNA noise or downstream noise. Due to these effects, it was shown that the matching network affects the performance of MIMO systems with coupled receiver antennas. Since the optimal multiport matching network is of very high complexity as well as very narrow operation bandwidth, development of single-port (SP) matching networks that boost the performance became inevitable. In this paper we develop a gradient-search algorithm to design the matching network for achievable rate maximization of multi user MIMO systems. For any combination of noise sources, we rigorously derive the exact gradient of the achievable rate with respect to the components of the matching network. We assume either full knowledge of the spatial channel or knowing its statistical properties. In the later case we optimize the matching network to maximize the Jensen's bound. Substantial performance enhancement is shown when our algorithms are used. Significant reduction in the array area is gained in comparison to the often used λ/2 antenna spacing without taking coupling into account. This can be vital for future wireless systems adopting massive MIMO arrays. Via eigenvalues distribution simulations at different SNR regimes, we show an intuitive link to the communication theory.
{"title":"Rate maximization in coupled MIMO systems: A generic algorithm for designing single-port matching networks","authors":"Yahia Hassan, A. Wittneben","doi":"10.1109/WCNC.2014.6952355","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952355","url":null,"abstract":"Compact arrays are known to be associated with antenna coupling and noise correlation. The noise can be either antenna noise, LNA noise or downstream noise. Due to these effects, it was shown that the matching network affects the performance of MIMO systems with coupled receiver antennas. Since the optimal multiport matching network is of very high complexity as well as very narrow operation bandwidth, development of single-port (SP) matching networks that boost the performance became inevitable. In this paper we develop a gradient-search algorithm to design the matching network for achievable rate maximization of multi user MIMO systems. For any combination of noise sources, we rigorously derive the exact gradient of the achievable rate with respect to the components of the matching network. We assume either full knowledge of the spatial channel or knowing its statistical properties. In the later case we optimize the matching network to maximize the Jensen's bound. Substantial performance enhancement is shown when our algorithms are used. Significant reduction in the array area is gained in comparison to the often used λ/2 antenna spacing without taking coupling into account. This can be vital for future wireless systems adopting massive MIMO arrays. Via eigenvalues distribution simulations at different SNR regimes, we show an intuitive link to the communication theory.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123989100","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952092
S. Banani, R. Adve
We consider a coordinated multi-point (CoMP) uplink cellular network with a Poisson point process (PPP) model for the position of BSs. Our model assumes cooperation amongst two BSs and the required density is obtained under shadowing and Rayleigh fading for different LTE-A path loss models. We obtain accurate closed-form approximations for the worst-case rate coverage probability within the cooperation region. The approximations presented are useful for a rapid assessment of network performance and can be utilized in parametric studies for network design. Here, they are applied to obtain the required density of BSs to achieve a target rate coverage probability. As an added benefit, the formulation here quantifies the penalty in moving from a regular BS deployment (the grid model) to a random BS deployment (the PPP model).
{"title":"The density penalty for random deployments in uplink CoMP networks","authors":"S. Banani, R. Adve","doi":"10.1109/WCNC.2014.6952092","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952092","url":null,"abstract":"We consider a coordinated multi-point (CoMP) uplink cellular network with a Poisson point process (PPP) model for the position of BSs. Our model assumes cooperation amongst two BSs and the required density is obtained under shadowing and Rayleigh fading for different LTE-A path loss models. We obtain accurate closed-form approximations for the worst-case rate coverage probability within the cooperation region. The approximations presented are useful for a rapid assessment of network performance and can be utilized in parametric studies for network design. Here, they are applied to obtain the required density of BSs to achieve a target rate coverage probability. As an added benefit, the formulation here quantifies the penalty in moving from a regular BS deployment (the grid model) to a random BS deployment (the PPP model).","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124200470","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952359
Erdogan Aydin, H. Ilhan, Ö. Özdemir
In this paper, two different antenna selection models based on signal-to-noise ratio (SNR) have been proposed in order to reduce the end-to-end bit error rate (BER) of decode and forward (DF) relaying cooperative system where source and destination terminals contain single antenna while relay terminal has multiple antennas. Specifically, by using instantaneous and average SNR of source-to-destination, source-to-relay and relay-to-destination links, optimal decision rules are derived theoretically for antenna selection at the relay terminal. Later, BER expressions of considered system have been derived for two antenna selection models over Rayleigh fading channels. Theoretical and simulation results show the validity of proposed mathematical analysis and point out the confirmation of theoretical results.
{"title":"SNR-based antenna selection schemes for cooperative relay networks in wireless channels","authors":"Erdogan Aydin, H. Ilhan, Ö. Özdemir","doi":"10.1109/WCNC.2014.6952359","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952359","url":null,"abstract":"In this paper, two different antenna selection models based on signal-to-noise ratio (SNR) have been proposed in order to reduce the end-to-end bit error rate (BER) of decode and forward (DF) relaying cooperative system where source and destination terminals contain single antenna while relay terminal has multiple antennas. Specifically, by using instantaneous and average SNR of source-to-destination, source-to-relay and relay-to-destination links, optimal decision rules are derived theoretically for antenna selection at the relay terminal. Later, BER expressions of considered system have been derived for two antenna selection models over Rayleigh fading channels. Theoretical and simulation results show the validity of proposed mathematical analysis and point out the confirmation of theoretical results.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114112043","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}
In wireless sensor networks, the connectivity-based localization protocols are widely studied due to low cost and no requirement for special hardware. Many connectivity-based algorithms rely on distance estimation between nodes according to their hop count, which often yields large errors in anisotropic sensor network. In this paper, we propose a virtual potential field algorithm, in which the estimated positions of unknown nodes are iteratively adjusted by eliminating the inconsistency to the connectivity constraint. Unlike current connectivity-based algorithms, VPF effectively exploits the connectivity constraint information, regardless of distance estimation between nodes, thus achieving high localization accuracy in both isotropic and anisotropic sensor networks. Simulation results show that VPF improves the localization accuracy by an average of 47% compared with MDS in isotropic network, and 42% compared with PDM in anisotropic network. As a refinement procedure, the average improvement factor of VPF is 56% and 50%, based on MDS and PDM respectively.
{"title":"Connectivity-based virtual potential field localization in wireless sensor networks","authors":"Chao Yang, Weiping Zhu, Wen Wang, Lijun Chen, Daoxu Chen, Jiannong Cao","doi":"10.1109/WCNC.2014.6952825","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952825","url":null,"abstract":"In wireless sensor networks, the connectivity-based localization protocols are widely studied due to low cost and no requirement for special hardware. Many connectivity-based algorithms rely on distance estimation between nodes according to their hop count, which often yields large errors in anisotropic sensor network. In this paper, we propose a virtual potential field algorithm, in which the estimated positions of unknown nodes are iteratively adjusted by eliminating the inconsistency to the connectivity constraint. Unlike current connectivity-based algorithms, VPF effectively exploits the connectivity constraint information, regardless of distance estimation between nodes, thus achieving high localization accuracy in both isotropic and anisotropic sensor networks. Simulation results show that VPF improves the localization accuracy by an average of 47% compared with MDS in isotropic network, and 42% compared with PDM in anisotropic network. As a refinement procedure, the average improvement factor of VPF is 56% and 50%, based on MDS and PDM respectively.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114620103","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952402
Michael A. Ruder, W. Gerstacker
In this paper, we consider joint user pairing and frequency allocation with beamforming (BF) assuming per user Quality of Service (QoS) requirements. A single-carrier frequency-division multiple-access (SC-FDMA) transmission employing a zero-forcing (ZF) detector at the receiver is assumed. The BF filter coefficients are jointly optimized with the user pairing and frequency allocation of the users. The transmit power savings achievable by combining BF with user pairing and frequency allocation are compared to these of a constant power allocation over all subcarriers. To this end, BF filter coefficient optimization and constant power allocation are briefly revisited and novel BF filter solutions for single-input multiple-output (SIMO) and single-input single-output (SISO) transmission, respectively, are derived for SC-FDMA. Numerical results show that the transmit power can be significantly reduced with BF for suboptimum algorithms, but for optimal joint user pairing and frequency allocation the gain of BF compared to constant power allocation is negligible.
{"title":"Joint user pairing, frequency allocation, and beamforming for MIMO SC-FDMA transmission with QoS requirements","authors":"Michael A. Ruder, W. Gerstacker","doi":"10.1109/WCNC.2014.6952402","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952402","url":null,"abstract":"In this paper, we consider joint user pairing and frequency allocation with beamforming (BF) assuming per user Quality of Service (QoS) requirements. A single-carrier frequency-division multiple-access (SC-FDMA) transmission employing a zero-forcing (ZF) detector at the receiver is assumed. The BF filter coefficients are jointly optimized with the user pairing and frequency allocation of the users. The transmit power savings achievable by combining BF with user pairing and frequency allocation are compared to these of a constant power allocation over all subcarriers. To this end, BF filter coefficient optimization and constant power allocation are briefly revisited and novel BF filter solutions for single-input multiple-output (SIMO) and single-input single-output (SISO) transmission, respectively, are derived for SC-FDMA. Numerical results show that the transmit power can be significantly reduced with BF for suboptimum algorithms, but for optimal joint user pairing and frequency allocation the gain of BF compared to constant power allocation is negligible.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116281755","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952914
G. K. Nguyen, T. V. Nguyen, Hyundong Shin
Localization using the received signal strength (RSS) is a popular technique in the indoor location aware service because of the wide deployment of wireless local area networks (WLANs) and the spreading of mobile device with the measuring RSS function. In this paper, we investigate the RSS-based WLAN indoor positioning system using ℓ0-norm recovery support of sparse representation. Based on the fingerprinting method, the radio map (RM) constructed in offline phase is decomposed into a dictionary and a corresponding sparse representation matrix, using the K-SVD learning overcomplete dictionary algorithm. The learned dictionary guarantees the condition of stable recovery sparse representation. The position of each reference point (RP) in the RM is characterized by an unique support in each vector of sparse representation. We use the orthogonal matching pursuit algorithm to find the support of sparse representation of the real-time measured RSS vector over the learned dictionary and thereby determine which RP is closest to the user. This is an ℓ0-norm minimization problem. We also study the effect of the other RPs to the recovery solution of real-time measurement vector. We first derive the weighted vector that reflects the contribution of each RP in the localization formulation, then the user position is estimated by this vector and the positions of RPs.
{"title":"Learning dictionary and compressive sensing for WLAN localization","authors":"G. K. Nguyen, T. V. Nguyen, Hyundong Shin","doi":"10.1109/WCNC.2014.6952914","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952914","url":null,"abstract":"Localization using the received signal strength (RSS) is a popular technique in the indoor location aware service because of the wide deployment of wireless local area networks (WLANs) and the spreading of mobile device with the measuring RSS function. In this paper, we investigate the RSS-based WLAN indoor positioning system using ℓ0-norm recovery support of sparse representation. Based on the fingerprinting method, the radio map (RM) constructed in offline phase is decomposed into a dictionary and a corresponding sparse representation matrix, using the K-SVD learning overcomplete dictionary algorithm. The learned dictionary guarantees the condition of stable recovery sparse representation. The position of each reference point (RP) in the RM is characterized by an unique support in each vector of sparse representation. We use the orthogonal matching pursuit algorithm to find the support of sparse representation of the real-time measured RSS vector over the learned dictionary and thereby determine which RP is closest to the user. This is an ℓ0-norm minimization problem. We also study the effect of the other RPs to the recovery solution of real-time measurement vector. We first derive the weighted vector that reflects the contribution of each RP in the localization formulation, then the user position is estimated by this vector and the positions of RPs.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125485397","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952518
Husain Nizamuddin, A. F. D. Santos, T. Wild
Machine-to-Machine (M2M) communication has recently attracted significant interest, and is expected to play a major role in future wireless communication. Various M2M applications are being considered for integration to modern cellular networks including tracking, metering and eHealth, thus benefiting from the wide coverage and lower deployment costs. However, there exist applications supported by low end machine and sensor terminals constrained by limited battery, transmit power, complexity and cost, which suffer from the bulky signal processing and control overheads of existing systems making way for investigating new MAC and PHY approaches. In this paper we present a simple and efficient cross layer design for operation at low transmit powers and bandwidth, accommodating applications with sporadic, low volume transmissions and relatively relaxed QoS requirements. A wide range of monitoring and sensing applications fall in this category and will be a corner stone for realizing future Smart Cities. Using simulations, we identify the bounds on maximum supported machine terminals in a cell with above application characteristics, and also investigate the transmission latency and energy efficiency of the machine terminals.
{"title":"A random access and multiuser detection approach for massive access of low-complexity machine communications in cellular networks","authors":"Husain Nizamuddin, A. F. D. Santos, T. Wild","doi":"10.1109/WCNC.2014.6952518","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952518","url":null,"abstract":"Machine-to-Machine (M2M) communication has recently attracted significant interest, and is expected to play a major role in future wireless communication. Various M2M applications are being considered for integration to modern cellular networks including tracking, metering and eHealth, thus benefiting from the wide coverage and lower deployment costs. However, there exist applications supported by low end machine and sensor terminals constrained by limited battery, transmit power, complexity and cost, which suffer from the bulky signal processing and control overheads of existing systems making way for investigating new MAC and PHY approaches. In this paper we present a simple and efficient cross layer design for operation at low transmit powers and bandwidth, accommodating applications with sporadic, low volume transmissions and relatively relaxed QoS requirements. A wide range of monitoring and sensing applications fall in this category and will be a corner stone for realizing future Smart Cities. Using simulations, we identify the bounds on maximum supported machine terminals in a cell with above application characteristics, and also investigate the transmission latency and energy efficiency of the machine terminals.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125601365","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952477
L. Falconetti, Eslam Yassin
Coordinated Multi-Point (CoMP) reception between base stations (BSs) has shown to be an efficient way to improve user performance in the uplink (UL). However, it comes with an increased network power consumption due to additional signal processing at the base station and information transfer on the backhaul. In this paper we analyze the impact of two UL CoMP schemes on the energy consumption of a heterogeneous network featuring fast BS sleep mode. We show that depending on the load and the UL CoMP scheme applied, a network with UL CoMP may be more energy efficient than without. We also propose a CoMP scheme selection algorithm so that the most energy efficient scheme is selected for a user during its activity time. Results show that the selection algorithm, evaluated in an ideal and a practical variant, leads to the lowest network power consumption for different traffic loads.
{"title":"Towards energy efficiency with uplink cooperation in heterogeneous networks","authors":"L. Falconetti, Eslam Yassin","doi":"10.1109/WCNC.2014.6952477","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952477","url":null,"abstract":"Coordinated Multi-Point (CoMP) reception between base stations (BSs) has shown to be an efficient way to improve user performance in the uplink (UL). However, it comes with an increased network power consumption due to additional signal processing at the base station and information transfer on the backhaul. In this paper we analyze the impact of two UL CoMP schemes on the energy consumption of a heterogeneous network featuring fast BS sleep mode. We show that depending on the load and the UL CoMP scheme applied, a network with UL CoMP may be more energy efficient than without. We also propose a CoMP scheme selection algorithm so that the most energy efficient scheme is selected for a user during its activity time. Results show that the selection algorithm, evaluated in an ideal and a practical variant, leads to the lowest network power consumption for different traffic loads.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121442907","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952356
Liang Zhou, Y. Ohashi
In this paper we investigate low complexity millimeter-wave communication systems for uniform circular arrays (UCAs) in line-of-sight (LOS) multiple-input multiple-output (MIMO) channels. We first demonstrate that the MIMO channel matrices for UCAs in LOS-MIMO channels are circulant matrices. Then, we show that the channel matrices can be made orthogonal by choosing the array diameters appropriately as a function of range and wavelength for the 3×3 and 4×4 UCAs. We also derive simple analytical expressions of eigenvalues as a function of array design. Finally, we propose a high performance LOS-MIMO precoding system which combines forward error correction (FEC) codes and spatial interleaver with fixed precoding matrix. Unlike the SVD based eigenmode system, the proposed precoding system does not require CSI estimation, SVD calculation and feedback of precoding matrix owing to the properties of circulant matrices. Simulation results show that the proposed low complexity system can obtain excellent performance in various link ranges.
{"title":"Low complexity millimeter-wave LOS-MIMO precoding systems for uniform circular arrays","authors":"Liang Zhou, Y. Ohashi","doi":"10.1109/WCNC.2014.6952356","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952356","url":null,"abstract":"In this paper we investigate low complexity millimeter-wave communication systems for uniform circular arrays (UCAs) in line-of-sight (LOS) multiple-input multiple-output (MIMO) channels. We first demonstrate that the MIMO channel matrices for UCAs in LOS-MIMO channels are circulant matrices. Then, we show that the channel matrices can be made orthogonal by choosing the array diameters appropriately as a function of range and wavelength for the 3×3 and 4×4 UCAs. We also derive simple analytical expressions of eigenvalues as a function of array design. Finally, we propose a high performance LOS-MIMO precoding system which combines forward error correction (FEC) codes and spatial interleaver with fixed precoding matrix. Unlike the SVD based eigenmode system, the proposed precoding system does not require CSI estimation, SVD calculation and feedback of precoding matrix owing to the properties of circulant matrices. Simulation results show that the proposed low complexity system can obtain excellent performance in various link ranges.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115896762","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 : 2014-04-06DOI: 10.1109/WCNC.2014.6952562
Dimitrios Kosmanos, A. Argyriou, L. Tassiulas
In this paper we consider packetized video transmission in cooperative relay-based wireless networks. We propose algorithms for optimized relay selection that take into account the content of each specific video packet. Our first algorithm, that is designed for a narrowband flat-fading channel and single-carrier modulation, selects jointly the optimal relay and video packet for forwarding. Our next algorithm is an extension of our main idea for OFDM modulation that is suitable for frequency-selective fading channels. In this case in addition to optimized packet and relay selection, our algorithm also jointly selects the optimal power level for each subcarrier. The key benefit of our algorithms is that they are fully distributed since they require no explicit communication among the relays but they only use passively collected information. We perform an extensive evaluation of our algorithms for different system configurations.
{"title":"Video-aware relay selection in single-carrier and OFDM wireless systems","authors":"Dimitrios Kosmanos, A. Argyriou, L. Tassiulas","doi":"10.1109/WCNC.2014.6952562","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952562","url":null,"abstract":"In this paper we consider packetized video transmission in cooperative relay-based wireless networks. We propose algorithms for optimized relay selection that take into account the content of each specific video packet. Our first algorithm, that is designed for a narrowband flat-fading channel and single-carrier modulation, selects jointly the optimal relay and video packet for forwarding. Our next algorithm is an extension of our main idea for OFDM modulation that is suitable for frequency-selective fading channels. In this case in addition to optimized packet and relay selection, our algorithm also jointly selects the optimal power level for each subcarrier. The key benefit of our algorithms is that they are fully distributed since they require no explicit communication among the relays but they only use passively collected information. We perform an extensive evaluation of our algorithms for different system configurations.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132370608","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
扫码关注我们
求助内容：
应助结果提醒方式：