Hongli Xu, Liusheng Huang, C. Qiao, Xinglong Wang, Yu-e Sun
{"title":"Shared relay assignment (SRA) for many-to-one traffic in cooperative wireless transmissions","authors":"Hongli Xu, Liusheng Huang, C. Qiao, Xinglong Wang, Yu-e Sun","doi":"10.1109/IWQoS.2014.6914324","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914324","url":null,"abstract":"Relay assignment significantly affects the performance of cooperative communications. Previous studies in this area have mostly focused on assigning a dedicated relay to each source-destination pair for one-to-one (121) traffic. On the other hand, many-to-one (M21) traffic, which is also common in many situations (for example, several users associate with one access point in a wireless access network such as a WLAN), hasn't been well studied. This paper addresses the shared relay assignment (SRA) problem for M21 traffic. We formulate two new optimization problems: one is to maximize the minimum throughput among all the sources (hereafter called M21-SRA-MMT), and the other is to maximize the total throughput over all the sources while maintaining some degree of fairness (hereafter called M21-SRA-MTT). As both of these problems are NP-hard, we propose two approximation algorithms whose performance factors are 5.828 and 3, respectively, based on the rounding mechanism. Extensive simulation results show that our algorithm for M21-SRA-MMT can significantly improve the minimum throughput compared with existing algorithms, while our algorithm for M21-SRA-MTT can achieve the close-to-optimal performance.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"29 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120933257","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}
Hyunsoon Kim, Woonghee Lee, Mungyu Bae, Hwangnam Kim, Y. Park
{"title":"Link-aware AP selection for improving Wi-Fi quality","authors":"Hyunsoon Kim, Woonghee Lee, Mungyu Bae, Hwangnam Kim, Y. Park","doi":"10.1109/IWQoS.2014.6914333","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914333","url":null,"abstract":"The demand of mobile traffic increases tremendously as various Internet services are provided to mobile phones and computing devices, making mobile carriers to increase capacity of cellular network. Since current cell towers and auxiliary devices cannot carry excessive amount of traffic, several mobile carriers try to install low cost wireless equipments such as Wi-Fi access points (AP) so that some part of mobile traffic can be offloaded to these wireless nodes. Unlike cell towers, APs are installed randomly since there is no specific allocation policy for these license-exempt band equipment that are open to everyone. Since the randomized allocation of APs incur interference that causes serious degradation of wireless communication quality, it is necessary to design mobile devices to communicate in the environment or channel that contains the least interference. In order to make a mobile device experience the best wireless download quality, this paper proposes a novel AP selection mechanism that selects an AP that contains the least interference level compared to others with different number of communicating devices and amount of traffic load. Proposed selection mechanism does not require any additional feedback from nearby devices or APs. Performance evaluation is done by using real mobile devices with open source platform called Android.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124639759","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}
{"title":"Energy-traffic tradeoff cooperative offloading for mobile cloud computing","authors":"Jian Song, Yong Cui, Minming Li, J. Qiu, R. Buyya","doi":"10.1109/IWQoS.2014.6914329","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914329","url":null,"abstract":"This paper presents a quantitative study on the energy-traffic tradeoff problem from the perspective of entire Wireless Local Area Network (WLAN). We propose a novel Energy-Efficient Cooperative Offloading Model (E2COM) for energy-traffic tradeoff, which can ensure the fairness of energy consumption of mobile devices and reduce the computation repetition and eliminate the Internet data traffic redundancy through cooperative execution and sharing computation results. We design an Online Task Scheduling Algorithm (OTS) based on a pricing mechanism and Lyapunov optimization to address the problem without predicting future information on task arrivals, transmission rates and so on. OTS can achieve a desirable tradeoff between the energy consumption and Internet data traffic by appropriately setting the tradeoff coefficient. Simulation results demonstrate that E2COM is more efficient than no offloading and cloud offloading for a variety of typical mobile devices, applications and link qualities in WLAN.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129650215","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}
{"title":"kTRxer: A portable toolkit for reliable internet probing","authors":"Lei Xue, Xiapu Luo, Yuru Shao","doi":"10.1109/IWQoS.2014.6914311","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914311","url":null,"abstract":"Being one of the primitives of Internet measurement and security scanning, active probing has numerous applications. While the majority of existing probing tools were designed for PCs/servers, the wide adoption of mobile devices and embedded systems bring new requirements and challenges to active probing, for example, the limited resources in those devices may affect active probing's accuracy and efficiency. However, few research studies examine such impact. In this paper, we fill the gap by investigating the effect of resource-limited devices on common packet sending/receiving techniques used by probing tools and proposing kTRxer, a toolkit that can be run in many devices to help probing tools achieve better accuracy and efficiency. kTRxer mitigates the negative effect from devices by keeping away from noise sources and achieves portability by avoiding modifying specific device drivers. We have implemented kTRxer with 5489 lines of C codes and conducted extensive evaluation on three platforms, including PC, broadband router, and smartphone. The experimental results show that kTRxer can achieve up to 10 times transmission rate and introduce much less delay noise than existing approaches.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130740816","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}
Ghayet El Mouna Zhioua, H. Labiod, N. Tabbane, S. Tabbane
{"title":"A traffic QoS aware approach for cellular infrastructure offloading using VANETs","authors":"Ghayet El Mouna Zhioua, H. Labiod, N. Tabbane, S. Tabbane","doi":"10.1109/IWQoS.2014.6914328","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914328","url":null,"abstract":"Offloading a part of cellular traffic through other kinds of networks, such as Wi-Fi hotspots and femtoCells represents an interesting solution for operators to cope with the high user traffic demand increase. In this paper, we propose to use the Vehicular ad hoc Networks (VANETs) for the same purpose. We present an analytical study based on an optimization problem formulation to evaluate the potential of VANET to vehicle part of the cellular traffic. The offloading decision considers several constraints related to vehicle-to-infrastructure link availability, channel and medium contention, vehicle-to-vehicle link capacity and quality, data flows volume and the link connectivity duration between the vehicle and the road side unit. Moreover, the originality of this work is the consideration of flow's service class in the offloading decision. Numerical results show that the data offloading fraction is closely affected by the data volume of the flows and by vehicular link quality. Results show also that best effort and background traffics have more priority to be offloaded than the video streaming traffics.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132719201","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}
{"title":"Efficient end-to-end communication services for mixed criticality avionics systems","authors":"Ying Fang, Yu Hua, Xue Liu","doi":"10.1109/IWQoS.2014.6914319","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914319","url":null,"abstract":"Avionics Full Duplex Switched Ethernet (AFDX) is a new data network standard for modern avionics systems. Avionics systems are typical mixed criticality systems, where safety-critical and non-safety-critical applications co-exist. Traditional AFDX leverages best-effort redundant transmissions for flows to improve the communication reliability, resulting in the increase of end-to-end delays with weak reliability. In order to bridge the gap between high reliability requirements and short end-to-end delays, we propose a novel scheme, named HERSA (Holistic End-to-End Redundant Scheduling on AFDX). The idea behind HERSA is to leverage a differentiated transmission mode to distinguish safety-critical and non-safety-critical flows, as well as an efficient credit-based scheduling scheme to reduce the serving size for each flow. The salient feature of HERSA is to obtain O(1) complexity and offer the efficient end-to-end transmission services and the guaranteed reliability. We implement HERSA on a real test-bed. Experimental results demonstrate the efficiency and efficacy of HERSA.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123488952","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}
{"title":"QoS-based joint power and resource allocation with Adaptive Modulation and Coding for OFDMA femtocell networks","authors":"R. Hatoum, A. Hatoum, A. Ghaith, G. Pujolle","doi":"10.1109/IWQoS.2014.6914335","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914335","url":null,"abstract":"Recently, LTE-based femtocell system has received significant attention as a promising solution offering high-speed services, enhanced indoor coverage and increased system capacity. Intelligently allocate resources in multi-user OFDMA-based network is the substantial aim towards interference mitigation and enhancing power and spectral efficiencies. In this paper, we propose a downlink joint resource allocation with Adaptive Modulation and Coding (AMC) technique for such system, namely AMC-QRAP. The proposal core is adjusting the transmission link to the channel status and users demand through the power control and suitable selection of the modulation/coding scheme. Clustered network is adopted and users differentiation is considered providing Quality of Service (QoS) in the network. Our resolution model is solved as an optimization problem using the linear programming. We show through extensive simulations the outperformance of our method compare to different state-of-the-art methods using different evaluation metrics.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130844890","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}
Qiuyu Li, Yu Hua, Wenbo He, D. Feng, Zhenhua Nie, Yuanyuan Sun
{"title":"Necklace: An efficient cuckoo hashing scheme for cloud storage services","authors":"Qiuyu Li, Yu Hua, Wenbo He, D. Feng, Zhenhua Nie, Yuanyuan Sun","doi":"10.1109/IWQoS.2014.6914315","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914315","url":null,"abstract":"With the rapid growth of data, query performance is an important concern in cloud storage applications. To reduce the query response time, cuckoo hashing via d hash functions has been adopted to achieve O(1) query efficiency. However, in practice the cuckoo hashing consumes a large amount of system resources, since an item insertion may suffer from frequent “kick-out” operations or even endless loops. In order to address this problem, we propose an efficient loop-oblivious scheme, called Necklace, in the cloud. The idea behind Necklace is to minimize data migration among servers and alleviate the collisions in the insertion operation. We identify the shortest path via indexing the auxiliary table, without retrieving the actual storage contents or carrying out the tentative “kick-out” operations. We have implemented Necklace in a real cloud system and examined the performance by using a real-world trace. Extensive experimental results demonstrate the efficiency and efficacy of Necklace.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125502418","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}
{"title":"Jointly optimal selection and scheduling for lossy transmission of dependent frames with delay constraint","authors":"Saied Mehdian, B. Liang","doi":"10.1109/IWQoS.2014.6914317","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914317","url":null,"abstract":"We present a jointly optimal selection and scheduling scheme for the lossy transmission of frames governed by a dependency relation and a delay constraint over a link with limited capacity. A main application for this is scalable video streaming. Our objective is to select a subset of frames and decide their transmission schedule such that the overall video quality at the receiver is maximized. The problem is solved for two of the most common classes of dependency structures for video encoding, which include as a special case the popular hierarchical dyadic structure. We formally characterize the structural properties of an optimal transmission schedule in terms of frame dependency. It is shown that regardless of the subset of frames selected for transmission, any optimal schedule has an equivalent canonical form that is a subsequence of a unique universal sequence containing all frames. The canonical form can be computed efficiently through the construction of a dependency tree. This leads to separable but jointly optimal frame selection and scheduling algorithms that have quadratic computational complexity in the number of frames. Simulation with video traces demonstrates that the optimal scheme can substantially outperform existing suboptimal alternatives.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"11 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124335053","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}
{"title":"KEEP: Fast secret key extraction protocol for D2D communication","authors":"Wei Xi, Xiangyang Li, Chen Qian, Jinsong Han, Shaojie Tang, Jizhong Zhao, K. Zhao","doi":"10.1109/IWQoS.2014.6914340","DOIUrl":"https://doi.org/10.1109/IWQoS.2014.6914340","url":null,"abstract":"Device to device (D2D) communication is expected to become a promising technology of the next-generation wireless communication systems. Security issues have become technical barriers of D2D communication due to its “open-air” nature and lack of centralized control. Generating symmetric keys individually on different communication parties without key exchange or distribution is desirable but challenging. Recent work has proposed to extract keys from the measurement of physical layer random variations of a wireless channel, e.g., the channel state information (CSI) from orthogonal frequency-division multiplexing (OFDM). Existing CSI-based key extraction methods usually use the measurement results of individual subcarriers. However, our real world experiment results show that CSI measurements from near-by subcarriers have strong correlations and a generated key may have a large proportion of repeated bit segments. Hence attackers may crack the key in a relatively short time and hence reduce the security level of the generated keys. In this work, we propose a fast secret key extraction protocol, called KEEP. KEEP uses a validation-recombination mechanism to obtain consistent secret keys from CSI measurements of all subcarriers. It achieves high security level of the keys and fast key-generation rate. We implement KEEP using off-the-shelf 802.11n devices and evaluate its performance via extensive experiments. Both theoretical analysis and experimental results demonstrate that KEEP is safer and more effective than the state-of-the-art approaches.","PeriodicalId":301428,"journal":{"name":"2014 IEEE 22nd International Symposium of Quality of Service (IWQoS)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116090136","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}