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":"17 1","pages":"2708-2713"},"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}
Pub Date : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503243
Weihan Goh, C. Yeo
In disruption tolerant networks (DTNs), nodes exchange beacon messages to set up links via a process known as neighbor discovery. However as it is, beacon messages are susceptible to forgery and tampering that could be exploited to attack and participate in the network. This paper outlines a protocol to 1) protect beacon messages in tactical-level DTNs from forgery and tampering utilizing an identity-based signature scheme (IBS), and 2) provide capabilities for nodes that are compromised or captured to signal its state discreetly to other DTN nodes. The protocol maintains the same amount of message overhead as without it.
{"title":"Threat mitigation in tactical-level disruption tolerant networks","authors":"Weihan Goh, C. Yeo","doi":"10.1109/GLOCOM.2012.6503243","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503243","url":null,"abstract":"In disruption tolerant networks (DTNs), nodes exchange beacon messages to set up links via a process known as neighbor discovery. However as it is, beacon messages are susceptible to forgery and tampering that could be exploited to attack and participate in the network. This paper outlines a protocol to 1) protect beacon messages in tactical-level DTNs from forgery and tampering utilizing an identity-based signature scheme (IBS), and 2) provide capabilities for nodes that are compromised or captured to signal its state discreetly to other DTN nodes. The protocol maintains the same amount of message overhead as without it.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"1 1","pages":"997-1003"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77530342","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.6503503
Zhuofan Liao, Jianxin Wang, Shigeng Zhang, Jiannong Cao
In WiMAX mesh networks based on IEEE 802.16j, when transmission power of the base station (BS) and the number of radios and channels are settled, data rate at the subscriber (SS) is decided by the distance between the SS and its uplink relay station (RS). In this paper, we study the problem of deploying a minimum number of RSs to satisfy all SSs' distance requirements. Firstly, we translate it into a minimum clique partition problem, which is NP-complete. Based on SSs' neighbor information and location information, we then propose two heuristic algorithms based on clique partition, named as MAXDCP and GEOCP, respectively. Simulation results show that, compared with the state-of-the-art MIS and HS algorithms, MAXDCP uses 23.8% fewer relays than MIS with the same time complexity, and GEOCP uses 35% fewer relays than MIS in the same time and 18.5% fewer relays than HS in much less time.
{"title":"Clique partition based relay placement in WiMAX mesh networks","authors":"Zhuofan Liao, Jianxin Wang, Shigeng Zhang, Jiannong Cao","doi":"10.1109/GLOCOM.2012.6503503","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503503","url":null,"abstract":"In WiMAX mesh networks based on IEEE 802.16j, when transmission power of the base station (BS) and the number of radios and channels are settled, data rate at the subscriber (SS) is decided by the distance between the SS and its uplink relay station (RS). In this paper, we study the problem of deploying a minimum number of RSs to satisfy all SSs' distance requirements. Firstly, we translate it into a minimum clique partition problem, which is NP-complete. Based on SSs' neighbor information and location information, we then propose two heuristic algorithms based on clique partition, named as MAXDCP and GEOCP, respectively. Simulation results show that, compared with the state-of-the-art MIS and HS algorithms, MAXDCP uses 23.8% fewer relays than MIS with the same time complexity, and GEOCP uses 35% fewer relays than MIS in the same time and 18.5% fewer relays than HS in much less time.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"107 1","pages":"2566-2571"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77631371","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.6503543
Huichen Dai, Jianyuan Lu, Yi Wang, B. Liu
Routing is undoubtedly the foundation of NDN's data transmission service. We propose a two-layer routing protocol for NDN [1], [2], which is composed of a Topology Maintaining (TM) layer and a Prefix Announcing (PA) layer. The underlying layer (TM) maintains the full topology of an NDN network domain and calculates the shortest-path trees. The upper layer (PA) provides content in two ways: active publishing and passive serving. However, solely adopting either of them will lead to the problem of scalability. We compare the efficiency and cost of the two methods, and evaluation results show that active publishing is much more efficient than the passive serving method in terms of triggered traffic, but actively publishing all the content will lead to Forwarding Information Base (FIB) explosion. Therefore, we further propose a popularity-based active publishing policy and arrive at a compromise between the active and passive methods. Moreover, we put forward several methods to aggregate FIB entries, and the FIB size shrinks effectively after aggregation. This routing protocol is compliant with the NDN characteristics and supports NDN multipath routing.
{"title":"A two-layer intra-domain routing scheme for named data networking","authors":"Huichen Dai, Jianyuan Lu, Yi Wang, B. Liu","doi":"10.1109/GLOCOM.2012.6503543","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503543","url":null,"abstract":"Routing is undoubtedly the foundation of NDN's data transmission service. We propose a two-layer routing protocol for NDN [1], [2], which is composed of a Topology Maintaining (TM) layer and a Prefix Announcing (PA) layer. The underlying layer (TM) maintains the full topology of an NDN network domain and calculates the shortest-path trees. The upper layer (PA) provides content in two ways: active publishing and passive serving. However, solely adopting either of them will lead to the problem of scalability. We compare the efficiency and cost of the two methods, and evaluation results show that active publishing is much more efficient than the passive serving method in terms of triggered traffic, but actively publishing all the content will lead to Forwarding Information Base (FIB) explosion. Therefore, we further propose a popularity-based active publishing policy and arrive at a compromise between the active and passive methods. Moreover, we put forward several methods to aggregate FIB entries, and the FIB size shrinks effectively after aggregation. This routing protocol is compliant with the NDN characteristics and supports NDN multipath routing.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"138 6 1","pages":"2815-2820"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83934171","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.6503749
Yong Li, L. Wang, Z. Ding
In this work1, we present a new multiple-input-multiple-output (MIMO) receiver that integrates the MIMO signal detection and the decoding of low density parity check coded data. This joint MIMO detector and decoder utilizes linear programming and achieves about 9.0 dB gain over existing works in terms of bit error rate (BER) of 4 × 10−5 with comparable computational complexity. The proposed detector also outperforms the classic turbo equalizer by achieving up to 4.0 dB improvement over turbo equalizer at frame error rate (FER) of 1 × 104. In fact, we can achieve further gain by improving the proposed joint detector through the use of redundant parity checks.
{"title":"Linear programming based joint detection of LDPC coded MIMO systems","authors":"Yong Li, L. Wang, Z. Ding","doi":"10.1109/GLOCOM.2012.6503749","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503749","url":null,"abstract":"In this work1, we present a new multiple-input-multiple-output (MIMO) receiver that integrates the MIMO signal detection and the decoding of low density parity check coded data. This joint MIMO detector and decoder utilizes linear programming and achieves about 9.0 dB gain over existing works in terms of bit error rate (BER) of 4 × 10−5 with comparable computational complexity. The proposed detector also outperforms the classic turbo equalizer by achieving up to 4.0 dB improvement over turbo equalizer at frame error rate (FER) of 1 × 104. In fact, we can achieve further gain by improving the proposed joint detector through the use of redundant parity checks.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"17 1","pages":"4043-4048"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75857553","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.6503416
Min Chen
While demands on video traffic over mobile networks have been souring, the wireless link capacity cannot keep up with the traffic demand. The gap between the traffic demand and the link capacity, along with time-varying link conditions, results in poor service quality of video streaming over mobile networks such as long buffering time and intermittent disruptions. Leveraging the cloud computing technology, we propose a new mobile video streaming framework, dubbed AMVSC, which constructs a private agent at the cloud to provide video streaming services efficiently for each mobile user. For a given user, AMVSC lets her private agent adaptively adjust her streaming flow with a scalable video coding technique based on the feedback of link quality. We implement a prototype of the AMVSC framework to demonstrate its performance. It is shown that the private agents in the clouds can effectively provide the adaptive streaming.
{"title":"AMVSC: A framework of adaptive mobile video streaming in the cloud","authors":"Min Chen","doi":"10.1109/GLOCOM.2012.6503416","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503416","url":null,"abstract":"While demands on video traffic over mobile networks have been souring, the wireless link capacity cannot keep up with the traffic demand. The gap between the traffic demand and the link capacity, along with time-varying link conditions, results in poor service quality of video streaming over mobile networks such as long buffering time and intermittent disruptions. Leveraging the cloud computing technology, we propose a new mobile video streaming framework, dubbed AMVSC, which constructs a private agent at the cloud to provide video streaming services efficiently for each mobile user. For a given user, AMVSC lets her private agent adaptively adjust her streaming flow with a scalable video coding technique based on the feedback of link quality. We implement a prototype of the AMVSC framework to demonstrate its performance. It is shown that the private agents in the clouds can effectively provide the adaptive streaming.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"102 1","pages":"2042-2047"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74430370","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.6503351
Yisheng Zhao, Xi Li, Xiaoliang Zhang, Yi Li, Hong Ji
With the wide deployment of high-speed railway at more than 300 kilometers per hour, providing various services effectively for users in the train becomes both practical demand and interesting challenge for wireless communication. Resource allocation problem in high-speed railway communication system is one of the key issues to improve the efficiency of resource utilization. In this paper, we propose a multidimensional resource allocation strategy for high-speed railway downlink orthogonal frequency-division multiplexing (OFDM) system with multiple-input multiple-output (MIMO) antennas. Sub-carrier, antenna, time slot, and power are considered jointly, which is modeled as a nonlinear integer programming problem. The effect of the moving speed on inter-carrier interference is analyzed to calculate the transmitted power. The objective is to minimize the total transmitted power while satisfying quality of service requirement of each user. Moreover, optimal and approximate solutions are obtained by linearization and quadratic fitting, respectively. Simulation results have proved that approximate solution has lower total transmitted power than optimal solution while the computation complexity is higher.
{"title":"Multidimensional resource allocation strategy for high-speed railway MIMO-OFDM system","authors":"Yisheng Zhao, Xi Li, Xiaoliang Zhang, Yi Li, Hong Ji","doi":"10.1109/GLOCOM.2012.6503351","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503351","url":null,"abstract":"With the wide deployment of high-speed railway at more than 300 kilometers per hour, providing various services effectively for users in the train becomes both practical demand and interesting challenge for wireless communication. Resource allocation problem in high-speed railway communication system is one of the key issues to improve the efficiency of resource utilization. In this paper, we propose a multidimensional resource allocation strategy for high-speed railway downlink orthogonal frequency-division multiplexing (OFDM) system with multiple-input multiple-output (MIMO) antennas. Sub-carrier, antenna, time slot, and power are considered jointly, which is modeled as a nonlinear integer programming problem. The effect of the moving speed on inter-carrier interference is analyzed to calculate the transmitted power. The objective is to minimize the total transmitted power while satisfying quality of service requirement of each user. Moreover, optimal and approximate solutions are obtained by linearization and quadratic fitting, respectively. Simulation results have proved that approximate solution has lower total transmitted power than optimal solution while the computation complexity is higher.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"67 ","pages":"1653-1657"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/GLOCOM.2012.6503351","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72426025","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.6503612
Sung Whan Yoon, J. Moon
This paper considers error-correcting codes designed to correct a finite set of known two-dimensional (2D) error patterns that can occur in a 2D array of bits. Obvious applications for this type of codes include storage and display devices. The specific codes designed in this paper are cyclic codes that can correct any single occurrences of dominant known error patterns that can occur anywhere in the 2D array. As example codes, rate-0.994 codes are constructed which target eight known 2D error patterns in a 63 × 63 bit array.
{"title":"Two-dimensional cyclic codes correcting known error patterns","authors":"Sung Whan Yoon, J. Moon","doi":"10.1109/GLOCOM.2012.6503612","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503612","url":null,"abstract":"This paper considers error-correcting codes designed to correct a finite set of known two-dimensional (2D) error patterns that can occur in a 2D array of bits. Obvious applications for this type of codes include storage and display devices. The specific codes designed in this paper are cyclic codes that can correct any single occurrences of dominant known error patterns that can occur anywhere in the 2D array. As example codes, rate-0.994 codes are constructed which target eight known 2D error patterns in a 63 × 63 bit array.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"34 1","pages":"3231-3236"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81309816","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.6503855
Kuan-Chou Lee, Jyun-Wei Pu, Chih-Peng Li, Hsueh-Jyh Li
This paper investigates the performance of a dual-hop amplify-and-forward relaying system with co-channel interference at the relay. The source node is equipped with multiple antennas and adopts the space-time block code to increase the diversity gain. Both the outage probability and the bit error rate in the presence of multiple Rayleigh fading interferers are obtained in closed-form. Simulation experiments are conducted to verify the theoretical derivations.
{"title":"Performance analysis of dual-hop amplify-and-forward systems with multiple antennas and interference at the relay","authors":"Kuan-Chou Lee, Jyun-Wei Pu, Chih-Peng Li, Hsueh-Jyh Li","doi":"10.1109/GLOCOM.2012.6503855","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503855","url":null,"abstract":"This paper investigates the performance of a dual-hop amplify-and-forward relaying system with co-channel interference at the relay. The source node is equipped with multiple antennas and adopts the space-time block code to increase the diversity gain. Both the outage probability and the bit error rate in the presence of multiple Rayleigh fading interferers are obtained in closed-form. Simulation experiments are conducted to verify the theoretical derivations.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"07 1","pages":"4665-4670"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86162323","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.6504000
Lei Qin, Yang Yang, Dongmei Zhao
In this paper we study the problem of providing fair throughput for mobile stations (MSs) in a wireless mesh network (WMN) by jointly considering the handoff management of the MSs and the resource allocations at the access points (APs). An optimization problem is formulated based on long-term proportional fairness, so that all the MSs in the entire WMN can receive fair average throughput, while the total throughput of the MSs is maximized. The optimum solution is based on the assumption of having global information about the channel conditions and mobility information of all the MSs, and cannot be easily implemented in a practical system. A heuristic scheme is then proposed, which allows each AP to allocate its resources based on local information only, and the handoff decisions of the MSs are based on information exchanged between neighboring APs. Numerical results show that performance of the proposed heuristic scheme is very close to the optimum in terms of both fairness and throughput.
{"title":"Joint handoff and resource management for throughput fairness in a wireless mesh network","authors":"Lei Qin, Yang Yang, Dongmei Zhao","doi":"10.1109/GLOCOM.2012.6504000","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6504000","url":null,"abstract":"In this paper we study the problem of providing fair throughput for mobile stations (MSs) in a wireless mesh network (WMN) by jointly considering the handoff management of the MSs and the resource allocations at the access points (APs). An optimization problem is formulated based on long-term proportional fairness, so that all the MSs in the entire WMN can receive fair average throughput, while the total throughput of the MSs is maximized. The optimum solution is based on the assumption of having global information about the channel conditions and mobility information of all the MSs, and cannot be easily implemented in a practical system. A heuristic scheme is then proposed, which allows each AP to allocate its resources based on local information only, and the handoff decisions of the MSs are based on information exchanged between neighboring APs. Numerical results show that performance of the proposed heuristic scheme is very close to the optimum in terms of both fairness and throughput.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"30 1","pages":"5525-5530"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84344463","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
扫码关注我们
求助内容：
应助结果提醒方式：