Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208069
M. Nekoui, H. Pishro-Nik
The introduction of the Vehicle Infrastructure Inte- gration (VII) initiative by the US Department of Transportation (USDOT) has recently attracted the attention of researchers and given rise to a plethora of studies, each one seeking to enhance the safety and efficiency of transportation networks in one way or another. Moreover, vehicles communicating with each other and with the infrastructure, render their drivers with more information on their surroundings, extending the horizon of drivers and making them more vigilant to face the unexpected. In this study, we provide a mathematical framework which foretells the effect of deploying VII-enabled vehicles, such as VII-assisted and VII-automated, on the overall safety and efficiency. We show that inter-vehicular communications improves the throughput of vehicles by reducing the Perception-Reaction times of drivers. Furthermore, we exhibit that this is obtained without needing to compromise over safety requirements. Our framework can be utilized by decision makers to anticipate the effect of VII on transportation networks prior to their real-life deployment. Index Terms—Vehicular Ad-Hoc Networks (VANETs), Vehicle- Infrastructure Integration (VII), Dedicated Short Range Commu- nications (DSRC), Perception-Reaction (P-R) time.
{"title":"The Effect of VII Market Penetration on Safety and Efficiency of Transportation Networks","authors":"M. Nekoui, H. Pishro-Nik","doi":"10.1109/ICCW.2009.5208069","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208069","url":null,"abstract":"The introduction of the Vehicle Infrastructure Inte- gration (VII) initiative by the US Department of Transportation (USDOT) has recently attracted the attention of researchers and given rise to a plethora of studies, each one seeking to enhance the safety and efficiency of transportation networks in one way or another. Moreover, vehicles communicating with each other and with the infrastructure, render their drivers with more information on their surroundings, extending the horizon of drivers and making them more vigilant to face the unexpected. In this study, we provide a mathematical framework which foretells the effect of deploying VII-enabled vehicles, such as VII-assisted and VII-automated, on the overall safety and efficiency. We show that inter-vehicular communications improves the throughput of vehicles by reducing the Perception-Reaction times of drivers. Furthermore, we exhibit that this is obtained without needing to compromise over safety requirements. Our framework can be utilized by decision makers to anticipate the effect of VII on transportation networks prior to their real-life deployment. Index Terms—Vehicular Ad-Hoc Networks (VANETs), Vehicle- Infrastructure Integration (VII), Dedicated Short Range Commu- nications (DSRC), Perception-Reaction (P-R) time.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128736598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5207978
R. Bless, C. Werle
The use of network virtualization promises additional flexibility and opens up many opportunities for deploying future network architectures. But the increased flexibility creates additional costs with respect to management and control as well as new issues that need to be addressed. In this paper, we describe a framework that allows for dynamic setup of virtual networks and we point out required mechanisms, interfaces, and protocols. Additionally, we take into account runtime aspects by examining control interfaces and signaling protocols necessary for the management of virtual networks and the attachment of end users.
{"title":"Network Virtualization from a Signaling Perspective","authors":"R. Bless, C. Werle","doi":"10.1109/ICCW.2009.5207978","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207978","url":null,"abstract":"The use of network virtualization promises additional flexibility and opens up many opportunities for deploying future network architectures. But the increased flexibility creates additional costs with respect to management and control as well as new issues that need to be addressed. In this paper, we describe a framework that allows for dynamic setup of virtual networks and we point out required mechanisms, interfaces, and protocols. Additionally, we take into account runtime aspects by examining control interfaces and signaling protocols necessary for the management of virtual networks and the attachment of end users.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116100213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208013
W. Adi
Contemporary networks are lacking resilient identification for their participating entities as switches, hosts, terminals, mobile devices and others. Replacement attacks on such units represent a major security gap in many environments and applications. A provable and un-clonable physical unit identity was not an essential security requirement in most contemporary networks due to flexibility requirements avoiding expected increase in hardware complexity and the difficulty to cope with additional system identity. There has been also no essential necessarily for it in most practical operation. However, this missing physical security represents today serious threat as false network units could allow untraceable attacks. Once a network entity can be physically replaced by another fake unit, many denial of service attacks, intrusion and man-in-the-middle attacks become quite easy. Recently, "Physical Unclonable Functions" PUFs were proposed to generate unclonable physical identity (6), (7), (8). PUFs however are costly, complex to manage and exhibit inconsistent reproducibility due to aging and drifts as in voltage and temperature. In this work a practically hard to clone structures for network physical entities are proposed based on clone-resistant evolving dynamic identity concept. Units can be securely traced in an operating network in such a way that it is virtually infeasible to clone due to practical reasons. The proposed technique is combining the time scale as a true irreversible "one-way function" together with the transaction profile in the system environment to come up with practically unclonable identity after a short operation time. The paper demonstrates a sample scenario including new core cryptographic primitives towards creating and managing such clone-resistant identity in contemporary network units. Keywords-identification; network security; clone-resistant Identity; authentication
{"title":"Clone-Resistant Network Unit Identification","authors":"W. Adi","doi":"10.1109/ICCW.2009.5208013","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208013","url":null,"abstract":"Contemporary networks are lacking resilient identification for their participating entities as switches, hosts, terminals, mobile devices and others. Replacement attacks on such units represent a major security gap in many environments and applications. A provable and un-clonable physical unit identity was not an essential security requirement in most contemporary networks due to flexibility requirements avoiding expected increase in hardware complexity and the difficulty to cope with additional system identity. There has been also no essential necessarily for it in most practical operation. However, this missing physical security represents today serious threat as false network units could allow untraceable attacks. Once a network entity can be physically replaced by another fake unit, many denial of service attacks, intrusion and man-in-the-middle attacks become quite easy. Recently, \"Physical Unclonable Functions\" PUFs were proposed to generate unclonable physical identity (6), (7), (8). PUFs however are costly, complex to manage and exhibit inconsistent reproducibility due to aging and drifts as in voltage and temperature. In this work a practically hard to clone structures for network physical entities are proposed based on clone-resistant evolving dynamic identity concept. Units can be securely traced in an operating network in such a way that it is virtually infeasible to clone due to practical reasons. The proposed technique is combining the time scale as a true irreversible \"one-way function\" together with the transaction profile in the system environment to come up with practically unclonable identity after a short operation time. The paper demonstrates a sample scenario including new core cryptographic primitives towards creating and managing such clone-resistant identity in contemporary network units. Keywords-identification; network security; clone-resistant Identity; authentication","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116413229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208113
S. Baek, J. Son, B. D. Choi
We mathematically analyze a sleep mode operation proposed by Samsung for IEEE 802.16 m. The sleep mode operation for downlink traffic is modeled as a 2-dimensional Markov chain. We obtain the power consumption of a mobile station. We show that the power consumption of a mobile station decreases as the sleep cycle increases and the analytical results also match with the simulation results very well.
{"title":"Performance Analysis of Sleep Mode Operation for IEEE 802.16m Advanced WMAN","authors":"S. Baek, J. Son, B. D. Choi","doi":"10.1109/ICCW.2009.5208113","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208113","url":null,"abstract":"We mathematically analyze a sleep mode operation proposed by Samsung for IEEE 802.16 m. The sleep mode operation for downlink traffic is modeled as a 2-dimensional Markov chain. We obtain the power consumption of a mobile station. We show that the power consumption of a mobile station decreases as the sleep cycle increases and the analytical results also match with the simulation results very well.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114648364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208082
N. Sengee, B. Bazarragchaa, T. Y. Kim, H. Choi
Contrast enhancement is important and useful for medical images. One of the widely accepted contrast enhancement method is histogram equalization (GHE). Although GHE achieves comparatively better performance on almost all types of image, GHE sometimes produces excessive visual deterioration. Some extensions of GHE are developed, however these extensions sometimes either fail to enhance the visualization or over enhance contrast of the original image. By over-enhancing contrast, some important information may be lost. Therefore we propose a new method called "Weight Clustering Histogram Equalization" (WCHE). WCHE assigns each non-zero bin of the original image's histogram to a separate cluster, and computes each cluster's weight. The cluster numbers are reduced by three suggesting criteria. Then, the clusters acquire the same partitions as the result image histogram. Finally, transformation functions for each cluster's sub-histogram are calculated based on the traditional GHE method in the new acquired partitions of the result image histogram, and the sub-histogram's gray levels are mapped to the result image by the corresponding transformation functions. We showed experimentally that WCHE bas been validated with some numerical results.
{"title":"Weight Clustering Histogram Equalization for Medical Image Enhancement","authors":"N. Sengee, B. Bazarragchaa, T. Y. Kim, H. Choi","doi":"10.1109/ICCW.2009.5208082","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208082","url":null,"abstract":"Contrast enhancement is important and useful for medical images. One of the widely accepted contrast enhancement method is histogram equalization (GHE). Although GHE achieves comparatively better performance on almost all types of image, GHE sometimes produces excessive visual deterioration. Some extensions of GHE are developed, however these extensions sometimes either fail to enhance the visualization or over enhance contrast of the original image. By over-enhancing contrast, some important information may be lost. Therefore we propose a new method called \"Weight Clustering Histogram Equalization\" (WCHE). WCHE assigns each non-zero bin of the original image's histogram to a separate cluster, and computes each cluster's weight. The cluster numbers are reduced by three suggesting criteria. Then, the clusters acquire the same partitions as the result image histogram. Finally, transformation functions for each cluster's sub-histogram are calculated based on the traditional GHE method in the new acquired partitions of the result image histogram, and the sub-histogram's gray levels are mapped to the result image by the corresponding transformation functions. We showed experimentally that WCHE bas been validated with some numerical results.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114668779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208061
Q. Xiao, Q. Gao, L. Xiao, S. Zhou, J. Wang
Opportunistic spectrum access system allows the secondary user to access spectrum holes not being utilized by the primary user. Traditional opportunistic spectrum access approaches only sense and utilize current spectrum holes. This can result in uncontrollable collision probability, which exceed the maximum collision probability allowed by the primary user network. In this paper, we consider a cognitive radio system with one primary channel and one secondary user, and then we introduce a channel-usage pattern model and a fundamental access scheme in this system. On the basis of this model and fundamental access scheme, we study optimal opportunistic spectrum access problem and formulate it as an optimization problem that the secondary user maximizes spectrum holes utilization under the constraint of collision tolerable level. And then we solve this optimization problem in the case that the idle period is exponential distribution. Theoretical analysis and simulation results both show that the optimal opportunistic spectrum access approach can maximize spectrum holes utilization under the constraint of collision tolerable level.
{"title":"An Optimal Opportunistic Spectrum Access Approach","authors":"Q. Xiao, Q. Gao, L. Xiao, S. Zhou, J. Wang","doi":"10.1109/ICCW.2009.5208061","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208061","url":null,"abstract":"Opportunistic spectrum access system allows the secondary user to access spectrum holes not being utilized by the primary user. Traditional opportunistic spectrum access approaches only sense and utilize current spectrum holes. This can result in uncontrollable collision probability, which exceed the maximum collision probability allowed by the primary user network. In this paper, we consider a cognitive radio system with one primary channel and one secondary user, and then we introduce a channel-usage pattern model and a fundamental access scheme in this system. On the basis of this model and fundamental access scheme, we study optimal opportunistic spectrum access problem and formulate it as an optimization problem that the secondary user maximizes spectrum holes utilization under the constraint of collision tolerable level. And then we solve this optimization problem in the case that the idle period is exponential distribution. Theoretical analysis and simulation results both show that the optimal opportunistic spectrum access approach can maximize spectrum holes utilization under the constraint of collision tolerable level.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127303959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208045
M. Marsan, L. Chiaraviglio, D. Ciullo, M. Meo
In this paper we study with simple analytical models the energy-aware management of cellular access networks, trying to characterize the amount of energy that can be saved by reducing the number of active cells during the periods when they are not necessary because traffic is low. When some cells are switched off, radio coverage and service provisioning are taken care of by the cells that remain active, so as to guarantee that service is available over the whole area. We show how to optimize the energy saving, first assuming that any fraction of cells can be turned off, and then accounting for the constraints resulting from the cell layout.
{"title":"Optimal Energy Savings in Cellular Access Networks","authors":"M. Marsan, L. Chiaraviglio, D. Ciullo, M. Meo","doi":"10.1109/ICCW.2009.5208045","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208045","url":null,"abstract":"In this paper we study with simple analytical models the energy-aware management of cellular access networks, trying to characterize the amount of energy that can be saved by reducing the number of active cells during the periods when they are not necessary because traffic is low. When some cells are switched off, radio coverage and service provisioning are taken care of by the cells that remain active, so as to guarantee that service is available over the whole area. We show how to optimize the energy saving, first assuming that any fraction of cells can be turned off, and then accounting for the constraints resulting from the cell layout.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127580191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208112
C. Cordeiro
The wide harmonized spectrum in the unlicensed millimeter-wave (60 GHz) band has been receiving increased attention, since it enables multi-Gbps data rates suitable for applications of next generation WLAN and WPAN such as wireless display, high-speed device synchronization, and the evolution of Wi-Fi. As such, the industry is in the process of defining new 60 GHz PHY and MAC technologies that can serve a wide variety of applications and usages, as to avoid the proliferation of non-coexistent devices operating in this unoccupied spectrum. Therefore, in this paper we discuss the challenges and trade-offs with three of the most "popular" medium access schemes, namely, CSMA/CA, TDMA, and polling, in meeting the diverse requirements of the applications and usages envisioned for the 60 GHz band. We also analyze the throughput performance of each access technology and discuss a hybrid MAC that takes advantage of each access mechanism to meet the requirements of the envisioned usages and applications of 60 GHz WLAN and WPAN.
{"title":"Evaluation of Medium Access Technologies for Next Generation Millimeter-Wave WLAN and WPAN","authors":"C. Cordeiro","doi":"10.1109/ICCW.2009.5208112","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208112","url":null,"abstract":"The wide harmonized spectrum in the unlicensed millimeter-wave (60 GHz) band has been receiving increased attention, since it enables multi-Gbps data rates suitable for applications of next generation WLAN and WPAN such as wireless display, high-speed device synchronization, and the evolution of Wi-Fi. As such, the industry is in the process of defining new 60 GHz PHY and MAC technologies that can serve a wide variety of applications and usages, as to avoid the proliferation of non-coexistent devices operating in this unoccupied spectrum. Therefore, in this paper we discuss the challenges and trade-offs with three of the most \"popular\" medium access schemes, namely, CSMA/CA, TDMA, and polling, in meeting the diverse requirements of the applications and usages envisioned for the 60 GHz band. We also analyze the throughput performance of each access technology and discuss a hybrid MAC that takes advantage of each access mechanism to meet the requirements of the envisioned usages and applications of 60 GHz WLAN and WPAN.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208019
J. Chang, Yuan Li, Shulan Feng, Haiguang Wang, Chao Sun, Philipp Zhang
Mobility enhancement and carrier aggregation are important aspects to investigate as part of the LTE-Advanced study. Hard handover is the only handover scheme in LTE Rel-8. Generally, hard handover is fairly simple, but its outage probability is high and the handover procedure may be unreliable, especially for VoIP service. In this paper, we propose a fractional soft handover scheme based on the carrier aggregation. The main idea is to partially perform soft handover for VoIP, but non-VoIP service is only transmitted from source eNodeB or target eNodeB. The theoretical analysis and simulation results show that the proposed fractional soft handover scheme not only attains the lowest handover outage probability, but also improve the reliability of VoIP service.
{"title":"A Fractional Soft Handover Scheme for 3GPP LTE-Advanced System","authors":"J. Chang, Yuan Li, Shulan Feng, Haiguang Wang, Chao Sun, Philipp Zhang","doi":"10.1109/ICCW.2009.5208019","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208019","url":null,"abstract":"Mobility enhancement and carrier aggregation are important aspects to investigate as part of the LTE-Advanced study. Hard handover is the only handover scheme in LTE Rel-8. Generally, hard handover is fairly simple, but its outage probability is high and the handover procedure may be unreliable, especially for VoIP service. In this paper, we propose a fractional soft handover scheme based on the carrier aggregation. The main idea is to partially perform soft handover for VoIP, but non-VoIP service is only transmitted from source eNodeB or target eNodeB. The theoretical analysis and simulation results show that the proposed fractional soft handover scheme not only attains the lowest handover outage probability, but also improve the reliability of VoIP service.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130636318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208118
M. Rahman, S. Sasaki, J. Wang, T. Baykaş, C. Sum, R. Funada, H. Harada, S. Kato
An in-depth yet simple analysis is presented for binary direct sequence code division multiple access (DS-CDMA) systems considering a frequency selective Nakagami fading channel and maximal ratio combining (MRC) receiver. The inevitable inter-symbol interference as well as multiple access interference from simultaneous users are modeled elegantly and their characteristic functions (CF) are developed. Utilizing the CFs, the exact bit error probabilities are developed following the CF method of error rate analysis that claims the honor to be the first-to-publish reliable result for such channel and receiver. The CF based exact error rate is less computationally intensive than that can be obtained by traditional methods of approximation. The same method also lets us develop a new simpler approximate error rate. The exact method is utilized to investigate the range of parameters where approximations (existing and the new) would be accurate.
{"title":"On Error Probabilities for DS-CDMA/MRC in Frequency Selective Nakagami Fading","authors":"M. Rahman, S. Sasaki, J. Wang, T. Baykaş, C. Sum, R. Funada, H. Harada, S. Kato","doi":"10.1109/ICCW.2009.5208118","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208118","url":null,"abstract":"An in-depth yet simple analysis is presented for binary direct sequence code division multiple access (DS-CDMA) systems considering a frequency selective Nakagami fading channel and maximal ratio combining (MRC) receiver. The inevitable inter-symbol interference as well as multiple access interference from simultaneous users are modeled elegantly and their characteristic functions (CF) are developed. Utilizing the CFs, the exact bit error probabilities are developed following the CF method of error rate analysis that claims the honor to be the first-to-publish reliable result for such channel and receiver. The CF based exact error rate is less computationally intensive than that can be obtained by traditional methods of approximation. The same method also lets us develop a new simpler approximate error rate. The exact method is utilized to investigate the range of parameters where approximations (existing and the new) would be accurate.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130652049","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
扫码关注我们
求助内容：
应助结果提醒方式：