Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655332
J. Choi, Byungju Lee, B. Shim, Insung Kang
In this paper, we present a novel soft-input soft-output detector for large-scale MIMO systems that offers substantial complexity reduction over the existing detectors and performance close to the full dimensional symbol detector. The proposed algorithm, termed soft-input soft-output successive group (SSG) detector, detects a subset of symbols successively with an aid of the preprocessing designed to suppress the inter-group interference. In fact, the proposed preprocessor mitigates the effect of interfering symbol groups using a priori information of the undetected groups and a posteriori information of the detected groups. Simulation results performed on large-scale multi-input multi-output (MIMO) systems demonstrate that the proposed SSG detector achieves significant complexity reduction over the conventional approaches with negligible performance loss.
{"title":"Low complexity soft-input soft-output group detection for massive MIMO systems","authors":"J. Choi, Byungju Lee, B. Shim, Insung Kang","doi":"10.1109/ICC.2013.6655332","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655332","url":null,"abstract":"In this paper, we present a novel soft-input soft-output detector for large-scale MIMO systems that offers substantial complexity reduction over the existing detectors and performance close to the full dimensional symbol detector. The proposed algorithm, termed soft-input soft-output successive group (SSG) detector, detects a subset of symbols successively with an aid of the preprocessing designed to suppress the inter-group interference. In fact, the proposed preprocessor mitigates the effect of interfering symbol groups using a priori information of the undetected groups and a posteriori information of the detected groups. Simulation results performed on large-scale multi-input multi-output (MIMO) systems demonstrate that the proposed SSG detector achieves significant complexity reduction over the conventional approaches with negligible performance loss.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"115 1","pages":"4792-4796"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79111538","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}
Recently, the recovery performance of analog Compressed Sensing (CS) has been significantly improved by representing multiband signals with the modulated and merged Slepian basis (MM-Slepian dictionary), which avoids the frequency leakage effect of the Discrete Fourier Transform (DFT) basis. However, the MM-Slepian dictionary has a very large scale and corresponds to a large-scale measurement matrix, which leads to high recovery computational complexity. This paper resolves the above problem by modulating and band-limiting the multiband signal rather than modulating the Slepian basis. Specifically, instead of using the MM-Slepian dictionary to represent the whole multiband signal, we propose to use the non-modulated Slepian basis to represent the modulated and band-limited version of the multiband signal based on the recently proposed Modulated Wideband Converter (MWC). Furthermore, based on the analytical derivation with the non-modulated Slepian basis, we propose an Interpolation Recovery (IR) algorithm to take full advantage of the Slepian basis, whereas the Direct Recovery (DR) algorithm using the Moore-Penrose pseudo-inverse cannot achieve this. Simulation results verify that, with low recovery computational load, the non-modulated Slepian basis combined with the IR algorithm improves the recovery SNR by up to 35 dB compared with the DFT basis in noise-free environment.
{"title":"Analog compressed sensing for multiband signals with non-modulated Slepian basis","authors":"Xianjun Yang, E. Dutkiewicz, Qimei Cui, Xiaojing Huang, Xiaofeng Tao, Gengfa Fang","doi":"10.1109/ICC.2013.6655361","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655361","url":null,"abstract":"Recently, the recovery performance of analog Compressed Sensing (CS) has been significantly improved by representing multiband signals with the modulated and merged Slepian basis (MM-Slepian dictionary), which avoids the frequency leakage effect of the Discrete Fourier Transform (DFT) basis. However, the MM-Slepian dictionary has a very large scale and corresponds to a large-scale measurement matrix, which leads to high recovery computational complexity. This paper resolves the above problem by modulating and band-limiting the multiband signal rather than modulating the Slepian basis. Specifically, instead of using the MM-Slepian dictionary to represent the whole multiband signal, we propose to use the non-modulated Slepian basis to represent the modulated and band-limited version of the multiband signal based on the recently proposed Modulated Wideband Converter (MWC). Furthermore, based on the analytical derivation with the non-modulated Slepian basis, we propose an Interpolation Recovery (IR) algorithm to take full advantage of the Slepian basis, whereas the Direct Recovery (DR) algorithm using the Moore-Penrose pseudo-inverse cannot achieve this. Simulation results verify that, with low recovery computational load, the non-modulated Slepian basis combined with the IR algorithm improves the recovery SNR by up to 35 dB compared with the DFT basis in noise-free environment.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"89 1","pages":"4941-4945"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83381376","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.6655623
Peng Li, Song Guo, T. Miyazaki, Victor C. M. Leung
Cooperative communication (CC) has been proposed to increase the wireless channel capacity and reliability by employing multiple single-antenna nodes to form a virtual antenna array. Many efforts focus on exploiting the benefits of CC among multiple source-destination pairs with an unrealistic assumption that each of them communicates over a dedicated channel without interference. In this paper, we investigate the transmission scheduling problem for multiple source-destination pairs under the assistance of a set of dedicated relay nodes on a single channel. By applying the protocol interference model, we propose a concept of cooperative link to characterize the interference regions of CC. Due to the NP-completeness of optimal scheduling, LP (linear programming) based heuristic algorithms are proposed to maximize the minimum transmission rate under a given relay assignment. Then, without specifying a relay node for each source-destination pair, we study the max-min rate problem by jointly considering transmission scheduling and relay assignment. Heuristic algorithms are proposed to solve this more challenging problem. Finally, extensive simulations are conducted to show that the proposed algorithm outperforms direct transmission substantially.
{"title":"Joint optimization of transmission scheduling and relay assignment for cooperative communications","authors":"Peng Li, Song Guo, T. Miyazaki, Victor C. M. Leung","doi":"10.1109/ICC.2013.6655623","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655623","url":null,"abstract":"Cooperative communication (CC) has been proposed to increase the wireless channel capacity and reliability by employing multiple single-antenna nodes to form a virtual antenna array. Many efforts focus on exploiting the benefits of CC among multiple source-destination pairs with an unrealistic assumption that each of them communicates over a dedicated channel without interference. In this paper, we investigate the transmission scheduling problem for multiple source-destination pairs under the assistance of a set of dedicated relay nodes on a single channel. By applying the protocol interference model, we propose a concept of cooperative link to characterize the interference regions of CC. Due to the NP-completeness of optimal scheduling, LP (linear programming) based heuristic algorithms are proposed to maximize the minimum transmission rate under a given relay assignment. Then, without specifying a relay node for each source-destination pair, we study the max-min rate problem by jointly considering transmission scheduling and relay assignment. Heuristic algorithms are proposed to solve this more challenging problem. Finally, extensive simulations are conducted to show that the proposed algorithm outperforms direct transmission substantially.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"18 1","pages":"6338-6342"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81202183","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.6655211
Bing Bu, F. Yu, T. Tang, Chunhai Gao
Communication-based train control (CBTC) systems use wireless local area networks (WLANs) to transmit train status and control commands. Random transmission delays and packet drops are inevitable in train-ground communication, which could result in unnecessary traction, brake or even emergency brake of trains, loss of line capacity and passenger satisfaction. In this paper, we study the random packet drops in CBTC systems, analyze their impact on the performances of CBTC systems, and propose a control scheme to improve CBTC performances. We model the system to control a group of trains as a networked control system with packet drops in transmissions. Extensive simulation results are presented. We show that our proposed scheme can provide less energy consumption, better riding comfortability and total cost reduction.
{"title":"An energy-efficient control scheme for communication-based train control (CBTC) systems with random packet drops","authors":"Bing Bu, F. Yu, T. Tang, Chunhai Gao","doi":"10.1109/ICC.2013.6655211","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655211","url":null,"abstract":"Communication-based train control (CBTC) systems use wireless local area networks (WLANs) to transmit train status and control commands. Random transmission delays and packet drops are inevitable in train-ground communication, which could result in unnecessary traction, brake or even emergency brake of trains, loss of line capacity and passenger satisfaction. In this paper, we study the random packet drops in CBTC systems, analyze their impact on the performances of CBTC systems, and propose a control scheme to improve CBTC performances. We model the system to control a group of trains as a networked control system with packet drops in transmissions. Extensive simulation results are presented. We show that our proposed scheme can provide less energy consumption, better riding comfortability and total cost reduction.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"4143-4147"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88562642","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.6655455
Kianoush Hosseini, J. Hoydis, S. Brink, M. Debbah
We propose a time division duplex (TDD) based network architecture where a macrocell tier with a “massive” multiple-input multiple-output (MIMO) base station (BS) is overlaid with a dense tier of small cells (SCs). In this context, the TDD protocol and the resulting channel reciprocity have two compelling advantages. First, a large number of BS antennas can be deployed without incurring a prohibitive overhead for channel training. Second, the BS can estimate the interference covariance matrix from the SC tier which can be leveraged for downlink precoding. In particular, the BS designs its precoding vectors to transmit independent data streams to its users while being orthogonal to the subspace spanned by the strongest interference directions; thereby minimizing the sum interference imposed on the SCs. In other words, the BS “sacrifices” some of its antennas for interference cancellation while the TDD protocol allows for an implicit coordination across both tiers. Simulation results suggest that, given a sufficiently large number of BS antennas, the proposed scheme can significantly improve the sum-rate of the SC tier at the price of a small macro performance loss.
{"title":"Massive MIMO and small cells: How to densify heterogeneous networks","authors":"Kianoush Hosseini, J. Hoydis, S. Brink, M. Debbah","doi":"10.1109/ICC.2013.6655455","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655455","url":null,"abstract":"We propose a time division duplex (TDD) based network architecture where a macrocell tier with a “massive” multiple-input multiple-output (MIMO) base station (BS) is overlaid with a dense tier of small cells (SCs). In this context, the TDD protocol and the resulting channel reciprocity have two compelling advantages. First, a large number of BS antennas can be deployed without incurring a prohibitive overhead for channel training. Second, the BS can estimate the interference covariance matrix from the SC tier which can be leveraged for downlink precoding. In particular, the BS designs its precoding vectors to transmit independent data streams to its users while being orthogonal to the subspace spanned by the strongest interference directions; thereby minimizing the sum interference imposed on the SCs. In other words, the BS “sacrifices” some of its antennas for interference cancellation while the TDD protocol allows for an implicit coordination across both tiers. Simulation results suggest that, given a sufficiently large number of BS antennas, the proposed scheme can significantly improve the sum-rate of the SC tier at the price of a small macro performance loss.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"18 1","pages":"5442-5447"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88733950","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.6654752
Yong Li, Depeng Jin, Lieguang Zeng, Sheng Chen
Opportunistic contact between moving vehicles is one of the key features in vehicular delay tolerant networks (VDTNs) that critically influences the design of routing schemes and the network throughput. Due to prohibitive costs to collect enough realistic contact recodes, to the best of our knowledge, little experiment work has been conducted to study the opportunistic contact patterns in large scale urban vehicular mobility environment. In this work, we carry out an extensive experiment involving tens of thousands of operational taxis in Beijing city. Based on studying this newly collected Beijing trace and the existing Shanghai trace, we find some invariant characteristics of the opportunistic contacts for large scale urban VDTN. Specifically, in terms of contact duration, we find that there exists a characteristic time point, up to which and including at least 80% of the distribution, the contact duration obeys an exponential distribution, while beyond which it decays as a power law one. This property is in sharp contrast to the recent empirical data studies based on human mobility, where the contact duration exhibits a power law distribution. In terms of contact interval, we find that its distribution can be modelled by a three-segmented distribution, and there exists a characteristic time point, up to which the contact interval obeys a power law distribution, while beyond which it decays as an exponential one. Our observations thus reveal fundamental patterns for large scale vehicular mobility, and further provide useful guidelines for the design of new urban VDTN' routing protocols and their performance evaluation.
{"title":"Revealing patterns of opportunistic contact durations and intervals for large scale urban vehicular mobility","authors":"Yong Li, Depeng Jin, Lieguang Zeng, Sheng Chen","doi":"10.1109/ICC.2013.6654752","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654752","url":null,"abstract":"Opportunistic contact between moving vehicles is one of the key features in vehicular delay tolerant networks (VDTNs) that critically influences the design of routing schemes and the network throughput. Due to prohibitive costs to collect enough realistic contact recodes, to the best of our knowledge, little experiment work has been conducted to study the opportunistic contact patterns in large scale urban vehicular mobility environment. In this work, we carry out an extensive experiment involving tens of thousands of operational taxis in Beijing city. Based on studying this newly collected Beijing trace and the existing Shanghai trace, we find some invariant characteristics of the opportunistic contacts for large scale urban VDTN. Specifically, in terms of contact duration, we find that there exists a characteristic time point, up to which and including at least 80% of the distribution, the contact duration obeys an exponential distribution, while beyond which it decays as a power law one. This property is in sharp contrast to the recent empirical data studies based on human mobility, where the contact duration exhibits a power law distribution. In terms of contact interval, we find that its distribution can be modelled by a three-segmented distribution, and there exists a characteristic time point, up to which the contact interval obeys a power law distribution, while beyond which it decays as an exponential one. Our observations thus reveal fundamental patterns for large scale vehicular mobility, and further provide useful guidelines for the design of new urban VDTN' routing protocols and their performance evaluation.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"208 1","pages":"1646-1650"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89332489","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.6655243
Khaled M. Ali, S. Lai, G. Messier
Recent advances in power line communications (PLC) have made it popular for in-home networking. This makes PLC an increasingly relevant source of interference for digital subscriber line (DSL) networks within the home environment. This paper presents measured PLC-to-DSL coupling channels for a worst case DSL deployment scenario. We then propose an interference cancelling scheme based on a frequency domain interference canceller (FDIC) that utilizes the common mode (CM) PLC interference to estimate and remove the differential mode (DM) PLC interference. The mean square error (MSE) of the proposed FDIC is derived and compared to the minimum MSE achieved by an optimum Wiener filter. Improvement in the signal to interference plus noise ratio (SINR) achieved by using the FDIC is also presented. Both mathematical analysis and simulation results demonstrate the effectiveness of the proposed FCID in reducing the DM PLC interference on the DM DSL signal.
{"title":"An evaluation of frequency domain PLC interference cancellation for DSL systems","authors":"Khaled M. Ali, S. Lai, G. Messier","doi":"10.1109/ICC.2013.6655243","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655243","url":null,"abstract":"Recent advances in power line communications (PLC) have made it popular for in-home networking. This makes PLC an increasingly relevant source of interference for digital subscriber line (DSL) networks within the home environment. This paper presents measured PLC-to-DSL coupling channels for a worst case DSL deployment scenario. We then propose an interference cancelling scheme based on a frequency domain interference canceller (FDIC) that utilizes the common mode (CM) PLC interference to estimate and remove the differential mode (DM) PLC interference. The mean square error (MSE) of the proposed FDIC is derived and compared to the minimum MSE achieved by an optimum Wiener filter. Improvement in the signal to interference plus noise ratio (SINR) achieved by using the FDIC is also presented. Both mathematical analysis and simulation results demonstrate the effectiveness of the proposed FCID in reducing the DM PLC interference on the DM DSL signal.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"40 1","pages":"4315-4320"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87276428","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.6655088
M. Ohtani, K. Tsukamoto, Y. Koizumi, H. Ohsaki, M. Imase, K. Hato, J. Murayama
Data-centric networking has recently been getting increased attention. A representative design of data-centric networking is CCN (Content-Centric Networking), which routes packets within a network based on their content identifiers. CCN is basically designed to be open because ease of data reuse is one of the greatest advantages of data-centric networking. However, being used for real-world networking, completely open data-centric networking is not sufficient. It is required to realize closed communication within a group of users. In this paper, we propose Virtual Content-Centric Networking (VCCN), which realizes closed communication within a group of users with CCN router virtualization. This paper presents four building blocks of VCCN: extension of the content identifier, CCN router virtualization, packet transport between virtualized CCN routers, and Social Network Services cooperative user/group identification. Moreover, we implemented VCCN's basic features by extending the CCNx software and performed a preliminary performance evaluation of our VCCN implementation.
{"title":"VCCN: Virtual content-centric networking for realizing group-based communication","authors":"M. Ohtani, K. Tsukamoto, Y. Koizumi, H. Ohsaki, M. Imase, K. Hato, J. Murayama","doi":"10.1109/ICC.2013.6655088","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655088","url":null,"abstract":"Data-centric networking has recently been getting increased attention. A representative design of data-centric networking is CCN (Content-Centric Networking), which routes packets within a network based on their content identifiers. CCN is basically designed to be open because ease of data reuse is one of the greatest advantages of data-centric networking. However, being used for real-world networking, completely open data-centric networking is not sufficient. It is required to realize closed communication within a group of users. In this paper, we propose Virtual Content-Centric Networking (VCCN), which realizes closed communication within a group of users with CCN router virtualization. This paper presents four building blocks of VCCN: extension of the content identifier, CCN router virtualization, packet transport between virtualized CCN routers, and Social Network Services cooperative user/group identification. Moreover, we implemented VCCN's basic features by extending the CCNx software and performed a preliminary performance evaluation of our VCCN implementation.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"16 1","pages":"3476-3480"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87311777","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.6654930
Hongting Zhang, Hsiao-Chun Wu, S. Chang
The optimal data-fusion rule was first established for multiple-sensor detection systems in 1986. The probability of false alarm and the probability of miss detection required in this data-fusion rule are quite difficult to precisely enumerate in practice. Although the improved data-fusion implementation techniques are available, most existing cooperative spectrum-sensing techniques are still based on the simple energy-detection algorithm, which is prone to failure in many scenarios. In our previous paper, we proposed a novel adaptive cooperative spectrum-sensing scheme based on Jarque-Bera (JB) statistics. However, the commonly-used sample-average estimator for the cumulative weights becomes unreliable in time-varying environments. To overcome this drawback, in this paper, we adopt a temporal discount factor, which is crucial to the probability estimators. New theoretical analysis to justify the advantage of our proposed new estimators over the conventional sample-average estimators and to determine the optimal numerical value of the proposed discount factor is presented. The Monte Carlo simulation results are also provided to demonstrate the superiority of our proposed adaptive cooperative spectrum sensing method in time-varying environments.
{"title":"Analysis and algorithm for robust adaptive cooperative spectrum-sensing in time-varying environments","authors":"Hongting Zhang, Hsiao-Chun Wu, S. Chang","doi":"10.1109/ICC.2013.6654930","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654930","url":null,"abstract":"The optimal data-fusion rule was first established for multiple-sensor detection systems in 1986. The probability of false alarm and the probability of miss detection required in this data-fusion rule are quite difficult to precisely enumerate in practice. Although the improved data-fusion implementation techniques are available, most existing cooperative spectrum-sensing techniques are still based on the simple energy-detection algorithm, which is prone to failure in many scenarios. In our previous paper, we proposed a novel adaptive cooperative spectrum-sensing scheme based on Jarque-Bera (JB) statistics. However, the commonly-used sample-average estimator for the cumulative weights becomes unreliable in time-varying environments. To overcome this drawback, in this paper, we adopt a temporal discount factor, which is crucial to the probability estimators. New theoretical analysis to justify the advantage of our proposed new estimators over the conventional sample-average estimators and to determine the optimal numerical value of the proposed discount factor is presented. The Monte Carlo simulation results are also provided to demonstrate the superiority of our proposed adaptive cooperative spectrum sensing method in time-varying environments.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"19 1","pages":"2617-2621"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87355427","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.6655123
A. Akhtar, M. R. Nakhai, H. Aghvami
In this paper, cooperative physical layer network coding (CPLNC) is introduced as an energy efficient transmission strategy for future wireless networks. Implementation framework for CPLNC is presented and its performance is analyzed in Rayleigh fading channels. To demonstrate the effectiveness of the proposed scheme in saving energy, we incorporate CPLNC in two major energy-efficient routing algorithms. Simulation results demonstrate the effectiveness of the proposed algorithms in reducing energy consumption.
{"title":"CPLNC based energy efficient routing in Rayleigh fading networks","authors":"A. Akhtar, M. R. Nakhai, H. Aghvami","doi":"10.1109/ICC.2013.6655123","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655123","url":null,"abstract":"In this paper, cooperative physical layer network coding (CPLNC) is introduced as an energy efficient transmission strategy for future wireless networks. Implementation framework for CPLNC is presented and its performance is analyzed in Rayleigh fading channels. To demonstrate the effectiveness of the proposed scheme in saving energy, we incorporate CPLNC in two major energy-efficient routing algorithms. Simulation results demonstrate the effectiveness of the proposed algorithms in reducing energy consumption.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"28 1","pages":"3666-3671"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87430857","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
扫码关注我们
求助内容：
应助结果提醒方式：