Pub Date : 2016-06-20DOI: 10.1109/IWQoS.2016.7590413
Xuemin Wen, Yanni Han, Ting Yu, Xin Chen, Zhen Xu
It is a challenge to improve utilization of physical resources when allocating resources for virtual data centers (VDCs). In this work we proposed two reliability-aware VDC embedding methods NMP and NMPD. To reduce embedding cost, the proposals try to split VMs into clusters based on topological potential and modularity and assign each cluster to a server. Via simulations, we show that NMP can accept more VDCs and help InPs improve the revenue. Although accepting a little less VDCs, NMPD can reduce resources occupied by VDCs and alleviate the congestion of core links.
{"title":"Improving revenue for reliability-aware VDC embedding in a software-defined data center","authors":"Xuemin Wen, Yanni Han, Ting Yu, Xin Chen, Zhen Xu","doi":"10.1109/IWQoS.2016.7590413","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590413","url":null,"abstract":"It is a challenge to improve utilization of physical resources when allocating resources for virtual data centers (VDCs). In this work we proposed two reliability-aware VDC embedding methods NMP and NMPD. To reduce embedding cost, the proposals try to split VMs into clusters based on topological potential and modularity and assign each cluster to a server. Via simulations, we show that NMP can accept more VDCs and help InPs improve the revenue. Although accepting a little less VDCs, NMPD can reduce resources occupied by VDCs and alleviate the congestion of core links.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116242448","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590400
M. Zhu, Xiao-Yang Liu, Meikang Qiu, R. Shen, W. Shu, Minyou Wu
Public vehicle (PV) systems will be efficient traffic-management platforms in future smart cities, where PVs provide ridesharing trips with balanced QoS (quality of service). PV systems differ from traditional ridesharing due to that the paths and scheduling tasks are calculated by a server according to passengers' requests, and all PVs corporate with each other to achieve higher transportation efficiency. Path planning is the primary problem. The current path planning strategies become inefficient especially for traffic big data in cities of large population and urban area. To ensure real-time scheduling, we propose one efficient path planning strategy with balanced QoS (e.g., waiting time, detour) by restricting search area for each PV, so that a large number of computation is saved. Simulation results based on the Shanghai (China) urban road network show that, the computation can be reduced by 34% compared with the exhaustive search method since many requests violating QoS are excluded.
{"title":"Traffic big data based path planning strategy in public vehicle systems","authors":"M. Zhu, Xiao-Yang Liu, Meikang Qiu, R. Shen, W. Shu, Minyou Wu","doi":"10.1109/IWQoS.2016.7590400","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590400","url":null,"abstract":"Public vehicle (PV) systems will be efficient traffic-management platforms in future smart cities, where PVs provide ridesharing trips with balanced QoS (quality of service). PV systems differ from traditional ridesharing due to that the paths and scheduling tasks are calculated by a server according to passengers' requests, and all PVs corporate with each other to achieve higher transportation efficiency. Path planning is the primary problem. The current path planning strategies become inefficient especially for traffic big data in cities of large population and urban area. To ensure real-time scheduling, we propose one efficient path planning strategy with balanced QoS (e.g., waiting time, detour) by restricting search area for each PV, so that a large number of computation is saved. Simulation results based on the Shanghai (China) urban road network show that, the computation can be reduced by 34% compared with the exhaustive search method since many requests violating QoS are excluded.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121281988","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590391
Yang Wang, Hengchang Liu, Liusheng Huang, J. Stankovic
Due to high mobility and intermittent connections in vehicular networks, reliable and efficient Vehicle-to-Vehicle (V2V) communication is a challenging task. The Named Data Networking (NDN) paradigm is recently being applied to achieve efficient V2V communication, however, proactive V2V information diffusion conflicts with the receiver-initiated nature of NDN. This paper bridges this gap by exploiting hierarchical data names to achieve efficient and proactive V2V information diffusion. We first identify a popular subgroup of vehicles, then select them as the diffusion seeds with 3G/4G capability, while others are only equipped with short-range V2V communication. We also design a namespace-based method to optimize data transmission when vehicles are close, in order to maximize the information distribution across geographical space. We evaluate our solution via a real-world taxicab dataset. Experimental results demonstrate that our approach significantly outperforms state-of-the-art solutions in terms of diffusion speed and success rate of data retrieval.
{"title":"Efficient and proactive V2V information diffusion using Named Data Networking","authors":"Yang Wang, Hengchang Liu, Liusheng Huang, J. Stankovic","doi":"10.1109/IWQoS.2016.7590391","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590391","url":null,"abstract":"Due to high mobility and intermittent connections in vehicular networks, reliable and efficient Vehicle-to-Vehicle (V2V) communication is a challenging task. The Named Data Networking (NDN) paradigm is recently being applied to achieve efficient V2V communication, however, proactive V2V information diffusion conflicts with the receiver-initiated nature of NDN. This paper bridges this gap by exploiting hierarchical data names to achieve efficient and proactive V2V information diffusion. We first identify a popular subgroup of vehicles, then select them as the diffusion seeds with 3G/4G capability, while others are only equipped with short-range V2V communication. We also design a namespace-based method to optimize data transmission when vehicles are close, in order to maximize the information distribution across geographical space. We evaluate our solution via a real-world taxicab dataset. Experimental results demonstrate that our approach significantly outperforms state-of-the-art solutions in terms of diffusion speed and success rate of data retrieval.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122386952","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590447
Shuo Yang, Fan Wu, Shaojie Tang, Tie Luo, Xiaofeng Gao, L. Kong, Guihai Chen
Mobile crowdsensing has become a novel and promising paradigm in collecting environmental data. A critical problem in improving the QoS of crowdsensing is to decide which users to select to perform sensing tasks, in order to obtain the most informative data, while maintaining the total sensing costs below a given budget. The key challenges lie in (i) finding an effective measure of the informativeness of users' data, (ii) learning users' sensing costs which are unknown a priori, and (iii) designing efficient user selection algorithms that achieve low-regret guarantees. In this paper, we build Gaussian Processes (GPs) to model spatial locations, and provide a mutual information-based criteria to characterize users' informativeness. To tackle the second and third challenges, we model the problem as a budgeted multi-armed bandit (MAB) problem based on stochastic assumptions, and propose an algorithm with theoretically proven low-regret guarantee. Our theoretical analysis and evaluation results both demonstrate that our algorithm can efficiently select most informative users under stringent constraints.
{"title":"Selecting most informative contributors with unknown costs for budgeted crowdsensing","authors":"Shuo Yang, Fan Wu, Shaojie Tang, Tie Luo, Xiaofeng Gao, L. Kong, Guihai Chen","doi":"10.1109/IWQoS.2016.7590447","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590447","url":null,"abstract":"Mobile crowdsensing has become a novel and promising paradigm in collecting environmental data. A critical problem in improving the QoS of crowdsensing is to decide which users to select to perform sensing tasks, in order to obtain the most informative data, while maintaining the total sensing costs below a given budget. The key challenges lie in (i) finding an effective measure of the informativeness of users' data, (ii) learning users' sensing costs which are unknown a priori, and (iii) designing efficient user selection algorithms that achieve low-regret guarantees. In this paper, we build Gaussian Processes (GPs) to model spatial locations, and provide a mutual information-based criteria to characterize users' informativeness. To tackle the second and third challenges, we model the problem as a budgeted multi-armed bandit (MAB) problem based on stochastic assumptions, and propose an algorithm with theoretically proven low-regret guarantee. Our theoretical analysis and evaluation results both demonstrate that our algorithm can efficiently select most informative users under stringent constraints.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115024348","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590433
Tingwei Zhu, F. Wang, Yu Hua, D. Feng, Yong Wan, Qingyu Shi, Yanwen Xie
Continuously enriched distributed systems in data centers generate much network traffic in push-style one-to-many group mode, raising new requirements for multicast transport in terms of efficiency and robustness. Existing reliable multicast solutions, which suffer from low robustness and inefficiency in either host-side protocols or multicast routing, are not suitable for data centers. In order to address the problems of inefficiency and low robustness, we present a sender-initiated, efficient, congestion-aware and robust reliable multicast solution mainly for small groups in SDN-based data centers, called MCTCP. The main idea behind MCTCP is to manage the multicast groups in a centralized manner, and reactively schedule multicast flows to active and low-utilized links, by extending TCP as the host-side protocol and managing multicast groups in the SDN-controller. The multicast spanning trees are calculated and adjusted according to the network status to perform a better allocation of resources. Our experiments show that, MCTCP can dynamically bypass the congested and failing links, achieving high efficiency and robustness. As a result, MCTCP outperforms the state-of-the-art reliable multicast schemes. Moreover, MCTCP improves the performance of data replication in HDFS compared with the original and TCP-SMO based ones, e.g., achieves 101% and 50% improvements in terms of bandwidth, respectively.
{"title":"MCTCP: Congestion-aware and robust multicast TCP in Software-Defined networks","authors":"Tingwei Zhu, F. Wang, Yu Hua, D. Feng, Yong Wan, Qingyu Shi, Yanwen Xie","doi":"10.1109/IWQoS.2016.7590433","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590433","url":null,"abstract":"Continuously enriched distributed systems in data centers generate much network traffic in push-style one-to-many group mode, raising new requirements for multicast transport in terms of efficiency and robustness. Existing reliable multicast solutions, which suffer from low robustness and inefficiency in either host-side protocols or multicast routing, are not suitable for data centers. In order to address the problems of inefficiency and low robustness, we present a sender-initiated, efficient, congestion-aware and robust reliable multicast solution mainly for small groups in SDN-based data centers, called MCTCP. The main idea behind MCTCP is to manage the multicast groups in a centralized manner, and reactively schedule multicast flows to active and low-utilized links, by extending TCP as the host-side protocol and managing multicast groups in the SDN-controller. The multicast spanning trees are calculated and adjusted according to the network status to perform a better allocation of resources. Our experiments show that, MCTCP can dynamically bypass the congested and failing links, achieving high efficiency and robustness. As a result, MCTCP outperforms the state-of-the-art reliable multicast schemes. Moreover, MCTCP improves the performance of data replication in HDFS compared with the original and TCP-SMO based ones, e.g., achieves 101% and 50% improvements in terms of bandwidth, respectively.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128603537","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590388
Jun Li, Baochun Li
Erasure coding has been increasingly replacing replication in distributed storage systems, thanks to its lower storage overhead with the same level of failure tolerance. However, with lower storage overhead, the reconstruction overhead of erasure codes can increase significantly as well. Under the ever-changing workload, in which the data access can be highly skewed, it is difficult to achieve a well trade-off between the storage overhead and the reconstruction overhead. In this paper, we propose Zebra, a framework that encodes data into multiple tiers by their demand. Given the overall storage overhead and the number of failures to tolerate, Zebra determines the parameters of erasure coding in each tier by solving a geometric programming problem. Based on the demand of data, Zebra can dynamically assign data into the corresponding tiers to minimize the overall reconstruction overhead, and achieve a flexible tradeoff between the storage overhead and the reconstruction overhead in multiple tiers, such that hot data can enjoy less overhead of reconstruction and cold data can be stored with lower storage overhead. When demand changes, Zebra can adjust itself accordingly with a marginal amount of network transfer.
{"title":"Zebra: Demand-aware erasure coding for distributed storage systems","authors":"Jun Li, Baochun Li","doi":"10.1109/IWQoS.2016.7590388","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590388","url":null,"abstract":"Erasure coding has been increasingly replacing replication in distributed storage systems, thanks to its lower storage overhead with the same level of failure tolerance. However, with lower storage overhead, the reconstruction overhead of erasure codes can increase significantly as well. Under the ever-changing workload, in which the data access can be highly skewed, it is difficult to achieve a well trade-off between the storage overhead and the reconstruction overhead. In this paper, we propose Zebra, a framework that encodes data into multiple tiers by their demand. Given the overall storage overhead and the number of failures to tolerate, Zebra determines the parameters of erasure coding in each tier by solving a geometric programming problem. Based on the demand of data, Zebra can dynamically assign data into the corresponding tiers to minimize the overall reconstruction overhead, and achieve a flexible tradeoff between the storage overhead and the reconstruction overhead in multiple tiers, such that hot data can enjoy less overhead of reconstruction and cold data can be stored with lower storage overhead. When demand changes, Zebra can adjust itself accordingly with a marginal amount of network transfer.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130116391","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 Software Defined Networking (SDN), the configuration inconsistency during updates is one main source of network instability. An efficient updating scheme with configuration consistency is required. In this paper, we propose the scheme of Fast Incremental Consistent Update for SDN (FICUS) based on the relation graph (RG). In our scheme, we analyse the relation between update operations, construct the relation graph and find a proper order of these update operations to avoid inconsistency. To solve the problem, we define two types of relations: the path dependency relation and the path rejection relation. We evaluate our scheme and algorithms by comprehensive experiments. The results show that our scheme needs only 10%-40% of the rules compared with the two-phase update scheme and speeds up the update process by 40% in average.
{"title":"FICUS: Fast Incremental Consistent Update in SDN based on relation graph","authors":"Qing Li, Lei Wang, Yong Jiang, Guangwu Hu, Mingwei Xu, Q. Liao","doi":"10.1109/IWQoS.2016.7590421","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590421","url":null,"abstract":"In Software Defined Networking (SDN), the configuration inconsistency during updates is one main source of network instability. An efficient updating scheme with configuration consistency is required. In this paper, we propose the scheme of Fast Incremental Consistent Update for SDN (FICUS) based on the relation graph (RG). In our scheme, we analyse the relation between update operations, construct the relation graph and find a proper order of these update operations to avoid inconsistency. To solve the problem, we define two types of relations: the path dependency relation and the path rejection relation. We evaluate our scheme and algorithms by comprehensive experiments. The results show that our scheme needs only 10%-40% of the rules compared with the two-phase update scheme and speeds up the update process by 40% in average.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134019361","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590412
Olumuyiwa Ibidunmoye, Thijs Metsch, E. Elmroth
Service performance degradation and downtimes are a common on the Internet today. Many on-line services (e.g. Amazon.com, Spotify, and Netflix, etc.) report huge loss in revenue and traffic per episode. This is perhaps due to the correlation between performance and end-users's satisfaction.
{"title":"Real-time detection of performance anomalies for cloud services","authors":"Olumuyiwa Ibidunmoye, Thijs Metsch, E. Elmroth","doi":"10.1109/IWQoS.2016.7590412","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590412","url":null,"abstract":"Service performance degradation and downtimes are a common on the Internet today. Many on-line services (e.g. Amazon.com, Spotify, and Netflix, etc.) report huge loss in revenue and traffic per episode. This is perhaps due to the correlation between performance and end-users's satisfaction.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123800019","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590429
Zhifeng Xu, Fangming Liu, Tao Wang, Hong Xu
Middleboxes are prevalent in today's enterprise and data center networks. Network function virtualization (NFV) is a promising technology to replace dedicated hardware middleboxes with virtualized network functions (VNFs) running on commodity servers. However, no prior study has examined the energy efficiency of different NFV implementations. In this paper, we conduct a measurement study on the power efficiency of software data planes, the virtual I/O and the software middleboxes, which are important parts of the NFV implementations. We run two popular software middleboxes (Snort and Bro) on three common software data planes (i.e., DPDK-OVS, Click Modular Router and Netmap). Our results show significant differences on power among those different NFV implementations. We analyze the underlying design choices and give implications on how to build more power efficient NFV implementations.
{"title":"Demystifying the energy efficiency of Network Function Virtualization","authors":"Zhifeng Xu, Fangming Liu, Tao Wang, Hong Xu","doi":"10.1109/IWQoS.2016.7590429","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590429","url":null,"abstract":"Middleboxes are prevalent in today's enterprise and data center networks. Network function virtualization (NFV) is a promising technology to replace dedicated hardware middleboxes with virtualized network functions (VNFs) running on commodity servers. However, no prior study has examined the energy efficiency of different NFV implementations. In this paper, we conduct a measurement study on the power efficiency of software data planes, the virtual I/O and the software middleboxes, which are important parts of the NFV implementations. We run two popular software middleboxes (Snort and Bro) on three common software data planes (i.e., DPDK-OVS, Click Modular Router and Netmap). Our results show significant differences on power among those different NFV implementations. We analyze the underlying design choices and give implications on how to build more power efficient NFV implementations.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"379 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116565531","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 : 2016-06-20DOI: 10.1109/IWQoS.2016.7590452
Chang Hu, Mingjun Xiao, Liusheng Huang, Guoju Gao
Nowadays, vehicles have shown great potential in crowdsensing. To guarantee a good Quality of Service (QoS), stimulating enough vehicles to participate in crowdsensing is very necessary. In this paper, we focus on the incentive mechanism design in the vehicle-based nondeterministic crowdsensing. Different from existing works, we take into consideration that each vehicle performs sensing tasks along some trajectories with different probabilities, and each task must be successfully performed with a joint probability no less than a threshold. Designing an incentive mechanism for such a nondeterministic crowdsensing system is challenging, which contains a non-trivial set cover problem with non-linear constraints. To solve the problem, we propose a truthful incentive mechanism based on reverse auction, including an approximation algorithm to select winning bids with a nearly minimum social cost, and a payment algorithm to determine the payments for all participants. Through theoretical analysis, we prove that our incentive mechanism is truthful and individual rational, and we give an approximation ratio of the winning bid selection algorithm. In addition, we conduct extensive simulations, based on a real vehicle trace, to validate the performances of the proposed incentive mechanism.
{"title":"Truthful incentive mechanism for vehicle-based nondeterministic crowdsensing","authors":"Chang Hu, Mingjun Xiao, Liusheng Huang, Guoju Gao","doi":"10.1109/IWQoS.2016.7590452","DOIUrl":"https://doi.org/10.1109/IWQoS.2016.7590452","url":null,"abstract":"Nowadays, vehicles have shown great potential in crowdsensing. To guarantee a good Quality of Service (QoS), stimulating enough vehicles to participate in crowdsensing is very necessary. In this paper, we focus on the incentive mechanism design in the vehicle-based nondeterministic crowdsensing. Different from existing works, we take into consideration that each vehicle performs sensing tasks along some trajectories with different probabilities, and each task must be successfully performed with a joint probability no less than a threshold. Designing an incentive mechanism for such a nondeterministic crowdsensing system is challenging, which contains a non-trivial set cover problem with non-linear constraints. To solve the problem, we propose a truthful incentive mechanism based on reverse auction, including an approximation algorithm to select winning bids with a nearly minimum social cost, and a payment algorithm to determine the payments for all participants. Through theoretical analysis, we prove that our incentive mechanism is truthful and individual rational, and we give an approximation ratio of the winning bid selection algorithm. In addition, we conduct extensive simulations, based on a real vehicle trace, to validate the performances of the proposed incentive mechanism.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127516049","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
扫码关注我们
求助内容：
应助结果提醒方式：