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

2016 IEEE 41st Conference on Local Computer Networks (LCN)最新文献

筛选
英文 中文
Tri-MCL: Synergistic Localization for Mobile Ad-Hoc and Wireless Sensor Networks 三mcl:移动Ad-Hoc和无线传感器网络的协同定位
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.61
Arne Bochem, Yali Yuan, D. Hogrefe
{"title":"Tri-MCL: Synergistic Localization for Mobile Ad-Hoc and Wireless Sensor Networks","authors":"Arne Bochem, Yali Yuan, D. Hogrefe","doi":"10.1109/LCN.2016.61","DOIUrl":"https://doi.org/10.1109/LCN.2016.61","url":null,"abstract":"Localization is a highly important topic in wireless sensor networks as well as in many Internet of Things applications. Many current localization algorithms are based on the Sequential Monte Carlo Localization method (MCL), the accuracy of which is bounded by the radio range. High computational complexity in the sampling step is another issue of these approaches. We present Tri-MCL which significantly improves on the accuracy of the Monte Carlo Localization algorithm. To do this, we leverage three different distance measurement algorithms based on range-free approaches. Using these, we estimate the distances between unknown nodes and anchor nodes to perform more fine-grained filtering of the particles as well as for weighting the particles in the final estimation step of the algorithm. Simulation results illustrate that the proposed algorithm achieves better accuracy than the MCL and SA-MCL algorithms. Furthermore, it also exhibits high efficiency in the sampling step.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"58 1","pages":"333-338"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82018297","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
Revisiting the So-Called Constructive Interference in Concurrent Transmission 再论并发传输中所谓的建设性干扰
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.56
Chun-Hao Liao, Yuki Katsumata, Makoto Suzuki, H. Morikawa
{"title":"Revisiting the So-Called Constructive Interference in Concurrent Transmission","authors":"Chun-Hao Liao, Yuki Katsumata, Makoto Suzuki, H. Morikawa","doi":"10.1109/LCN.2016.56","DOIUrl":"https://doi.org/10.1109/LCN.2016.56","url":null,"abstract":"Many works attributed the successful reception of concurrent transmission (CT) to the constructive interference. However, due to the inevitable carrier frequency offset (CFO) and the resulted beating effect, the claim of constructive interference is actually not valid. To clarify the reason behind the successful receptions under CT, we conduct extensive evaluations and identify the following findings. 1) We show that the IEEE 802.15.4 receivers survive the beating effect mainly because of the direct sequence spread spectrum (DSSS), while systems without the protection of DSSS are not applicable to CT. 2) We identify a counterintuitive phenomenon that the IEEE 802.15.4 receiver could survive only the beating results from large CFO, while performing poorly when CFO is small. 3) We demonstrate that, even if the receivers survive, CT links lead to little performance improvements compared to conventional signal transmission links from the SNR point of view.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"58 1","pages":"280-288"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87659272","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}
引用次数: 25
User-Centric Network Provisioning in Software Defined Data Center Environment 软件定义数据中心环境中以用户为中心的网络配置
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.57
Taimur Bakhshi, B. Ghita
{"title":"User-Centric Network Provisioning in Software Defined Data Center Environment","authors":"Taimur Bakhshi, B. Ghita","doi":"10.1109/LCN.2016.57","DOIUrl":"https://doi.org/10.1109/LCN.2016.57","url":null,"abstract":"Present data center (DC) network provisioning schemes primarily utilize conventional load-balancing technologies, offering individual application performance improvement. Diversity in application usage however, makes isolated application prioritization a performance caveat for users with varying application trends. The present paper proposes a user profiling approach to capture application trends based on generic flow measurements (NetFlow) and employs the extracted profiles to create DC traffic forwarding policies. The scheme allows operators to define a global profile and application hierarchy based on extracted profiles to prioritize traffic for individual user classes. The proposed design was tested by extracting user profiles from a realistic enterprise network, and further simulated to dynamically manage DC traffic using the software defined networking paradigm. Compared to conventional traffic management schemes, the frame delivery ratio and effective throughput of our design was significantly higher for high priority north-south user traffic as well as the inter-server east-west application traffic.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"225 1","pages":"289-297"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85258809","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
Organization-Level Control of Excessive Internet Downloads 组织层面对互联网过度下载的控制
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.38
Saad Y. Sait, H. Murthy, K. Sivalingam
{"title":"Organization-Level Control of Excessive Internet Downloads","authors":"Saad Y. Sait, H. Murthy, K. Sivalingam","doi":"10.1109/LCN.2016.38","DOIUrl":"https://doi.org/10.1109/LCN.2016.38","url":null,"abstract":"The control of excessive downloads by rogue users in organizational LANs is the subject of this work. Two mechanisms have been used in order to accomplish this. The first mechanism, is TCP rate control (TCR), it is a receiver-based flow control technique that can be used to effectively rate limit rogue users' flows, making more bandwidth available to regular users. The second mechanism, admission control reduces the bandwidth wastage due to users disconnecting out of impatience when user goodputs are low. Using simulation-based experiments, it has been demonstrated that the composite technique, exclusive TCP rate and admission control (xTRAC) provides seamless control of rogue users, while improving response times and goodput by upto 58% during overload. In this way regular users are incentivized and rogue users are penalized leading to long-term control of users.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"34 1","pages":"184-187"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91242585","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
Inferring and Controlling Congestion in CCN via the Pending Interest Table Occupancy 通过待处理兴趣表占用来推断和控制CCN中的拥塞
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.72
Amuda James Abu, B. Bensaou, A. Abdelmoniem
{"title":"Inferring and Controlling Congestion in CCN via the Pending Interest Table Occupancy","authors":"Amuda James Abu, B. Bensaou, A. Abdelmoniem","doi":"10.1109/LCN.2016.72","DOIUrl":"https://doi.org/10.1109/LCN.2016.72","url":null,"abstract":"Despite the improvements brought about by content-centric networking's (CCN) in-network caching and interest aggregation, congestion can still take place in such networks due to the dominance of non-reusable content, high cache churn, high delay variations, premature timeouts and interest retransmission. This becomes even more dramatic when multi-path routing is adopted. Identifying that at a given node in CCN, the Pending Interest Table (PIT) occupancy can give a good estimate of the data workload to arrive to the node in the near future, we propose in this paper a novel mechanism to control congestion in CCN based on this idea. Our mechanism uses the average occupancy of the PIT to estimate the anticipated data packet transmission queue length and sends explicit congestion notification signals to the content requesters to reduce their interest sending rates when such anticipated queue size exceeds a threshold. We demonstrate the effectiveness of our proposed mechanism via ns-3 simulation.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"12 1","pages":"433-441"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81737747","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
Graph Partitioning in Parallelization of Large Scale Networks 大规模网络并行化中的图划分
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.36
Sima Das, J. Leopold, Susmita K. Ghosh, Sajal K. Das
{"title":"Graph Partitioning in Parallelization of Large Scale Networks","authors":"Sima Das, J. Leopold, Susmita K. Ghosh, Sajal K. Das","doi":"10.1109/LCN.2016.36","DOIUrl":"https://doi.org/10.1109/LCN.2016.36","url":null,"abstract":"Real world large scale networks exhibit intrinsic community structure, with dense intra-community connectivity and sparse inter-community connectivity. Leveraging their community structure for parallelization of computational tasks and applications, is a significant step towards computational efficiency and application effectiveness. We propose a weighted depth-first-search graph partitioning algorithm for community formation that preserves the needed community dependency without any cycles. To comply with heterogeneity in community structure and size of the real world networks, we use a flexible limiting value for them. Further, our algorithm is a diversion from the existing modularity based algorithms. We evaluate our algorithm as the quality of the generated partitions, measured in terms of number of graph cuts.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"30 1","pages":"176-179"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74926342","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
Certificate Revocation Guard (CRG): An Efficient Mechanism for Checking Certificate Revocation 证书撤销保护(CRG):一种有效的证书撤销检查机制
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.84
Qinwen Hu, M. R. Asghar, N. Brownlee
{"title":"Certificate Revocation Guard (CRG): An Efficient Mechanism for Checking Certificate Revocation","authors":"Qinwen Hu, M. R. Asghar, N. Brownlee","doi":"10.1109/LCN.2016.84","DOIUrl":"https://doi.org/10.1109/LCN.2016.84","url":null,"abstract":"In the Public Key infrastructure (PKI) model, digital certificates play a vital role in securing online communication. Communicating parties exchange and validate these certificates, the validation fails if a certificate has been revoked. In this paper we propose the Certificate Revocation Guard (CRG) to efficiently check certificate revocation while minimising bandwidth, latency and storage overheads. CRG is based on OCSP, which caches the status of certificates locally. CRG could be installed on the user's machine, at the organisational proxy or even at the ISP level. Compared to a naive approach (where a client checks the revocation status of all certificates in the chain on every request), CRG decreases the bandwidth overheads and network latencies by 95%. Using CRG incurs 69% lower storage overheads compared to the CRL method. Our results demonstrate the effectiveness of our approach to improve certificate revocation.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"139 1","pages":"527-530"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85887796","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}
引用次数: 10
B. A. T. M. A. N. Handover Extension for Routing Nodes in Infrastructure WMNs B. A. T. M. A. N.基础设施无线网络中路由节点切换扩展
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.118
Patrick Herrmann, Ulrike Meyer
{"title":"B. A. T. M. A. N. Handover Extension for Routing Nodes in Infrastructure WMNs","authors":"Patrick Herrmann, Ulrike Meyer","doi":"10.1109/LCN.2016.118","DOIUrl":"https://doi.org/10.1109/LCN.2016.118","url":null,"abstract":"In the past, several proposals to support fast handover in wireless mesh networks have been published. However, most handover extensions are only concerned with moving stations that are unaware of the used routing protocol and assume relatively stationary routing nodes. In this paper we propose an extension to the BATMAN routing protocol to support seamless handover of routing nodes in infrastructure wireless mesh networks. We implement the new extension in our wireless mesh testbed and evaluate its performance in comparison to a standard WLAN handover followed by a route reestablishment using BATMAN. The evaluation shows that route reestablishment is more than 40 times faster with our extension when compared to standard BATMAN.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"34 1","pages":"680-687"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86483774","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
Opportunistic Geographic Forwarding in Wireless Sensor Networks for Critical Rare Events 关键罕见事件无线传感器网络中的机会地理转发
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.46
David C. Harrison, Winston K.G. Seah, Hang Yu, R. Rayudu
{"title":"Opportunistic Geographic Forwarding in Wireless Sensor Networks for Critical Rare Events","authors":"David C. Harrison, Winston K.G. Seah, Hang Yu, R. Rayudu","doi":"10.1109/LCN.2016.46","DOIUrl":"https://doi.org/10.1109/LCN.2016.46","url":null,"abstract":"Wireless sensor networks for rarely occurring critical events must maintain sensing coverage and low latency network connectivity to ensure event detection and subsequent rapid propagation of notification messages. Existing geographic forwarding algorithms have proved successful in providing energy efficient network connectivity for arbitrary topologies where sensing coverage is not guaranteed. This paper proposes a location aware algorithm for Swift Opportunistic Forwarding of Infrequent Events (SOFIE) that takes advantage of geometric properties common to sensing networks providing perfect area coverage. The algorithm is shown to deliver more rapid message propagation than two established, general purpose geographic forwarding algorithm in optimally and randomly placed networks of varied sensing node density. Further, the algorithm is shown to maintain this advantage when deployed in a coverage preserving, duty-cycled sensing network where nodes may power down whilst the network is actively forwarding event notification messages.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"18 1","pages":"216-219"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89388497","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
Topology Control in Wireless Sensor Networks: What Blocks the Breakthrough? 无线传感器网络的拓扑控制:是什么阻碍了突破?
2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.67
Michael Stein, Tobias Petry, Immanuel Schweizer, Martina Brachmann, M. Mühlhäuser
{"title":"Topology Control in Wireless Sensor Networks: What Blocks the Breakthrough?","authors":"Michael Stein, Tobias Petry, Immanuel Schweizer, Martina Brachmann, M. Mühlhäuser","doi":"10.1109/LCN.2016.67","DOIUrl":"https://doi.org/10.1109/LCN.2016.67","url":null,"abstract":"Graph-based topology control adapts wireless topologies to achieve certain target graph structures. Wireless sensor networks seem well-suited for the expectations (in particular those on provided energy savings) raised by topology control. Nevertheless, topology control has never made the breakthrough in real-world deployments. This work explores the reasons for this, identifying five practical obstacles of today's topology control: (i) unrealistic assumptions, (ii) unsuitable graph structures, (iii) application agnosticism, (iv) unclear role in the stack, and (v) insufficient framework support. To address the latter obstacle, we provide a re-usable framework for the implementation and evaluation of topology control. Based on this framework, we conduct a testbed-based evaluation for two application scenarios and three topology control algorithms including a novel application-specific algorithm. Indeed, the identified obstacles hinder topology control from boosting the application. However, the achieved graph structures show the practical feasibility of topology control in principle.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"156 1","pages":"389-397"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79851801","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信