Pub Date : 2012-04-01DOI: 10.1109/WCNC.2012.6214068
Yutaka Okaie, T. Nakano
In this paper, we consider a nano-biosensor network composed of nano-to-micro scale biological machines distributed over a two-dimensional bounded area. The goal of the nano-biosensor network is to detect a target signal that propagates via Brownian motion in the monitoring area. Three simple nanomachine placement strategies are investigated: random, proportional, and regular placement. In the random placement, nanomachines are distributed randomly over the area. In the proportional placement, more nanomachines are placed where signals appear more frequently. In the regular placement, nanomachines are distributed to maintain a specific distance from adjacent nanomachines. Three placement strategies are evaluated through simulation based on the mean residence time which is defined as the average amount of time that a target signal stays in the monitoring area. Our simulation results show that the regular placement performs best when signal arrival locations follow normal distribution. Simulation results are also provided to show the impact of nanomachine failure on the mean residence time.
{"title":"Nanomachine placement strategies for detecting Brownian molecules in nanonetworks","authors":"Yutaka Okaie, T. Nakano","doi":"10.1109/WCNC.2012.6214068","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214068","url":null,"abstract":"In this paper, we consider a nano-biosensor network composed of nano-to-micro scale biological machines distributed over a two-dimensional bounded area. The goal of the nano-biosensor network is to detect a target signal that propagates via Brownian motion in the monitoring area. Three simple nanomachine placement strategies are investigated: random, proportional, and regular placement. In the random placement, nanomachines are distributed randomly over the area. In the proportional placement, more nanomachines are placed where signals appear more frequently. In the regular placement, nanomachines are distributed to maintain a specific distance from adjacent nanomachines. Three placement strategies are evaluated through simulation based on the mean residence time which is defined as the average amount of time that a target signal stays in the monitoring area. Our simulation results show that the regular placement performs best when signal arrival locations follow normal distribution. Simulation results are also provided to show the impact of nanomachine failure on the mean residence time.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129405437","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-04-01DOI: 10.1109/WCNC.2012.6213998
S. Nam, Dong In Kim, Hong-Chuan Yang
A dynamic decode-&-forward (DDF) is redesigned to meet the crucial requirements for type-2 user equipment (UE) relays which are being considered for next-generation cellular standards (e.g., LTE-Advanced). Toward this, the proposed modified DDF (M-DDF) realizes a fast jump-in relaying and sequential decoding where a subframe decoding is employed to yield a combination of energy/information/mixed combining, in conjunction with the random codeset for encoding and re-encoding at source and multiple UE relays, depending on their channel conditions. These additional features existing in the M-DDF circumvent the need of exchanging control messages between multiple relays and end user near cell boundary, which is not allowed for type-2 UE relays. Through comparison among the DDF with single and multiple orthogonal channels and M-DDF, the M-DDF bridges the gap between former relaying protocols with application to type-2 UE relays, offering reliable rate capacity with less channel usage and further improvement, if the early termination of decoding is made available.
{"title":"Modified dynamic DF for type-2 UE relays","authors":"S. Nam, Dong In Kim, Hong-Chuan Yang","doi":"10.1109/WCNC.2012.6213998","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213998","url":null,"abstract":"A dynamic decode-&-forward (DDF) is redesigned to meet the crucial requirements for type-2 user equipment (UE) relays which are being considered for next-generation cellular standards (e.g., LTE-Advanced). Toward this, the proposed modified DDF (M-DDF) realizes a fast jump-in relaying and sequential decoding where a subframe decoding is employed to yield a combination of energy/information/mixed combining, in conjunction with the random codeset for encoding and re-encoding at source and multiple UE relays, depending on their channel conditions. These additional features existing in the M-DDF circumvent the need of exchanging control messages between multiple relays and end user near cell boundary, which is not allowed for type-2 UE relays. Through comparison among the DDF with single and multiple orthogonal channels and M-DDF, the M-DDF bridges the gap between former relaying protocols with application to type-2 UE relays, offering reliable rate capacity with less channel usage and further improvement, if the early termination of decoding is made available.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130811483","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-04-01DOI: 10.1109/WCNC.2012.6214154
Hosung Park, Seungmin Oh, Euisin Lee, Soochang Park, Sang-Ha Kim, Wanseop Lee
A principal issue for wireless sensor networks is energy efficiency, which is necessary for prolonging applications to track continuous object, such as wild fire and poison gas. Selective wakeup approach is an effective way to save energy in such networks. However, most previous studies on selective wakeup schemes have concentrated on individual objects, such as intruders and tanks, and they cannot be applied for tracking continuous objects. This is because the continuous object is pretty flexible and dynamic due to its sensitiveness to surrounding natural effects so that movable area cannot be correctly estimated by the just spatiotemporal mechanism. Therefore, we propose a grid-based protocol for applying the efficient and accurate selective wakeup technique to tracking continuous objects. When an object is detected in some specific area which tightly surrounds the object, a pre-designated area where the target may move is activated to prepare the target without any complex calculations. Moreover, our protocol is simple and asynchronous, which makes it more suitable for wireless sensor networks.
{"title":"Selective wakeup discipline for continuous object tracking in grid-based wireless sensor networks","authors":"Hosung Park, Seungmin Oh, Euisin Lee, Soochang Park, Sang-Ha Kim, Wanseop Lee","doi":"10.1109/WCNC.2012.6214154","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214154","url":null,"abstract":"A principal issue for wireless sensor networks is energy efficiency, which is necessary for prolonging applications to track continuous object, such as wild fire and poison gas. Selective wakeup approach is an effective way to save energy in such networks. However, most previous studies on selective wakeup schemes have concentrated on individual objects, such as intruders and tanks, and they cannot be applied for tracking continuous objects. This is because the continuous object is pretty flexible and dynamic due to its sensitiveness to surrounding natural effects so that movable area cannot be correctly estimated by the just spatiotemporal mechanism. Therefore, we propose a grid-based protocol for applying the efficient and accurate selective wakeup technique to tracking continuous objects. When an object is detected in some specific area which tightly surrounds the object, a pre-designated area where the target may move is activated to prepare the target without any complex calculations. Moreover, our protocol is simple and asynchronous, which makes it more suitable for wireless sensor networks.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130818091","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-04-01DOI: 10.1109/WCNC.2012.6214196
M. Muslam, H. Chan, L. Magagula, N. Ventura
The current use of IP address in network application session identification cannot preserve the session when the IP address changes. Host Identity Protocol (HIP), which is an identity-location separation protocol, provides a better framework to build solutions for mobility, multihoming, and security by adding a host identity layer on top of the IP layer. Yet modifying the IP protocol stack and adding mobility as well as other solutions to all the hosts can be impractical to deploy and interoperate with existing IP hosts. This paper proposes a network-based HIP service as well as mobility solution at HIP layer to all mobile hosts. The network-based service includes tracking mobile hosts, assigning network prefix per host identifier, securely updating the binding of mobile hosts, and providing a HIP proxy function to ensure the delivery of the same IP prefix to the mobile host during handover in the same network domain. Better handover performance in terms of handover latency and signaling overheard is achieved, when compared with proxy mobile IP or existing purely HIP-based mobility protocol.
{"title":"Network-based mobility and Host Identity Protocol","authors":"M. Muslam, H. Chan, L. Magagula, N. Ventura","doi":"10.1109/WCNC.2012.6214196","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214196","url":null,"abstract":"The current use of IP address in network application session identification cannot preserve the session when the IP address changes. Host Identity Protocol (HIP), which is an identity-location separation protocol, provides a better framework to build solutions for mobility, multihoming, and security by adding a host identity layer on top of the IP layer. Yet modifying the IP protocol stack and adding mobility as well as other solutions to all the hosts can be impractical to deploy and interoperate with existing IP hosts. This paper proposes a network-based HIP service as well as mobility solution at HIP layer to all mobile hosts. The network-based service includes tracking mobile hosts, assigning network prefix per host identifier, securely updating the binding of mobile hosts, and providing a HIP proxy function to ensure the delivery of the same IP prefix to the mobile host during handover in the same network domain. Better handover performance in terms of handover latency and signaling overheard is achieved, when compared with proxy mobile IP or existing purely HIP-based mobility protocol.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131013787","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-04-01DOI: 10.1109/WCNC.2012.6214116
L. Zhang, T. Okamawari, T. Fujii
LTE (Long Term Evolution) has been standardized in 3GPP (3rd Generation Partnership Project) to provide higher data throughput as well as lower latency for various IP based services including web browsing, VoIP (Voice over IP), video streaming and so on. In this paper, we evaluate the performance of TCP and UDP when handover is executed in an LTE system. The performance is degraded due to the interference between source and target eNBs (evolved NodeB). Also the handover interruption time negatively affects overall performance. We measure the TCP throughput and the transmission delay of UDP during the handover process by using our indoor and outdoor LTE testbeds. The results show that better TCP throughput performance is obtained by decreasing the A3-offset and the interruption time caused by a handover event is around 80ms.
{"title":"Performance evaluation of TCP and UDP during LTE handover","authors":"L. Zhang, T. Okamawari, T. Fujii","doi":"10.1109/WCNC.2012.6214116","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214116","url":null,"abstract":"LTE (Long Term Evolution) has been standardized in 3GPP (3rd Generation Partnership Project) to provide higher data throughput as well as lower latency for various IP based services including web browsing, VoIP (Voice over IP), video streaming and so on. In this paper, we evaluate the performance of TCP and UDP when handover is executed in an LTE system. The performance is degraded due to the interference between source and target eNBs (evolved NodeB). Also the handover interruption time negatively affects overall performance. We measure the TCP throughput and the transmission delay of UDP during the handover process by using our indoor and outdoor LTE testbeds. The results show that better TCP throughput performance is obtained by decreasing the A3-offset and the interruption time caused by a handover event is around 80ms.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131252508","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-04-01DOI: 10.1109/WCNC.2012.6214450
Ammar Zafar, Yunfei Chen, Mohamed-Slim Alouini, R. Radaydeh
In this paper, we present two optimal resource allocation schemes that maximize throughput and symbol correct rate (SCR). The throughput and SCR are derived. The derived throughput and SCR are optimized with respect to the sensing time, the source transmission power and the relay transmission power. Numerical results show that the optimal sensing time is dependent on the primary user's signal-to-noise-ratio (SNR). They also show that SCR increases with increase in the number of relays.
{"title":"Resource allocation for relay assisted cognitive radio networks","authors":"Ammar Zafar, Yunfei Chen, Mohamed-Slim Alouini, R. Radaydeh","doi":"10.1109/WCNC.2012.6214450","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214450","url":null,"abstract":"In this paper, we present two optimal resource allocation schemes that maximize throughput and symbol correct rate (SCR). The throughput and SCR are derived. The derived throughput and SCR are optimized with respect to the sensing time, the source transmission power and the relay transmission power. Numerical results show that the optimal sensing time is dependent on the primary user's signal-to-noise-ratio (SNR). They also show that SCR increases with increase in the number of relays.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"24 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993713","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-04-01DOI: 10.1109/WCNC.2012.6214197
F. Lehmann
We consider physical network coding on a two-way relay channel. Two source nodes send their packets simultaneously over time-varying MIMO channels to a relay node. Assuming that the relay employs the joint decode-and-forward strategy, the relay must be able to decode the individual source packets. This task requires a robust estimation of the source-to-relay channels. We design a message passing algorithm based on factor-graphs to solve this problem efficiently.
{"title":"A joint decode-and-forward strategy for physical network coding based on factor graphs","authors":"F. Lehmann","doi":"10.1109/WCNC.2012.6214197","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214197","url":null,"abstract":"We consider physical network coding on a two-way relay channel. Two source nodes send their packets simultaneously over time-varying MIMO channels to a relay node. Assuming that the relay employs the joint decode-and-forward strategy, the relay must be able to decode the individual source packets. This task requires a robust estimation of the source-to-relay channels. We design a message passing algorithm based on factor-graphs to solve this problem efficiently.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131118764","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-04-01DOI: 10.1109/WCNC.2012.6214020
G. Cecchetti, A. L. Ruscelli, Antonia Mastropaolo, G. Lipari
Quality of Service (QoS) provided by the IEEE 802.11e amendment and by the proposed HCF Controlled Channel Access (HCCA) reference scheduler is tailored for Constant Bit Rate traffic streams. Moreover the numerous alternative scheduling algorithms are not suitable to serve Variable Bit Rate (VBR) traffic streams with the required QoS and real-time guarantees. This paper presents Immediate Dynamic TXOP HCCA (IDTH), a new scheduling algorithm based on a bandwidth reclaiming mechanism suitable to cooperate with a HCCA real-time scheduler. IDTH recovers the portion of the transmission time unused by the scheduled stations to provide a further capacity for the next variable bit rate traffic streams. The transmission opportunity of the next scheduled station is assigned considering the available spare resources and the previously used ones. The scheduling analysis and the simulations results show that IDTH is suitable to reduce the delay experienced by VBR traffic streams, to efficiently deal with the variability of multimedia traffic and to avoid waste of resources.
{"title":"Providing variable TXOP for IEEE 802.11e HCCA real-time networks","authors":"G. Cecchetti, A. L. Ruscelli, Antonia Mastropaolo, G. Lipari","doi":"10.1109/WCNC.2012.6214020","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214020","url":null,"abstract":"Quality of Service (QoS) provided by the IEEE 802.11e amendment and by the proposed HCF Controlled Channel Access (HCCA) reference scheduler is tailored for Constant Bit Rate traffic streams. Moreover the numerous alternative scheduling algorithms are not suitable to serve Variable Bit Rate (VBR) traffic streams with the required QoS and real-time guarantees. This paper presents Immediate Dynamic TXOP HCCA (IDTH), a new scheduling algorithm based on a bandwidth reclaiming mechanism suitable to cooperate with a HCCA real-time scheduler. IDTH recovers the portion of the transmission time unused by the scheduled stations to provide a further capacity for the next variable bit rate traffic streams. The transmission opportunity of the next scheduled station is assigned considering the available spare resources and the previously used ones. The scheduling analysis and the simulations results show that IDTH is suitable to reduce the delay experienced by VBR traffic streams, to efficiently deal with the variability of multimedia traffic and to avoid waste of resources.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127869014","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}
The nonlinear distortion caused by power amplifier (PA) nonlinearity distorts the constellation and degrades the bit error rate (BER) performance of 60 GHz millimeter wave (mmWave) wireless local area network (WLAN) easily, due to the huge bandwidth and high equivalent isotropic radiated power (EIRP), especially for quadrature amplitude modulation (QAM) signals. This paper aims at data-aided (DA) distorted constellation (DC) estimation and demodulation to resist PA nonlinearity. A maximum likelihood (ML) estimation algorithm is proposed, and the corresponding Cramer-Rao lower bounds (CRLBs) are computed. Furthermore, we implement the demodulation based on the DC rather than the standard constellation (SC). Simulation results indicate that the means of the estimated parameters are unbiased and the mean square errors (MSEs) approach the CRLBs. Meanwhile, the proposed DC demodulation with PA nonlinearity achieves BER performance close to the ideal PA case, and evidently outperforms the traditional SC demodulation especially in the high-code-rate or uncoded case.
{"title":"Data-aided distorted constellation estimation and demodulation for 60 GHz mmWave WLAN","authors":"Changming Zhang, Zhenyu Xiao, Xiaoming Peng, Depeng Jin, Lieguang Zeng","doi":"10.1109/WCNC.2012.6213951","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213951","url":null,"abstract":"The nonlinear distortion caused by power amplifier (PA) nonlinearity distorts the constellation and degrades the bit error rate (BER) performance of 60 GHz millimeter wave (mmWave) wireless local area network (WLAN) easily, due to the huge bandwidth and high equivalent isotropic radiated power (EIRP), especially for quadrature amplitude modulation (QAM) signals. This paper aims at data-aided (DA) distorted constellation (DC) estimation and demodulation to resist PA nonlinearity. A maximum likelihood (ML) estimation algorithm is proposed, and the corresponding Cramer-Rao lower bounds (CRLBs) are computed. Furthermore, we implement the demodulation based on the DC rather than the standard constellation (SC). Simulation results indicate that the means of the estimated parameters are unbiased and the mean square errors (MSEs) approach the CRLBs. Meanwhile, the proposed DC demodulation with PA nonlinearity achieves BER performance close to the ideal PA case, and evidently outperforms the traditional SC demodulation especially in the high-code-rate or uncoded case.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115477657","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-04-01DOI: 10.1109/WCNC.2012.6213925
Javad Jafarian, K. Hamdi
Cognitive radio (CR), as the novel approach to improve the utilization of the available radio spectrum is introduced under the constraint that the current authorized users are sufficiently protected against any harmful interferences. However, there are many challenges associated with detection of the primary users (PUs) which need to be addressed carefully. One of the most important challenges in CR networks is how to sense the existence of a PU transmission. The secondary users (SUs) are required to sense the channels, and once the PUs are found, they are required to vacate the channel in a specific amount of time. In a single threshold energy detection scheme, the higher the probability of detection, the better the PUs are protected, however; it gives higher probability of false alarm which means less chances the channel can be reused when it is available. A double threshold detection scheme ensures the target probability of detection while keeping the probability of false alarm as low as required at the cost of increasing the sensing time. This paper is concerned with analysis of the designing the sensing duration and two thresholds difference value in a cooperative double threshold sensing scheme that maximizes the throughput of the SUs, subject to adequate protection to the PUs. Through this work, we formulate the sensing-throughput tradeoff problem mathematically, and prove that the formulated problem is indeed a unimodal function of both parameters and there is an optimal set of two sensing parameters which yields the highest throughput for the secondary network.
{"title":"Throughput optimization in a cooperative double-threshold sensing scheme","authors":"Javad Jafarian, K. Hamdi","doi":"10.1109/WCNC.2012.6213925","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213925","url":null,"abstract":"Cognitive radio (CR), as the novel approach to improve the utilization of the available radio spectrum is introduced under the constraint that the current authorized users are sufficiently protected against any harmful interferences. However, there are many challenges associated with detection of the primary users (PUs) which need to be addressed carefully. One of the most important challenges in CR networks is how to sense the existence of a PU transmission. The secondary users (SUs) are required to sense the channels, and once the PUs are found, they are required to vacate the channel in a specific amount of time. In a single threshold energy detection scheme, the higher the probability of detection, the better the PUs are protected, however; it gives higher probability of false alarm which means less chances the channel can be reused when it is available. A double threshold detection scheme ensures the target probability of detection while keeping the probability of false alarm as low as required at the cost of increasing the sensing time. This paper is concerned with analysis of the designing the sensing duration and two thresholds difference value in a cooperative double threshold sensing scheme that maximizes the throughput of the SUs, subject to adequate protection to the PUs. Through this work, we formulate the sensing-throughput tradeoff problem mathematically, and prove that the formulated problem is indeed a unimodal function of both parameters and there is an optimal set of two sensing parameters which yields the highest throughput for the secondary network.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124085627","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
扫码关注我们
求助内容：
应助结果提醒方式：