Testbed Evaluation Research Articles

Laboratory and Field Testbed Evaluation of the Performance of Recycled Asphalt Mixture Using High-Penetration Asphalt

The application of recycled asphalt pavement (RAP) on a large scale is highly promoted to meet the current needs of carbon neutrality and sustainable development purposes. However, a majority of RAP mixture productions are currently relying on the restoring effects provided by the rejuvenators. Therefore, the study focuses on the feasibility of using high penetration asphalt binder (HPAB) in RAP mixture as a replacement for conventional rejuvenators. In this study, a recycled asphalt pavement mixture containing HPAB (RAP-H) was developed to resolve the cracking issue of RAP pavement in winter seasons owing to the rigid behavior of aged binders. To verify the applicability of the RAP-H mixture, the results of the quality standard test and mechanical performance test were compared with the reference RAP mixture having rejuvenator (RAP-R). Through the fatigue cracking test, by using Overlay Tester (OT) device, it was found that all specimens did not reach 93% load reduction after 1000 OT cycles, indicating a satisfied stress-bearing capacity. Additionally, the highest dynamic modulus of 27,275 MPa was found in the modified HPAB mixture, and this result is 4.4% higher than that of the reference mix. In the full-scale testbed, the long-term field applicability of the proposed approach was verified through field test construction. The measurement in practice reveals that the elastic modulus of RAP-H back-calculated from the FWD (Falling Weight Deflectometer) test is increased by more than 50% compared to RAP-R, which resulted in excellent performance characteristics of the HPAB pavement layer. In addition to the efficiency in the surface layer, an improved elastic modulus of the sub-base and subgrade layers in the HPAB section was found to be at 28.6% and 19.5%, respectively, compared to the RAP-R mix. In general, the performance of RAP-H satisfied all of the domestic and international quality and performance standards. The field test results confirmed the possibility of field application by showing performance higher than conventional recycled asphalt pavement.

Network Queuing Assessment: A Method to Detect Bottlenecks in Service Function Chaining

Virtualization and softwarization have driven the widespread adoption of the cloud computing paradigm, with savings in CAPEX, OPEX, and environmental footprint, by transferring to and sharing computational resources in datacenters. Represented by some leading technologies - as Software Defined Networks, Network Function Virtualization, and Service Function Chaining - they bring new network and service management challenges. The autonomous resource elasticity that demands new techniques to detect overloaded functions, also known as bottlenecks, is a challenge. Most research efforts in this area have focused on traditional hardware metrics like CPU, memory, throughput, and tailored application metrics. These approaches may be imprecise and hard to transfer between different scenarios. This paper presents the Network Queue Assessment (NQA) technique for detecting bottlenecks in Service Function Chaining based on network queue occupation, which requires no end-user feedback or knowledge about its internal architecture, and no definition of thresholds. Our results confirm the accuracy of NQA for bottleneck detection in a testbed evaluation with virtualized versions of five network functions: Intrusion Detection System (IDS), Network Address Translation (NAT), Virtual Private Network (VPN), Proxy-cache, and Firewall. Also, we combine the previously evaluated functions in four more complex scenarios to confirm our conclusions.

Powerless IoT Clicker System

A batteryless remote control and a corresponding receiver system for home Internet of Things (IoT) applications are proposed. The user board backscatters a carrier signal in accordance with a user’s click pattern. The backscattered signal is captured using a low-end radio-frequency (RF) receiver, and a receiver algorithm detects the pattern and identifies the corresponding user command. Our testbed evaluation demonstrates 100% accuracy at up to 3 m.

Breaking Cellular IoT with Forged Data-plane Signaling: Attacks and Countermeasure

We devise new attacks exploiting the unprotected data-plane signaling in cellular IoT networks (a.k.a. both NB-IoT and Cat-M). We show that, despite the deployed security mechanisms on both control-plane signaling and data-plane packet forwarding, novel data-plane signaling attacks are still feasible. The attacker can forge both uplink and downlink data-plane signaling messages that pass the current security checks used by the receiver. With the capability of forging messages, the attacker can launch attacks that exhibit a variety of attack forms beyond simplistic packet-blasting, denial-of-service (DoS) threats, including location privacy breach, packet delivery loop, prolonged data delivery, throughput limiting, radio resource draining, connection reset, and multicast disabling. Our testbed evaluation and operational network validation have confirmed the attack viability. To combat the threat, we further propose a new defense solution within the 3GPP C-IoT standard framework. It leverages the synchronized timer clock information to protect the data-plane signaling messages with low overhead.

