Pub Date : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503680
Shun Zhang, F. Gao, Changxing Pei, Xiandeng He
In this paper, we design a segment training based individual channel estimation scheme in the classical three-node amplify-and-forward one-way relay network (OWRN). We investigate the underlying power allocation at the relay to minimize the mean-square-error (MSE) of the individual channel estimation and to maximize the average effective signal-to-noise ratio (AESNR) of the data detection. The optimal/sub-optimal power allocation schemes are also derived for the two objectives. Extensive numerical results are provided to corroborate the proposed studies.
{"title":"Segment training based individual channel estimation for one-way relay network","authors":"Shun Zhang, F. Gao, Changxing Pei, Xiandeng He","doi":"10.1109/GLOCOM.2012.6503680","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503680","url":null,"abstract":"In this paper, we design a segment training based individual channel estimation scheme in the classical three-node amplify-and-forward one-way relay network (OWRN). We investigate the underlying power allocation at the relay to minimize the mean-square-error (MSE) of the individual channel estimation and to maximize the average effective signal-to-noise ratio (AESNR) of the data detection. The optimal/sub-optimal power allocation schemes are also derived for the two objectives. Extensive numerical results are provided to corroborate the proposed studies.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88852140","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503490
Gang Liu, Hong Ji, Yi Li, Xiaoliang Zhang
Recently, the MIMO two-way AF relaying, a promising spectral efficient transmission technique, has attracted a great deal of attention. Meanwhile, it has been shown that it is possible to improve the performance of MEMO systems by employing antenna selection technology. Existing antenna selection algorithms in MEMO two-way AF relay assume perfect channel state information(CSI). However, as a matter of fact, it is difficult to obtain perfect CSI. In this paper, considering the antenna correlation and channel estimation error, we derive the lower bound on sum rate utilizing worst case uncorrelated additive noise theorem in MIMO two-way AF relaying system, and analyze the effect of antenna correlation and channel estimation error on the sum rate. Then, an optimal relay antenna selection algorithm based on discrete stochastic optimization is proposed to maximize the sum rate under the assumption of imperfect CSI. We also prove the convergence of the proposed algorithm through theoretical analysis. Through extensive numerical simulation, we observe that the proposed relay antenna selection algorithm converges to the best antenna set obtained by exhaustive search when only imperfect CSI is available.
{"title":"Sum rate maximization antenna selection via discrete stochastic approximation in MIMO two-way AF relay with imperfect CSI","authors":"Gang Liu, Hong Ji, Yi Li, Xiaoliang Zhang","doi":"10.1109/GLOCOM.2012.6503490","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503490","url":null,"abstract":"Recently, the MIMO two-way AF relaying, a promising spectral efficient transmission technique, has attracted a great deal of attention. Meanwhile, it has been shown that it is possible to improve the performance of MEMO systems by employing antenna selection technology. Existing antenna selection algorithms in MEMO two-way AF relay assume perfect channel state information(CSI). However, as a matter of fact, it is difficult to obtain perfect CSI. In this paper, considering the antenna correlation and channel estimation error, we derive the lower bound on sum rate utilizing worst case uncorrelated additive noise theorem in MIMO two-way AF relaying system, and analyze the effect of antenna correlation and channel estimation error on the sum rate. Then, an optimal relay antenna selection algorithm based on discrete stochastic optimization is proposed to maximize the sum rate under the assumption of imperfect CSI. We also prove the convergence of the proposed algorithm through theoretical analysis. Through extensive numerical simulation, we observe that the proposed relay antenna selection algorithm converges to the best antenna set obtained by exhaustive search when only imperfect CSI is available.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85257925","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503772
Kai Yang, Jie Yang, Liyu Cai
The performance of orthogonal space-time block code (OSTBC) transmission in dual-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying networks over spatially correlated Nakagami-m fading channel is investigated, where the source, relay, and destination terminals are all equipped with multiple antennas. We provide the compact closed-form expression for cumulative distribution function (CDF) of the end-to-end SNR and then exact analytical expressions are derived for the outage probability (OP), probability density function (PDF), and moment generating function (MGF) of the end-to-end SNR based on its CDF. Further, we present the asymptotic expression for CDF in the high SNR regime, which gives an insight of the system performance and the achievable diversity order. The analytical expressions are validated by Monte-Carlo simulations. It's shown that the correlation is detrimental to the MIMO relaying performance.
{"title":"Performance of OSTBC transmission in dual-hop amplify-and-forward MIMO relaying systems over spatially correlated Nakagami-m fading channels","authors":"Kai Yang, Jie Yang, Liyu Cai","doi":"10.1109/GLOCOM.2012.6503772","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503772","url":null,"abstract":"The performance of orthogonal space-time block code (OSTBC) transmission in dual-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying networks over spatially correlated Nakagami-m fading channel is investigated, where the source, relay, and destination terminals are all equipped with multiple antennas. We provide the compact closed-form expression for cumulative distribution function (CDF) of the end-to-end SNR and then exact analytical expressions are derived for the outage probability (OP), probability density function (PDF), and moment generating function (MGF) of the end-to-end SNR based on its CDF. Further, we present the asymptotic expression for CDF in the high SNR regime, which gives an insight of the system performance and the achievable diversity order. The analytical expressions are validated by Monte-Carlo simulations. It's shown that the correlation is detrimental to the MIMO relaying performance.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81899527","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503819
Yu Zhang, Zhaoyang Zhang, Rui Yin, Guanding Yu, Wei Wang
In this paper, we design a joint channel-network coding scheme based on rateless code for the three-stage two-way relay system, where two terminals send messages to each other through a relay between them. Each terminal takes one of the first two stages to encode its message using a Raptor Code and then broadcasts the result into the air, respectively. In the third stage, upon successfully decoding the corresponding messages, the relay node re-encodes them with the new Raptor Codes, and then XORs the outputs and broadcasts the result to both terminals. Together with the packets received directly in previous stages, each terminal then retrieves the desired message using an iterative decoder. Here, the degree profiles of the Raptor Codes used at each node are jointly optimized through solving a set of linear programming problems. Simulations show that, the system throughput achieved by the optimized degree profiles always outperforms the one with conventional degree profile optimized for binary erasure channel (BEC) and the conventional network coding scheme with rateless coding.
{"title":"Joint channel-network coding with rateless code in two-way relay system","authors":"Yu Zhang, Zhaoyang Zhang, Rui Yin, Guanding Yu, Wei Wang","doi":"10.1109/GLOCOM.2012.6503819","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503819","url":null,"abstract":"In this paper, we design a joint channel-network coding scheme based on rateless code for the three-stage two-way relay system, where two terminals send messages to each other through a relay between them. Each terminal takes one of the first two stages to encode its message using a Raptor Code and then broadcasts the result into the air, respectively. In the third stage, upon successfully decoding the corresponding messages, the relay node re-encodes them with the new Raptor Codes, and then XORs the outputs and broadcasts the result to both terminals. Together with the packets received directly in previous stages, each terminal then retrieves the desired message using an iterative decoder. Here, the degree profiles of the Raptor Codes used at each node are jointly optimized through solving a set of linear programming problems. Simulations show that, the system throughput achieved by the optimized degree profiles always outperforms the one with conventional degree profile optimized for binary erasure channel (BEC) and the conventional network coding scheme with rateless coding.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75845206","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6504002
Chih-Hua Chang, Hung-Yun Hsieh
Many applications involving machine-to-machine (M2M) communications are characterized by the large amount of data to transport. To address the “big data” problem introduced by these M2M applications, we argue in this paper that instead of focusing on serving individual machines with better quality, one should focus on solutions that can better serve the data itself. To substantiate this concept, we consider the scenario of data gathering in a wide area by machines that are connected to a central aggregator through direct wireless links. The aggregator has limited radio resources to allocate to machines for uplink transmission of collected data, and hence the problem arises as to how the resources can be effectively utilized for supporting such an M2M application. In contrast to conventional approaches on maximizing the number of machines that can access the radio resources, we investigate an approach that takes into consideration “useful” information content that individual machines can provide for prioritization of resource allocation. Numerical results based on the proposed algorithms show that although the number of machines that can be supported is not maximized, the data so collected at the aggregator does exhibit significant quality gain for the target M2M scenario, thus motivating further investigation along this direction.
{"title":"Not every bit counts: A resource allocation problem for data gathering in machine-to-machine communications","authors":"Chih-Hua Chang, Hung-Yun Hsieh","doi":"10.1109/GLOCOM.2012.6504002","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6504002","url":null,"abstract":"Many applications involving machine-to-machine (M2M) communications are characterized by the large amount of data to transport. To address the “big data” problem introduced by these M2M applications, we argue in this paper that instead of focusing on serving individual machines with better quality, one should focus on solutions that can better serve the data itself. To substantiate this concept, we consider the scenario of data gathering in a wide area by machines that are connected to a central aggregator through direct wireless links. The aggregator has limited radio resources to allocate to machines for uplink transmission of collected data, and hence the problem arises as to how the resources can be effectively utilized for supporting such an M2M application. In contrast to conventional approaches on maximizing the number of machines that can access the radio resources, we investigate an approach that takes into consideration “useful” information content that individual machines can provide for prioritization of resource allocation. Numerical results based on the proposed algorithms show that although the number of machines that can be supported is not maximized, the data so collected at the aggregator does exhibit significant quality gain for the target M2M scenario, thus motivating further investigation along this direction.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81149113","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}
In this paper, the power optimization of the multicarrier cognitive system underlying the primary network is investigated. We consider the interference coupled cognitive network under individual secondary user's power constraint and primary user's rate constraint. A multicarrier discrete distributed (MCDD) algorithm based on Gibbs sampler is proposed. Although the problem is nonconcave, MCDD is proved to converge to the global optimal solution. To reduce the computational complexity and convergence time, the Gibbs sampler based Lagrangian algorithm (GSLA) is proposed to get a near optimal solution. We also provide simulation results to show the effectiveness of the proposed algorithms.
{"title":"Distributed optimal power control for multicarrier cognitive systems","authors":"Guanying Ru, Hongxiang Li, Thuan T. Tran, Weiyao Lin, Lingjia Liu, Huasen Wu","doi":"10.1109/GLOCOM.2012.6503265","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503265","url":null,"abstract":"In this paper, the power optimization of the multicarrier cognitive system underlying the primary network is investigated. We consider the interference coupled cognitive network under individual secondary user's power constraint and primary user's rate constraint. A multicarrier discrete distributed (MCDD) algorithm based on Gibbs sampler is proposed. Although the problem is nonconcave, MCDD is proved to converge to the global optimal solution. To reduce the computational complexity and convergence time, the Gibbs sampler based Lagrangian algorithm (GSLA) is proposed to get a near optimal solution. We also provide simulation results to show the effectiveness of the proposed algorithms.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86344990","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503221
Jianhua Mo, Xiawen Xiao, M. Tao, Nanrun Zhou
Hash functions are often used to protect the integrity of information. In general, the design of hash functions should satisfy three standards: pre-image resistance, second pre-image resistance and collision resistance. The design of hash functions in the literature assumes that the messages to be transmitted are equally probable. In this paper, we focus on the pre-image resistance and investigate the problem of mapping design for hash function utilizing the unequal occurrence probabilities of the messages. We first present a necessary condition for the optimal mapping and then introduce a heuristic algorithm. Simulation experiments are carried out to evaluate the performance of the proposed new design. It is shown that the probability of successful attack can be significantly reduced compared with the conventional design. Our algorithm can be useful in scenarios where the attacker has limited ability or time to estimate the probability distribution of the messages. To our best knowledge, this work is the first attempt of making use of the message distribution in designing hash functions for information security.
{"title":"Hash function mapping design utilizing probability distribution for pre-image resistance","authors":"Jianhua Mo, Xiawen Xiao, M. Tao, Nanrun Zhou","doi":"10.1109/GLOCOM.2012.6503221","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503221","url":null,"abstract":"Hash functions are often used to protect the integrity of information. In general, the design of hash functions should satisfy three standards: pre-image resistance, second pre-image resistance and collision resistance. The design of hash functions in the literature assumes that the messages to be transmitted are equally probable. In this paper, we focus on the pre-image resistance and investigate the problem of mapping design for hash function utilizing the unequal occurrence probabilities of the messages. We first present a necessary condition for the optimal mapping and then introduce a heuristic algorithm. Simulation experiments are carried out to evaluate the performance of the proposed new design. It is shown that the probability of successful attack can be significantly reduced compared with the conventional design. Our algorithm can be useful in scenarios where the attacker has limited ability or time to estimate the probability distribution of the messages. To our best knowledge, this work is the first attempt of making use of the message distribution in designing hash functions for information security.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90294422","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503861
B. Han, Zhongyuan Zhao, M. Peng, Yong Li, Wenbo Wang
Joint scheduling and resource allocation in uplink orthogonal frequency division multiplexing (OFDM) systems is complicated, and even gets intractable with large subcarrier and user number. This paper investigates the resource allocation for OFDM-based multi-user multiple-access relay channels (MARC) with network coding. We formulate a joint optimization problem considering source pairing, subcarrier assignment, subcarrier pairing and power allocation to maximize the sum-rate under per-user power constraint. The problem is addressed in polynomial time by optimizing three separate subproblems, and afterwards three low-complexity suboptimal algorithms are further proposed. The simulation results demonstrate performance gain of the proposed algorithms versus per-node transmit power and source nodes number, respectively.
{"title":"Resource allocation for OFDM multiple-access relay channels with network coding","authors":"B. Han, Zhongyuan Zhao, M. Peng, Yong Li, Wenbo Wang","doi":"10.1109/GLOCOM.2012.6503861","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503861","url":null,"abstract":"Joint scheduling and resource allocation in uplink orthogonal frequency division multiplexing (OFDM) systems is complicated, and even gets intractable with large subcarrier and user number. This paper investigates the resource allocation for OFDM-based multi-user multiple-access relay channels (MARC) with network coding. We formulate a joint optimization problem considering source pairing, subcarrier assignment, subcarrier pairing and power allocation to maximize the sum-rate under per-user power constraint. The problem is addressed in polynomial time by optimizing three separate subproblems, and afterwards three low-complexity suboptimal algorithms are further proposed. The simulation results demonstrate performance gain of the proposed algorithms versus per-node transmit power and source nodes number, respectively.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79732231","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503703
Liang Sun, M. Lei
This paper considers signal processing algorithms for the downlink coordinated multi-point multiple-input multiple-output (MIMO) systems with multiple-antenna users. A novel adaptive joint nonlinear transmit-receive processing algorithm is proposed based on zero-forcing (ZF) criterion. In this algorithm, a block successive ZF precoding is first applied at the multiple base stations to pre-cancel partial multiuser interference. Then nonlinear Tomlinson-Harashima precoding is applied to further reduce interference between the data streams of other users and the other data streams of the same user, whereas linear equalization and modulo operation are applied at each user. We first show that the proposed joint nonlinear transmit-receive processing algorithm effectively decomposes the multiuser MIMO channel into parallel independent single-user MIMO channels. Different from the method in [1], our proposed algorithm allows the number of sub-channels of each user to be arbitrary number no more than the rank of that user's equivalent channel, and then for the given set of the numbers of sub-channels and the given power allocation of all users, closed-form expressions of the transmit and receive processing matrices are derived to optimize the output signal to interference plus noise ratio of each user. Subsequently, an adaptive method is proposed to adapt the number of sub-channels according to the fading of the users' channel matrices (termed as adaptive algorithm). Simulation results show that the proposed algorithm achieves much better throughput performance than the processing methods in the literature, such as the non-adaptive nonlinear preprocessing algorithm in [1] and the known block diagonalization techniques.
{"title":"Adaptive joint nonlinear transmit-receive processing for multi-cell MIMO networks","authors":"Liang Sun, M. Lei","doi":"10.1109/GLOCOM.2012.6503703","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503703","url":null,"abstract":"This paper considers signal processing algorithms for the downlink coordinated multi-point multiple-input multiple-output (MIMO) systems with multiple-antenna users. A novel adaptive joint nonlinear transmit-receive processing algorithm is proposed based on zero-forcing (ZF) criterion. In this algorithm, a block successive ZF precoding is first applied at the multiple base stations to pre-cancel partial multiuser interference. Then nonlinear Tomlinson-Harashima precoding is applied to further reduce interference between the data streams of other users and the other data streams of the same user, whereas linear equalization and modulo operation are applied at each user. We first show that the proposed joint nonlinear transmit-receive processing algorithm effectively decomposes the multiuser MIMO channel into parallel independent single-user MIMO channels. Different from the method in [1], our proposed algorithm allows the number of sub-channels of each user to be arbitrary number no more than the rank of that user's equivalent channel, and then for the given set of the numbers of sub-channels and the given power allocation of all users, closed-form expressions of the transmit and receive processing matrices are derived to optimize the output signal to interference plus noise ratio of each user. Subsequently, an adaptive method is proposed to adapt the number of sub-channels according to the fading of the users' channel matrices (termed as adaptive algorithm). Simulation results show that the proposed algorithm achieves much better throughput performance than the processing methods in the literature, such as the non-adaptive nonlinear preprocessing algorithm in [1] and the known block diagonalization techniques.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88308892","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503526
Honglei Jiang, Song Guo, Deze Zeng, Hai Jin
Recently, BitTorrent (BT) communities are rapidly evolving towards Private Torrent (PT) sites. The efficiency of such content sharing system depends on how well it can satisfy the requirements of users. The traditional way to improve usability is to make users extend their seeding duration by incentives like Share Ratio Enforcement (SRE). However, our measurement-based studies show its inefficiency in meeting various download requests from users. For example, some available contents have not been requested for long and some requests are not available, recognized as the “available but no request” and “request but not available” problems respectively. To make the content availability match users' download demands, we propose new incentive polices that only reward the seeding behaviors for needed torrents. This is achieved by providing users the rewarding information of seeding various contents that vary based on their interests and timeliness to the community. Our trace-driven simulation result shows the proposed “Max Cost Interval” and “Max Time Interval” policies can significantly improve the content over existing policies in a more cost-efficient way.
最近，BT (BitTorrent)社区正迅速向Private Torrent (PT)网站发展。这种内容共享系统的效率取决于它能在多大程度上满足用户的需求。提高可用性的传统方法是通过Share Ratio Enforcement (SRE)等激励措施让用户延长播种时间。然而，我们基于测量的研究表明，它在满足用户的各种下载请求方面效率低下。例如，一些可用的内容长时间未被请求，而一些请求不可用，分别被识别为“可用但无请求”和“请求但不可用”问题。为了使内容的可用性与用户的下载需求相匹配，我们提出了新的激励政策，只奖励需要种子的播种行为。这是通过向用户提供播种各种内容的奖励信息来实现的，这些内容根据用户的兴趣和对社区的及时性而变化。我们的跟踪驱动模拟结果表明，建议的“最大成本间隔”和“最大时间间隔”策略可以以更经济有效的方式显著改善现有策略的内容。
{"title":"Improving content availability by request-adaptive incentive in private peer-to-peer communities","authors":"Honglei Jiang, Song Guo, Deze Zeng, Hai Jin","doi":"10.1109/GLOCOM.2012.6503526","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503526","url":null,"abstract":"Recently, BitTorrent (BT) communities are rapidly evolving towards Private Torrent (PT) sites. The efficiency of such content sharing system depends on how well it can satisfy the requirements of users. The traditional way to improve usability is to make users extend their seeding duration by incentives like Share Ratio Enforcement (SRE). However, our measurement-based studies show its inefficiency in meeting various download requests from users. For example, some available contents have not been requested for long and some requests are not available, recognized as the “available but no request” and “request but not available” problems respectively. To make the content availability match users' download demands, we propose new incentive polices that only reward the seeding behaviors for needed torrents. This is achieved by providing users the rewarding information of seeding various contents that vary based on their interests and timeliness to the community. Our trace-driven simulation result shows the proposed “Max Cost Interval” and “Max Time Interval” policies can significantly improve the content over existing policies in a more cost-efficient way.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78600448","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
扫码关注我们
求助内容：
应助结果提醒方式：