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

筛选
英文 中文
vINCENT: An incentive scheme supporting heterogeneity in Peer-to-Peer content distribution vINCENT:支持点对点内容分发异质性的激励方案
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925752
M. Wichtlhuber, Peter Heise, Bjorn Scheurich, Julius Rückert, D. Hausheer
{"title":"vINCENT: An incentive scheme supporting heterogeneity in Peer-to-Peer content distribution","authors":"M. Wichtlhuber, Peter Heise, Bjorn Scheurich, Julius Rückert, D. Hausheer","doi":"10.1109/LCN.2014.6925752","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925752","url":null,"abstract":"Peer-to-Peer (P2P) has proven to be a scalable approach for content distribution, while reducing the load for the content provider. As P2P systems depend on each node's participation, reciprocal incentive mechanisms for stimulating contribution are a major building block in those systems. However, reciprocal incentive schemes fall short for resource-poor devices, as they lead to service degradation for those nodes. This paper presents vINCENT, an incentive scheme allowing resource-poor devices to seek support from resource-rich devices. The novel scheme is based on virtual nodes which form a trusted domain around multiple devices. vINCENT has been implemented and evaluated in a P2P live streaming scenario. The solution provides good playback quality to all devices within a virtual node, given a sufficient contribution of the virtual node as a whole. At the same time, free riding nodes are isolated efficiently and the game theoretic properties of reciprocity are preserved.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"38 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":"116538751","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
A distributed tracking algorithm for target interception in face-structured sensor networks 人脸结构传感器网络中目标拦截的分布式跟踪算法
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925819
É. L. Souza, R. Pazzi, E. Nakamura
{"title":"A distributed tracking algorithm for target interception in face-structured sensor networks","authors":"É. L. Souza, R. Pazzi, E. Nakamura","doi":"10.1109/LCN.2014.6925819","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925819","url":null,"abstract":"An addition to the target tracking application is the presence of a tracker that aims to intercept the target. The WSN provides the position of the target to the tracker, so that it can move towards the target. The objective is to reach the target in the shortest possible time, using the fewest number of nodes to save energy. In this paper, we propose and evaluate a Tracking Algorithm for Target Interception in face-structured sensor networks (TATI). TATI reduces the number of active nodes, activating only the faces that are feasible to be achieved by the target until the next sampling. Furthermore, the algorithm uses the nominal communication range of the nodes to shorten the route of the tracker. Simulation results show that TATI can save up to 15% in energy consumption, and it can keep the tracker around 10 meters closer to the target compared to the baseline.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"26 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":"129141776","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-assisted access for vehicular resources 车辆资源的缓存辅助访问
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925753
Sherin Abdel Hamid, H. Hassanein, G. Takahara, Hisham Farahat
{"title":"Caching-assisted access for vehicular resources","authors":"Sherin Abdel Hamid, H. Hassanein, G. Takahara, Hisham Farahat","doi":"10.1109/LCN.2014.6925753","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925753","url":null,"abstract":"Smart vehicles are considered major providers of ubiquitous information services. In this paper, we propose a solution for expedited and cost-effective access to vehicular public sensing services. The proposed caching-assisted data delivery (CADD) scheme applies caching on the delivery path of the collected data. Cached information can be used for later interests without having to request similar data from vehicles. CADD relies on the deployment of a “light-weight” road caching spot (RCS) at intersections, and on vehicles for communication to/from RCSs. CADD involves a novel caching mechanism that utilizes real-time information for selecting the caching RCSs while considering popularity in cache replacement. A data chunk to be replaced may be forwarded to another less-loaded RCS. CADD considers vehicles' headings to direct communication towards the destination, which reduces access delay. Performance evaluation of CADD shows significant improvements in the access cost and delay compared to a scheme that does not deploy RCSs.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"9 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":"125378782","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}
引用次数: 9
A multi-rate multi-channel multicast algorithm in wireless mesh networks 无线网状网络中的多速率多通道组播算法
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925756
Wanqing Tu
{"title":"A multi-rate multi-channel multicast algorithm in wireless mesh networks","authors":"Wanqing Tu","doi":"10.1109/LCN.2014.6925756","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925756","url":null,"abstract":"Devices in wireless mesh networks can operate on multiple channels and automatically adjust their transmission rates for the occupied channels. This paper shows how to improve performance-guaranteed multicasting transmission coverage for wireless multi-hop mesh networks by exploring the transmission opportunity offered by multiple rates (MR) and multiple channels (MC). We investigate the characteristics and behavior of transmissions with different rates in wireless multi-hop mesh networks. We then propose parallel low-rate transmissions and alternative rate transmissions to explore the advantages of MRMC under the constraint of limited channel resources. A novel link-controlled multi-rate multi-channel multicast algorithm is also designed to extend wireless multicast coverage with high throughput. Our NS2 simulation results demonstrate the improved multicast quality of LC-MRMC in much larger wireless areas as compared to current studies.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"43 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":"127264297","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}
引用次数: 12
An eigendecomposition based adaptive spatial sampling technique for wireless sensor networks 基于特征分解的无线传感器网络自适应空间采样技术
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925809
Sabri-E. Zaman, Manik Gupta, R. Mondragón, E. Bodanese
{"title":"An eigendecomposition based adaptive spatial sampling technique for wireless sensor networks","authors":"Sabri-E. Zaman, Manik Gupta, R. Mondragón, E. Bodanese","doi":"10.1109/LCN.2014.6925809","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925809","url":null,"abstract":"We propose a real-time adaptive- spatial sampling technique for the efficient collection of fine grained data in wireless sensor networks. The collection of fine grained data can incur high energy costs. This energy costs can be reduced by exploiting the spatial correlations of adjacent nodes, where only the most dominant nodes collect the data. We show that, using concepts developed in Random Matrix Theory, it is possible to determine the dominant nodes which enable to process noisy data in a time efficient, scalable, decentralized manner. The proposed technique has been validated using spatially interpolated pollution datasets giving good results in terms of data reduction and accuracy.","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":"116489285","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
Unleashing the shrew: a stealth greedy targeted attack on TCP traffic in wireless LANs 释放泼妇:对无线局域网中TCP流量的隐形贪婪目标攻击
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925789
Liyi Gu, Jun Zhang, B. Bensaou
{"title":"Unleashing the shrew: a stealth greedy targeted attack on TCP traffic in wireless LANs","authors":"Liyi Gu, Jun Zhang, B. Bensaou","doi":"10.1109/LCN.2014.6925789","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925789","url":null,"abstract":"This paper presents a new jamming attack in wireless LANs that deliberately targets uplink TCP acknowledgements (TCP-ACKs) of downlink TCP flows. To ensure immunity to detection with existing schemes, in this attack, the attacker does not jam the target constantly; instead, it relies on our probabilistic estimation model to forecast the time when its transmission has the highest likelihood of colliding with the target's generated TCP-ACKs. Repeating this process results in a decrease of the average congestion window of the targeted due to an increased round-trip time (RTT). The rogue node and/or its colluding attackers can grab this freed bandwidth and increase their throughput. We demonstrate via ns-2 simulation the effectiveness of such attack and show how easy it is to deploy without hardware modification. We also discuss its immunity to detection by existing detection schemes and investigate some parameters that may be used in building future detection mechanisms.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"88 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":"133107323","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}
引用次数: 2
Time calibration in experiments with networked sensors 网络传感器实验中的时间标定
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925798
O. Mehani, R. Taib, Benjamin Itzstein
{"title":"Time calibration in experiments with networked sensors","authors":"O. Mehani, R. Taib, Benjamin Itzstein","doi":"10.1109/LCN.2014.6925798","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925798","url":null,"abstract":"Physiological sensors are widely used in user studies, often by practitioners with limited expertise in networking. However, large data volumes, and processing times often prevent the use of a single computer to collect the readings in real time. With multiple collection machines appear the problems of data aggregation and, more importantly, synchronisation. This paper describes how the OML reporting library allows solving the aggregation problem at low cost by introducing a lightweight instrumentation reporting to a centralised database. However, with unknown delays in network paths during aggregation and unreliable clocks on acquisition machines, synchronisation is hard to attain. We present a preliminary study of the theoretical feasibility of post hoc synchronisation corrections, supported by an experiment applying correction techniques to artificially impaired clocks and network transmissions. Based on the results of this experiment this paper highlights potential improvements.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"97 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":"129584357","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
PowerPi: Measuring and modeling the power consumption of the Raspberry Pi PowerPi:测量和建模树莓派的功耗
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925777
F. Kaup, P. Gottschling, D. Hausheer
{"title":"PowerPi: Measuring and modeling the power consumption of the Raspberry Pi","authors":"F. Kaup, P. Gottschling, D. Hausheer","doi":"10.1109/LCN.2014.6925777","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925777","url":null,"abstract":"An increasing number of households is connected to the Internet via DSL or cable, for which home gateways are required. The optimization of these - caused by their large number - is a promising area for energy efficiency improvements. Since no power models for home gateways are currently available, the optimization of their power state is not possible. This paper presents PowerPi, a power consumption model for the Raspberry Pi which is used as a substitute to conventional home gateways to derive the impact of typical hardware components on the energy consumption. The different power states of the platform are measured and a power model is derived, allowing to estimate the power consumption based on CPU and network utilization only. The proposed power model estimates the power consumption resulting in a RMSE of less than 3.3%, which is slightly larger than the maximum error of the measurements of 2.5%.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"34 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":"132675767","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}
引用次数: 96
Spatial unfairness in IEEE 802.11 networks IEEE 802.11网络中的空间不公平性
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925799
Y. Bejerano, Hyoung-Gyu Choi, Seung-Jae Han
{"title":"Spatial unfairness in IEEE 802.11 networks","authors":"Y. Bejerano, Hyoung-Gyu Choi, Seung-Jae Han","doi":"10.1109/LCN.2014.6925799","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925799","url":null,"abstract":"Physical layer capture is one of the main causes of throughput unfairness in IEEE 802.11 Wireless LANs. While existing work have analyzed the impact of physical layer capture on the total system throughput of a cell, we study the relative unfairness among users as result of capture. Since this unfairness is related to the relative location of users, we call it as spatial unfairness. Our evaluation characterizes the relative throughput of users as a function of the users' distance from the Access Point.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"1 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":"130696542","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
Efficient virtual network embedding via exploring periodic resource demands 通过探索周期性资源需求,实现高效的虚拟网络嵌入
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-09-01 DOI: 10.1109/LCN.2014.6925760
Zichuan Xu, W. Liang, Qiufen Xia
{"title":"Efficient virtual network embedding via exploring periodic resource demands","authors":"Zichuan Xu, W. Liang, Qiufen Xia","doi":"10.1109/LCN.2014.6925760","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925760","url":null,"abstract":"Cloud computing built on virtualization technologies promises provisioning elastic computing and communication resources to enterprise users. To share cloud resources efficiently, embedding virtual networks of different users to a distributed cloud consisting of multiple data centers (a substrate network) poses great challenges. Motivated by the fact that most enterprise virtual networks usually operate on long-term basics and have the characteristics of periodic resource demands, in this paper we study the virtual network embedding problem by embedding as many virtual networks as possible to a substrate network such that the revenue of the service provider of the substrate network is maximized, while meeting various Service Level Agreements (SLAs) between enterprise users and the cloud service provider. For this problem, we propose an efficient embedding algorithm by exploring periodic resource demands of virtual networks, and employing a novel embedding metric that models the workloads on both substrate nodes and communication links if the periodic resource demands of virtual networks are given; otherwise, we propose a prediction model to predict the periodic resource demands of these virtual networks based on their historic resource demands. We also evaluate the performance of the proposed algorithms by experimental simulation. Experimental results demonstrate that the proposed algorithms outperform existing algorithms, improving the revenue from 10% to 31%.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"21 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":"114541936","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}
引用次数: 15
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学术官方微信