Pub Date : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762669
Y. Abbosh, A. Yahya, A. Abbosh
This paper investigates the use of neural networks to detect and locate early breast cancer using a simple feed-forward back-propagation neural network. In order to test the proposed algorithm, an electromagnetic simulator is used to build a three-dimensional breast model. Spherical tumors of radii 1 mm, 2 mm, 4 mm, and 5 mm are assumed to be at different locations in the breast model. An ultra-wideband pulse is transmitted towards the breast model and four probes are located around the breast to capture the scattered signals. The collected signals are then analyzed using the neural networks to get useful information concerning the presence or otherwise of the tumor and its location if it does exist. The obtained results from using the proposed method are promising with 100% success in the detection and 95% success in the localization.
{"title":"Neural networks for the detection and localization of breast cancer","authors":"Y. Abbosh, A. Yahya, A. Abbosh","doi":"10.1109/ICCITECHNOL.2011.5762669","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762669","url":null,"abstract":"This paper investigates the use of neural networks to detect and locate early breast cancer using a simple feed-forward back-propagation neural network. In order to test the proposed algorithm, an electromagnetic simulator is used to build a three-dimensional breast model. Spherical tumors of radii 1 mm, 2 mm, 4 mm, and 5 mm are assumed to be at different locations in the breast model. An ultra-wideband pulse is transmitted towards the breast model and four probes are located around the breast to capture the scattered signals. The collected signals are then analyzed using the neural networks to get useful information concerning the presence or otherwise of the tumor and its location if it does exist. The obtained results from using the proposed method are promising with 100% success in the detection and 95% success in the localization.","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127793432","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 : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762682
S. Elnoubi, W. Abdallah, Mohamed M. M. Omar
In this paper, we propose a Minimum Bit Error Rate (MBER) beamforming combined with Space-Time Block Coding (STBC) according to the number of antenna array. A class of adaptive beamforming algorithm has been proposed based on minimizing the BER cost function directly. Consequently, MBER beamforming is capable of providing significant performance gains in terms of a reduced BER. The beamforming weights of the combined system are optimized in such a way that the virtual channel coefficients corresponding to STBC-encoded data streams, seen at the receiver, are guaranteed to be uncorrelated. Therefore the promised achievable diversity order by conventional system with STBC can be obtained completely. Combined MBER beamforming with STBC single array performance measured by BER is compared under the condition of direction of arrival (DOA) and signal-to-noise ratio (SNR). The numerical simulation results of the proposed technique show that this minimum BER (MBER) approach utilizes the antenna array elements more intelligently and have a performance dependent of DOA and angular spread (AS).
{"title":"Minimum Bit Error Rate beamforming combined with Space-Time Block Coding","authors":"S. Elnoubi, W. Abdallah, Mohamed M. M. Omar","doi":"10.1109/ICCITECHNOL.2011.5762682","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762682","url":null,"abstract":"In this paper, we propose a Minimum Bit Error Rate (MBER) beamforming combined with Space-Time Block Coding (STBC) according to the number of antenna array. A class of adaptive beamforming algorithm has been proposed based on minimizing the BER cost function directly. Consequently, MBER beamforming is capable of providing significant performance gains in terms of a reduced BER. The beamforming weights of the combined system are optimized in such a way that the virtual channel coefficients corresponding to STBC-encoded data streams, seen at the receiver, are guaranteed to be uncorrelated. Therefore the promised achievable diversity order by conventional system with STBC can be obtained completely. Combined MBER beamforming with STBC single array performance measured by BER is compared under the condition of direction of arrival (DOA) and signal-to-noise ratio (SNR). The numerical simulation results of the proposed technique show that this minimum BER (MBER) approach utilizes the antenna array elements more intelligently and have a performance dependent of DOA and angular spread (AS).","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126164484","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 : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762700
A. Helmy, H. Fathallah
Several centralized algorithms have been proposed for upstream bandwidth-allocation in passive optical networks (PONs); making the optical line terminal (OLT) in the central office the intelligent device that arbitrates time-division access to the shared upstream channel. When the distance between the OLT and optical network units (ONUs) is extended from 20 km to beyond 100 km, as suggested by next generation long-reach PONs, it becomes difficult for centralized algorithms to support service differentiation required for real-time applications. This is because these algorithms are based on bandwidth negotiation messages frequently exchanged between the OLT and ONUs, which become seriously delayed, when the network is extended, causing the performance to degrade. In this paper, we propose a distributed scheme for the emerging LR-PON while also allowing centralized control over the access network. Simulation results show that the average upstream packet delay can be significantly decreased below that of centralized algorithms while maintaining a high throughput.
{"title":"Taking Turns with adaptive cycle time - an upstream media access scheme for extended-reach FTTx","authors":"A. Helmy, H. Fathallah","doi":"10.1109/ICCITECHNOL.2011.5762700","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762700","url":null,"abstract":"Several centralized algorithms have been proposed for upstream bandwidth-allocation in passive optical networks (PONs); making the optical line terminal (OLT) in the central office the intelligent device that arbitrates time-division access to the shared upstream channel. When the distance between the OLT and optical network units (ONUs) is extended from 20 km to beyond 100 km, as suggested by next generation long-reach PONs, it becomes difficult for centralized algorithms to support service differentiation required for real-time applications. This is because these algorithms are based on bandwidth negotiation messages frequently exchanged between the OLT and ONUs, which become seriously delayed, when the network is extended, causing the performance to degrade. In this paper, we propose a distributed scheme for the emerging LR-PON while also allowing centralized control over the access network. Simulation results show that the average upstream packet delay can be significantly decreased below that of centralized algorithms while maintaining a high throughput.","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130588974","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 : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762672
Lutful Karim, N. Nasser, Tarek El Salti
Recently many Wireless Sensor Network (WSN)-based agriculture monitoring systems have been implemented mostly for developed countries. WSN in these monitoring systems uses tree topology and multi-hop dynamic flooding routing protocol that are not energy efficient and has a single point of failure. Though some protocols use zone-based routing they consider that a large number of sensors are deployed to achieve more precision, which is expensive and not feasible in developing countries. In this paper, we propose Energy Efficient Zone-based Routing Protocol (EEZRP) that work by deploying a minimum number of sensor nodes for agricultural monitoring in developing countries. Experimental results show that EEZRP protocol outperforms the existing LEACH and DSC protocols in terms of network lifetime.
{"title":"Efficient Zone-based Routing Protocol of Sensor Network in agriculture monitoring systems","authors":"Lutful Karim, N. Nasser, Tarek El Salti","doi":"10.1109/ICCITECHNOL.2011.5762672","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762672","url":null,"abstract":"Recently many Wireless Sensor Network (WSN)-based agriculture monitoring systems have been implemented mostly for developed countries. WSN in these monitoring systems uses tree topology and multi-hop dynamic flooding routing protocol that are not energy efficient and has a single point of failure. Though some protocols use zone-based routing they consider that a large number of sensors are deployed to achieve more precision, which is expensive and not feasible in developing countries. In this paper, we propose Energy Efficient Zone-based Routing Protocol (EEZRP) that work by deploying a minimum number of sensor nodes for agricultural monitoring in developing countries. Experimental results show that EEZRP protocol outperforms the existing LEACH and DSC protocols in terms of network lifetime.","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130101356","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 : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762671
H. Tran, A. Mellouk
In order to successfully resolve the network infrastructure's problems the network provider has to improve the service quality. However in traditional ways, maintaining and improving of the service quality are generally determined in terms of quality of service criteria, not in terms of satisfaction and perception to the end-user. The latter is represented by Quality of Experience (QoE) that becomes recently the most important tendency to guarantee the quality of network services. QoE represents the subjective perception of end-users using network services with network functions such as admission control, resource management, routing, traffic control, etc. In this paper, we focus on routing mechanism driven by QoE end-users. Today, NP-complete is one of the most routing algorithm problems when trying to satisfy multi QoS constraints criteria simultaneously. In order to avoid the classification problem of these multiple criteria reducing the complexity problem for the future Internet, we propose two protocols based on user QoE measurement in routing paradigm to construct an adaptive and evolutionary system. Our first approach is a routing driven by terminal QoE basing on a least squares reinforcement learning technique called Least Squares Policy Iteration. The second approach, namely QQAR (QoE Q-learning based Adaptive Routing), is a improvement of the first one. QQAR basing on Q-Learning, a Reinforcement Learning algorithm, uses Pseudo Subjective Quality Assessment (PSQA), a real-time QoE assessment tool based on Random Neural Network, to evaluate QoE. Experimental results showed a significant performance against over other traditional routing protocols.
为了成功地解决网络基础设施的问题，网络提供商必须提高服务质量。然而，在传统方法中，维持和改善服务质素一般是根据服务质素准则来决定，而不是根据最终用户的满意程度和感知来决定。后者以体验质量(Quality of Experience, QoE)为代表，它已成为保证网络服务质量的最重要趋势。QoE是终端用户使用具有网络功能(如准入控制、资源管理、路由、流量控制等)的网络服务的主观感受。本文主要研究由QoE终端用户驱动的路由机制。目前，np完备是试图同时满足多个QoS约束条件的路由算法中最常见的问题之一。为了避免这些多准则的分类问题，降低未来互联网的复杂性问题，我们提出了两种基于路由范式中用户QoE度量的协议来构建一个自适应和进化的系统。我们的第一种方法是基于最小二乘强化学习技术(称为最小二乘策略迭代)的终端QoE驱动路由。第二种方法，即QQAR (QoE基于q学习的自适应路由)，是对第一种方法的改进。基于强化学习算法Q-Learning的QQAR，使用基于随机神经网络的实时QoE评估工具伪主观质量评估(PSQA)来评估QoE。实验结果表明，与其他传统路由协议相比，该协议具有显著的性能。
{"title":"Real-Time state-dependent routing based on user perception","authors":"H. Tran, A. Mellouk","doi":"10.1109/ICCITECHNOL.2011.5762671","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762671","url":null,"abstract":"In order to successfully resolve the network infrastructure's problems the network provider has to improve the service quality. However in traditional ways, maintaining and improving of the service quality are generally determined in terms of quality of service criteria, not in terms of satisfaction and perception to the end-user. The latter is represented by Quality of Experience (QoE) that becomes recently the most important tendency to guarantee the quality of network services. QoE represents the subjective perception of end-users using network services with network functions such as admission control, resource management, routing, traffic control, etc. In this paper, we focus on routing mechanism driven by QoE end-users. Today, NP-complete is one of the most routing algorithm problems when trying to satisfy multi QoS constraints criteria simultaneously. In order to avoid the classification problem of these multiple criteria reducing the complexity problem for the future Internet, we propose two protocols based on user QoE measurement in routing paradigm to construct an adaptive and evolutionary system. Our first approach is a routing driven by terminal QoE basing on a least squares reinforcement learning technique called Least Squares Policy Iteration. The second approach, namely QQAR (QoE Q-learning based Adaptive Routing), is a improvement of the first one. QQAR basing on Q-Learning, a Reinforcement Learning algorithm, uses Pseudo Subjective Quality Assessment (PSQA), a real-time QoE assessment tool based on Random Neural Network, to evaluate QoE. Experimental results showed a significant performance against over other traditional routing protocols.","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125575574","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 : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762683
J. Karam
The construction of Daubechies orthogonal mother wavelet via two channel perfect reconstruction filter bank requires the identification of necessary conditions that the coefficients of the filters and the roots of binomial polynomials associated with it should exhibit. In this paper, a particular class of polynomials is derived from such construction. It bears as coefficients the ratios of those of the binomial polynomials. Limits for the roots of this family of polynomials are derived and the conditions for obtaining optimum radius are identified.
{"title":"Sharpening the limits of the zeros of Daubechies wavelets related polynomials","authors":"J. Karam","doi":"10.1109/ICCITECHNOL.2011.5762683","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762683","url":null,"abstract":"The construction of Daubechies orthogonal mother wavelet via two channel perfect reconstruction filter bank requires the identification of necessary conditions that the coefficients of the filters and the roots of binomial polynomials associated with it should exhibit. In this paper, a particular class of polynomials is derived from such construction. It bears as coefficients the ratios of those of the binomial polynomials. Limits for the roots of this family of polynomials are derived and the conditions for obtaining optimum radius are identified.","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114801766","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 : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762668
R. Shubair, S. Jimaa, R. Hamila, M. A. Al-Tunaije
This paper presents the design and analysis of smart antenna systems used for the detection and estimation of correlated radio signals encountered in multipath environments using circular antenna arrays. The MUSIC algorithm along with spatial smoothing is used for this purpose. A Matlab-based graphical user interface (GUI) toolbox is designed specifically for this purpose. The toolbox allows for studying the effect of varying those related to circular antenna array itself as well as those related to the surrounding environment.
{"title":"On the detection and estimation of correlated signal using circular antenna arrays","authors":"R. Shubair, S. Jimaa, R. Hamila, M. A. Al-Tunaije","doi":"10.1109/ICCITECHNOL.2011.5762668","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762668","url":null,"abstract":"This paper presents the design and analysis of smart antenna systems used for the detection and estimation of correlated radio signals encountered in multipath environments using circular antenna arrays. The MUSIC algorithm along with spatial smoothing is used for this purpose. A Matlab-based graphical user interface (GUI) toolbox is designed specifically for this purpose. The toolbox allows for studying the effect of varying those related to circular antenna array itself as well as those related to the surrounding environment.","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114510637","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 : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762698
H. Abed, Ala Al-Fuqaha, A. Aljaafreh
In this paper, we present a Failure Prediction System (FPS) using a novel algorithm that extracts frequent anomalous behaviors based on multi-scale trend analysis of multiple network parameters. The proposed Correlation Analysis Across Parameters algorithm (CAAP) utilizes multiple levels of timescale analysis to reveal the frequent anomalous behaviors. The CAAP philosophy is that failures usually do not occur because of change in a single parameter behavior; instead, a set of interrelated parameters change their behaviors jointly and lead to a particular failure. The proposed algorithm requires an enhanced version of FABM algorithm which was presented by the authors in a previous paper and was used to analyze each parameter's behavior individually. Moreover, the new version, called FABMG algorithm, has the same polynomial computational complexity of O(n2). The CAAP utilizes the data mining techniques of association rules mining in order to reveal the existed correlation relationships. Consequently, as found in this work, this approach improves the quality of the FPS results which was relying on individual parameter analysis only. One of the strengths of CAAP is that it requires the FABMG output only, i.e. it does not require rescanning the database in order to produce the correlation results.
{"title":"Failure Prediction based on multi-parameter analysis in support of autonomic networks","authors":"H. Abed, Ala Al-Fuqaha, A. Aljaafreh","doi":"10.1109/ICCITECHNOL.2011.5762698","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762698","url":null,"abstract":"In this paper, we present a Failure Prediction System (FPS) using a novel algorithm that extracts frequent anomalous behaviors based on multi-scale trend analysis of multiple network parameters. The proposed Correlation Analysis Across Parameters algorithm (CAAP) utilizes multiple levels of timescale analysis to reveal the frequent anomalous behaviors. The CAAP philosophy is that failures usually do not occur because of change in a single parameter behavior; instead, a set of interrelated parameters change their behaviors jointly and lead to a particular failure. The proposed algorithm requires an enhanced version of FABM algorithm which was presented by the authors in a previous paper and was used to analyze each parameter's behavior individually. Moreover, the new version, called FABMG algorithm, has the same polynomial computational complexity of O(n2). The CAAP utilizes the data mining techniques of association rules mining in order to reveal the existed correlation relationships. Consequently, as found in this work, this approach improves the quality of the FPS results which was relying on individual parameter analysis only. One of the strengths of CAAP is that it requires the FABMG output only, i.e. it does not require rescanning the database in order to produce the correlation results.","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124135853","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 : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762676
Jia Huang, H. Shahnasser
In performance studies of vehicular ad hoc networks, intelligent simulation tools like NS-2 plays an important role. Since Tcl scripts are widely used, we have implemented a new tool which is MyTool for generating Tcl scripts file. In this work, we introduce the specific characteristics of MyTool and discuss its features compared with NSG2 (NS-2 Scenarios Generator 2). In later section, we illustrate one wireless communication network's example to explain how MyTool does work to build up communication network, create the Tcl script files and finally run the simulation in NS-2.
{"title":"A preprocessor Tcl script generator for NS-2 communication network simulation","authors":"Jia Huang, H. Shahnasser","doi":"10.1109/ICCITECHNOL.2011.5762676","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762676","url":null,"abstract":"In performance studies of vehicular ad hoc networks, intelligent simulation tools like NS-2 plays an important role. Since Tcl scripts are widely used, we have implemented a new tool which is MyTool for generating Tcl scripts file. In this work, we introduce the specific characteristics of MyTool and discuss its features compared with NSG2 (NS-2 Scenarios Generator 2). In later section, we illustrate one wireless communication network's example to explain how MyTool does work to build up communication network, create the Tcl script files and finally run the simulation in NS-2.","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132006777","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 : 2011-03-29DOI: 10.1109/ICCITECHNOL.2011.5762685
O. F. Rodriguez, S. Primak, V. Kontorovich
A spectrum sensing technique for Cognitive Radio (CR) Networks based on the Sequential Analysis of A.Wald is applied to partially coherent channel scenarios. It is shown that using Wald's test, it is possible to reduce the number of samples required to detect the presence of the primary user by approximately a factor of 2 in comparison to the well known Neyman-Pearson test. An expression for the Wald test statistic for the case of partially coherent channel is derived. Effects of phase uncertainty on the performance of the test is investigated.
{"title":"On performance of the Wald test in partially coherent Cognitive Radio channels","authors":"O. F. Rodriguez, S. Primak, V. Kontorovich","doi":"10.1109/ICCITECHNOL.2011.5762685","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2011.5762685","url":null,"abstract":"A spectrum sensing technique for Cognitive Radio (CR) Networks based on the Sequential Analysis of A.Wald is applied to partially coherent channel scenarios. It is shown that using Wald's test, it is possible to reduce the number of samples required to detect the presence of the primary user by approximately a factor of 2 in comparison to the well known Neyman-Pearson test. An expression for the Wald test statistic for the case of partially coherent channel is derived. Effects of phase uncertainty on the performance of the test is investigated.","PeriodicalId":211631,"journal":{"name":"2011 International Conference on Communications and Information Technology (ICCIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127574943","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
扫码关注我们
求助内容：
应助结果提醒方式：