Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917661
A. Kannan, B. Fidan, Guoqiang Mao
Erroneous local geometric realizations in some parts of the network due to their sensitivity to certain distance measurement errors is a major problem in wireless sensor network localization. This may in turn affect the localization of either the entire network or a large portion of it. This phenomenon is well-described using the notion of "flip ambiguity" in rigid graph theory. In this paper we analytically derive an expression for the flip ambiguity probabilities of arbitrary neighborhoods in two dimensional sensor networks. This probability can be used to mitigate flip ambiguities in two ways: 1) If an unknown sensor finds the probability of flip ambiguity on its location estimate larger than a predefined threshold, it may choose not to localize itself 2) Every known neighbor can be assigned with a confidence factor to its estimated location, reflecting the probability of flip ambiguity; a sensor with an initially unknown location can then choose only those known neighbors with a confidence factor greater than a predefined threshold. A recent study by co-authors have shown that the performance of sequential and cluster based localization schemes in the literature can be significantly improved by correctly identifying and removing neighborhoods with possible flip ambiguities from the localization process. One motivation of this paper is to enhance the performance of the robustness criterion presented in that study by accurately identifying the flip ambiguity probabilities of arbitrary neighborhoods. The various simulations done in this study show that our analytical calculations of the probability of flip ambiguity matches with the simulated detection of the probability very accurately.
{"title":"Derivation of Flip Ambiguity Probabilities to Facilitate Robust Sensor Network Localization","authors":"A. Kannan, B. Fidan, Guoqiang Mao","doi":"10.1109/WCNC.2009.4917661","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917661","url":null,"abstract":"Erroneous local geometric realizations in some parts of the network due to their sensitivity to certain distance measurement errors is a major problem in wireless sensor network localization. This may in turn affect the localization of either the entire network or a large portion of it. This phenomenon is well-described using the notion of \"flip ambiguity\" in rigid graph theory. In this paper we analytically derive an expression for the flip ambiguity probabilities of arbitrary neighborhoods in two dimensional sensor networks. This probability can be used to mitigate flip ambiguities in two ways: 1) If an unknown sensor finds the probability of flip ambiguity on its location estimate larger than a predefined threshold, it may choose not to localize itself 2) Every known neighbor can be assigned with a confidence factor to its estimated location, reflecting the probability of flip ambiguity; a sensor with an initially unknown location can then choose only those known neighbors with a confidence factor greater than a predefined threshold. A recent study by co-authors have shown that the performance of sequential and cluster based localization schemes in the literature can be significantly improved by correctly identifying and removing neighborhoods with possible flip ambiguities from the localization process. One motivation of this paper is to enhance the performance of the robustness criterion presented in that study by accurately identifying the flip ambiguity probabilities of arbitrary neighborhoods. The various simulations done in this study show that our analytical calculations of the probability of flip ambiguity matches with the simulated detection of the probability very accurately.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128947553","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-04-05DOI: 10.1109/WCNC.2009.4917715
K. Munasinghe, A. Jamalipour
Efficient methods for analyzing vertical handoffs for IP based data sessions are essential for emerging heterogeneous data networks. This is mainly due to the high frequency of vertical handoffs experienced by roaming users in such internetworked environments. This paper presents an analytical approach for evaluating vertical session handoffs in such an environment where the packet arrivals follow a Pareto distribution. The reason behind this assumption is due to the fact that probability distributions with long tails have proven to be better suited for modeling packet inter-arrival times for Internet based data traffic. The analysis and evaluation are applied for a framework previously designed by the authors' for interworking between heterogeneous data networks. Finally, the results obtained from this analysis are compared against the results obtained from a classical queuing model where Poisson arrivals and exponential service times are assumed.
{"title":"Evaluation of Session Handoffs in a Heterogeneous Mobile Network for Pareto Based Packet Arrivals","authors":"K. Munasinghe, A. Jamalipour","doi":"10.1109/WCNC.2009.4917715","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917715","url":null,"abstract":"Efficient methods for analyzing vertical handoffs for IP based data sessions are essential for emerging heterogeneous data networks. This is mainly due to the high frequency of vertical handoffs experienced by roaming users in such internetworked environments. This paper presents an analytical approach for evaluating vertical session handoffs in such an environment where the packet arrivals follow a Pareto distribution. The reason behind this assumption is due to the fact that probability distributions with long tails have proven to be better suited for modeling packet inter-arrival times for Internet based data traffic. The analysis and evaluation are applied for a framework previously designed by the authors' for interworking between heterogeneous data networks. Finally, the results obtained from this analysis are compared against the results obtained from a classical queuing model where Poisson arrivals and exponential service times are assumed.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132787750","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-04-05DOI: 10.1109/WCNC.2009.4917798
H. Bobarshad, M. Shikh-Bahaei
An analytical model is employed to solve a cross-layer optimization problem in IEEE 802.11 wireless local area networks (WLANs). Closed-form expressions for the optimum retry limit, packet overflow drop rate and overall loss rate are derived using M/M/1 queuing model, and subsequently an adaptive MAC retry limit scheme is studied. Furthermore simulation results (network simulator-2) will verify the accuracy of our analytical model.
{"title":"M/M/1 Queuing Model for Adaptive Cross-Layer Error Protection in WLANs","authors":"H. Bobarshad, M. Shikh-Bahaei","doi":"10.1109/WCNC.2009.4917798","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917798","url":null,"abstract":"An analytical model is employed to solve a cross-layer optimization problem in IEEE 802.11 wireless local area networks (WLANs). Closed-form expressions for the optimum retry limit, packet overflow drop rate and overall loss rate are derived using M/M/1 queuing model, and subsequently an adaptive MAC retry limit scheme is studied. Furthermore simulation results (network simulator-2) will verify the accuracy of our analytical model.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131095778","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-04-05DOI: 10.1109/WCNC.2009.4917592
Shunyuan Ye, S. Panwar
Carrier sensing has been used as an effective way to reduce collisions and exploit spatial reuse in wireless networks. Previous research has attempted to tune the carrier sensing range to maximize the network throughput. However, the impact of carrier sensing threshold on the probability of successful transmission has been ignored. In this paper, we derive an analytical model to calculate the successful transmission probability. We then calculate the throughput of routing protocols using different link metrics. To the best of our knowledge, this perhaps is the first attempt to derive the throughput of routing protocols like expected transmission count (ETX) [1] and expected transmission time (ETT) [2] in wireless networks. We also investigate the impact of some other important factors, such as node density, average contention window size and packet length. Our results show that optimal routing protocols that are using ETT as the path metric can achieve around 30% more throughput than those using ETX and End-to-end delay. Compared to the minimum hop count protocols such as DSR and AODV, the optimal routing protocol can improve the throughput by up to 100%.
{"title":"Analysis of Carrier Sensing's Influence on the Performance of Routing Protocols in Multi-Hop, Multi-Rate Wireless Networks","authors":"Shunyuan Ye, S. Panwar","doi":"10.1109/WCNC.2009.4917592","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917592","url":null,"abstract":"Carrier sensing has been used as an effective way to reduce collisions and exploit spatial reuse in wireless networks. Previous research has attempted to tune the carrier sensing range to maximize the network throughput. However, the impact of carrier sensing threshold on the probability of successful transmission has been ignored. In this paper, we derive an analytical model to calculate the successful transmission probability. We then calculate the throughput of routing protocols using different link metrics. To the best of our knowledge, this perhaps is the first attempt to derive the throughput of routing protocols like expected transmission count (ETX) [1] and expected transmission time (ETT) [2] in wireless networks. We also investigate the impact of some other important factors, such as node density, average contention window size and packet length. Our results show that optimal routing protocols that are using ETT as the path metric can achieve around 30% more throughput than those using ETX and End-to-end delay. Compared to the minimum hop count protocols such as DSR and AODV, the optimal routing protocol can improve the throughput by up to 100%.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130719579","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-04-05DOI: 10.1109/WCNC.2009.4917557
Bora Karaoglu, T. Numanoglu, W. Heinzelman
Soft clustering of the nodes combined with time division multiple access (TDMA) channel access within a cluster has been shown to provide an energy-efficient solution for Mobile Ad-Hoc Networks (MANET). Such channel access schemes use a parameter that is critical in determining network performance: the number of frames per superframe, which determines the amount of spatial reuse possible, similar to the frequency reuse factor in cellular networks. When a smaller number of frames per superframe is used, each frame will consist of a larger number of slots, enabling the frame (i.e., cluster) to support more nodes, but also limiting the choices of frames for clusterheads to select, causing higher co-channel interference and collisions. Conversely, when a larger number of frames per superframe is used, the clusterheads will only be able to grant channel access to a limited number of nodes, which in turn increases the number of dropped packets (i.e., blocked channel access). The optimum value of the number of frames is the one that minimizes the combined effect of both collisions and dropped packets. By analytically determining the effects of dropped packets and collisions, we can find the optimal value for any given scenario. This paper develops a model to determine the optimal TDMA structure under various settings, showing the advantages that can be obtained by adapting protocol parameters as network conditions change.
{"title":"Adaptation of TDMA Parameters Based on Network Conditions","authors":"Bora Karaoglu, T. Numanoglu, W. Heinzelman","doi":"10.1109/WCNC.2009.4917557","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917557","url":null,"abstract":"Soft clustering of the nodes combined with time division multiple access (TDMA) channel access within a cluster has been shown to provide an energy-efficient solution for Mobile Ad-Hoc Networks (MANET). Such channel access schemes use a parameter that is critical in determining network performance: the number of frames per superframe, which determines the amount of spatial reuse possible, similar to the frequency reuse factor in cellular networks. When a smaller number of frames per superframe is used, each frame will consist of a larger number of slots, enabling the frame (i.e., cluster) to support more nodes, but also limiting the choices of frames for clusterheads to select, causing higher co-channel interference and collisions. Conversely, when a larger number of frames per superframe is used, the clusterheads will only be able to grant channel access to a limited number of nodes, which in turn increases the number of dropped packets (i.e., blocked channel access). The optimum value of the number of frames is the one that minimizes the combined effect of both collisions and dropped packets. By analytically determining the effects of dropped packets and collisions, we can find the optimal value for any given scenario. This paper develops a model to determine the optimal TDMA structure under various settings, showing the advantages that can be obtained by adapting protocol parameters as network conditions change.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130847068","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-04-05DOI: 10.1109/WCNC.2009.4917526
I. Stupia, F. Giannetti, V. Lottici, L. Vandendorpe
Coded multi-antenna and multi-carrier techniques combined together with link resources adaptation algorithms are the key technologies toward efficient high-data-rate communications over wireless fading channels. The practicability of this concept, however, requires that the transmitter can perform accurate and simple evaluation of the actual link performance. This paper contributes with a novel method specifically developed to predict the link performance of bit-interleaved coded MIMO-OFDM links, which offers improved accuracy at the price of lower complexity when compared with conventional techniques. Its effectiveness is confirmed through extensive simulation results obtained over typical wireless channel environments.
{"title":"A Novel Link Performance Prediction Method for Coded MIMO-OFDM Systems","authors":"I. Stupia, F. Giannetti, V. Lottici, L. Vandendorpe","doi":"10.1109/WCNC.2009.4917526","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917526","url":null,"abstract":"Coded multi-antenna and multi-carrier techniques combined together with link resources adaptation algorithms are the key technologies toward efficient high-data-rate communications over wireless fading channels. The practicability of this concept, however, requires that the transmitter can perform accurate and simple evaluation of the actual link performance. This paper contributes with a novel method specifically developed to predict the link performance of bit-interleaved coded MIMO-OFDM links, which offers improved accuracy at the price of lower complexity when compared with conventional techniques. Its effectiveness is confirmed through extensive simulation results obtained over typical wireless channel environments.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130960085","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-04-05DOI: 10.1109/WCNC.2009.4917766
Ville Syrjälä, M. Valkama
This paper presents a new way to address and mitigate sampling jitter in high-frequency bandpass-sampling OFDM radio receivers. Baseband model for mapping the sampling jitter to certain type of phase noise is first presented, and stemming from this model, state-of-the-art phase noise mitigation techniques are then proposed to remove the jitter-induced signal distortion. Performances of the proposed jitter mitigation techniques are analyzed with extensive computer simulations in high-speed bandpass sampling multicarrier system context. In the link performance simulations, both additive white Gaussian noise (AWGN) and extended ITU-R vehicular A multipath (eVehA) radio channel types are used, combined with realistic sampling clock and jitter modelling.
{"title":"Jitter Mitigation in High-Frequency Bandpass-Sampling OFDM Radios","authors":"Ville Syrjälä, M. Valkama","doi":"10.1109/WCNC.2009.4917766","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917766","url":null,"abstract":"This paper presents a new way to address and mitigate sampling jitter in high-frequency bandpass-sampling OFDM radio receivers. Baseband model for mapping the sampling jitter to certain type of phase noise is first presented, and stemming from this model, state-of-the-art phase noise mitigation techniques are then proposed to remove the jitter-induced signal distortion. Performances of the proposed jitter mitigation techniques are analyzed with extensive computer simulations in high-speed bandpass sampling multicarrier system context. In the link performance simulations, both additive white Gaussian noise (AWGN) and extended ITU-R vehicular A multipath (eVehA) radio channel types are used, combined with realistic sampling clock and jitter modelling.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133271829","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-04-05DOI: 10.1109/WCNC.2009.4917910
Yingpei Zeng, Jiannong Cao, Shigeng Zhang, Shanqing Guo, Li Xie
Many secure localization algorithms have been proposed. In these algorithms, collusion attack is usually considered as the strongest attack when evaluating their performance. Also, for ensuring correct localization under the collusion attack, a necessary number of normal beacons are needed and a lower bound on this number has been established (assuming the errors of distance measurements are ignorable). In this paper, we introduce pollution attack, a more powerful attack which can succeed even when the number of normal beacons is more than the lower bound. In this attack, victim node is misled to a special chosen location, which results in a confusion of compromised beacon with normal beacon. We propose a new metric to measure the vulnerability of a normal location reference set to pollution attack, and develop two algorithms to efficiently compute the value of the proposed metric. We also present a method to judge whether the output of the localization algorithm is credible under pollution attack. Simulation results show that the pollution attack can succeed with high probability.
{"title":"Pollution Attack: A New Attack Against Localization in Wireless Sensor Networks","authors":"Yingpei Zeng, Jiannong Cao, Shigeng Zhang, Shanqing Guo, Li Xie","doi":"10.1109/WCNC.2009.4917910","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917910","url":null,"abstract":"Many secure localization algorithms have been proposed. In these algorithms, collusion attack is usually considered as the strongest attack when evaluating their performance. Also, for ensuring correct localization under the collusion attack, a necessary number of normal beacons are needed and a lower bound on this number has been established (assuming the errors of distance measurements are ignorable). In this paper, we introduce pollution attack, a more powerful attack which can succeed even when the number of normal beacons is more than the lower bound. In this attack, victim node is misled to a special chosen location, which results in a confusion of compromised beacon with normal beacon. We propose a new metric to measure the vulnerability of a normal location reference set to pollution attack, and develop two algorithms to efficiently compute the value of the proposed metric. We also present a method to judge whether the output of the localization algorithm is credible under pollution attack. Simulation results show that the pollution attack can succeed with high probability.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134483600","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-04-05DOI: 10.1109/WCNC.2009.4917684
Shiang-Jiun Lin, W. Sheen, Chia-Chi Huang
Relay-assisted cellular network is one of the most promising architectures for the next-generation mobile cellular system, which is envisaged to support high-rate multimedia services in a wide variety of environments: indoors, outdoors, low-mobility, high-mobility, etc. This work aims to investigate the theoretical performance of downlink transmissions of relay-assisted cellular networks in the multi-cell environment with optimized system parameters. A genetic-algorithm based approach is proposed for joint multi-cell optimization of system parameters including locations of relay stations, path selection, reuse pattern and resource allocation to maximize the system spectral efficiency. Two types of quality of end-user experience (QoE) (fixed-bandwidth allocation and fixed-throughput allocation) are investigated along with two path selection schemes (spectral efficiency-based and SINR-based). Numerical results show that with the deployment of relay stations, the system performance is significantly improved over the conventional cellular networks.
{"title":"Downlink Performance and Optimization of Relay-Assisted Cellular Networks","authors":"Shiang-Jiun Lin, W. Sheen, Chia-Chi Huang","doi":"10.1109/WCNC.2009.4917684","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917684","url":null,"abstract":"Relay-assisted cellular network is one of the most promising architectures for the next-generation mobile cellular system, which is envisaged to support high-rate multimedia services in a wide variety of environments: indoors, outdoors, low-mobility, high-mobility, etc. This work aims to investigate the theoretical performance of downlink transmissions of relay-assisted cellular networks in the multi-cell environment with optimized system parameters. A genetic-algorithm based approach is proposed for joint multi-cell optimization of system parameters including locations of relay stations, path selection, reuse pattern and resource allocation to maximize the system spectral efficiency. Two types of quality of end-user experience (QoE) (fixed-bandwidth allocation and fixed-throughput allocation) are investigated along with two path selection schemes (spectral efficiency-based and SINR-based). Numerical results show that with the deployment of relay stations, the system performance is significantly improved over the conventional cellular networks.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131755857","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-04-05DOI: 10.1109/WCNC.2009.4917977
Gongpu Wang, C. Tellambura
Super-imposed pilots can be used as an alternative to traditional pilots that are used for channel estimation. Superimposed pilots improve bandwidth efficiency. We apply it to the Amplify and Forward (AF) relay systems. In this paper we give the channel estimation (CE) results, analyze the system performance, study the power allocation methods and extend our result to multi-hop relay systems. Our main contribution is that we suggest and prove the existence of minimum bit error rate (BER) as a function of pilot signal power, find the best power allocation ratio value that can reach the minimum BER, analyze parameters' influence on the ratio value, and extend our result to multi-hop systems.
{"title":"Super-Imposed Pilot-Aided Channel Estimation and Power Allocation for Relay Systems","authors":"Gongpu Wang, C. Tellambura","doi":"10.1109/WCNC.2009.4917977","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917977","url":null,"abstract":"Super-imposed pilots can be used as an alternative to traditional pilots that are used for channel estimation. Superimposed pilots improve bandwidth efficiency. We apply it to the Amplify and Forward (AF) relay systems. In this paper we give the channel estimation (CE) results, analyze the system performance, study the power allocation methods and extend our result to multi-hop relay systems. Our main contribution is that we suggest and prove the existence of minimum bit error rate (BER) as a function of pilot signal power, find the best power allocation ratio value that can reach the minimum BER, analyze parameters' influence on the ratio value, and extend our result to multi-hop systems.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115196766","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
扫码关注我们
求助内容：
应助结果提醒方式：