发布求助
文献互助 智能选刊 最新文献

39th Annual IEEE Conference on Local Computer Networks最新文献

筛选
英文 中文
Optimal cooperative routing protocol based on prefix popularity for Content Centric Networking 基于前缀流行度的内容中心网络最优协同路由协议
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925805
S. Tarnoi, W. Kumwilaisak, Yusheng Ji
{"title":"Optimal cooperative routing protocol based on prefix popularity for Content Centric Networking","authors":"S. Tarnoi, W. Kumwilaisak, Yusheng Ji","doi":"10.1109/LCN.2014.6925805","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925805","url":null,"abstract":"This paper presents an optimal cooperative routing protocol (OCRP) for Content Centric Networking (CCN) aiming to improve the in-network cache utilization. The objective of OCRP is to selectively aggregate the multiple flows of interest messages onto the same path. This improves the cache utilization while mitigating the cache contention in the Content Store (CS) of CCN routers on the routing path. The optimal routing path is obtained by binary linear optimization under threes constraints: flow conservation constraint, cache contention mitigating constraint, and path length constraint. Our simulation results of OCRP show the reduction in the server load and round-trip hop distance in comparison to those of the shortest path routing and our previously proposed cooperative routing schemes.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123846831","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}
引用次数: 5
Resource allocation and request handling for user-aware content retrieval in the cloud 云中用户感知内容检索的资源分配和请求处理
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925758
Boyang Yu, Jianping Pan
{"title":"Resource allocation and request handling for user-aware content retrieval in the cloud","authors":"Boyang Yu, Jianping Pan","doi":"10.1109/LCN.2014.6925758","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925758","url":null,"abstract":"The user-aware content retrieval services are always data-intensive and require much resource to satisfy the user demand, which incurs the high cost of implementation. Considering that they could largely exploit the pay-as-you-go paradigm and the almost unlimited resource pool of the cloud, we investigate the design issues of deploying the services to the cloud in a cost-effective way. We formulate the resource allocation and request handling problem which aims at lowering the deployment cost and guaranteeing the service quality simultaneously. Due to the hardness of obtaining an optimal solution, we design two approximate algorithms with different points of emphasis and analyze their approximation ratios as well. In addition, we discuss the implementation issues in applying the proposed algorithms to the practical systems. Finally, the algorithms are evaluated and validated through both trace-based and synthesized simulations where they show a large improvement in terms of the total system cost.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125475736","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
CluClas: Hybrid clustering-classification approach for accurate and efficient network classification CluClas:用于准确高效网络分类的混合聚类-分类方法
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925769
A. Fahad, K. Alharthi, Z. Tari, Abdulmohsen Almalawi, I. Khalil
{"title":"CluClas: Hybrid clustering-classification approach for accurate and efficient network classification","authors":"A. Fahad, K. Alharthi, Z. Tari, Abdulmohsen Almalawi, I. Khalil","doi":"10.1109/LCN.2014.6925769","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925769","url":null,"abstract":"The traffic classification is the foundation for many network activities, such as Quality of Service (QoS), security monitoring, Lawful Interception and Intrusion Detection Systems (IDS). A recent statistics-based approach to address the unsatisfactory results of traditional port-based and payload-based approaches has attracted attention. However, the presence of non-informative attributes and noise instances degrade the performance of this approach. Thus, to address this problem, in this paper, we propose a hybrid clustering-classification approach (called CluClas) to improve the accuracy and efficiency of network traffic classification by selecting informative attributes and representative instances. An extensive empirical study on four traffic data sets shows the effectiveness of our proposed approach.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114112758","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}
引用次数: 5
Optimal power allocation in cognitive networks using non-orthogonal AF relays 基于非正交自动对焦中继的认知网络最优功率分配
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925804
Mahmoud Elsaadany
{"title":"Optimal power allocation in cognitive networks using non-orthogonal AF relays","authors":"Mahmoud Elsaadany","doi":"10.1109/LCN.2014.6925804","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925804","url":null,"abstract":"Underlay cognitive networks are being promoted as an implementable solution for the congestion in the wireless spectrum. With some nodes employed as relays, the throughput of such networks is enhanced through cooperative gains. In this paper, we address the problem of maximizing the throughput of an underlay cognitive network through optimal power allocation of non-orthogonal amplify-and-forward relays. In order to maintain stable communication at the primary network, the interference due to the activities of all the cognitive nodes is kept below a limit. The optimal power allocation problem is formulated and then transformed to a quadratically constrained quadratic problem (QCQP). The maximum throughput of the cognitive network is derived as an eigen-solution of a channel-dependent matrix and the corresponding signal-to-noise ratio (SNR) is shown to be the dominant eigenvalue of this matrix. The proposed power allocation achieves significant throughput improvement over equal power allocation scheme and opportunistic relay selection scheme.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114865959","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}
引用次数: 7
Optimal rate allocation and scheduling in cooperative streaming 协同流中的最优速率分配与调度
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925821
M. R. Zakerinasab, Mea Wang
{"title":"Optimal rate allocation and scheduling in cooperative streaming","authors":"M. R. Zakerinasab, Mea Wang","doi":"10.1109/LCN.2014.6925821","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925821","url":null,"abstract":"While the demand for multimedia streaming, especially from mobile devices, is growing rapidly, mobile devices are challenged by the variable transmission rate in wireless channels and limited battery capacity. In this paper, we propose an energy-efficient cooperative streaming system. In the proposed system, mobile devices collectively stream a copy of the multimedia content from the source over cellular links. The devices form a cooperative group and share received content, in coded form for efficient loss detection and recovery, with each other over short-range links. The sharing is guided by the optimal rate allocation and scheduling (RAS) algorithm that determines the amount of data and the data to be transmitted on each link. Overall, the system minimizes both the streaming traffic in the cellular network and the energy consumed by streaming applications on mobile devices. Our experimental results also show that the RAS algorithm prolongs the streaming session for the entire cooperative group.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116549712","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}
引用次数: 0
Bi-scale temporal sampling strategy for traffic-induced pollution data with Wireless Sensor Networks 基于无线传感器网络的交通污染数据双尺度时间采样策略
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925782
Lamling Venus Shum, S. Hailes, Manik Gupta, E. Bodanese, P. Rajalakshmi, U. Desai
{"title":"Bi-scale temporal sampling strategy for traffic-induced pollution data with Wireless Sensor Networks","authors":"Lamling Venus Shum, S. Hailes, Manik Gupta, E. Bodanese, P. Rajalakshmi, U. Desai","doi":"10.1109/LCN.2014.6925782","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925782","url":null,"abstract":"Carbon Monoxide (CO) induced by traffic pollution is highly dynamic and non-linear. In a pilot research, we collected some fine-grained 1Hz CO pollution data from a residential road and a busy motorway in Hyderabad, India, in preparation of the deployment of a larger scale, longer term wireless sensor monitoring system. Power conservation is an important issue as the sensor nodes are battery operated. We studied the characteristics of the collected data and designed an adaptive sampling algorithm, Bi-Scale temporal sampler, which adapts the sampling frequency to the statistics collected in real time. This design has incorporated practical engineering considerations including minimising electronic noise, sensor warm-up time and data characteristics. Results show that Bi-Scale sampler achieves better energy saving and statistical deviation ratio for our requirements than burst sampling and eSENSE sampling strategies, which are techniques popularly used in environmental monitoring applications.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132157672","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
A novel vehicular sensing framework for smart cities 面向智慧城市的新型车辆传感框架
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925824
Jagruti Sahoo, S. Cherkaoui, A. Hafid
{"title":"A novel vehicular sensing framework for smart cities","authors":"Jagruti Sahoo, S. Cherkaoui, A. Hafid","doi":"10.1109/LCN.2014.6925824","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925824","url":null,"abstract":"Smart cities leverage technology to analyze data to make decisions, anticipate problems and coordinate resources to operate efficiently. Data produced by sensors embedded in vehicles moving on streets enable sensing applications for smart cities that were infeasible in the past due to high deployment costs. In this paper, we propose a novel framework for collection, aggregation and retrieval of data. The framework considers vehicles and road-side units as the main entities. To collect data, the city road network is divided into a number of sensing regions. We discuss the aggregation operations for each type of event. A retrieval mechanism is also proposed to deliver content in real-time. The simulations results demonstrate that the proposed framework outperforms existing vehicular sensing approaches in terms of delay and accuracy.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126198943","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}
引用次数: 7
Caching piggyback information for efficient index code transmission 缓存承载信息以实现高效的索引代码传输
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-06-27 DOI: 10.1109/LCN.2014.6925757
Jalaluddin Qureshi
{"title":"Caching piggyback information for efficient index code transmission","authors":"Jalaluddin Qureshi","doi":"10.1109/LCN.2014.6925757","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925757","url":null,"abstract":"The index coding problem is a fundamental transmission problem arising in content distribution and wireless networks. Traditional approach to solve this problem is to find heuristic/ approximation minimum clique partition solution on an appropriately mapped graph of the index coding problem. In this paper we study index code for unicast data flow for which we propose updated clique index coding (UCIC) scheme, UCIC piggybacks additional information in the coded symbol such that an unsatisfied client can update its cache. We show that UCIC has higher coding gain than previously proposed index coding schemes, and it is optimal for those instances where index code of minimum length is known.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"60 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120894758","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
LSD-ABAC: Lightweight static and dynamic attributes based access control scheme for secure data access in mobile environment LSD-ABAC:用于移动环境下安全数据访问的基于静态和动态属性的轻量级访问控制方案
39th Annual IEEE Conference on Local Computer Networks Pub Date : 1900-01-01 DOI: 10.1109/LCN.2014.6925791
Fei Li, Y. Rahulamathavan, M. Rajarajan
{"title":"LSD-ABAC: Lightweight static and dynamic attributes based access control scheme for secure data access in mobile environment","authors":"Fei Li, Y. Rahulamathavan, M. Rajarajan","doi":"10.1109/LCN.2014.6925791","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925791","url":null,"abstract":"Technology advancements in smart mobile devices empower mobile users by enhancing mobility, customizability and adaptability of computing environments. Mobile devices are now intelligent enough to capture dynamic attributes such as unlock failures, application usage, location and proximity of devices in and around its surrounding environment. Different users will have different set of values for these dynamic attributes. In traditional attribute based access control, users are authenticated to access restricted data using long term static attributes such as password, roles, and physical location. In this paper, in order to allow secure data access in mobile environment, we securely combine both the dynamic and static attributes and develop novel access control technique. Security and performance analyse show that the proposed scheme substantially reduces the computational complexity while enhances the security compare to the conventional schemes.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125953963","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}
引用次数: 19
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信