Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6654726
Walid M. Ibrahim, A. Taha, S. Arabia
Knowing the position of sensor nodes in an environmental monitoring is useful to identify the location of events. However deploying GPS receivers or other anchor sensors is expensive, since the role of anchor nodes ends after localizing sensor nodes' positions and they are transferred into ordinary sensor nodes. In this paper, we introduce a new localization scheme for a wireless sensor network that can localize sensor nodes using a collinear and non-collinear mobile anchor node. This scheme benefits from the estimated distance between neighbor nodes and additional information provided by the anchor node about the flow direction of the message. Each node localizes it's position from two independent directions. A Kalman Filter is then used to improve the location accuracy for each node. Through simulation studies, we show that the scheme using a Kalman Filter decreases the estimation errors than using single direction by 31% and 16% better than using weighted averages. As well, our new scheme overcomes the collinearity problem that appears from using mobile anchor nodes.
{"title":"Robust wireless multihop localization using mobile anchors","authors":"Walid M. Ibrahim, A. Taha, S. Arabia","doi":"10.1109/ICC.2013.6654726","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654726","url":null,"abstract":"Knowing the position of sensor nodes in an environmental monitoring is useful to identify the location of events. However deploying GPS receivers or other anchor sensors is expensive, since the role of anchor nodes ends after localizing sensor nodes' positions and they are transferred into ordinary sensor nodes. In this paper, we introduce a new localization scheme for a wireless sensor network that can localize sensor nodes using a collinear and non-collinear mobile anchor node. This scheme benefits from the estimated distance between neighbor nodes and additional information provided by the anchor node about the flow direction of the message. Each node localizes it's position from two independent directions. A Kalman Filter is then used to improve the location accuracy for each node. Through simulation studies, we show that the scheme using a Kalman Filter decreases the estimation errors than using single direction by 31% and 16% better than using weighted averages. As well, our new scheme overcomes the collinearity problem that appears from using mobile anchor nodes.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"83 1","pages":"1506-1511"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75409051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6654830
Kentaroh Toyoda, I. Sasase
As VoIP (Voice over IP) grows rapidly, it is expected to prevail tremendous unsolicited advertisement calls, which type of calls is referred to SPIT (SPam over Internet Telephony). SPIT detection is more difficult to execute than email SPAM detection since the callee or SPIT detection system does not tell whether it is SPIT or legitimate call until he/she actually takes a call. Recently, many SPIT detection techniques are proposed by finding outliers of call patterns. However, most of these techniques suffer from setting a threshold to distinguish that the caller is legitimate or not and this could cause to high false negative rate or low true positive rate. This is because these techniques analyse call pattern by a single feature e.g. call frequency or average call duration. In this paper, we propose a multi-feature call pattern analysis with unsupervised Random Forests classifier, which is one of the excellent classification algorithms. We also propose two simple but helpful features for better classification. We show the effectiveness of Random Forests based classification without supervised training data and which features contribute to classification.
随着VoIP (Voice over IP)的迅速发展，预计将会有大量的未经请求的广告电话，这种电话被称为SPIT (SPam over Internet Telephony)。恶意呼叫检测比垃圾邮件检测更难执行，因为被呼叫方或恶意呼叫检测系统在他/她实际接听电话之前无法判断这是恶意呼叫还是合法呼叫。近年来，许多语音识别技术都是通过寻找呼叫模式的异常值来实现的。然而，大多数这些技术都设置了一个阈值来区分调用者是否合法，这可能导致高假阴性率或低真阳性率。这是因为这些技术通过单个特征来分析呼叫模式，例如呼叫频率或平均呼叫时长。本文提出了一种基于无监督随机森林分类器的多特征呼叫模式分析算法，它是一种优秀的分类算法。为了更好地分类，我们还提出了两个简单但有用的特征。我们展示了在没有监督训练数据的情况下基于随机森林的分类的有效性，以及哪些特征有助于分类。
{"title":"SPIT callers detection with unsupervised Random Forests classifier","authors":"Kentaroh Toyoda, I. Sasase","doi":"10.1109/ICC.2013.6654830","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654830","url":null,"abstract":"As VoIP (Voice over IP) grows rapidly, it is expected to prevail tremendous unsolicited advertisement calls, which type of calls is referred to SPIT (SPam over Internet Telephony). SPIT detection is more difficult to execute than email SPAM detection since the callee or SPIT detection system does not tell whether it is SPIT or legitimate call until he/she actually takes a call. Recently, many SPIT detection techniques are proposed by finding outliers of call patterns. However, most of these techniques suffer from setting a threshold to distinguish that the caller is legitimate or not and this could cause to high false negative rate or low true positive rate. This is because these techniques analyse call pattern by a single feature e.g. call frequency or average call duration. In this paper, we propose a multi-feature call pattern analysis with unsupervised Random Forests classifier, which is one of the excellent classification algorithms. We also propose two simple but helpful features for better classification. We show the effectiveness of Random Forests based classification without supervised training data and which features contribute to classification.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"38 1","pages":"2068-2072"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74864601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655078
K. Niu, Kai Chen, Jiaru Lin
CRC (cyclic redundancy check) concatenated polar codes are superior to the turbo codes under the successive cancellation list (SCL) or successive cancellation stack (SCS) decoding algorithms. But the code length of polar codes is limited to the power of two. In this paper, a family of rate-compatible punctured polar (RCPP) codes is proposed to satisfy the construction with arbitrary code length. We propose a simple quasi-uniform puncturing algorithm to generate the puncturing table. And we prove that this method has better row-weight property than that of the random puncturing. Simulation results under the binary input additive white Gaussian noise channels (BI-AWGNs) show that these RCPP codes outperform the performance of turbo codes in WCDMA (Wideband Code Division Multiple Access) or LTE (Long Term Evolution) wireless communication systems in the large range of code lengths. Especially, the RCPP code with CRC-aided SCL/SCS algorithm can provide over 0.7dB performance gain at the block error rate (BLER) of 10-4 with short code length M = 512 and code rate R = 0.5.
{"title":"Beyond turbo codes: Rate-compatible punctured polar codes","authors":"K. Niu, Kai Chen, Jiaru Lin","doi":"10.1109/ICC.2013.6655078","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655078","url":null,"abstract":"CRC (cyclic redundancy check) concatenated polar codes are superior to the turbo codes under the successive cancellation list (SCL) or successive cancellation stack (SCS) decoding algorithms. But the code length of polar codes is limited to the power of two. In this paper, a family of rate-compatible punctured polar (RCPP) codes is proposed to satisfy the construction with arbitrary code length. We propose a simple quasi-uniform puncturing algorithm to generate the puncturing table. And we prove that this method has better row-weight property than that of the random puncturing. Simulation results under the binary input additive white Gaussian noise channels (BI-AWGNs) show that these RCPP codes outperform the performance of turbo codes in WCDMA (Wideband Code Division Multiple Access) or LTE (Long Term Evolution) wireless communication systems in the large range of code lengths. Especially, the RCPP code with CRC-aided SCL/SCS algorithm can provide over 0.7dB performance gain at the block error rate (BLER) of 10-4 with short code length M = 512 and code rate R = 0.5.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"29 1","pages":"3423-3427"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74924819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655210
Dong Wei, Chunyan Feng, Caili Guo
A Joint Polarization-Amplitude-Phase Modulation (JPAPM) scheme in wireless communication is proposed to improve the Power Amplifier (PA) energy efficiency. The proposed scheme introduces the signal's Polarization State (PS), amplitude and phase as the information-bearing parameters. Thus, the data rate can be further enhanced on the basis of the traditional amplitude-phase modulation. Also, since the transmitted signal's PS completely manipulated by orthogonally dual-polarized antennas is unaffected by the PA, JPAPM can let PA work in its nonlinear region to acquire high PA conversion efficiency. Furthermore, to mitigate the polarization-based impairment to JPAPM caused by the wireless channel's polarization dependent loss effect, the optimal pre-compensation algorithm is also presented. Simulation under the same symbol error rate and channel state shows the JPAPM can improve the PA energy efficiency significantly compared with the traditional quadrature amplitude modulation.
{"title":"An optimal pre-compensation based joint polarization-amplitude-phase modulation scheme for the power amplifier energy efficiency improvement","authors":"Dong Wei, Chunyan Feng, Caili Guo","doi":"10.1109/ICC.2013.6655210","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655210","url":null,"abstract":"A Joint Polarization-Amplitude-Phase Modulation (JPAPM) scheme in wireless communication is proposed to improve the Power Amplifier (PA) energy efficiency. The proposed scheme introduces the signal's Polarization State (PS), amplitude and phase as the information-bearing parameters. Thus, the data rate can be further enhanced on the basis of the traditional amplitude-phase modulation. Also, since the transmitted signal's PS completely manipulated by orthogonally dual-polarized antennas is unaffected by the PA, JPAPM can let PA work in its nonlinear region to acquire high PA conversion efficiency. Furthermore, to mitigate the polarization-based impairment to JPAPM caused by the wireless channel's polarization dependent loss effect, the optimal pre-compensation algorithm is also presented. Simulation under the same symbol error rate and channel state shows the JPAPM can improve the PA energy efficiency significantly compared with the traditional quadrature amplitude modulation.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"32 1","pages":"4137-4142"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73684424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655207
Kun Wang, J. Alonso-Zarate, M. Dohler
In this paper, we evaluate the energy-efficiency of LTE for Machine-to-Machine (M2M) communications with small data transmissions. We quantify the minimum resources that can be allocated in LTE for the uplink and we show that the energy-efficiency of the transmissions of small blocks of data strongly depends on the transmission power and the Adaptive Modulation and Coding (AMC) procedure. Indeed, when an aggressive Modulation and Coding Scheme (MCS) is used thanks to good channel quality, the energy-efficiency of LTE decreases for the transmission of small amounts of data, as the physical resource blocks are under-utilized. In addition, we propose a solution to deal with this drawback by selecting an optimal MCS and utilizing the LTE Uplink Power Control (UPC) mechanism. The results presented in this paper are based on open-source ns-3 computer-based simulations.
{"title":"Energy-efficiency of LTE for small data machine-to-machine communications","authors":"Kun Wang, J. Alonso-Zarate, M. Dohler","doi":"10.1109/ICC.2013.6655207","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655207","url":null,"abstract":"In this paper, we evaluate the energy-efficiency of LTE for Machine-to-Machine (M2M) communications with small data transmissions. We quantify the minimum resources that can be allocated in LTE for the uplink and we show that the energy-efficiency of the transmissions of small blocks of data strongly depends on the transmission power and the Adaptive Modulation and Coding (AMC) procedure. Indeed, when an aggressive Modulation and Coding Scheme (MCS) is used thanks to good channel quality, the energy-efficiency of LTE decreases for the transmission of small amounts of data, as the physical resource blocks are under-utilized. In addition, we propose a solution to deal with this drawback by selecting an optimal MCS and utilizing the LTE Uplink Power Control (UPC) mechanism. The results presented in this paper are based on open-source ns-3 computer-based simulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"17 1","pages":"4120-4124"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74334095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655554
Jun Zhang, Jason Min Wang, Ying Wang, B. Bensaou
In this paper we study the problem of client association, airtime sharing and contention resolution in a multi-cell WLAN to achieve fair download bandwidth sharing. We first model the problem as a utility maximization problem, then, because of the integral nature of association, the problem being NP-hard, we decompose it into two sub-problems: the client association problem on one hand, and the joint airtime sharing and contention resolution problem on the other. We show that, for each fixed association pattern, the corresponding joint airtime sharing and contention resolution problem can be solved in polynomial time. To solve the client association problem, we propose the so-called Swap localized algorithm. The Swap procedure iteratively swaps clients between pairs of neighbour access points (APs) if the swap leads to an improvement in the global utility. Simulation results show that, the proposed algorithm is significantly better than RSSI-based heuristic, and quickly leads to a near-optimal solution.
{"title":"Optimal client association, airtime sharing and contention resolution in throughput fair multi-cell WLANs with hidden APs","authors":"Jun Zhang, Jason Min Wang, Ying Wang, B. Bensaou","doi":"10.1109/ICC.2013.6655554","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655554","url":null,"abstract":"In this paper we study the problem of client association, airtime sharing and contention resolution in a multi-cell WLAN to achieve fair download bandwidth sharing. We first model the problem as a utility maximization problem, then, because of the integral nature of association, the problem being NP-hard, we decompose it into two sub-problems: the client association problem on one hand, and the joint airtime sharing and contention resolution problem on the other. We show that, for each fixed association pattern, the corresponding joint airtime sharing and contention resolution problem can be solved in polynomial time. To solve the client association problem, we propose the so-called Swap localized algorithm. The Swap procedure iteratively swaps clients between pairs of neighbour access points (APs) if the swap leads to an improvement in the global utility. Simulation results show that, the proposed algorithm is significantly better than RSSI-based heuristic, and quickly leads to a near-optimal solution.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"202 1","pages":"5969-5973"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78691925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655477
V. Sridharan, N. Kiyani, H. Nikookar, J. V. D. Heuvel, G. Dolmans
In this paper, non-data aided (NDA) signal-to-noise ratio (SNR) estimation techniques for non-coherent on-off keying (OOK) receivers using non-equiprobable signal transmission is analyzed. Expectation-maximization (EM), M1M2 and M2M3 estimators are investigated. It is shown that the performance of moments based estimators degrade in high SNR region due to bad noise estimates. Moreover, lower moment based estimator, i.e., M1M2 is shown to be inoperable for equiprobable case. EM estimator is investigated and a noise recalibration stage is added for high SNR region. Hybrid estimators, i.e., M1M2-EM and M2M3 - EM are proposed to cover a wide range of SNR for equiprobable and non-equiprobable signal transmission. The normalized mean square error (NMSE) is evaluated for each estimator. Closed form analytical expressions are derived for each of the estimators and is found to be in good agreement with the simulations.
{"title":"NDA SNR estimation techniques for non-equiprobable signaling using non-coherent OOK receivers","authors":"V. Sridharan, N. Kiyani, H. Nikookar, J. V. D. Heuvel, G. Dolmans","doi":"10.1109/ICC.2013.6655477","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655477","url":null,"abstract":"In this paper, non-data aided (NDA) signal-to-noise ratio (SNR) estimation techniques for non-coherent on-off keying (OOK) receivers using non-equiprobable signal transmission is analyzed. Expectation-maximization (EM), M<sub>1</sub>M<sub>2</sub> and M<sub>2</sub>M<sub>3</sub> estimators are investigated. It is shown that the performance of moments based estimators degrade in high SNR region due to bad noise estimates. Moreover, lower moment based estimator, i.e., M<sub>1</sub>M<sub>2</sub> is shown to be inoperable for equiprobable case. EM estimator is investigated and a noise recalibration stage is added for high SNR region. Hybrid estimators, i.e., M<sub>1</sub>M<sub>2</sub>-EM and M<sub>2</sub>M<sub>3</sub> - EM are proposed to cover a wide range of SNR for equiprobable and non-equiprobable signal transmission. The normalized mean square error (NMSE) is evaluated for each estimator. Closed form analytical expressions are derived for each of the estimators and is found to be in good agreement with the simulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"6 1","pages":"5559-5563"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75948297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6654707
N. Rachkidy, A. Guitton, M. Misson
Wireless sensor networks can accommodate multiple applications by using a multi-stack architecture in order to deliver a large number of QoS. Multi-stack architectures can be optimized by allowing packet exchanges between stacks. However, routing loops may appear because of these exchanges. In this paper, we highlight the problem of routing loops generated when the same packet is routed according to two routing protocols. We define the delayable property of routing protocols by considering that some nodes might hold packets in order to avoid loops in the network. We show that minimizing the number of such nodes is an NP-complete problem. Then, we propose two heuristics to address this issue: a centralized deterministic heuristic requiring a global knowledge of the network, and a distributed stochastic heuristic reducing the number of hops from source to destination. Our two heuristics show important benefits: we reach a gain of up to 67% for the first heuristic and of up to 53% for the second heuristic, in terms of number of hops.
{"title":"Improving routing performance when several routing protocols are used sequentially in a WSN","authors":"N. Rachkidy, A. Guitton, M. Misson","doi":"10.1109/ICC.2013.6654707","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654707","url":null,"abstract":"Wireless sensor networks can accommodate multiple applications by using a multi-stack architecture in order to deliver a large number of QoS. Multi-stack architectures can be optimized by allowing packet exchanges between stacks. However, routing loops may appear because of these exchanges. In this paper, we highlight the problem of routing loops generated when the same packet is routed according to two routing protocols. We define the delayable property of routing protocols by considering that some nodes might hold packets in order to avoid loops in the network. We show that minimizing the number of such nodes is an NP-complete problem. Then, we propose two heuristics to address this issue: a centralized deterministic heuristic requiring a global knowledge of the network, and a distributed stochastic heuristic reducing the number of hops from source to destination. Our two heuristics show important benefits: we reach a gain of up to 67% for the first heuristic and of up to 53% for the second heuristic, in terms of number of hops.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"26 1","pages":"1408-1413"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72673181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655079
É. Awwad, G. R. Othman, Y. Jaouën
Coherent detection with Polarization Multiplexing (PolMux) is the most promising technique for future optical fiber transmission systems. However, the optical channel suffers from non-unitary impairments known as Polarization Dependent Loss (PDL). Space-Time coding, originally designed for wireless Rayleigh fading channels, was proven to be capable of mitigating PDL. Coding gains of ST codes were evaluated through simulations and experiments that showed differences in their performance on the optical channel and on the wireless channel. In this paper, we derive an upper bound of the pairwise error probability of an optical channel considering the PDL effect. This upper bound explains the performance of ST codes used to mitigate PDL and yields the design criterion that a code should satisfy in order to completely mitigate PDL.
{"title":"Design criterion of polarization-time codes for optical fiber channels","authors":"É. Awwad, G. R. Othman, Y. Jaouën","doi":"10.1109/ICC.2013.6655079","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655079","url":null,"abstract":"Coherent detection with Polarization Multiplexing (PolMux) is the most promising technique for future optical fiber transmission systems. However, the optical channel suffers from non-unitary impairments known as Polarization Dependent Loss (PDL). Space-Time coding, originally designed for wireless Rayleigh fading channels, was proven to be capable of mitigating PDL. Coding gains of ST codes were evaluated through simulations and experiments that showed differences in their performance on the optical channel and on the wireless channel. In this paper, we derive an upper bound of the pairwise error probability of an optical channel considering the PDL effect. This upper bound explains the performance of ST codes used to mitigate PDL and yields the design criterion that a code should satisfy in order to completely mitigate PDL.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"144 1","pages":"3428-3432"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78166042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6654870
Y. Aikawa, Y. Hei, T. Ogishi, S. Niida, T. Hasegawa
The market for multiplayer online games is rapidly growing in concert with the growth in broadband Internet connection services. Since such games share a virtual space among many players, it is important to match players to a group so that they share low-latency connections with each other. This is because the latency between them affects the perceived quality of their experience. In this paper, we propose a topology-aware matching algorithm using players' geographical locations. We focus on synchronous multiplayer games that require a latency comparable to a delay of one frame. This paper describes the algorithm and its evaluation by simulations.
{"title":"Topology-aware clustering to achieve latency comparable to one-frame in multiplayer online games","authors":"Y. Aikawa, Y. Hei, T. Ogishi, S. Niida, T. Hasegawa","doi":"10.1109/ICC.2013.6654870","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654870","url":null,"abstract":"The market for multiplayer online games is rapidly growing in concert with the growth in broadband Internet connection services. Since such games share a virtual space among many players, it is important to match players to a group so that they share low-latency connections with each other. This is because the latency between them affects the perceived quality of their experience. In this paper, we propose a topology-aware matching algorithm using players' geographical locations. We focus on synchronous multiplayer games that require a latency comparable to a delay of one frame. This paper describes the algorithm and its evaluation by simulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"54 1","pages":"2288-2292"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79815154","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
扫码关注我们
求助内容：
应助结果提醒方式：