2015 24th International Conference on Computer Communication and Networks (ICCCN)最新文献_第9页

Impact of Network Performance on Cloud Speech Recognition 网络性能对云语音识别的影响

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288417

Mehdi Assefi, Mike P. Wittie, Allan Knight

引用次数: 25

Truthful Auction for Resource Allocation in Cooperative Cognitive Radio Networks 协作认知无线电网络中资源分配的诚实拍卖

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288481

Xinglong Wang, Liusheng Huang, Hongli Xu, He Huang

{"title":"Truthful Auction for Resource Allocation in Cooperative Cognitive Radio Networks","authors":"Xinglong Wang, Liusheng Huang, Hongli Xu, He Huang","doi":"10.1109/ICCCN.2015.7288481","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288481","url":null,"abstract":"Cooperative cognitive radio network (CCRN) is a promising paradigm to increase spectrum utilization and exploit spatial diversity. The allocation of two related resources, i.e. spectrum and relay nodes, plays a fundamental role in the performance of CCRNs. However, previous works either lack of incentives for both primary users (PUs) and relay nodes to participate in or consider spectrum auction and relay auction separately. In this paper, we consider a static cooperative cognitive radio network scenario with several PUs and multiple secondary user coteries, each of which consists of a set of secondary users who are interested in sharing the same secondary relay node. We model the problem of joint spectrum allocation and relay allocation as a hierarchical auction and propose TERA, which is the first Truthful auction mechanism for Efficient Resource Allocation in CCRNs. We show that TERA satisfies critical economic properties such as truthful, individual rationality, budget balance, supply limits and computational efficiency. Furthermore, we theoretically prove TERA can achieve near-optimal revenue with high probability. Finally, extensive simulation results show that TERA is efficient and able to improve the utility of PUs and relay nodes significantly up to 125% and 151% respectively.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124367290","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}

引用次数: 11

An Agent Based Data Collection Scheme for Vehicular Sensor Networks 一种基于Agent的车载传感器网络数据采集方案

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288374

Hui Huang, Lavy Libman, G. Geers

{"title":"An Agent Based Data Collection Scheme for Vehicular Sensor Networks","authors":"Hui Huang, Lavy Libman, G. Geers","doi":"10.1109/ICCCN.2015.7288374","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288374","url":null,"abstract":"A Vehicular Sensor Network (VSN) is a sensing platform composed of smart onboard sensor nodes (vehicles) and roadside units, in which vehicles continuously collect sensor data from the road network to enable a range of real-time data-intensive applications, such as traffic pattern/congestion analysis, road surface diagnosis, and urban pollution monitoring. However, due to lossy links, limited bandwidth and highly dynamic network topology, it is very challenging to efficiently collect the data generated by vehicles on the road, especially under dense traffic situations. In this paper, we propose to deploy mobile agents for collecting sensor readings from a given road segment of interest. The mobile agent migrates among vehicles within the segment via wireless broadcast and uses local on-board computational resources to process and collect data as required. Since the wireless links are generally lossy, a broadcast may not reach all the vehicles within the segment; thus, to improve the reliability of the scheme, we further propose a termination decision algorithm based on recursive Bayesian estimation by which the agent decides whether all vehicles within the segment have been visited. Extensive simulation results show that the proposed agent-based data collection scheme achieves close to 100% data collection coverage under a wide range of vehicular traffic densities, while retaining a small communication overhead.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124586791","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}

引用次数: 3

Towards a New Quasigroup Block Cipher for a Single-Chip FPGA Implementation 一种基于FPGA的准群分组密码

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288479

W. Mahoney, Abhishek Parakh

引用次数: 1

Energy-Efficient Opportunistic Network Coding Algorithms for Wireless Networks 无线网络的节能机会网络编码算法

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288407

Ki-sung Koo, G. Manimaran

引用次数: 5

Tight Bounds on Localized Sensor Self-Deployment for Focused Coverage 聚焦覆盖的局部传感器自部署的严格边界

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288475

Gokarna Sharma, H. Krishnan

引用次数: 4

Spectrum Assignment in Mesh Elastic Optical Networks 网格弹性光网络中的频谱分配

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288470

Mahmoud Fayez, Iyad A. Katib, G. Rouskas, H. Faheem

引用次数: 9

Network-Aware Instance Scheduling in OpenStack 支持OpenStack的实例感知网络调度

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288436

M. Scharf, M. Stein, T. Voith, V. Hilt

引用次数: 17

pcp: Internet Latency Estimation Using CDN Replicas 使用CDN副本的互联网延迟估计

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288449

Samuel Micka, U. Goel, Hanlu Ye, Mike P. Wittie, B. Mumey

{"title":"pcp: Internet Latency Estimation Using CDN Replicas","authors":"Samuel Micka, U. Goel, Hanlu Ye, Mike P. Wittie, B. Mumey","doi":"10.1109/ICCCN.2015.7288449","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288449","url":null,"abstract":"Interactive mobile Internet applications have become increasingly common and necessary to perform everyday tasks such as augmented reality, online gaming, video chat, and cloud-based voice recognition. These applications speed up their communications by connecting users to the closest servers and clustering nearby users together. In replica server selection and client clustering, determination of the closest host quickly and accurately is crucial to interactive application responses and the satisfaction of users' expectations. Researchers commonly use latency as the primary metric of network proximity and have developed various latency approximation tools. However, these tools do not yet offer an attractive balance of measurement accuracy, scalability, and maintainability. In this paper, we propose a new latency estimation system for arbitrary hosts using host-to-CDN latency measurements. Compared to existing latency estimation tools, our technique offers superior coverage of the IP address space and latency estimation accuracy. With improved coverage and accuracy of latency estimation it will become easier to establish low latency connections between hosts in a network, improving the responsiveness of interactive Internet applications.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"699 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126264398","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}

引用次数: 4

Snowballing Effects in Preferential Attachment: The Impact of the Initial Links 优先依恋的滚雪球效应:初始环节的影响

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288467

Huanyang Zheng, Jie Wu

{"title":"Snowballing Effects in Preferential Attachment: The Impact of the Initial Links","authors":"Huanyang Zheng, Jie Wu","doi":"10.1109/ICCCN.2015.7288467","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288467","url":null,"abstract":"This paper studies the node degree snowballing effects (i.e., degree growth effects) in the age-sensitive preferential attachment model, where nodes are iteratively added one by one to a growing network. Upon entering the network, each new node connects to a suitably chosen set of existing nodes, while the attachment probability for an existing node to get connected depends on both its node degree and age difference. We are interested in accelerating the node degree snowballing effects through the impact of the initial links. If a new node enters the growing network with more initial links (a larger degree), it could attract many more links from the later nodes, and thus, its degree snowballs faster. We find that the initial links are only impactful when neither the node degree nor the age difference dominates the attachment probability. In that case, the relationship between the ratio of the additional initial link and the gain ratio of the eventual node degree is shown to include two stages (linear stage and diminishing return stage). Applications of our work involve citation networks and online social networks. For example, in citation networks, we answer the question that whether an author can attract additional citations through self-citations. Finally, real data-driven experiments verify the accuracies of our results, which cast some new light in real-world growing networks.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127262815","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}

引用次数: 1