Pub Date : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503857
Chin-Liang Wang, Jyun-Yu Chen, Hung-Chin Wang
In this paper, we investigate the effect of channel estimation errors on the capacity of amplify-and-forward cooperative relay systems. Since an exact capacity expression in the presence of channel estimation errors is difficult to be found, we turn to derive its lower bound instead. Accordingly, by maximizing the derived lower bound, we propose power allocation schemes for both single-relay and multi-relay systems. For single-relay systems, an analytical solution for inequality constrained problem is too complicated to be obtained. Thus, we propose a gradient descent algorithm with a log-barrier function to solve the inequality constrained problem. For multi-relay systems, in terms of the channel estimates and the corresponding mean-squared errors, we provide a water-filling solution for the optimal power allocation among the relays. Simulation results show that the proposed power allocation schemes yield capacity gain compared with equal power allocation at low to medium signal-to-noise ratios.
{"title":"Capacity analysis and power allocation under imperfect channel estimation for AF-based cooperative relay systems","authors":"Chin-Liang Wang, Jyun-Yu Chen, Hung-Chin Wang","doi":"10.1109/GLOCOM.2012.6503857","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503857","url":null,"abstract":"In this paper, we investigate the effect of channel estimation errors on the capacity of amplify-and-forward cooperative relay systems. Since an exact capacity expression in the presence of channel estimation errors is difficult to be found, we turn to derive its lower bound instead. Accordingly, by maximizing the derived lower bound, we propose power allocation schemes for both single-relay and multi-relay systems. For single-relay systems, an analytical solution for inequality constrained problem is too complicated to be obtained. Thus, we propose a gradient descent algorithm with a log-barrier function to solve the inequality constrained problem. For multi-relay systems, in terms of the channel estimates and the corresponding mean-squared errors, we provide a water-filling solution for the optimal power allocation among the relays. Simulation results show that the proposed power allocation schemes yield capacity gain compared with equal power allocation at low to medium signal-to-noise ratios.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"65 1","pages":"4677-4682"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83951781","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503338
Ying An, Jiawei Huang, Hong Song, Jianxin Wang
End-to-end reliability in Delay Tolerant Networks (DTNs) is challenging and complicated because of high delay and absence of stable end-to-end path in the intermittently-connected mobile environment. Some existing acknowledgement mechanisms use active forwarding to provide the end-to-end reliability, while incurring excessive retransmissions or replications. The other passive mechanisms aim to reduce the storage overhead but may suffer a large delay. To improve the storage-delay tradeoff, we propose a Congestion Level based end-to-end ACKnowledgement (CL-ACK) mechanism, which adaptively adjusts the spread manner of ACK packets according to the ratio of drops over replications. Simulation results show that CL-ACK effectively controls resources consumption, reduces end-to-end delay, and achieves high message delivery rate.
{"title":"A Congestion Level based end-to-end acknowledgement mechanism for Delay Tolerant Networks","authors":"Ying An, Jiawei Huang, Hong Song, Jianxin Wang","doi":"10.1109/GLOCOM.2012.6503338","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503338","url":null,"abstract":"End-to-end reliability in Delay Tolerant Networks (DTNs) is challenging and complicated because of high delay and absence of stable end-to-end path in the intermittently-connected mobile environment. Some existing acknowledgement mechanisms use active forwarding to provide the end-to-end reliability, while incurring excessive retransmissions or replications. The other passive mechanisms aim to reduce the storage overhead but may suffer a large delay. To improve the storage-delay tradeoff, we propose a Congestion Level based end-to-end ACKnowledgement (CL-ACK) mechanism, which adaptively adjusts the spread manner of ACK packets according to the ratio of drops over replications. Simulation results show that CL-ACK effectively controls resources consumption, reduces end-to-end delay, and achieves high message delivery rate.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"44 1","pages":"1574-1579"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90491858","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503123
Qinghua Shen, W. Zhuang
Delay constraint and sensor energy consumption requirements are two core issues for e-healthcare applications in wireless body area networks. In this paper, we investigate the data transmission scheduling problem to utilize the sleep and opportunistic transmission for energy efficiency, while guaran- teeing the worst-case delay for medical data transmission. To achieve sensor energy saving by exploiting propagation channel quality with a deterministic delay requirement poses challenges in developing a scheduling policy. We address this problem using a Lyapunov optimization formulation and propose a two-step scheduling algorithm. We prove that the algorithm can provide worst-case delay guarantee under certain conditions. Theoretical analysis and simulation results are presented to demonstrate the tradeoff between the transmission delay and energy consumption.
{"title":"Energy efficient scheduling for delay constrained communication in wireless body area networks","authors":"Qinghua Shen, W. Zhuang","doi":"10.1109/GLOCOM.2012.6503123","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503123","url":null,"abstract":"Delay constraint and sensor energy consumption requirements are two core issues for e-healthcare applications in wireless body area networks. In this paper, we investigate the data transmission scheduling problem to utilize the sleep and opportunistic transmission for energy efficiency, while guaran- teeing the worst-case delay for medical data transmission. To achieve sensor energy saving by exploiting propagation channel quality with a deterministic delay requirement poses challenges in developing a scheduling policy. We address this problem using a Lyapunov optimization formulation and propose a two-step scheduling algorithm. We prove that the algorithm can provide worst-case delay guarantee under certain conditions. Theoretical analysis and simulation results are presented to demonstrate the tradeoff between the transmission delay and energy consumption.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"14 1","pages":"262-267"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74691453","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503406
Yan Zhang, Xu Zhou, Xuezhen Zhang, Shuhao Liu, D. Liao
In P2P file sharing systems over mobile cellular networks, the bottleneck of file transfer speed is usually the downlink bandwidth of the receiver rather than the uplink bandwidth of the senders. In this paper we consider the impact of downlink bandwidth limitation on file transfer speed and propose two novel peer selection algorithms named DBaT-B and DBaT-N, which are designed for two different cases of the requesting peer's demand respectively. Our algorithms take the requesting peer's downlink bandwidth as the target of the sum of the selected peers' uplink bandwidth. To ensure load balance on cells, they will first choose a cell with the lowest traffic load before choosing each peer. We also provide a Fuzzy Cognitive Map that can be used to estimate peers' service ability in P2P systems over mobile cellular networks. Simulation results show that in respective cases DBaT-B and DBaT-N can both achieve much better load balance on cells than some traditional algorithms while ensuring favorable file transfer speed.
{"title":"Peer selection in P2P file sharing systems over mobile cellular networks with consideration of downlink bandwidth limitation","authors":"Yan Zhang, Xu Zhou, Xuezhen Zhang, Shuhao Liu, D. Liao","doi":"10.1109/GLOCOM.2012.6503406","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503406","url":null,"abstract":"In P2P file sharing systems over mobile cellular networks, the bottleneck of file transfer speed is usually the downlink bandwidth of the receiver rather than the uplink bandwidth of the senders. In this paper we consider the impact of downlink bandwidth limitation on file transfer speed and propose two novel peer selection algorithms named DBaT-B and DBaT-N, which are designed for two different cases of the requesting peer's demand respectively. Our algorithms take the requesting peer's downlink bandwidth as the target of the sum of the selected peers' uplink bandwidth. To ensure load balance on cells, they will first choose a cell with the lowest traffic load before choosing each peer. We also provide a Fuzzy Cognitive Map that can be used to estimate peers' service ability in P2P systems over mobile cellular networks. Simulation results show that in respective cases DBaT-B and DBaT-N can both achieve much better load balance on cells than some traditional algorithms while ensuring favorable file transfer speed.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"40 1","pages":"1981-1987"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84588451","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503907
Kuhn-Chang Lin, Jiun-You Lai, Y. Su
Energy-efficient scheduling problem in wireless communication system is investigated in this paper. We propose two near-optimal schedulers which have simple structures for the general hard delay constraint scenario. Both single-user and multiuser cases are considered. The first scheduler invokes Gaussian approximation while the second one is inspired by the inverse water-filling (IWF) approach. The scheduling policies consist of a channel-awareness term and a delay-awareness term. Numerical results show that the proposed policies achieve near optimal performance when the total required transmit bits, R, is large. For the multiuser scenario, our scheduling strategy consists of an initial resource (number of time slots) allocation and a slot-by-slot user selection and bit loading algorithm. The former depends on the rate requirement and a priori knowledge of user-dependent channel statistic while the latter use an order statistic based approach designed to minimize the expected total energy consumption.
{"title":"Energy-efficient scheduling for wireless communication system","authors":"Kuhn-Chang Lin, Jiun-You Lai, Y. Su","doi":"10.1109/GLOCOM.2012.6503907","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503907","url":null,"abstract":"Energy-efficient scheduling problem in wireless communication system is investigated in this paper. We propose two near-optimal schedulers which have simple structures for the general hard delay constraint scenario. Both single-user and multiuser cases are considered. The first scheduler invokes Gaussian approximation while the second one is inspired by the inverse water-filling (IWF) approach. The scheduling policies consist of a channel-awareness term and a delay-awareness term. Numerical results show that the proposed policies achieve near optimal performance when the total required transmit bits, R, is large. For the multiuser scenario, our scheduling strategy consists of an initial resource (number of time slots) allocation and a slot-by-slot user selection and bit loading algorithm. The former depends on the rate requirement and a priori knowledge of user-dependent channel statistic while the latter use an order statistic based approach designed to minimize the expected total energy consumption.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"82 1","pages":"4969-4974"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85409703","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503218
Xiaobo Ma, Jianfeng Li, Jing Tao, X. Guan
Domain names play an increasingly important role for the botnet activities. Traditionally, DNS traces from several local DNS servers are used passively to measure the DNS query behavior. However, since botnets are a wide-scale threat and usually reside in geographically dispersed networks, the vantage point of several local DNS servers is sometimes too small to help us understand the DNS query behavior (e.g., whether queried or not, average query rate) of botnets. In this paper, we actively measure the DNS query behavior of botnets in geographically dispersed networks via the DNS cache probing technique. We first analytically characterize how multiple domain names are queried by botnets in different networks under certain circumstances. Then, we actively measure real botnet samples in the wild to gain insight into how multiple domain names are queried by botnets in 480 geographically dispersed networks globally, and show that our analytical characterization well describes the DNS query behavior of the botnet samples. The active measurement technique can help to acquire extensive DNS query information in different networks and thus potentially facilitate various DNS-related research and applications.
{"title":"Towards active measurement for DNS query behavior of botnets","authors":"Xiaobo Ma, Jianfeng Li, Jing Tao, X. Guan","doi":"10.1109/GLOCOM.2012.6503218","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503218","url":null,"abstract":"Domain names play an increasingly important role for the botnet activities. Traditionally, DNS traces from several local DNS servers are used passively to measure the DNS query behavior. However, since botnets are a wide-scale threat and usually reside in geographically dispersed networks, the vantage point of several local DNS servers is sometimes too small to help us understand the DNS query behavior (e.g., whether queried or not, average query rate) of botnets. In this paper, we actively measure the DNS query behavior of botnets in geographically dispersed networks via the DNS cache probing technique. We first analytically characterize how multiple domain names are queried by botnets in different networks under certain circumstances. Then, we actively measure real botnet samples in the wild to gain insight into how multiple domain names are queried by botnets in 480 geographically dispersed networks globally, and show that our analytical characterization well describes the DNS query behavior of the botnet samples. The active measurement technique can help to acquire extensive DNS query information in different networks and thus potentially facilitate various DNS-related research and applications.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"12 1","pages":"845-849"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82301012","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503203
Chin-Fu Ku, Kai-Hsiang Yang, Jan-Ming Ho
In network applications with security constraints, it is usually desirable to disseminate a file from a server through trusted network channels to a set of peers. This is a problem seldom studied in the literature though the problems of data integrity and security have been studied by many. In this paper, we study the file dissemination problem with trust relation modeled as a rooted full binary tree. We present the OOFD algorithm to schedule dissemination of the file iteratively from each peer holding a replica of the file to one of its descendants on the binary tree. We show that, in a homogeneous network, OOFD algorithm is optimum in the sense that time it takes to disseminate the file to all nodes is minimized.
{"title":"An optimal scheduling for file dissemination under a full binary tree of trust relationship","authors":"Chin-Fu Ku, Kai-Hsiang Yang, Jan-Ming Ho","doi":"10.1109/GLOCOM.2012.6503203","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503203","url":null,"abstract":"In network applications with security constraints, it is usually desirable to disseminate a file from a server through trusted network channels to a set of peers. This is a problem seldom studied in the literature though the problems of data integrity and security have been studied by many. In this paper, we study the file dissemination problem with trust relation modeled as a rooted full binary tree. We present the OOFD algorithm to schedule dissemination of the file iteratively from each peer holding a replica of the file to one of its descendants on the binary tree. We show that, in a homogeneous network, OOFD algorithm is optimum in the sense that time it takes to disseminate the file to all nodes is minimized.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"70 1","pages":"751-757"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89106820","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503945
Wei-Te Wong, Ya-Ju Yu, Ai-Chun Pang
Given the explosive growth of mobile subscribers, network operators have to densely deploy base stations to serve the exponentially increasing access demands. Nevertheless, recent researches have pointed out that base station operation has been identified as a significant portion of total system energy consumption and 90% of the traffic is carried by only 40% of base stations even under peak traffic demand. Therefore, switching off underutilized base stations for saving power is an important issue with the increasing awareness of environmental responsibility and economical concerns of network operators. This paper targets the problem of dynamic base station operation, with an objective to minimize total power consumption of all base stations. We prove this problem is NP-hard and cannot be approximated in polynomial time with a ratio better than 3 over 2. Then, we propose a distributed algorithm to tackle it. The simulation results show that our proposed algorithm can significantly reduce the network power consumption.
{"title":"Decentralized energy-efficient base station operation for green cellular networks","authors":"Wei-Te Wong, Ya-Ju Yu, Ai-Chun Pang","doi":"10.1109/GLOCOM.2012.6503945","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503945","url":null,"abstract":"Given the explosive growth of mobile subscribers, network operators have to densely deploy base stations to serve the exponentially increasing access demands. Nevertheless, recent researches have pointed out that base station operation has been identified as a significant portion of total system energy consumption and 90% of the traffic is carried by only 40% of base stations even under peak traffic demand. Therefore, switching off underutilized base stations for saving power is an important issue with the increasing awareness of environmental responsibility and economical concerns of network operators. This paper targets the problem of dynamic base station operation, with an objective to minimize total power consumption of all base stations. We prove this problem is NP-hard and cannot be approximated in polynomial time with a ratio better than 3 over 2. Then, we propose a distributed algorithm to tackle it. The simulation results show that our proposed algorithm can significantly reduce the network power consumption.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"30 1","pages":"5194-5200"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88327830","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503379
Lanjie Zhai, Hong Ji, Xi Li, Yiwen Tang
Cooperative relaying technology among secondary users (SUs) in cognitive radio networks (CRN) is shown to yield a significant performance improvement, such as improving spectrum utilization as well as system fairness in CRN. This paper investigates the problem of the relay selection and resource allocation in a downlink OFDMA cognitive relay network. The objective of this optimization problem is to maximize both system throughput and system fairness, which is achieved through our proposed non-transferable utility coalition graph game algorithm (NTU-CGGA). In this algorithm, the SUs with more available channels can help SUs with less available channels to improve their utility in terms of the throughput and fairness by forming a directed tree graph. The coalition graph is formatted according to spectrum availability and traffic demands of SUs by using merge-split rule. So it can effectively exploit both space and frequency diversity of the system. Simulation results show that, NTU-CGGA significantly improves system throughput while not reducing the fairness level, which has a better performance comparing with other existing algorithms.
{"title":"Coalition Graph Game for joint relay selection and resource allocation in cooperative cognitive radio networks","authors":"Lanjie Zhai, Hong Ji, Xi Li, Yiwen Tang","doi":"10.1109/GLOCOM.2012.6503379","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503379","url":null,"abstract":"Cooperative relaying technology among secondary users (SUs) in cognitive radio networks (CRN) is shown to yield a significant performance improvement, such as improving spectrum utilization as well as system fairness in CRN. This paper investigates the problem of the relay selection and resource allocation in a downlink OFDMA cognitive relay network. The objective of this optimization problem is to maximize both system throughput and system fairness, which is achieved through our proposed non-transferable utility coalition graph game algorithm (NTU-CGGA). In this algorithm, the SUs with more available channels can help SUs with less available channels to improve their utility in terms of the throughput and fairness by forming a directed tree graph. The coalition graph is formatted according to spectrum availability and traffic demands of SUs by using merge-split rule. So it can effectively exploit both space and frequency diversity of the system. Simulation results show that, NTU-CGGA significantly improves system throughput while not reducing the fairness level, which has a better performance comparing with other existing algorithms.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"14 1","pages":"1818-1823"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81211931","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503301
Yonglei Jiang, Huaxia Chen, Honglin Hu
The Cyclic Delay Diversity (CDD)-induced cyclostationary signature is considered to be a robust and cost-efficient scheme for self-coordination of Cognitive Radio Network (CRN). However, the performance of network coordination relies on the reliable detection of such cyclostationary signatures. In this paper, we deduce an exact covariance matrix to characterize the statistics of cyclostationary signature. Based on the covariance matrix, we propose an Asymptotically Optimal Likelihood (AOL) detector for the test of the CDD-induced cyclostationary signature. In addition, an Asymptotically Maximum Likelihood Probability (AMLP) criterion is provided to solve the multiple signatures identification issue. Comprehensive simulations verify that the proposed detector provides superior performance in detection probability and observation duration, compared with the existing Constant False Alarm Rate (CFAR) detector.
{"title":"Asymptotically Optimal Likelihood detector for cyclostationary signature induced by Cyclic Delay Diversity","authors":"Yonglei Jiang, Huaxia Chen, Honglin Hu","doi":"10.1109/GLOCOM.2012.6503301","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503301","url":null,"abstract":"The Cyclic Delay Diversity (CDD)-induced cyclostationary signature is considered to be a robust and cost-efficient scheme for self-coordination of Cognitive Radio Network (CRN). However, the performance of network coordination relies on the reliable detection of such cyclostationary signatures. In this paper, we deduce an exact covariance matrix to characterize the statistics of cyclostationary signature. Based on the covariance matrix, we propose an Asymptotically Optimal Likelihood (AOL) detector for the test of the CDD-induced cyclostationary signature. In addition, an Asymptotically Maximum Likelihood Probability (AMLP) criterion is provided to solve the multiple signatures identification issue. Comprehensive simulations verify that the proposed detector provides superior performance in detection probability and observation duration, compared with the existing Constant False Alarm Rate (CFAR) detector.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"8 1","pages":"1351-1355"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81841895","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
扫码关注我们
求助内容：
应助结果提醒方式：