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

Topology Preserving Map to Physical Map - A Thin-Plate Spline Based Transform 拓扑保持映射到物理映射——基于薄板样条的变换

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.54

Ali F. Buoud, A. Jayasumana

{"title":"Topology Preserving Map to Physical Map - A Thin-Plate Spline Based Transform","authors":"Ali F. Buoud, A. Jayasumana","doi":"10.1109/LCN.2016.54","DOIUrl":"https://doi.org/10.1109/LCN.2016.54","url":null,"abstract":"A Topology Preserving Map (TPM) is an easily obtainable localization free connectivity based map that preserves physical layout features of 2D/3D sensor networks. This paper considers how to obtain physical maps and physical coordinates from a TPM when the physical locations of a subset of nodes are known. First, we present a General Procrustes Alignment (GPA) based solution, which is the optimal linear transformation solution to the problem. Second approach is based on thin-plate spline (TPS), which transforms the set of topology coordinates to physical coordinates using radial basis functions. Five representative 2D network topologies are used to evaluate and compare the TPS approach with GPA approach, and also with the existing distance vector-hop (DV-Hop) technique. Results are presented for the cases where the reference nodes are selected randomly from the entire network, or randomly from the inner and outer boundaries of the network. The results show that with less than 10% of nodes as reference nodes, a map with an average error less than 0.6 of radio range can be achieved with the TPS approach, which significantly outperforms both the GPA and the DV-Hop. TPS approach generalizes directly to 3-D networks as well.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"24 1","pages":"262-270"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90663329","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

Improving Reliable Transmission Throughput with Systematic Random Code 利用系统随机码提高可靠传输吞吐量

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.87

Zan-Kai Chong, H. Ohsaki, Cheng-Kuan Bryan Ng, B. Goi, H. Ewe, S. Chong

{"title":"Improving Reliable Transmission Throughput with Systematic Random Code","authors":"Zan-Kai Chong, H. Ohsaki, Cheng-Kuan Bryan Ng, B. Goi, H. Ewe, S. Chong","doi":"10.1109/LCN.2016.87","DOIUrl":"https://doi.org/10.1109/LCN.2016.87","url":null,"abstract":"Rateless erasure code (REC) is an erasure code, where the encoder generates a potentially infinite number of encoded symbols and the original message can be reconstructed from a sufficient number of correctly received packets. Many REC-based transmission protocols have been proposed for improving network throughput in lossy channel. However, state-of-the-art RECs (such as LT code and Raptor code) are not efficient for transmitting short messages. Recent studies suggest that network traffic is characterised by bursts of short messages and thus existing transmission protocols do not benefit from the gains of deploying REC. In this paper, we propose an REC-based transmission protocol, namely UDP-RC, which integrates the simplicity of UDP and strength of systematic Random code suited to network traffic with short messages. It attains high throughput by transmitting short messages reliably with lower overheads over lossy channel. We experimentally show that UDP-RC achieves at least 50% higher throughput and maintains more stable throughput compared to TCP (Transmission Control Protocol) and UDT (UDP Data transfer) protocol under both ideal and lossy channel conditions.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"610 1","pages":"539-542"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86671522","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

Efficient Learning of Communication Profiles from IP Flow Records 从IP流记录中高效学习通信配置文件

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.92

Christian A. Hammerschmidt, Samuel Marchal, R. State, Gaetano Pellegrino, S. Verwer

引用次数: 16

Spatio-Temporal Coordination of Mobile Robot Swarms 移动机器人群体的时空协调

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.81

Daniel Graff, R. Karnapke

引用次数: 1

Model-Based Survivability Analysis of a Virtualized System 基于模型的虚拟化系统生存能力分析

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.104

Xiaolin Chang, Zhenjiang Zhang, Xiaodan Li, Kishor S. Trivedi

引用次数: 7

Concurrent Transmissions for Communication Protocols in the Internet of Things 物联网通信协议的并发传输

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.69

Martina Brachmann, O. Landsiedel, S. Santini

引用次数: 20

Incremental Switch Deployment for Hybrid Software-Defined Networks 混合型软件定义网络的增量交换机部署

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.95

Xuya Jia, Yong Jiang, Zehua Guo

引用次数: 21

A Time and Energy Efficient Protocol for Locating Coverage Holes in WSNs 一种既省时又节能的无线传感器网络覆盖孔定位协议

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.37

Phi-Le Nguyen, Khanh-Van Nguyen, Q. Vu, Yusheng Ji

引用次数: 3

A System Level Solution for DSA Systems: From Low-Cost Sensing to Spectrum Database DSA系统级解决方案:从低成本传感到频谱数据库

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.22

Osama Abbas Al Tameemi, M. Chatterjee

{"title":"A System Level Solution for DSA Systems: From Low-Cost Sensing to Spectrum Database","authors":"Osama Abbas Al Tameemi, M. Chatterjee","doi":"10.1109/LCN.2016.22","DOIUrl":"https://doi.org/10.1109/LCN.2016.22","url":null,"abstract":"In this paper, we present and implement a low-cost yet effective architecture that enables dynamic spectrum access (DSA) for any type of network. Our intention is to break the cost-scalability barrier and show that a complete system level solution for a database-assisted DSA system can be implemented with standard servers and inexpensive software configurable RF chips, thereby achieving economics of scale. First, we present the overall architecture that is capable of providing networks of any size to perform in-band and out of band channel access in a dynamic manner. The two main components of this architecture are the received signal strength indicator (RSSI) sensing network and the DSA server. For the RSSI sensing network, we built wired and wireless spectrum sensors that operate on 280-930 MHz using low-cost off the shelf software configurable RF (SCRF) chips. To get the RSSI values on a set of bands, we use generic micro-controllers to program the operating parameters (scan range, center frequency, bandwidth resolution, demodulation scheme and scan rate) of the SCRF chips. The wireless sensors transmit the sensed RSSI values to the nearest Ethernet-enabled hub using a light-weight communication protocol. The hub aggregates the data from multiple sensors and streams to the DSA server using UDP over IP. On receiving the real-time RSSI values from various sensors, the DSA server stores them in database engine with other meta data. Entries from the database are used by the channel allocation service that finds the best channel for the inquiring DSA nodes. To demonstrate the efficiency of the implemented database-assisted DSA system, we compare it to a legacy system and show the benefits in terms of resilience to jamming, channel relinquishment on primary arrival, and best channel determination and allocation. We also show the performance gains in terms of frame error rate (FER) and spectral efficiency. Finally, we compare the RSSI sensitivity of the low-cost sensors to that of a professional spectrum analyzer.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"83 1","pages":"104-111"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83983823","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

Hardware Modules for Packet Interarrival Time Monitoring for Software Defined Measurements 用于软件定义测量的数据包到达时间监控的硬件模块

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.39

Racyus D. G. Pacífico, P. Goulart, A. Vieira, M. Vieira, J. Nacif

引用次数: 4