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.
{"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}
Zan-Kai Chong, H. Ohsaki, Cheng-Kuan Bryan Ng, B. Goi, H. Ewe, S. Chong
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.
{"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}
Christian A. Hammerschmidt, Samuel Marchal, R. State, Gaetano Pellegrino, S. Verwer
The task of network traffic monitoring has evolved drastically with the ever-increasing amount of data flowing in large scale networks. The automated analysis of this tremendous source of information often comes with using simpler models on aggregated data (e.g. IP flow records) due to time and space constraints. A step towards utilizing IP flow records more effectively are stream learning techniques. We propose a method to collect a limited yet relevant amount of data in order to learn a class of complex models, finite state machines, in real-time. These machines are used as communication profiles to fingerprint, identify or classify hosts and services and offer high detection rates while requiring less training data and thus being faster to compute than simple models.
{"title":"Efficient Learning of Communication Profiles from IP Flow Records","authors":"Christian A. Hammerschmidt, Samuel Marchal, R. State, Gaetano Pellegrino, S. Verwer","doi":"10.1109/LCN.2016.92","DOIUrl":"https://doi.org/10.1109/LCN.2016.92","url":null,"abstract":"The task of network traffic monitoring has evolved drastically with the ever-increasing amount of data flowing in large scale networks. The automated analysis of this tremendous source of information often comes with using simpler models on aggregated data (e.g. IP flow records) due to time and space constraints. A step towards utilizing IP flow records more effectively are stream learning techniques. We propose a method to collect a limited yet relevant amount of data in order to learn a class of complex models, finite state machines, in real-time. These machines are used as communication profiles to fingerprint, identify or classify hosts and services and offer high detection rates while requiring less training data and thus being faster to compute than simple models.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"60 1","pages":"559-562"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79617175","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}
Context-aware applications that require access to physical space and time are a necessity in cyber-physical systems. We focus on the design of a cyber-physical operating system in which a space-time scheduler is the core-component responsible for resource management. Given a set of space-time tasks and a set of mobile robots that move through physical space, a main objective remains in finding a mapping of tasks to robots. In this paper, we address the problem of scheduling a set of tasks with spatio-temporal constraints in space and time. We present an online-scheduler that computes collision-free spatio-temporal trajectories for the robots in order to execute the space-time tasks. As side condition, collisions with static as well as dynamic obstacles must be avoided at all times. The scheduler consists of two components: a job scheduler that uses a heuristic and performs a coarse-grained scheduling and a trajectory planner that takes the output of the job scheduler and computes spatio-temporal trajectories.
{"title":"Spatio-Temporal Coordination of Mobile Robot Swarms","authors":"Daniel Graff, R. Karnapke","doi":"10.1109/LCN.2016.81","DOIUrl":"https://doi.org/10.1109/LCN.2016.81","url":null,"abstract":"Context-aware applications that require access to physical space and time are a necessity in cyber-physical systems. We focus on the design of a cyber-physical operating system in which a space-time scheduler is the core-component responsible for resource management. Given a set of space-time tasks and a set of mobile robots that move through physical space, a main objective remains in finding a mapping of tasks to robots. In this paper, we address the problem of scheduling a set of tasks with spatio-temporal constraints in space and time. We present an online-scheduler that computes collision-free spatio-temporal trajectories for the robots in order to execute the space-time tasks. As side condition, collisions with static as well as dynamic obstacles must be avoided at all times. The scheduler consists of two components: a job scheduler that uses a heuristic and performs a coarse-grained scheduling and a trajectory planner that takes the output of the job scheduler and computes spatio-temporal trajectories.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"24 1","pages":"515-518"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75494792","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}
Xiaolin Chang, Zhenjiang Zhang, Xiaodan Li, Kishor S. Trivedi
Transient survivability analysis of a virtualized system (VS) is critical to the wide deployment of cloud services. The existing research of VS availability and/or reliability focused on the steady-state analysis. This paper presents a model and the closed-form solutions to analyze the survivability of both cloud service and VS after a service breakdown occurrence by using continuous-time Markov chain. Service breakdown may be caused by software rejuvenation of virtual machine (VM) and/or VM monitor (VMM), or caused by VM and/or VMM bugs. The VS applies two techniques for improving service survivability: VM failover and live VM migration. The proposed model and the defined survivability metrics not only enable us to quantitatively assess the system survivability but also provide insights on the investment efforts in system recovery strategies. Sensitivity analysis through numerical analysis is carried out to study the impact of key parameters on system survivability.
{"title":"Model-Based Survivability Analysis of a Virtualized System","authors":"Xiaolin Chang, Zhenjiang Zhang, Xiaodan Li, Kishor S. Trivedi","doi":"10.1109/LCN.2016.104","DOIUrl":"https://doi.org/10.1109/LCN.2016.104","url":null,"abstract":"Transient survivability analysis of a virtualized system (VS) is critical to the wide deployment of cloud services. The existing research of VS availability and/or reliability focused on the steady-state analysis. This paper presents a model and the closed-form solutions to analyze the survivability of both cloud service and VS after a service breakdown occurrence by using continuous-time Markov chain. Service breakdown may be caused by software rejuvenation of virtual machine (VM) and/or VM monitor (VMM), or caused by VM and/or VMM bugs. The VS applies two techniques for improving service survivability: VM failover and live VM migration. The proposed model and the defined survivability metrics not only enable us to quantitatively assess the system survivability but also provide insights on the investment efforts in system recovery strategies. Sensitivity analysis through numerical analysis is carried out to study the impact of key parameters on system survivability.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"143 1","pages":"611-614"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73279145","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}
Standard Internet communication protocols are key enablers for the Internet of Things (IoT). Recent technological advances have made it possible to run such protocols on resource-constrained devices. Yet these devices often use energy-efficient, low-level communication technologies, like IEEE 802.15.4, which suffer from low-reliability and high latency. These drawbacks can be significantly reduced if communication occurs using concurrent transmissions - a novel communication paradigm for resource-constrained devices. In this paper, we show that Internet protocols like TCP/UDP and CoAP can run efficiently on top of a routing substrate based on concurrent transmissions. We call this substrate LaneFlood and demonstrate its effectiveness through extensive experiments on Flocklab, a publicly available testbed. Our results show that LaneFlood improves upon CXFS - a representative competitor - in terms of both duty cycle and reliability. Furthermore, LaneFlood can transport IoT traffic with an end-to-end latency of less than 300 ms over several hops.
{"title":"Concurrent Transmissions for Communication Protocols in the Internet of Things","authors":"Martina Brachmann, O. Landsiedel, S. Santini","doi":"10.1109/LCN.2016.69","DOIUrl":"https://doi.org/10.1109/LCN.2016.69","url":null,"abstract":"Standard Internet communication protocols are key enablers for the Internet of Things (IoT). Recent technological advances have made it possible to run such protocols on resource-constrained devices. Yet these devices often use energy-efficient, low-level communication technologies, like IEEE 802.15.4, which suffer from low-reliability and high latency. These drawbacks can be significantly reduced if communication occurs using concurrent transmissions - a novel communication paradigm for resource-constrained devices. In this paper, we show that Internet protocols like TCP/UDP and CoAP can run efficiently on top of a routing substrate based on concurrent transmissions. We call this substrate LaneFlood and demonstrate its effectiveness through extensive experiments on Flocklab, a publicly available testbed. Our results show that LaneFlood improves upon CXFS - a representative competitor - in terms of both duty cycle and reliability. Furthermore, LaneFlood can transport IoT traffic with an end-to-end latency of less than 300 ms over several hops.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"30 1","pages":"406-414"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87390054","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}
Software-Defined Networking (SDN) brings great opportunities to improve network performance. However, due to budget constraints and technique limitations, Internet Service Providers (ISPs) can upgrade only a limited number of conventional switches to SDN switches in real backbone networks at one time. In this paper, we propose one heuristic scheme for deploying SDN switches in hybrid SDNs. Our scheme works for two different cases: (1) maximizing the network control ability with a given upgrading budget constraint, and (2) minimizing the upgrading cost to achieve the best network control ability. We evaluate our scheme in real topologies. We evaluate our scheme in real topologies. The results show that our scheme can achieve 95% of flows controlled with only 10% upgrading cost.
{"title":"Incremental Switch Deployment for Hybrid Software-Defined Networks","authors":"Xuya Jia, Yong Jiang, Zehua Guo","doi":"10.1109/LCN.2016.95","DOIUrl":"https://doi.org/10.1109/LCN.2016.95","url":null,"abstract":"Software-Defined Networking (SDN) brings great opportunities to improve network performance. However, due to budget constraints and technique limitations, Internet Service Providers (ISPs) can upgrade only a limited number of conventional switches to SDN switches in real backbone networks at one time. In this paper, we propose one heuristic scheme for deploying SDN switches in hybrid SDNs. Our scheme works for two different cases: (1) maximizing the network control ability with a given upgrading budget constraint, and (2) minimizing the upgrading cost to achieve the best network control ability. We evaluate our scheme in real topologies. We evaluate our scheme in real topologies. The results show that our scheme can achieve 95% of flows controlled with only 10% upgrading cost.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"62 1","pages":"571-574"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86926349","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}
Phi-Le Nguyen, Khanh-Van Nguyen, Q. Vu, Yusheng Ji
There are two main requirements in dealing with coverage holes in wireless sensor networks (WSNs): locating the hole boundary and finding the locations to deploy new sensors for hole patching. The current protocols on finding the patching locations always require re-running the protocols from scratch many times. This constraint causes the time complexity and energy overhead to increase proportionally to the hole size. In this paper, we propose a lightweight protocol to determine coverage holes in wireless sensor network. Our protocol does not only can determine the exact hole boundary but also approximate the boundary by a simpler shape which can help to speed up the patching location finding process. The simulation experiments show that our protocol can reduce more than 56% of time complexity and save more than 46% of energy overhead in comparison with existing protocols.
{"title":"A Time and Energy Efficient Protocol for Locating Coverage Holes in WSNs","authors":"Phi-Le Nguyen, Khanh-Van Nguyen, Q. Vu, Yusheng Ji","doi":"10.1109/LCN.2016.37","DOIUrl":"https://doi.org/10.1109/LCN.2016.37","url":null,"abstract":"There are two main requirements in dealing with coverage holes in wireless sensor networks (WSNs): locating the hole boundary and finding the locations to deploy new sensors for hole patching. The current protocols on finding the patching locations always require re-running the protocols from scratch many times. This constraint causes the time complexity and energy overhead to increase proportionally to the hole size. In this paper, we propose a lightweight protocol to determine coverage holes in wireless sensor network. Our protocol does not only can determine the exact hole boundary but also approximate the boundary by a simpler shape which can help to speed up the patching location finding process. The simulation experiments show that our protocol can reduce more than 56% of time complexity and save more than 46% of energy overhead in comparison with existing protocols.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"39 1","pages":"180-183"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77871962","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}
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.
在本文中，我们提出并实现了一种低成本且有效的架构，可以为任何类型的网络实现动态频谱接入(DSA)。我们的目的是打破成本可扩展性障碍，并表明数据库辅助DSA系统的完整系统级解决方案可以用标准服务器和廉价的软件可配置射频芯片实现，从而实现规模经济。首先，我们提出了能够提供任何规模的网络以动态方式执行带内和带外信道访问的总体架构。该体系结构的两个主要组成部分是接收信号强度指示器(RSSI)传感网络和DSA服务器。对于RSSI传感网络，我们使用低成本的现成软件可配置射频(SCRF)芯片构建了工作在280-930 MHz的有线和无线频谱传感器。为了获得一组频带上的RSSI值，我们使用通用微控制器对SCRF芯片的工作参数(扫描范围、中心频率、带宽分辨率、解调方案和扫描速率)进行编程。无线传感器使用轻量级通信协议将感知到的RSSI值传输到最近的启用以太网的集线器。集线器聚合来自多个传感器的数据，并使用UDP over IP将数据流传输到DSA服务器。DSA服务器在接收到各种传感器的实时RSSI值后，将其与其他元数据一起存储在数据库引擎中。来自数据库的条目由通道分配服务使用，该服务为查询的DSA节点查找最佳通道。为了证明所实现的数据库辅助DSA系统的效率，我们将其与遗留系统进行了比较，并展示了在抗干扰能力、主到达时放弃信道以及最佳信道确定和分配方面的优势。我们还展示了在帧错误率(FER)和频谱效率方面的性能提升。最后，我们比较了低成本传感器与专业频谱分析仪的RSSI灵敏度。
{"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}
Racyus D. G. Pacífico, P. Goulart, A. Vieira, M. Vieira, J. Nacif
Measurement and tracking have crucial roles in Software-Defined Networks (SDNs). Unfortunately, most of procedures and techniques to perform measurements and monitoring tasks are implemented in software at network end-hosts. Despite the large use, a software based approach generates imprecision, high costs, and makes monitoring more difficult. In this paper, we extend OpenFlow switch to implement a measurement architecture for SDN. Our system performs measurements in a simple and scalable way without depending on end-hosts. It allows monitoring the performance at the granularity of flows. Moreover, our system also enables software-defined measurements can collect flow's statistics on the fly. We have prototyped our architecture on the NetFPGA platform and, as an initial case study, we have implemented a module to measure packet interarrival time. This module has been validated in a realistic testbed. Our results demonstrate that the proposed architecture presents a negligible difference when compared to measurements performed by software at end-hosts.
{"title":"Hardware Modules for Packet Interarrival Time Monitoring for Software Defined Measurements","authors":"Racyus D. G. Pacífico, P. Goulart, A. Vieira, M. Vieira, J. Nacif","doi":"10.1109/LCN.2016.39","DOIUrl":"https://doi.org/10.1109/LCN.2016.39","url":null,"abstract":"Measurement and tracking have crucial roles in Software-Defined Networks (SDNs). Unfortunately, most of procedures and techniques to perform measurements and monitoring tasks are implemented in software at network end-hosts. Despite the large use, a software based approach generates imprecision, high costs, and makes monitoring more difficult. In this paper, we extend OpenFlow switch to implement a measurement architecture for SDN. Our system performs measurements in a simple and scalable way without depending on end-hosts. It allows monitoring the performance at the granularity of flows. Moreover, our system also enables software-defined measurements can collect flow's statistics on the fly. We have prototyped our architecture on the NetFPGA platform and, as an initial case study, we have implemented a module to measure packet interarrival time. This module has been validated in a realistic testbed. Our results demonstrate that the proposed architecture presents a negligible difference when compared to measurements performed by software at end-hosts.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"2 1","pages":"188-191"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84034719","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：