Pub Date : 2013-03-20DOI: 10.1109/CISS.2013.6552318
Mohamed Hassanin, J. Garcia-Frías
We investigate the performance of analog joint source channel coding systems based on the use of spiral-like space filling curves for the transmission of Gaussian sources over non-linear channels, including channels of the type encountered in underwater acoustic communications. We focus on bandwidth reduction schemes where two i.i.d. samples are mapped to one channel symbol. We evaluate the theoretical limits for some of the non-linear channels and extend existing analog coding schemes to deal with the channel non-linearities, demonstrating that the system performance is very close to the theoretical limits for a wide range of signal to noise ratios.
{"title":"Analog joint source channel coding over non-linear acoustic channels","authors":"Mohamed Hassanin, J. Garcia-Frías","doi":"10.1109/CISS.2013.6552318","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552318","url":null,"abstract":"We investigate the performance of analog joint source channel coding systems based on the use of spiral-like space filling curves for the transmission of Gaussian sources over non-linear channels, including channels of the type encountered in underwater acoustic communications. We focus on bandwidth reduction schemes where two i.i.d. samples are mapped to one channel symbol. We evaluate the theoretical limits for some of the non-linear channels and extend existing analog coding schemes to deal with the channel non-linearities, demonstrating that the system performance is very close to the theoretical limits for a wide range of signal to noise ratios.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115629506","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-03-20DOI: 10.1109/CISS.2013.6552270
Y. S. Khiabani, Shuangqing Wei, Jian Wang, Jian Yuan
In this paper we propose an encoding-encryption approach to take advantage of intentional noise introduced in ciphertexts for a block cipher working in CFB or CBC mode. First of all, we provide a rigorous analysis of the impacts of channel degradation on block ciphered systems. We show that the overall channel can be modeled as a Finite State Markov Chain (FSMC) with symmetric channels associated in each state, whose underlying non-coherent Shannon capacity is derived and computed. Despite Eve's efforts in modifying her linear crytanalysis given the intercepted noisy ciphertexts, there is still a non-negligible probability of having possible failures in her attack. We essentially create a wiretap channel in application layer that is a degraded version of the main channel and measure security of the system in terms of secrecy capacity and show that it depends on the deliberately introduced bit error rate. In addition, Alice can accordingly adjust cross over probability of the channel to maximize secrecy rate. This secrecy rate can be achieved by wiretap channel coding over multiple frames in application layer if the delay in system is bearable.
{"title":"Secrecy enhancement of block ciphered systems with deliberate noise in Non-coherent scenario","authors":"Y. S. Khiabani, Shuangqing Wei, Jian Wang, Jian Yuan","doi":"10.1109/CISS.2013.6552270","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552270","url":null,"abstract":"In this paper we propose an encoding-encryption approach to take advantage of intentional noise introduced in ciphertexts for a block cipher working in CFB or CBC mode. First of all, we provide a rigorous analysis of the impacts of channel degradation on block ciphered systems. We show that the overall channel can be modeled as a Finite State Markov Chain (FSMC) with symmetric channels associated in each state, whose underlying non-coherent Shannon capacity is derived and computed. Despite Eve's efforts in modifying her linear crytanalysis given the intercepted noisy ciphertexts, there is still a non-negligible probability of having possible failures in her attack. We essentially create a wiretap channel in application layer that is a degraded version of the main channel and measure security of the system in terms of secrecy capacity and show that it depends on the deliberately introduced bit error rate. In addition, Alice can accordingly adjust cross over probability of the channel to maximize secrecy rate. This secrecy rate can be achieved by wiretap channel coding over multiple frames in application layer if the delay in system is bearable.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114383810","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-03-20DOI: 10.1109/CISS.2013.6624255
Teng Yang, Yuhan Dong, Xuedan Zhang
Time synchronization is a critical issue in distributed systems especially for wireless sensor networks (WSNs). Most existing synchronization algorithms, such as Reference Broadcasts Synchronization (RBS), Time-sync Protocol for Sensor Networks (TPSN), Flooding Time Synchronization Protocol (FTSP) and etc., assumed instantaneous communication between the pair of nodes intended for synchronization, which is however hard to implement in high latency systems. Time Synchronization for High Latency networks (TSHL) is another algorithm to address this problem for short range networks and ideally assumes constant clock skew during synchronization, which is impractical for longer communication distance with higher latency and viable clock skew. By analyzing the compensating error of TSHL, we proposed a novel frequency tracking synchronization algorithm for high latency networks. Numerical results suggest that the proposed algorithm works well for variable clock skew and outperforms TSHL scheme.
{"title":"Frequency tracking synchronization algorithm for high latency wireless sensor networks","authors":"Teng Yang, Yuhan Dong, Xuedan Zhang","doi":"10.1109/CISS.2013.6624255","DOIUrl":"https://doi.org/10.1109/CISS.2013.6624255","url":null,"abstract":"Time synchronization is a critical issue in distributed systems especially for wireless sensor networks (WSNs). Most existing synchronization algorithms, such as Reference Broadcasts Synchronization (RBS), Time-sync Protocol for Sensor Networks (TPSN), Flooding Time Synchronization Protocol (FTSP) and etc., assumed instantaneous communication between the pair of nodes intended for synchronization, which is however hard to implement in high latency systems. Time Synchronization for High Latency networks (TSHL) is another algorithm to address this problem for short range networks and ideally assumes constant clock skew during synchronization, which is impractical for longer communication distance with higher latency and viable clock skew. By analyzing the compensating error of TSHL, we proposed a novel frequency tracking synchronization algorithm for high latency networks. Numerical results suggest that the proposed algorithm works well for variable clock skew and outperforms TSHL scheme.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117268297","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-03-20DOI: 10.1109/CISS.2013.6552258
K. Wagner, M. Doroslovački
The concept of self-orthogonalizing adaptation is extended from the least mean square algorithm to the general case of complex proportionate type normalized least mean square algorithms. The derived algorithm requires knowledge of the input signal's covariance matrix. Implementation of the algorithm using a fixed transform such as the discrete cosine transform or discrete wavelet transform is presented for applications in which the input signal's covariance matrix is unknown.
{"title":"Transform domain CPtNLMS algorithms","authors":"K. Wagner, M. Doroslovački","doi":"10.1109/CISS.2013.6552258","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552258","url":null,"abstract":"The concept of self-orthogonalizing adaptation is extended from the least mean square algorithm to the general case of complex proportionate type normalized least mean square algorithms. The derived algorithm requires knowledge of the input signal's covariance matrix. Implementation of the algorithm using a fixed transform such as the discrete cosine transform or discrete wavelet transform is presented for applications in which the input signal's covariance matrix is unknown.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129552213","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-03-20DOI: 10.1109/CISS.2013.6552260
A. Andreou, Thomas S. Murray, P. Pouliquen
Signal to symbol converters (SSCs) are an emerging class of integrated microsystems aimed at an informed and intelligent conversion of signals to symbols. We present an architecture overview for signal to symbol converters, discuss related prior work and outline future opportunities and challenges.
{"title":"Signal to symbol converters: Overview, opportunities and challenges","authors":"A. Andreou, Thomas S. Murray, P. Pouliquen","doi":"10.1109/CISS.2013.6552260","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552260","url":null,"abstract":"Signal to symbol converters (SSCs) are an emerging class of integrated microsystems aimed at an informed and intelligent conversion of signals to symbols. We present an architecture overview for signal to symbol converters, discuss related prior work and outline future opportunities and challenges.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130086203","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-03-20DOI: 10.1109/CISS.2013.6624264
Qiao Fu, B. Banitalebi, Lin Zhang, M. Beigl
Mobile Wireless Sensor Networks (WSN) provide sensing coverage of huge areas by deploying mobile entities to collect sensing data from the static sensors and aggregate to the access points. Comparing with static WSN, such network can provide low cost, high throughput, large scale sensing coverage. However, data collection in mobile WSN strongly relies on the movement of the mobiles. Sensing data may not be collected effectively due to the limitation of the mobiles. In this paper, we introduce an energy efficient Collaborative Communication (CC) in WSN to ensure effective data collection in mobile WSN. Experiments on real taxi trajectories of 27; 000 taxis in the Beijing city show that energy efficient CC decrease the energy consumption of the urban sensing network in Beijing comparing with individual communication, with an ensurance of data collection ratio larger than 80%.
{"title":"Energy-efficient collaborative data collection in mobile wireless sensor networks","authors":"Qiao Fu, B. Banitalebi, Lin Zhang, M. Beigl","doi":"10.1109/CISS.2013.6624264","DOIUrl":"https://doi.org/10.1109/CISS.2013.6624264","url":null,"abstract":"Mobile Wireless Sensor Networks (WSN) provide sensing coverage of huge areas by deploying mobile entities to collect sensing data from the static sensors and aggregate to the access points. Comparing with static WSN, such network can provide low cost, high throughput, large scale sensing coverage. However, data collection in mobile WSN strongly relies on the movement of the mobiles. Sensing data may not be collected effectively due to the limitation of the mobiles. In this paper, we introduce an energy efficient Collaborative Communication (CC) in WSN to ensure effective data collection in mobile WSN. Experiments on real taxi trajectories of 27; 000 taxis in the Beijing city show that energy efficient CC decrease the energy consumption of the urban sensing network in Beijing comparing with individual communication, with an ensurance of data collection ratio larger than 80%.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130205065","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-03-20DOI: 10.1109/CISS.2013.6552285
Sudarshan Ramenahalli, Daniel R. Mendat, S. Dura-Bernal, E. Culurciello, E. Niebur, A. Andreou
In this paper we provide an overview of audiovisual saliency map models. In the simplest model, the location of auditory source is modeled as a Gaussian and use different methods of combining the auditory and visual information. We then provide experimental results with applications of simple audio-visual integration models for cognitive scene analysis. We validate the simple audio-visual saliency models with a hardware convolutional network architecture and real data recorded from moving audio-visual objects. The latter system was developed under Torch language by extending the attention.lua (code) and attention.ui (GUI) files that implement Culurciello's visual attention model.
{"title":"Audio-visual saliency map: Overview, basic models and hardware implementation","authors":"Sudarshan Ramenahalli, Daniel R. Mendat, S. Dura-Bernal, E. Culurciello, E. Niebur, A. Andreou","doi":"10.1109/CISS.2013.6552285","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552285","url":null,"abstract":"In this paper we provide an overview of audiovisual saliency map models. In the simplest model, the location of auditory source is modeled as a Gaussian and use different methods of combining the auditory and visual information. We then provide experimental results with applications of simple audio-visual integration models for cognitive scene analysis. We validate the simple audio-visual saliency models with a hardware convolutional network architecture and real data recorded from moving audio-visual objects. The latter system was developed under Torch language by extending the attention.lua (code) and attention.ui (GUI) files that implement Culurciello's visual attention model.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114201986","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-03-20DOI: 10.1109/CISS.2013.6552296
S. Gutta, Qi Cheng
The problem of classification arises in many realworld applications. Often classification of more than two classes is broken down into a group of binary classification problems using the one-versus-rest or pairwise approaches. For each binary classification problem, feature selection and classifier design are usually conducted separately. In this paper, we propose a new multitask learning approach in which feature selection and classifier design for all the binary classification tasks are carried out simultaneously. We consider probabilistic nonlinear kernel classifiers for binary classification. For each binary classifier, we give weights to the features within the kernels. We assume that the matrix consisting of all the feature weights for all the tasks has a sparse component and a low rank component. The sparse component determines the features that are relevant to each classifier, and the low rank component determines the common feature subspace that is relevant to all the classifiers. Experimental results on synthetic data demonstrate that the proposed approach achieves higher classification accuracy compared to the conventional classifiers. The proposed method accurately determines the relevant features that are important to each binary classifier.
{"title":"Joint multitask feature learning and classifier design","authors":"S. Gutta, Qi Cheng","doi":"10.1109/CISS.2013.6552296","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552296","url":null,"abstract":"The problem of classification arises in many realworld applications. Often classification of more than two classes is broken down into a group of binary classification problems using the one-versus-rest or pairwise approaches. For each binary classification problem, feature selection and classifier design are usually conducted separately. In this paper, we propose a new multitask learning approach in which feature selection and classifier design for all the binary classification tasks are carried out simultaneously. We consider probabilistic nonlinear kernel classifiers for binary classification. For each binary classifier, we give weights to the features within the kernels. We assume that the matrix consisting of all the feature weights for all the tasks has a sparse component and a low rank component. The sparse component determines the features that are relevant to each classifier, and the low rank component determines the common feature subspace that is relevant to all the classifiers. Experimental results on synthetic data demonstrate that the proposed approach achieves higher classification accuracy compared to the conventional classifiers. The proposed method accurately determines the relevant features that are important to each binary classifier.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123795885","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-03-20DOI: 10.1109/CISS.2013.6552325
Jayaprakash Rajasekharan, J. Lundén, V. Koivunen
In this paper, we propose to model smart grid households equipped with energy storage systems in a local neighbourhood as a divisible two-good exchange economy market. Households or users cooperate to trade these goods, in this case, their real-time energy supplied by utility company and their stored energy in order to minimize consumption cost. Difference in pricing mechanisms adopted by utility companies that serve the locality gives incentive for users to trade real-time energy. Households schedule their storage devices to be charged during low-price off-peak hours and sell the surplus stored energy to neighbours during peak hours to generate additional income. This creates a trading environment or a market where users exchange real-time energy and stored energy at certain prices. Preference relations of users capture how energy is valued in an economy by each user. We model these preferences as a utility that is a continuous, monotonic, quasi-convex function of energy. Given a set of endowments, consumption profiles and energy prices in the market for each user, we show that a market is created where real-time energy and stored energy are exchanged between users and such an exchange takes place at the competitive equilibrium. We analyze a simple two-user two-good exchange economy market to illustrate the concepts discussed above and prove that the trading prices of the goods in the market regulate themselves in such a way that trading results in reduced costs for both users.
{"title":"Competitive equilibrium pricing and cooperation in smart grids with energy storage","authors":"Jayaprakash Rajasekharan, J. Lundén, V. Koivunen","doi":"10.1109/CISS.2013.6552325","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552325","url":null,"abstract":"In this paper, we propose to model smart grid households equipped with energy storage systems in a local neighbourhood as a divisible two-good exchange economy market. Households or users cooperate to trade these goods, in this case, their real-time energy supplied by utility company and their stored energy in order to minimize consumption cost. Difference in pricing mechanisms adopted by utility companies that serve the locality gives incentive for users to trade real-time energy. Households schedule their storage devices to be charged during low-price off-peak hours and sell the surplus stored energy to neighbours during peak hours to generate additional income. This creates a trading environment or a market where users exchange real-time energy and stored energy at certain prices. Preference relations of users capture how energy is valued in an economy by each user. We model these preferences as a utility that is a continuous, monotonic, quasi-convex function of energy. Given a set of endowments, consumption profiles and energy prices in the market for each user, we show that a market is created where real-time energy and stored energy are exchanged between users and such an exchange takes place at the competitive equilibrium. We analyze a simple two-user two-good exchange economy market to illustrate the concepts discussed above and prove that the trading prices of the goods in the market regulate themselves in such a way that trading results in reduced costs for both users.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125612439","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-03-20DOI: 10.1109/CISS.2013.6552280
A. Ammar, D. Reynolds
The use of cooperative communication technology in energy harvesting sensor networks is one of the most viable solutions to overcome the power limitations of the battery-powerd sensor networks. However, combining cooperative communication and energy harvesting in a network requires an efficient and a practical relay usage scheduling scheme to maximize the overall packet delivery ratio. This paper considers a wireless sensor network with energy harvesting and cooperative communication, and proposes a practical scheme that maximizes the packet delivery ratio of the system. The results show that our scheme provides almost the same performance of the threshold based scheme (state-of-the-art scheme) using the same system parameters. Compared to the threshold scheme that has a tunable parameter (threshold value) for each set of system parameters, the results show that our scheme does not require any tunable parameter to maximize the performance. In the threshold based scheme, if one of the system parameters changes, the sensors need to tune the threshold level at a new value to maintain the maximum performance. Tuning the threshold at a certain value requires simulating the system at different threshold levels to get that tunable value. This is not easy and might not even be practical to implement especially in networks of thousands of sensors with unstable parameters. So, no need for any tunable parameter makes our scheme easier and more practical to be used. Also, it makes our scheme more flexible to adjust the performance of the source and relay to ensure fairness between them.
{"title":"A practical relay scheduling scheme for wireless sensor networks with energy harvesting","authors":"A. Ammar, D. Reynolds","doi":"10.1109/CISS.2013.6552280","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552280","url":null,"abstract":"The use of cooperative communication technology in energy harvesting sensor networks is one of the most viable solutions to overcome the power limitations of the battery-powerd sensor networks. However, combining cooperative communication and energy harvesting in a network requires an efficient and a practical relay usage scheduling scheme to maximize the overall packet delivery ratio. This paper considers a wireless sensor network with energy harvesting and cooperative communication, and proposes a practical scheme that maximizes the packet delivery ratio of the system. The results show that our scheme provides almost the same performance of the threshold based scheme (state-of-the-art scheme) using the same system parameters. Compared to the threshold scheme that has a tunable parameter (threshold value) for each set of system parameters, the results show that our scheme does not require any tunable parameter to maximize the performance. In the threshold based scheme, if one of the system parameters changes, the sensors need to tune the threshold level at a new value to maintain the maximum performance. Tuning the threshold at a certain value requires simulating the system at different threshold levels to get that tunable value. This is not easy and might not even be practical to implement especially in networks of thousands of sensors with unstable parameters. So, no need for any tunable parameter makes our scheme easier and more practical to be used. Also, it makes our scheme more flexible to adjust the performance of the source and relay to ensure fairness between them.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121278732","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
扫码关注我们
求助内容：
应助结果提醒方式：