Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7340971
Bing Fang, Zuping Qian, Wei Zhong, W. Shao
In this paper, we study the energy-efficient secrecy precoding problem for a general multiple-input multiple-output multiple-eavesdropper (MIMOME) wiretap channel. The system model considered here consists of a common transmitter, a legitimate receiver, and multiple eavesdroppers, all mounted with multiple antennas. In order to improve the energy efficiency (EE) performance of the proposed system, an artificial noise (AN)-aided precoding scheme is adopted. Because the formulated EE maximization problem is of huge nonconvex complexity, we solve it by employing a two-tier optimization structure. Although the outer-tier optimization problem is quite simple and can be efficiently solved by the famous golden section searching method, the inner-tier optimization problem turns out to be nonconvex and cannot be easily solved. To solve it, we relax it to a secrecy rate maximization (SRM) problem, which naturally constitutes a difference convex (DC)-type programming problem and can be iteratively solved by employing a successive convex approximation (SCA) method. Numerical simulations are further provided to demonstrate the proposed algorithms. Results show that our algorithms can converge fast to a near-optimal solution.
{"title":"Energy-efficient secrecy precoding for general MIMOME wiretap channels","authors":"Bing Fang, Zuping Qian, Wei Zhong, W. Shao","doi":"10.1109/WCSP.2015.7340971","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7340971","url":null,"abstract":"In this paper, we study the energy-efficient secrecy precoding problem for a general multiple-input multiple-output multiple-eavesdropper (MIMOME) wiretap channel. The system model considered here consists of a common transmitter, a legitimate receiver, and multiple eavesdroppers, all mounted with multiple antennas. In order to improve the energy efficiency (EE) performance of the proposed system, an artificial noise (AN)-aided precoding scheme is adopted. Because the formulated EE maximization problem is of huge nonconvex complexity, we solve it by employing a two-tier optimization structure. Although the outer-tier optimization problem is quite simple and can be efficiently solved by the famous golden section searching method, the inner-tier optimization problem turns out to be nonconvex and cannot be easily solved. To solve it, we relax it to a secrecy rate maximization (SRM) problem, which naturally constitutes a difference convex (DC)-type programming problem and can be iteratively solved by employing a successive convex approximation (SCA) method. Numerical simulations are further provided to demonstrate the proposed algorithms. Results show that our algorithms can converge fast to a near-optimal solution.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115031465","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341311
Lisu Yu, Xianfu Lei, P. Fan, Dageng Chen
In this paper, an optimized codebook design for a non-orthogonal multiple access scheme, called sparse code multiple access (SCMA), is presented. Unlike the low density signature (LDS) systems, in SCMA systems, the procedure of bits to QAM symbol mapping and spreading are combined together, and the incoming bits are directly mapped to the codewords of the SCMA codebook sets. Each layer or user has its dedicated codebook and the codebooks are all different. An improved method based on star-QAM signaling constellations is proposed here for designing the SCMA codebooks. It is demonstrated that the new method can greatly improve the BER performance without sacrificing the low detection complexity, compared to the existing codebooks and LDS.
{"title":"An optimized design of SCMA codebook based on star-QAM signaling constellations","authors":"Lisu Yu, Xianfu Lei, P. Fan, Dageng Chen","doi":"10.1109/WCSP.2015.7341311","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341311","url":null,"abstract":"In this paper, an optimized codebook design for a non-orthogonal multiple access scheme, called sparse code multiple access (SCMA), is presented. Unlike the low density signature (LDS) systems, in SCMA systems, the procedure of bits to QAM symbol mapping and spreading are combined together, and the incoming bits are directly mapped to the codewords of the SCMA codebook sets. Each layer or user has its dedicated codebook and the codebooks are all different. An improved method based on star-QAM signaling constellations is proposed here for designing the SCMA codebooks. It is demonstrated that the new method can greatly improve the BER performance without sacrificing the low detection complexity, compared to the existing codebooks and LDS.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130626437","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341083
Yafei Wang, Qianmin Jiang, Zhiyong Chen, Bin Xia
In this paper, we investigate the outage probability performance of a two-way full-duplex (TWFD) amplify-forward (AF) relay cooperative communication system in the presence of residual self-interference(RSI) at the source/destination terminals and relay node. We first give the closed-form expressions of the link outage probability under asymmetrical cases, in which the targeted data transmission rates in the bidirectional links are different. Based on the analytical expressions, we further analytically derive the exact expressions of the system outage probability with asymmetric traffic requirements. Besides, numerical results with the Monte Carlo simulations are also provided to verify the validity of our theoretical analysis.
{"title":"Outage probability of two-way full-duplex amplify-forward relay systems with asymmetric traffic requirements","authors":"Yafei Wang, Qianmin Jiang, Zhiyong Chen, Bin Xia","doi":"10.1109/WCSP.2015.7341083","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341083","url":null,"abstract":"In this paper, we investigate the outage probability performance of a two-way full-duplex (TWFD) amplify-forward (AF) relay cooperative communication system in the presence of residual self-interference(RSI) at the source/destination terminals and relay node. We first give the closed-form expressions of the link outage probability under asymmetrical cases, in which the targeted data transmission rates in the bidirectional links are different. Based on the analytical expressions, we further analytically derive the exact expressions of the system outage probability with asymmetric traffic requirements. Besides, numerical results with the Monte Carlo simulations are also provided to verify the validity of our theoretical analysis.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123532097","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341248
W. Feng, Rui Shi, N. Ge, Jianhua Lu
Coordinated transmission is an effective way to deal with the inter-cell interference (ICI) problem in a multi-cell distributed antenna system (DAS). However, in a practical scenario, the inter-cell channel state information (CSI) is usually imperfect, consequently causing a significant performance degradation of coordinated transmission. In this paper, to tackle this difficulty, we propose a coordinated selective transmission scheme, which is robust to the inter-cell CSI uncertainty. Particularly, we consider a composite inter-cell CSI model that consists of perfect large-scale CSI and imperfect small-scale CSI. An accuracy parameter is used to indicate different degree of uncertainty of the small-scale CSI. We then formulate a coordinated antenna selection problem, which is a non-convex integer programming problem. Using the successive approximation method and the Geometric Programming tool, we propose an iterative solution to the problem. Simulation results show that the proposed coordinated selective transmission scheme provides a significant sum rate gain over the existing methods, since it is more robust to the inter-cell small-scale CSI error.
{"title":"Robust coordination for multi-cell distributed antenna systems with selective transmission","authors":"W. Feng, Rui Shi, N. Ge, Jianhua Lu","doi":"10.1109/WCSP.2015.7341248","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341248","url":null,"abstract":"Coordinated transmission is an effective way to deal with the inter-cell interference (ICI) problem in a multi-cell distributed antenna system (DAS). However, in a practical scenario, the inter-cell channel state information (CSI) is usually imperfect, consequently causing a significant performance degradation of coordinated transmission. In this paper, to tackle this difficulty, we propose a coordinated selective transmission scheme, which is robust to the inter-cell CSI uncertainty. Particularly, we consider a composite inter-cell CSI model that consists of perfect large-scale CSI and imperfect small-scale CSI. An accuracy parameter is used to indicate different degree of uncertainty of the small-scale CSI. We then formulate a coordinated antenna selection problem, which is a non-convex integer programming problem. Using the successive approximation method and the Geometric Programming tool, we propose an iterative solution to the problem. Simulation results show that the proposed coordinated selective transmission scheme provides a significant sum rate gain over the existing methods, since it is more robust to the inter-cell small-scale CSI error.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123674617","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341165
Min Zhang, Lin Bai, Chen Chen, Jinho Choi
In this paper, in heterogeneous cellular networks (HCN), we first consider an approximation model for the aggregate adjacent channel interference (ACI) from nearby small-cells at a user in a macro-cell. With the help of two well known approximations for ACI, the signal to interference ratio (SIR) of users in a macro-cells (victim users) is derived in the presence of coexisting small-cells. In addition, the outage probabilities of the victim user in HCN is also derived to measure the performance of the system. Through simulations, we can demonstrate that as the small-cell intensity increases, the outage probability of victim user increases. Furthermore, under the same small-cell intensity, it is shown that as the distance between the user and its macro-cell base station (BS) increases, the outage probability also increases.
{"title":"Analysis of adjacent channel interference in heterogeneous cellular networks","authors":"Min Zhang, Lin Bai, Chen Chen, Jinho Choi","doi":"10.1109/WCSP.2015.7341165","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341165","url":null,"abstract":"In this paper, in heterogeneous cellular networks (HCN), we first consider an approximation model for the aggregate adjacent channel interference (ACI) from nearby small-cells at a user in a macro-cell. With the help of two well known approximations for ACI, the signal to interference ratio (SIR) of users in a macro-cells (victim users) is derived in the presence of coexisting small-cells. In addition, the outage probabilities of the victim user in HCN is also derived to measure the performance of the system. Through simulations, we can demonstrate that as the small-cell intensity increases, the outage probability of victim user increases. Furthermore, under the same small-cell intensity, it is shown that as the distance between the user and its macro-cell base station (BS) increases, the outage probability also increases.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121226369","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341100
Tingting Liu, Xinmin Li, Ling Qiu
Sparse code multiple access (SCMA) is a new multiple access technique with reusing non-orthogonal code domain resource. It has massive connectivity serving a large number of users and improves spectral efficiency of radio access. SCMA directly maps the information bits of different users to sparse complex codewords selected from the predefined codebooks, and each codeword represents a transmission layer. SCMA can be combined with MIMO technique to further improve the spectral efficiency. This combined technique is called code-space-multiplexing (CSM) which is the extension of the spatial multiplexing. Under downlink massive MIMO MU-SCMA (massive-CSM) system, the base station, equipped with massive transmit antennas, transmits SCMA codewords for each user. In this paper, by applying random matrix theory, we derive an asymptotic equivalent (AE) of signal to interference plus noise ratio (SINR) as the number of transmit antennas approaches infinity. In addition, some asymptotic results of SINR for two special cases can be obtained in terms of large-scale fading coefficients, sparse parameter and the number of resource blocks. Simulation results show massive-CSM can improve the capacity of MU-SCMA system and has a substantial advantage in terms of higher sum rate performance compared with Massive MIMO MU-OFDMA system. As the number of transmit antennas increases, our analytic expression of SINR closely approaches the theoretical result.
稀疏码多址(SCMA)是一种重用非正交码域资源的新型多址技术。它具有服务于大量用户的海量连接，提高了无线电接入的频谱效率。SCMA直接将不同用户的信息位映射到从预定义码本中选择的稀疏复杂码字，每个码字代表一个传输层。SCMA可以与MIMO技术相结合，进一步提高频谱效率。这种组合技术被称为码空复用(CSM)，它是空间复用的扩展。在下行链路大规模MIMO MU-SCMA (massive- csm)系统下，基站配备大量发射天线，为每个用户发送SCMA码字。本文应用随机矩阵理论，导出了当发射天线数趋近于无穷时信噪比的渐近等价(AE)。此外，在大尺度衰落系数、稀疏参数和资源块数量方面，得到了两种特殊情况下SINR的一些渐近结果。仿真结果表明，与Massive MIMO MU-OFDMA系统相比，Massive - csm可以提高MU-SCMA系统的容量，在更高的和速率性能方面具有明显的优势。随着发射天线数量的增加，我们的解析式SINR更接近理论结果。
{"title":"Capacity for downlink massive MIMO MU-SCMA system","authors":"Tingting Liu, Xinmin Li, Ling Qiu","doi":"10.1109/WCSP.2015.7341100","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341100","url":null,"abstract":"Sparse code multiple access (SCMA) is a new multiple access technique with reusing non-orthogonal code domain resource. It has massive connectivity serving a large number of users and improves spectral efficiency of radio access. SCMA directly maps the information bits of different users to sparse complex codewords selected from the predefined codebooks, and each codeword represents a transmission layer. SCMA can be combined with MIMO technique to further improve the spectral efficiency. This combined technique is called code-space-multiplexing (CSM) which is the extension of the spatial multiplexing. Under downlink massive MIMO MU-SCMA (massive-CSM) system, the base station, equipped with massive transmit antennas, transmits SCMA codewords for each user. In this paper, by applying random matrix theory, we derive an asymptotic equivalent (AE) of signal to interference plus noise ratio (SINR) as the number of transmit antennas approaches infinity. In addition, some asymptotic results of SINR for two special cases can be obtained in terms of large-scale fading coefficients, sparse parameter and the number of resource blocks. Simulation results show massive-CSM can improve the capacity of MU-SCMA system and has a substantial advantage in terms of higher sum rate performance compared with Massive MIMO MU-OFDMA system. As the number of transmit antennas increases, our analytic expression of SINR closely approaches the theoretical result.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128098595","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341053
Xinli Xiong, Jing Feng, Lei Jiang
Automatic Modulation Classification (AMC) can be used in automatically identifying and classifying the modulation of communication devices. With the application of digital technique, AMC is developed towards higher frequency, which makes a lower probability of correct classification (PCC) at the conventional method. It is necessary for relay-communication to automatically classify the modulation of satellite. So, AMC plays an important part in heterogeneous satellite networking especially in Operationally Responsive Space (ORS). In order to enhance PCC in low Signal Noise Ratio (SNR) conditions, a novel method based on Radical Basis Function Neural Network (RBFNN) and Gravitational Search Algorithm (GSA) was presented in this paper. This method combined high-order cumulants with low-order statistics features, and supposed additive white Gaussian noise (AWGN) as the channel model. The classification performance of the typical RBFNN was optimized by GSA using information entropy changing to update the “agents” movement velocity, which expand the globe solution sets in exploration phase and escapes the local optimum in exploitation phase. Compared to existed methods, the proposed method does not require any previous knowledge of received signal. Simulation results show that the proposed method is more effective in low SNR conditions and improves the probability of correct classification.
{"title":"Automatic digital modulation classification for ORS satellite relay communication","authors":"Xinli Xiong, Jing Feng, Lei Jiang","doi":"10.1109/WCSP.2015.7341053","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341053","url":null,"abstract":"Automatic Modulation Classification (AMC) can be used in automatically identifying and classifying the modulation of communication devices. With the application of digital technique, AMC is developed towards higher frequency, which makes a lower probability of correct classification (PCC) at the conventional method. It is necessary for relay-communication to automatically classify the modulation of satellite. So, AMC plays an important part in heterogeneous satellite networking especially in Operationally Responsive Space (ORS). In order to enhance PCC in low Signal Noise Ratio (SNR) conditions, a novel method based on Radical Basis Function Neural Network (RBFNN) and Gravitational Search Algorithm (GSA) was presented in this paper. This method combined high-order cumulants with low-order statistics features, and supposed additive white Gaussian noise (AWGN) as the channel model. The classification performance of the typical RBFNN was optimized by GSA using information entropy changing to update the “agents” movement velocity, which expand the globe solution sets in exploration phase and escapes the local optimum in exploitation phase. Compared to existed methods, the proposed method does not require any previous knowledge of received signal. Simulation results show that the proposed method is more effective in low SNR conditions and improves the probability of correct classification.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132368046","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341240
Kai He, Yueyue Zhang, Yaping Zhu, Weiwei Xia, Z. Jia, Lianfeng Shen
The paper illustrates to integrate UWB technology with inertial navigation, and introduces the design of the hybrid indoor positioning system including server, gateway and sensor nodes. A linear regression matrix model is proposed to modify inertial navigation path. Least squares method is used to determine equations relating UWB trajectories to inertial navigation trajectories. Experimental results are shown to compare error distributions of hybrid algorithm and pure UWB solution.
{"title":"A hybrid indoor positioning system based on UWB and inertial navigation","authors":"Kai He, Yueyue Zhang, Yaping Zhu, Weiwei Xia, Z. Jia, Lianfeng Shen","doi":"10.1109/WCSP.2015.7341240","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341240","url":null,"abstract":"The paper illustrates to integrate UWB technology with inertial navigation, and introduces the design of the hybrid indoor positioning system including server, gateway and sensor nodes. A linear regression matrix model is proposed to modify inertial navigation path. Least squares method is used to determine equations relating UWB trajectories to inertial navigation trajectories. Experimental results are shown to compare error distributions of hybrid algorithm and pure UWB solution.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130005366","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341172
Xiong Cai, Xiaohui Li, Ruiyang Yuan, Y. Hei
Indoor localization could benefit greatly from non-line-of-sight (NLOS) identification and mitigation, since the major challenge for WiFi indoor ranging-based localization technologies are multipath and NLOS. NLOS identification and mitigation on commodity WiFi devices, however, is challenge due to limited bandwidth and coarse multipath resolution with mere MAC layer RSSI. In this study, we explore and exploit the finer-grained PHY layer channel state information (CSI) to identify and mitigate NLOS. Key to our approach is exploiting several statistical features of CSI, which are proved to be particularly effective. Approach based on machine learning is proposed to identify NLOS and mitigate NLOS error. Experiment results in various indoor scenarios with severe interferences demonstrate that the proposed approach outperform previous threshold-based approaches and mitigate the impact of NLOS conditions perfectly.
{"title":"Identification and mitigation of NLOS based on channel state information for indoor WiFi localization","authors":"Xiong Cai, Xiaohui Li, Ruiyang Yuan, Y. Hei","doi":"10.1109/WCSP.2015.7341172","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341172","url":null,"abstract":"Indoor localization could benefit greatly from non-line-of-sight (NLOS) identification and mitigation, since the major challenge for WiFi indoor ranging-based localization technologies are multipath and NLOS. NLOS identification and mitigation on commodity WiFi devices, however, is challenge due to limited bandwidth and coarse multipath resolution with mere MAC layer RSSI. In this study, we explore and exploit the finer-grained PHY layer channel state information (CSI) to identify and mitigate NLOS. Key to our approach is exploiting several statistical features of CSI, which are proved to be particularly effective. Approach based on machine learning is proposed to identify NLOS and mitigate NLOS error. Experiment results in various indoor scenarios with severe interferences demonstrate that the proposed approach outperform previous threshold-based approaches and mitigate the impact of NLOS conditions perfectly.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134603552","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341072
L. Lei, Hongyan Li
The problem of choosing the best forwards in Delay Tolerant Networks (DTNs) is crucial for minimizing the delay in traffic delivery. Different from the traditional networks, end-to-end delay in DTNs includes the propagation delay, transmission delay and also the waiting time introduced by the intermittent connectivity of links. In this paper, we widely discuss and mathematically formalize the computation of end-to-end delay. It is shown that the DTN end-to-end delay is determined by the starting time at source node, the traffic volume as well as the variation of edge parameters within a given time horizon. A novel routing strategy is proposed that the cumulative traffic of one link is used to calculate the transmission delay and the waiting time for crossing multiple connectivity intervals of that link. Several simulation results are also presented to evaluate the proposed routing mechanism in a satellite DTN scenario driven by real mobility traces.
{"title":"A routing policy based on time-varying graph for predictable delay tolerant networks","authors":"L. Lei, Hongyan Li","doi":"10.1109/WCSP.2015.7341072","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341072","url":null,"abstract":"The problem of choosing the best forwards in Delay Tolerant Networks (DTNs) is crucial for minimizing the delay in traffic delivery. Different from the traditional networks, end-to-end delay in DTNs includes the propagation delay, transmission delay and also the waiting time introduced by the intermittent connectivity of links. In this paper, we widely discuss and mathematically formalize the computation of end-to-end delay. It is shown that the DTN end-to-end delay is determined by the starting time at source node, the traffic volume as well as the variation of edge parameters within a given time horizon. A novel routing strategy is proposed that the cumulative traffic of one link is used to calculate the transmission delay and the waiting time for crossing multiple connectivity intervals of that link. Several simulation results are also presented to evaluate the proposed routing mechanism in a satellite DTN scenario driven by real mobility traces.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132642496","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
扫码关注我们
求助内容：
应助结果提醒方式：