PUFchain 2.0: Hardware-Assisted Robust Blockchain for Sustainable Simultaneous Device and Data Security in Smart Healthcare.

This article presents the first-ever hardware-assisted blockchain for simultaneously handling device and data security in smart healthcare. This article presents the hardware security primitive physical unclonable functions (PUF) and blockchain technology together as PUFchain 2.0 with a two-level authentication mechanism. The proposed PUFchain 2.0 security primitive presents a scalable approach by allowing Internet of Medical Things (IoMT) devices to connect and obtain PUF keys from the edge server with an embedded PUF module instead of connecting a PUF module to each device. The PUF key, once assigned to a particular media access control (MAC) address by the miner, will be unique for that MAC address and cannot be assigned to other devices. PUFs are developed based on internal micro-manufacturing process variations during chip fabrication. This property of PUFs is integrated with blockchain by including the PUF key of the IoMT into blockchain for authentication. The robustness of the proposed Proof of PUF-Enabled authentication consensus mechanism in PUFchain 2.0 has been substantiated through test bed evaluation. Arbiter PUFs have been used for the experimental validation of PUFchain 2.0. From the obtained 200 PUF keys, 75% are reliable and the Hamming distance of the PUF module is 48%. Obtained database outputs along with other metrics have been presented for validating the potential of PUFchain 2.0 in smart healthcare.

Characteristics of ultrafine particle emission change depending on the placement of ventilation systems in 3D printer working environment

This study evaluated the emission characteristics of ultrafine particles emitted during material extrusion type 3D printer, called Desktop 3D printer, operation in the test bed and mock-up environmental conditions respectively. For the measurement, a condensation particle counter (CPC) and scanning mobility particle sizer (SMPS) were employed. In the test-bed evaluation, representative materials widely used nowadays such as ABS, PLA, TPU, PC, etc, emitted higher than the UFP criteria (3.5 ×1011) of 2D printer test method RAL-UZ 171. Particle sizes emitted from materials were found to be less than 200 nm. For the mock-up environment, seven different Desktop 3D printers and mechanical ventilation devices are used to compare the reduction rates of UFP according to the kind and placement of ventilation systems. When the ventilation equipment was installed on the ceiling, the reduction efficiency of UFP emission was not confirmed clearly while the reduction rates were significantly reduced when installed on the window.

Chipless RFID Infrastructure Based Self-Localization: Testbed Evaluation

This paper presents a realistic feasibility of radio frequency identification (RFID) based self-localization of objects in real environments using simple infrastructure composed of chipless tags. These tags are designed as arrays of dielectric resonators (DR) in order to overcome the range limitations of the traditional chipless tags, where the DR array structure of the tags boosts the radar cross section (RCS) and, consequentially, extends the range coverage. Furthermore, an efficient algorithm for tag detection is proposed considering the environmental and hardware impairments that alter the backscattered signal from the tag. In this system, the reader interrogates the reference nodes, i.e. chipless tags, by a frequency-sweep RF signal, and the backscattered signals from the tags are captured and analyzed at the reader for detection, ranging and location estimation. A testbed is implemented with fabricated chipless RFID tags in order to evaluate the validity and accuracy of the proposed self-localization system. Experimental measurements based simulations are conducted in several scenarios in order to evaluate the proposed system. Moreover, an object (the reader) is moved to several locations in an interrogation area of $2.5\times 1.2$ m, and, afterwards, its location is estimated. The averaged measured location error achieved based on the proposed system is approximately 5 cm with a variation of 0.9 cm as a minimum observed error and 7 cm as a maximum error.

A-ECN Minimizing Queue Length for Datacenter Networks

