Pub Date : 2013-05-06DOI: 10.1109/ICTEL.2013.6632079
L. Ge, Gaojie Chen, Yu Gong, J. Chambers
In this paper, we consider the use of the Golden Code within two-way transmission over a wireless relay network in the fixed and selected relay cases. Such two-way transmission potentially improves the rate performance over one-way schemes. A four time slot amplify-and-forward (AF) protocol is exploited. Two policies are considered for relay selection, one based on a maximum-minimum strategy and a second using the maximum-mean approach. The combination of relay selection and two-way transmission mitigates the potential loss of diversity and rate in one-way fixed relay Golden Code transmission. End-to-end bit error rate simulations are used to evaluate the performance of the proposed approaches.
{"title":"Two-way distributed transmission based on the golden code for application in wireless relay networks","authors":"L. Ge, Gaojie Chen, Yu Gong, J. Chambers","doi":"10.1109/ICTEL.2013.6632079","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632079","url":null,"abstract":"In this paper, we consider the use of the Golden Code within two-way transmission over a wireless relay network in the fixed and selected relay cases. Such two-way transmission potentially improves the rate performance over one-way schemes. A four time slot amplify-and-forward (AF) protocol is exploited. Two policies are considered for relay selection, one based on a maximum-minimum strategy and a second using the maximum-mean approach. The combination of relay selection and two-way transmission mitigates the potential loss of diversity and rate in one-way fixed relay Golden Code transmission. End-to-end bit error rate simulations are used to evaluate the performance of the proposed approaches.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"708 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128985402","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632106
Y. Benlcouiri, A. Azizi, M. C. Ismaili, M. Benabdellah
In this work, we propose a new encryption method of still images based on the affine encryption principle for achieve a transposition and perform some manipulations to reduce the quantity of bits. The application of this method on images, gave a high degree of safety and a minimum processing time proportional to the number of pixels, during the encryption and the decryption. The comparison of this approach with the encryption method using injection of noise on the architecture of artificial neural networks, the DES encryption and the AES encryption showed that it is more efficient.
{"title":"Affine cipher extended to (Z/pZ) and it's application in images","authors":"Y. Benlcouiri, A. Azizi, M. C. Ismaili, M. Benabdellah","doi":"10.1109/ICTEL.2013.6632106","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632106","url":null,"abstract":"In this work, we propose a new encryption method of still images based on the affine encryption principle for achieve a transposition and perform some manipulations to reduce the quantity of bits. The application of this method on images, gave a high degree of safety and a minimum processing time proportional to the number of pixels, during the encryption and the decryption. The comparison of this approach with the encryption method using injection of noise on the architecture of artificial neural networks, the DES encryption and the AES encryption showed that it is more efficient.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131638243","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632081
Gilberto Berardinelli, Fernando M. L. Tavares, N. Mahmood, Oscar Tonelli, A. Cattoni, T. B. Sørensen, P. Mogensen
The exponential growth in indoor data traffic necessitates a massive deployment of small cells, and emphasizes the importance of interference coordination and suppression to realize the full potential of this densification. To be effective however, interference coordination and suppression requires strict time synchronization between the cells. This paper deals with distributed runtime synchronization for Beyond 4G femtocells. A simple random scheduling solution for the clock distribution messages is proposed, as well as different clock update mechanisms. Simulation results for a dense cell scenario with two stripes of apartments show that a `multiplicative clock update' exhibits an initial large time divergence among neighbor cells, but is able to achieve a lower long-term error floor than `additive clock update'. Practical implications of the residual time misalignment on the Beyond 4G system design are also addressed.
{"title":"Distributed synchronization for beyond 4G indoor femtocells","authors":"Gilberto Berardinelli, Fernando M. L. Tavares, N. Mahmood, Oscar Tonelli, A. Cattoni, T. B. Sørensen, P. Mogensen","doi":"10.1109/ICTEL.2013.6632081","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632081","url":null,"abstract":"The exponential growth in indoor data traffic necessitates a massive deployment of small cells, and emphasizes the importance of interference coordination and suppression to realize the full potential of this densification. To be effective however, interference coordination and suppression requires strict time synchronization between the cells. This paper deals with distributed runtime synchronization for Beyond 4G femtocells. A simple random scheduling solution for the clock distribution messages is proposed, as well as different clock update mechanisms. Simulation results for a dense cell scenario with two stripes of apartments show that a `multiplicative clock update' exhibits an initial large time divergence among neighbor cells, but is able to achieve a lower long-term error floor than `additive clock update'. Practical implications of the residual time misalignment on the Beyond 4G system design are also addressed.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131834873","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632118
W. Z. Khan, M. Aalsalem, Mohamad Naufal Mohamad Saad
In the security of wireless sensor networks, node replication attack is the most critical concern. In node replication attack, an adversary compromises the captured node and replicates the node, creating many replicas with the same node identity by obtaining all the secrets of the nodes. After this an adversary may launch many insidious attacks within the sensor network. So far, Randomized, Efficient and Distributed (RED) is considered to be the most promising distributed solution for detecting clone nodes but it also has some stern, stunning and uncompromising shortcomings. The contributions of this paper are twofold. First, we have presented a distributed and non-deterministic solution, removing the drawbacks of RED by making enhancements in order to identify and revoke clones. Finally, we have proposed a method for the detection of masked replication attack which is another form or variation of Node replication attack.
{"title":"Secure & robust RED (SR-RED)","authors":"W. Z. Khan, M. Aalsalem, Mohamad Naufal Mohamad Saad","doi":"10.1109/ICTEL.2013.6632118","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632118","url":null,"abstract":"In the security of wireless sensor networks, node replication attack is the most critical concern. In node replication attack, an adversary compromises the captured node and replicates the node, creating many replicas with the same node identity by obtaining all the secrets of the nodes. After this an adversary may launch many insidious attacks within the sensor network. So far, Randomized, Efficient and Distributed (RED) is considered to be the most promising distributed solution for detecting clone nodes but it also has some stern, stunning and uncompromising shortcomings. The contributions of this paper are twofold. First, we have presented a distributed and non-deterministic solution, removing the drawbacks of RED by making enhancements in order to identify and revoke clones. Finally, we have proposed a method for the detection of masked replication attack which is another form or variation of Node replication attack.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129649422","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632140
M. Aloqlah
Dual-hop transmission systems employing fixed-gain amplify-and-forward relay are studied in this paper. The examination has been done for independent and not necessarily identical Extended Generalized-K fading channels. New, exact closed-form expressions are derived for the nth moments of the end-to-end signal-to-noise ratio (SNR). The average end-to-end SNR and the amount of fading (AoF) of the system are also derived. Some numerical plots show that the influence of the power imbalance between the two hops may have gainful or harmful effects on the overall system performance.
{"title":"End-to-end performance analysis of dual-hop relaying systems over Extended Generalized K-fading channels","authors":"M. Aloqlah","doi":"10.1109/ICTEL.2013.6632140","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632140","url":null,"abstract":"Dual-hop transmission systems employing fixed-gain amplify-and-forward relay are studied in this paper. The examination has been done for independent and not necessarily identical Extended Generalized-K fading channels. New, exact closed-form expressions are derived for the nth moments of the end-to-end signal-to-noise ratio (SNR). The average end-to-end SNR and the amount of fading (AoF) of the system are also derived. Some numerical plots show that the influence of the power imbalance between the two hops may have gainful or harmful effects on the overall system performance.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124900848","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632129
Ahmad Jabban, Y. Nasser, M. Hélard
New integrated wireless and mobile networks are emerging to offer a wide range of services through heterogeneous networks anywhere at any time. The promotion towards these networks requires a user-centric approach which could enable users to control their terminal behavior in an efficient way. Each mobile terminal equipped with heterogeneous interfaces can access different network technologies and perform the corresponding services. In this paper, we consider a network selection strategy based on the estimated Signal to Interference-plus-Noise Ratio (SINR) value in an integrated heterogeneous network. Based on the Markov model, we describe the state of the heterogeneous system at any time, taking into account the quality of service (QoS) requirements of all users communicating in the heterogeneous networks. Then we analyze the system performance in terms of the blocking probabilities and connection quality of calls. Moreover, resource blocks allocation for services with different QoS requirements is also analyzed in this paper.
{"title":"Performance analysis of heterogeneous networks based on SINR selection strategy","authors":"Ahmad Jabban, Y. Nasser, M. Hélard","doi":"10.1109/ICTEL.2013.6632129","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632129","url":null,"abstract":"New integrated wireless and mobile networks are emerging to offer a wide range of services through heterogeneous networks anywhere at any time. The promotion towards these networks requires a user-centric approach which could enable users to control their terminal behavior in an efficient way. Each mobile terminal equipped with heterogeneous interfaces can access different network technologies and perform the corresponding services. In this paper, we consider a network selection strategy based on the estimated Signal to Interference-plus-Noise Ratio (SINR) value in an integrated heterogeneous network. Based on the Markov model, we describe the state of the heterogeneous system at any time, taking into account the quality of service (QoS) requirements of all users communicating in the heterogeneous networks. Then we analyze the system performance in terms of the blocking probabilities and connection quality of calls. Moreover, resource blocks allocation for services with different QoS requirements is also analyzed in this paper.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123435252","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632165
B. Sayraç, L. Gueguen, Chung Cong Trang, Ana Galindo-Serrano
In this paper, we propose a statistical estimation framework to estimate Primary User (PU) transmitter locations by using the spatial characterization of spectrum usage in a collaborative spectrum sensing context in Dynamic Spectrum Access (DSA) networks. First, a statistical likelihood model of the received power by collaborating Secondary Users (SUs) is constructed by assuming a propagation model and known PU transmitter locations. The added value of the paper is the improvement of this likelihood model by adding the a priori information on the PU transmitter locations in the form of spatial densities and point interactions taken from the theory of point processes. The resulting models are used in a statistical optimization framework to find the Maximum Likelihood (ML) and Maximum A Posteriori (MAP) estimates of the number of PU transmitters and their locations. Since the ML and the MAP estimations do not accept tractable closed-form analytical formulations, we propose to solve the optimization problems by the numerical Nelder-Mead algorithm. To assess the performance, the resulting random field is considered in the form of an interference map. The effects of the number of collaborating SUs, the shadowing standard deviation and the ratio of the number of SUs to the number of PU transmitters on the estimation quality are also evaluated.
{"title":"Point-process based localization of primary users in collaborative dynamic spectrum access","authors":"B. Sayraç, L. Gueguen, Chung Cong Trang, Ana Galindo-Serrano","doi":"10.1109/ICTEL.2013.6632165","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632165","url":null,"abstract":"In this paper, we propose a statistical estimation framework to estimate Primary User (PU) transmitter locations by using the spatial characterization of spectrum usage in a collaborative spectrum sensing context in Dynamic Spectrum Access (DSA) networks. First, a statistical likelihood model of the received power by collaborating Secondary Users (SUs) is constructed by assuming a propagation model and known PU transmitter locations. The added value of the paper is the improvement of this likelihood model by adding the a priori information on the PU transmitter locations in the form of spatial densities and point interactions taken from the theory of point processes. The resulting models are used in a statistical optimization framework to find the Maximum Likelihood (ML) and Maximum A Posteriori (MAP) estimates of the number of PU transmitters and their locations. Since the ML and the MAP estimations do not accept tractable closed-form analytical formulations, we propose to solve the optimization problems by the numerical Nelder-Mead algorithm. To assess the performance, the resulting random field is considered in the form of an interference map. The effects of the number of collaborating SUs, the shadowing standard deviation and the ratio of the number of SUs to the number of PU transmitters on the estimation quality are also evaluated.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127941339","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632104
Yijing Liu, Lihua Li
In Time Division Duplex (TDD) System, the downlink Channel State Information (CSI) can be acquired by using the channel reciprocity, after Base Station (BS) has acquired uplink CSI through channel estimation. Nevertheless, due to the mobility of Mobile Station (MS), the rapidly varying channel gain may result in the outdated-CSI at transmitter end. Besides, without any feedback mechanism, BS cannot correct the downlink CSI using channel estimation information at MS end, if there exist no perfect channel reciprocity. This paper proposes a novel adaptive multi-step channel prediction mechanism to combat these problems. By deriving the expression of prediction error, BS can adaptively predict CSI of multi-step ahead while keeping the Mean Squared Error (MSE) under a certain threshold. CSI of the rest samples can be acquired through linear interpolation. The complexity at BS end is largely alleviated correspondingly. Moreover, the proposed scheme takes Spatial Channel Model into consideration to reflect real transmission scenario. Simulation results illustrate that the proposed scheme can effectively reduce the complexity while maintaining the MSE under a certain threshold.
{"title":"Adaptive multi-step channel prediction in spatial channel model using Kalman filter","authors":"Yijing Liu, Lihua Li","doi":"10.1109/ICTEL.2013.6632104","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632104","url":null,"abstract":"In Time Division Duplex (TDD) System, the downlink Channel State Information (CSI) can be acquired by using the channel reciprocity, after Base Station (BS) has acquired uplink CSI through channel estimation. Nevertheless, due to the mobility of Mobile Station (MS), the rapidly varying channel gain may result in the outdated-CSI at transmitter end. Besides, without any feedback mechanism, BS cannot correct the downlink CSI using channel estimation information at MS end, if there exist no perfect channel reciprocity. This paper proposes a novel adaptive multi-step channel prediction mechanism to combat these problems. By deriving the expression of prediction error, BS can adaptively predict CSI of multi-step ahead while keeping the Mean Squared Error (MSE) under a certain threshold. CSI of the rest samples can be acquired through linear interpolation. The complexity at BS end is largely alleviated correspondingly. Moreover, the proposed scheme takes Spatial Channel Model into consideration to reflect real transmission scenario. Simulation results illustrate that the proposed scheme can effectively reduce the complexity while maintaining the MSE under a certain threshold.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"63 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114108411","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632127
M. Hasan, K. Arshad
ZigBee is a low-power, short range wireless technology for machine to machine communications and uses the IEEE802.15.4 standard. ZigBee networks are being widely used in applications such as home automation, automatic meter reading systems, sensor networks and home security systems. The orphan node problem is a well-known problem in ZigBee networks. In this paper, we develop a protocol to address the orphan node problem by integrating the concept of cognitive ZigBee nodes that are able to self-configure. Our proposed scheme works by quickly eliminating the failed nodes and then self-configuring the network in order to reconnect the orphan nodes in a cognitive manner. We evaluated the performance of our proposed scheme by conducting experiments at the Mobile and Wireless Research Laboratory (MWRL) based at the University of Greenwich.
{"title":"Robust home automation scheme using cognitive ZigBee network","authors":"M. Hasan, K. Arshad","doi":"10.1109/ICTEL.2013.6632127","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632127","url":null,"abstract":"ZigBee is a low-power, short range wireless technology for machine to machine communications and uses the IEEE802.15.4 standard. ZigBee networks are being widely used in applications such as home automation, automatic meter reading systems, sensor networks and home security systems. The orphan node problem is a well-known problem in ZigBee networks. In this paper, we develop a protocol to address the orphan node problem by integrating the concept of cognitive ZigBee nodes that are able to self-configure. Our proposed scheme works by quickly eliminating the failed nodes and then self-configuring the network in order to reconnect the orphan nodes in a cognitive manner. We evaluated the performance of our proposed scheme by conducting experiments at the Mobile and Wireless Research Laboratory (MWRL) based at the University of Greenwich.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124531800","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632065
D. P. Huy, S. B. Halima, M. Hélard
Time Reversal (TR) is a pre-filtering technique for Multiple Input Multiple Output (MIMO) wireless systems, which achieves optimum performance with a low complexity receiver such as the Dumb Receiver (DR) (a single tap receiver), when it is operated at low receive Signal to Noise Ratio (SNR). TR is thus an interesting candidate for green systems working at low receive SNRs. However, the probability to meet these optimality conditions, in a practical indoor deployment, is still unknown today. For the first time, we propose to evaluate a map of the ratio between the DR throughput and the Perfect Receiver (PR) throughput, i.e. the Dumb-to-Perfect Receiver Throughput Ratio (DPRTR), in a typical indoor deployment scenario. Contrary to previous works, our paper is based on system level simulations, enabling to collect statistical results, and is based on non-simplified analytical Post Receiver Signal-To-Interference and Noise Ratio (SINR) formulas, enabling to measure the exact distance from the optimum. The SINR formulas include exact inter-symbol and multi-stream interference terms. Based on simulations results, we show that a single access point with a power as low as 0dBm (as it could be expected in a green system) spread over a huge bandwidth of 100MHz, the DPRTR metric reaches at least 50%, in regions of the map around the transmitter, and achieves up to 100% in all other regions.
{"title":"Dumb-to-perfect receiver throughput ratio maps of a time reversal wireless indoor system","authors":"D. P. Huy, S. B. Halima, M. Hélard","doi":"10.1109/ICTEL.2013.6632065","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632065","url":null,"abstract":"Time Reversal (TR) is a pre-filtering technique for Multiple Input Multiple Output (MIMO) wireless systems, which achieves optimum performance with a low complexity receiver such as the Dumb Receiver (DR) (a single tap receiver), when it is operated at low receive Signal to Noise Ratio (SNR). TR is thus an interesting candidate for green systems working at low receive SNRs. However, the probability to meet these optimality conditions, in a practical indoor deployment, is still unknown today. For the first time, we propose to evaluate a map of the ratio between the DR throughput and the Perfect Receiver (PR) throughput, i.e. the Dumb-to-Perfect Receiver Throughput Ratio (DPRTR), in a typical indoor deployment scenario. Contrary to previous works, our paper is based on system level simulations, enabling to collect statistical results, and is based on non-simplified analytical Post Receiver Signal-To-Interference and Noise Ratio (SINR) formulas, enabling to measure the exact distance from the optimum. The SINR formulas include exact inter-symbol and multi-stream interference terms. Based on simulations results, we show that a single access point with a power as low as 0dBm (as it could be expected in a green system) spread over a huge bandwidth of 100MHz, the DPRTR metric reaches at least 50%, in regions of the map around the transmitter, and achieves up to 100% in all other regions.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129691390","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
扫码关注我们
求助内容：
应助结果提醒方式：