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

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

筛选
英文 中文
Characterizing the performance of beamforming WiFi access points 描述波束成形WiFi接入点的性能
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925810
Mohammad Naghibi, Majid Ghaderi
{"title":"Characterizing the performance of beamforming WiFi access points","authors":"Mohammad Naghibi, Majid Ghaderi","doi":"10.1109/LCN.2014.6925810","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925810","url":null,"abstract":"Recently beamforming WiFi access points (APs) have been commercially available from multiple vendors. The promise of beamforming APs is the enhanced range and data transmission rate, albeit at a premium price for the AP which can be an order of magnitude more expensive than regular omnidirectional APs. In this work, through live measurements, we study the throughput performance of beamforming APs and compare it with that of regular omnidirectional APs. We consider two systems with multiple WiFi clients and: 1) a single expensive beamforming AP, and 2) multiple low-cost omnidirectional APs. We find that while in some situations the beamforming AP outperforms multiple regular APs when downloading data, in other scenarios typical of home and office use, multiple regular APs results in higher throughput and service quality. Moreover, multiple regular APs always outperforms the beamforming AP when uploading data.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127235376","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
Data aggregation in VANETs a generalized framework for channel load adaptive schemes VANETs中的数据聚合是信道负载自适应方案的一种通用框架
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925800
Josef Jiru, L.C.W. Bremer, Kalman Graffi
{"title":"Data aggregation in VANETs a generalized framework for channel load adaptive schemes","authors":"Josef Jiru, L.C.W. Bremer, Kalman Graffi","doi":"10.1109/LCN.2014.6925800","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925800","url":null,"abstract":"One of the main communication challenges in vehicle-to-x communication is scalability. With increasing number of communication nodes the wireless channel must not get congested especially if a large amount of sensor data has to be forwarded over multiple nodes to a data processing application. This challenge can be solved by reducing the data load through data aggregation. This work introduces a framework for data aggregation as a decentralized congestion control mechanism on the application layer. This framework can be used to flexibly design aggregation schemes that adaptively adjust the generated data load depending on the overall channel load. Three basic aggregation schemes with different complexity and resulting data precision were developed within this framework and they are discussed in this paper. Performance evaluations show that the aggregation schemes are able to adapt to given channel load thresholds within seconds and deliver optimal data quality even in traffic jam situations.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131934824","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}
引用次数: 8
On the potential of MPT/MPR wireless networks 论MPT/MPR无线网络的潜力
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925755
Ke Li, I. Nikolaidis, J. Harms
{"title":"On the potential of MPT/MPR wireless networks","authors":"Ke Li, I. Nikolaidis, J. Harms","doi":"10.1109/LCN.2014.6925755","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925755","url":null,"abstract":"Due to recent progress in signal processing techniques, the traditional collision channel model is inadequate for communication networks where the transceivers are endowed with the ability to transmit or receive multiple packets simultaneously (the MPT/MPR capability). This paper studies the schedule construction in MPT/MPR systems with the objective to understand how the flows traversing the network can leverage the MPT/MPR capabilities in multi-hop wireless networks. Towards our goal, we present a heuristic algorithm MDSatur to produce a schedule and propose the wireless water-filling (WF) algorithm which extends the traditional water-filling algorithm to multi-hop wireless scenarios to compute max-min allocations when the MPT and MPR capabilities are equal. By combining MDSatur and WF, we also design the LEX scheme to approximate the lexicographically optimal allocation of the system when the network has nonidentical MPT and MPR capabilities.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130669819","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
Breach path to target area detection reliability in Wireless Sensor Networks 无线传感器网络中突破路径对目标区域检测可靠性的影响
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925779
Mohammed Elmorsy, E. Elmallah
{"title":"Breach path to target area detection reliability in Wireless Sensor Networks","authors":"Mohammed Elmorsy, E. Elmallah","doi":"10.1109/LCN.2014.6925779","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925779","url":null,"abstract":"Wireless Sensor Networks (WSNs) deployed for surveillance tasks are sometimes required to detect unauthorized traversal of intruders from outside the WSN area to an internal area of interest. When network nodes are subject to random failure, it becomes important to estimate the likelihood of successfully detecting and reporting an intrusion event to the sink node. To serve this purpose, we formalize the breach path to target area reliability (BPTA-REL) problem. We devise efficient methods to derive lower and upper bounds on the exact solution. Our approach is based on developing efficient algorithms for generating network pathsets and cutsets for the problem. Next, we present simulation results that illustrate the effectiveness of the obtained bounds as well as their potential use in tackling related design problems.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131216625","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}
引用次数: 6
Practical OFDMA for corridor-based routing in Wireless Multihop Networks 无线多跳网络中基于廊道路由的实用OFDMA
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925750
Adrian Loch, M. Hollick, A. Kühne, A. Klein
{"title":"Practical OFDMA for corridor-based routing in Wireless Multihop Networks","authors":"Adrian Loch, M. Hollick, A. Kühne, A. Klein","doi":"10.1109/LCN.2014.6925750","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925750","url":null,"abstract":"Corridor-based Routing enables advanced physical layer schemes in Wireless Multihop Networks (WMNs). It widens paths in order to span multiple nodes per hop. As a result, groups of nodes cooperate locally at each hop to forward packets. Recent theoretical work suggests using Orthogonal Frequency-Division Multiple Access (OFDMA) in combination with Corridor-based Routing to improve throughput in WMNs. However, results focus on achievable capacity and do not consider practical issues such as modulation and coding schemes. In this paper, we study OFDMA for corridors in practice and implement it on software-defined radios. We show that OFDMA corridors provide significantly larger throughput gains when considering realistic modulation and coding, achieving up to 2x throughput gain compared to traditional routing not based on corridors.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132338346","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
On rule width and the unreasonable effectiveness of policy verification 论规则宽度与政策验证有效性的不合理
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925786
H. B. Acharya
{"title":"On rule width and the unreasonable effectiveness of policy verification","authors":"H. B. Acharya","doi":"10.1109/LCN.2014.6925786","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925786","url":null,"abstract":"Policies, such as routing tables and firewalls, are fundamental components of networking infrastructure. Unfortunately, existing policy verification and optimization algorithms require O(nd) time, where n is the number of rules (thousands), and d the number of fields (usually <; 10). However, these algorithms perform very well in practice. In this paper, we provide the explanation for this result: n and d are not the only parameters of interest! Through experimental study of our Parallel Next-step Lookup system PaNeL, as well as the FDD and Probe algorithms for policy verification, we clearly demonstrate the importance of our proposed new metric - the “width index”. Some established algorithms (such as FDD, used for structured firewall design) indeed become intractable for policies with poor width index values. We therefore suggest that the “unreasonable effectiveness” of such algorithms for practical policies is possible because such policies have a reasonable width index.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129480526","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
Decentralizing SDN's control plane 分散SDN的控制平面
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925802
Mateus A. S. Santos, B. A. A. Nunes, K. Obraczka, T. Turletti, B. Oliveira, C. Margi
{"title":"Decentralizing SDN's control plane","authors":"Mateus A. S. Santos, B. A. A. Nunes, K. Obraczka, T. Turletti, B. Oliveira, C. Margi","doi":"10.1109/LCN.2014.6925802","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925802","url":null,"abstract":"Motivated by the internets of the future, which will likely be considerably larger in size as well as highly heterogeneous and decentralized, we propose Decentralize-SDN, D-SDN, a framework that enables not only physical- but also logical distribution of the Software-Defined Networking (SDN) control plane. D-SDN accomplishes network control distribution by defining a hierarchy of controllers that can “match” an internet's organizational- and administrative structure. By delegating control between main controllers and secondary controllers, D-SDN is able to accommodate administrative decentralization and autonomy.It incorporates security as an integral part of the framework. This paper describes D-SDN and presents two use cases, namely network capacity sharing and public safety network services.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"347 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132538336","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}
引用次数: 62
A fine-grain partial MAC virtualization to support cross layer design in wireless ad hoc networks 支持无线自组织网络跨层设计的细粒度部分MAC虚拟化
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925828
Seon-Yeong Han, B. Shin, Dongman Lee
{"title":"A fine-grain partial MAC virtualization to support cross layer design in wireless ad hoc networks","authors":"Seon-Yeong Han, B. Shin, Dongman Lee","doi":"10.1109/LCN.2014.6925828","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925828","url":null,"abstract":"Cross layer approach is a promising technology to satisfy applications' fastidious requirements and maximize the wireless channel usage in wireless ad hoc networks. Existing cross layer architecture either adopts a specific MAC for an application type or does not change the MAC behavior because the MAC is commonly used for all types of applications in a node. MAC virtualization is an appropriate method to associate the MAC behavior with a specific application's requirement without impacting on other types of application. In this paper, we propose a partial MAC virtualization to support cross layer design in wireless ad hoc networks. In the proposed scheme, a MAC scheme is divided into a set of controllable condition variables and common MAC executor. A MAC control manager generates a virtual MAC with a set of controllable condition variables and related state variables. This paper also proposes an interface through which an application or an agent of the application can control the MAC for its own purpose, which allows a cross-layer mechanism for each application in a node. We show the feasibility of the proposed scheme by an example and experiments.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132876392","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 stochastic flow-level network modeling: Performance evaluation of short TCP flows 面向随机流级网络建模:短TCP流的性能评估
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925817
Fabien Geyer, S. Schneele, G. Carle
{"title":"Towards stochastic flow-level network modeling: Performance evaluation of short TCP flows","authors":"Fabien Geyer, S. Schneele, G. Carle","doi":"10.1109/LCN.2014.6925817","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925817","url":null,"abstract":"We present in this paper a stochastic flow-level network model for the performance evaluation of IP networks with multiple bottlenecks supporting short-lived and long-lived TCP flows. Flow-level network models are efficient at estimating the mean bandwidth of TCP flows in various topologies, but they are generally limited to the study of infinite flows. This paper extends such models in order to evaluate short-lived flows alternating between idle and active periods where data of random size is transferred. We study the interaction between multiple flows and derive mean bandwidths, durations of file transfer or average number of active flows. We first study a single bottleneck, and then extend our analysis to networks with multiple bottlenecks as well as the effect of slow-start. We apply our results to various networks and assess the accuracy of our approach by comparing our analytical results with results of the discrete event simulator ns-2.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126413209","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
An image retrieval framework for distributed datacenters 分布式数据中心的图像检索框架
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925803
Di Yang, J. Liao, Q. Qi, Jingyu Wang, Tonghong Li
{"title":"An image retrieval framework for distributed datacenters","authors":"Di Yang, J. Liao, Q. Qi, Jingyu Wang, Tonghong Li","doi":"10.1109/LCN.2014.6925803","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925803","url":null,"abstract":"As massive data is stored in cloud datacenters, it is necessary to effectively locate interest data in such a distributed environment. However, since it is difficult to create a visual vocabulary due to the lack of global information, most existing systems of Content Based Image Retrieval (CBIR) only focus on global image features. In this paper, we propose a novel image retrieval framework, which efficiently incorporates the bag-of-visual-word model into Distributed Hash Tables (DHTs). Its key idea is to establish visual words for local image features by exploiting the merit of Locality Sensitive Hashing (LSH), so that similar image patches are most likely gathered into the same nodes without the knowledge of any global information. Extensive experimental results demonstrate that our approach yields high accuracy at very low cost, while keeping the load balanced.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128201442","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
首页 上一页 下一页 尾页
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学术官方微信