Recently, Explicit Congestion Notification (ECN) has been leveraged by DCTCP and its successive protocols to reduce the latency in datacenters. However, we find that DCTCP may induce the queue underflow and high latency in multi-queue scenarios and even single-queue environments. Our analysis concludes that the problem is caused by improper ECN marking thresholds of DCTCP. In this paper, an Adaptive ECN (A-ECN) marking scheme is proposed to enhance the performance of the ECN marking scheme of DCTCP.A-ECN is designed to minimize queue length as well as keeping high link utilization. More importantly, A-ECN can adaptively adjust ECN marking thresholds in different scenarios to achieve good generality. Therefore, network operators can directly deploy A-ECN in various environments regardless of underlying bandwidth, packet schedulers and the number of concurrent flows. At last, the testbed evaluation results show that A-ECN can minimize queue length and maintain high throughput. The flow completion times (FCT) for short flows could be reduced by up to 40% compared to the ECN marking scheme of DCTCP.

Reliable Communication and Latency Bound Generation in Wireless Cyber-Physical Systems

Low-power wireless communication has been widely used in cyber-physical systems that require time-critical data delivery. Achieving this goal is challenging because of link burstiness and interference. Based on significant empirical evidence of 21 days and over 3.6 M packet transmissions per link, we propose both routing and scheduling algorithms that produce latency bounds of the real-time periodic streams and accounts for both link bursts and interference. The solution is achieved through the definition of a new metric B max that characterizes links by their maximum burst length, and by choosing a novel least-burst-route that minimizes the sum of worst-case burst lengths over all links in the route. With extensive data-driven analysis, we show that our algorithms outperform existing solutions by achieving accurate latency bound with much less energy consumption. In addition, a testbed evaluation consisting of 48 nodes spread across a floor of a building shows that we obtain 100% reliable packet delivery within derived latency bounds. We also demonstrate how performance deteriorates and discuss its implications for wireless networks with insufficient high-quality links.

RecFlow: SDN-based receiver-driven flow scheduling in datacenters

Datacenter applications (e.g., web search, recommendation systems, and social networking) are designed to have a high fanout for the purpose of achieving scalable performance. Frequent fabric congestion (e.g., due to incast, imperfect hashing) is a corollary of such a design. This is true even when the network utilization is low. Such fabric congestion exhibits both temporal as well as spatial (intra-rack and inter-rack) variations. There exist two basic design paradigms which are used to address this issue. Current solutions lie somewhere between the two. On one hand we have arbiter based approaches where senders poll a centralized arbiter and collectively obey global scheduling decisions. On the other end of the spectrum, we have self adjusting end point based approaches where senders independently adjust transmission rate based on network congestion. The former incurs greater overhead, compared to the latter which trades off complexity for sub-optimality. Our work seeks a middle ground - optimality of arbiter based approaches with the simplicity of self adjusting end point based approaches. Our key design principle is that since the receiver has complete information regarding the flows destined for it, rather than having a centralized arbiter schedule flows or the senders making independent scheduling decisions, the receiver can orchestrate the various flows destined for it. Since multiple receivers may be using a bottleneck link, datapath visibility should be used to ensure fair sharing of the bottleneck capacity between receivers with minimum overhead. We propose RecFlow, which is a receiver-based proactive congestion control scheme. RecFlow employs OpenFlow provided path visibility to track changing bottlenecks on the fly. It spaces TCP acknowledgements to prevent traffic bursts and ensure that no receiver exceeds its fair share of the bottleneck capacity. The goal is to reduce buffer overflows while maintaining fairness among flows and high link utilization. Using extensive simulation results and real testbed evaluation, we show that compared to the state-of-the-art, RecFlow achieves up to 6× improvement in the inter-rack scenario and 1.5× in the intra-rack scenario while sharing the link capacity fairly between all flows.

Minimizing cost by reducing scaling operations in distributed stream processing

Elastic distributed stream processing systems are able to dynamically adapt to changes in the workload. Often, these systems react to the rate of incoming data, or to the level of resource utilization, by scaling up or down. The goal is to optimize the system's resource usage, thereby reducing its operational cost. However, such scaling operations consume resources on their own, introducing a certain overhead of resource usage, and therefore cost, for every scaling operation. In addition, migrations caused by scaling operations inevitably lead to brief processing gaps. Therefore, an excessive number of scaling operations should be avoided. We approach this problem by preventing unnecessary scaling operations and over-compensating reactions to short-term changes in the workload. This allows to maintain elasticity, while also minimizing the incurred overhead cost of scaling operations. To achieve this, we use advanced filtering techniques from the field of signal processing to pre-process raw system measurements, thus mitigating superfluous scaling operations. We perform a real-world testbed evaluation verifying the effects, and provide a break-even cost analysis to show the economic feasibility of our approach.

How effective and cost-effective are innovative combinatorial technologies and practices for supporting older people with long-term conditions to remain well in the community? An evaluation protocol for an NHS Test Bed in North West England

IntroductionThe Lancashire and Cumbria Innovation Alliance (LCIA) Test Bed is a partnership between the National Health Service in England, industry (led by Philips) and Lancaster University. Through the implementation of...

Embracing Corruption Burstiness: Fast Error Recovery for ZigBee under Wi-Fi Interference

The ZigBee communication can be easily and severely interfered by Wi-Fi traffic. Error recovery, as an important means for ZigBee to survive Wi-Fi interference, has been extensively studied in recent years. The existing works add upfront redundancy to in-packet blocks for recovering a certain number of random corruptions. Therefore, the bursty nature of ZigBee in-packet corruptions under Wi-Fi interference is often considered harmful, since some blocks are full of errors which cannot be recovered and some blocks have no errors but are still requiring redundancy. As a result, they often use interleaving to reshape the bursty errors, before applying complex FEC codes to recover the re-shaped random distributed errors. In this paper, we take a different view that burstiness may be helpful. With burstiness, the in-packet corruptions are often consecutive and the requirement for error recovery is reduced as “recovering any k consecutive errors” instead of “recovering any random k errors”. This lowered requirement allows us to design far more efficient code than the existing FEC codes. Motivated by this implication, we exploit the corruption burstiness to design a simple yet effective error recovery code using XOR operations (called ZiXOR). ZiXOR uses XOR code and the delay is significantly reduced. More, ZiXOR uses RSSI-hinted approach to detect in packet corruptions without CRC, incurring almost no extra transmission overhead. The testbed evaluation results show that ZiXOR outperforms the state-of-the-art works in terms of the throughput (by 47 percent) and latency (by 22 percent).

The Design and Implementation of a Rekeying-Aware Encrypted Deduplication Storage System

Rekeying refers to an operation of replacing an existing key with a new key for encryption. It renews security protection to protect against key compromise and enable dynamic access control in cryptographic storage. However, it is non-trivial to realize efficient rekeying in encrypted deduplication storage systems, which use deterministic content-derived encryption keys to allow deduplication on ciphertexts. We design and implement a rekeying-aware encrypted deduplication (REED) storage system. REED builds on a deterministic version of all-or-nothing transform, such that it enables secure and lightweight rekeying, while preserving the deduplication capability. We propose two REED encryption schemes that trade between performance and security and extend REED for dynamic access control. We implement a REED prototype with various performance optimization techniques and demonstrate how we can exploit similarity to mitigate key generation overhead. Our trace-driven testbed evaluation shows that our REED prototype maintains high performance and storage efficiency.

폐도로 생태복원을 위한 시험시공지 평가 연구 - 경부선 영동군 황간지역 시험시공지에 대한 시공 후 7년 시점의 추적조사 -

폐도로 생태복원을 위한 시험시공지 평가 연구 - 경부선 영동군 황간지역 시험시공지에 대한 시공 후 7년 시점의 추적조사 -

Jamming Resilient Communication Using MIMO Interference Cancellation

Jamming attack is a serious threat to the wireless communications. Reactive jamming maximizes the attack efficiency by jamming only when the targets are communicating, which can be readily implemented using software-defined radios. In this paper, we explore the use of the multi-input multi-output (MIMO) technology to achieve jamming resilient orthogonal frequency-division multiplexing (OFDM) communication. In particular, MIMO interference cancellation treats jamming signals as noise and strategically cancels them out, while transmit precoding adjusts the signal directions to optimize the decoding performance. We first investigate the reactive jamming strategies and their impacts on the MIMO-OFDM receivers. We then present a MIMO-based anti-jamming scheme that exploits MIMO interference cancellation and transmit precoding technologies to turn a jammed non-connectivity scenario into an operational network. We implement our jamming resilient communication scheme using software-defined radios. Our testbed evaluation shows the destructive power of reactive jamming attack, and also validates the efficacy and efficiency of our defense mechanisms in the presence of numerous types of reactive jammers with different jamming signal powers.

On Location Estimation Technique Based of the Time of Flight in Low-power Wireless Systems

Abstract This study deals with the distance estimation issue in low-power wireless systems being usually used for sensor networking and interconnecting the Internet of Things. There is an effort to locate or track these sensor entities for different needs the radio signal time of flight principle from the theoretical and practical side of application research is evaluated. Since these sensor devices are mainly targeted for low power consumption appliances, there is always need for optimization of any aspects needed for regular sensor operation. For the distance estimation we benefit from IEEE 802.15.4a technology, which offers the precise ranging capabilities. There is no need for additional hardware to be used for the ranging task and all fundamental measurements are acquired within the 15.4a standard compliant hardware in the real environment. The proposed work examines the problems and the solutions for implementation of distance estimation algorithms for WSN devices. The main contribution of the article is seen in this real testbed evaluation of the ranging technology.

Code pruning in opportunistic routing through bidirectional coding traffic comparison

AbstractOpportunistic routing (OR) significantly improves transmission reliability and network throughput in wireless mesh networks by utilizing the broadcast nature of the wireless medium. Through the integration of network coding (NC), the complicated coordination to select the best forwarding node (FN) in OR can be bypassed. However, the introduction of NC exacerbates the redundant‐packet‐transmission problem. To mitigate this issue, existing coded OR protocols either adopt the loss‐rate‐based approach, employ orthogonal vectors as coded feedback, or pursue the stream‐based coded OR model. However, these three solutions suffer inaccuracy and obsolescence of the loss‐rate measurement, false‐positive/false‐negative problem, and unavailability of hop‐by‐hop stream‐based OR, respectively. To address the previous problems, we propose a simple but practical coded feedback scheme, cumulative coding coefficient acknowledgement (C3ACK), based on the relevance between forward (coded packets received from upstream nodes) and backward coding traffic (coded packets overheard from downstream nodes), and apply C3ACK to both batch‐based and stream‐based coded OR models in order to prune redundant forward and backward coding traffic. Both testbed evaluation and simulation study show that our code‐pruning schemes can outperform existing approaches in terms of expected throughput and transmission count. Copyright © 2014 John Wiley & Sons, Ltd.

MeTHODICAL: Towards the next generation of multihomed applications

We introduce MeTHODICAL, a multihoming-aware decision-making mechanism which enables applications to capitalize on multihoming availability. MeTHODICAL employs an algorithm that establishes the foundation for assigning weights to multiple criteria, and a path optimization algorithm that performs path selection restricted by multiple multihoming and traffic performance criteria, a well-known NP-hard problem. The feasibility of the MeTHODICAL weighting criteria algorithm is demonstrated in this paper for different classes of service as specified in ITU-Y.1541. The algorithm is shown to have a time complexity of Omcnv. The path optimization algorithm, with a time complexity of O(n·m), is evaluated for the 1:1 and 1+1 protection models and is compared with previous proposals in this area. Results from our testbed evaluation demonstrate that the MeTHODICAL path optimization algorithm does not suffer from ranking abnormalities, nor does it require high-volume data to be efficient. The results show that heuristics can enhance the performance of MeTHODICAL and eliminate handover side-effects.

EasiND: Neighbor Discovery in Duty-Cycled Asynchronous Multichannel Mobile WSNs

Neighbor discovery is one of the first steps to establish communication links between sensor nodes; thus it becomes a fundamental building block for wireless sensor networks (WSNs). Traditional neighbor discovery protocols mainly focus on static wireless networks or networks where all nodes operate on the same frequency. However, the proliferation of mobile devices and multichannel communications post new challenges to neighbor discovery problem. In this paper, we present a neighbor discovery protocol named EasiND for asynchronous duty-cycled multichannel mobile WSNs. First, we propose a neighbor discovery system based on quorum system, which can bound the discovery latency in multichannel scenarios with low power consumptions. Second, we design an optimal asynchronous neighbor discovery system for multichannel mobile WSNs based on cyclic difference set. It is optimal in the sense that it minimizes the power consumption with bounded discovery latency under desired duty cycles. Finally, we validate the performance of EasiND through both theoretical analysis and test-bed evaluations. EasiND provides a 33.3% reduction in power-latency product in theory compared to U-Connect. Meanwhile, test-bed evaluation results show that EasiND decreases average discovery latency by up to 86% compared to U-Connect and achieves at least 93.5% average fraction of discoveries in a predefined time limitation under various network conditions.