Header Compression Research Articles

On the Capacity of Smart Grid Wireless Backhaul With Delay Guarantee and Packet Concatenation

In future smart grids, low channel efficiency due to small data payloads and the delay guarantee of many near-real-time applications would become two important issues. In this paper, we propose to employ a deadline-ordered scheduler with packet concatenation and apply admission control (AC) to resolve these two issues. In order to execute the AC mechanism, the delay bounds in the home area network and the neighborhood area network and the affine arrival curves for modeling the flows injecting into the concentrator are derived using network calculus. The performance of this novel design is illustrated via analytical and simulation results. In addition, the robust header compression protocol is adopted as a benchmark to evaluate the performance with the packet concatenation method. It is shown that the proposed scheduler with packet concatenation significantly improves the capacity of the smart grid wireless backhaul, and our AC mechanism provides a reliable estimate of the capacity.

Lightweighted and energy-aware MIKEY-Ticket for e-health applications in the context of internet of things

To secure e-health communications, key management protocols play a vital role in the security process. Nevertheless, current e-health systems are unable to run existing standardised key management protocols due to their limited energy power and computational capabilities. In this paper, we introduce two solutions to tailor MIKEY-Ticket protocol to a such constrained environment. Firstly, we propose a new header compression scheme to reduce the size of MIKEY's header from 12 Bytes to 3 Bytes in the best compression case. Secondly, we present a new exchange mode to reduce the number of exchanged messages from 6 to 4. We use a formal validation tool to evaluate and validate the security properties of our tailored MIKEY-Ticket protocol. In addition, we evaluate both communication and computational costs to demonstrate the energy gain. The results show a decrease in MIKEY-Ticket overhead and a considerable energy gain without compromising its security properties.

On Efficient Packet-Switched Wireless Networking: A Markovian Approach to Trans-Layer Design and Optimization of ROHC

In packet-switched radio links, the little known Robust Header Compression (ROHC) has become an integral part of many wireless and particularly cellular communication networks. To strengthen existing schemes, this paper aims to improve ROHC performance in terms of payload efficiency for U-mode compression under poor wireless channel conditions. We first consider the parameter optimization of current ROHC systems, for which we propose a Markov compressor model suitable for realistic unidirectional (U-mode) ROHC. We present both the steady-state analysis and the transient behavior analysis of the ROHC. More generally, we propose a novel trans-layer ROHC design concept by exploiting lower cellular network layer status information to adaptively control header compression without dedicated feedbacks. Considering practical delay and inaccuracy when acquiring lower layer information, we develop a ROHC control framework in terms of a partially observable Markov decision process. Our results demonstrate the strength of our Markov ROHC compressor model in characterizing both stationary and transient behaviors, and the significant advantage of the proposed trans-layer ROHC design approach.

Diet-ESP: IP layer security for IoT

The number of devices connected through the Internet of Things (IoT) will significantly grow in the next few years while security of their interconnections is going to be a major challenge. For many devices in IoT scenarios, the necessary resources to send and receive bytes are extremely high and w hen such devices are powered with battery the amount of exchanged bytes directly impacts their life time. As a result, compression of existing protocols is a widely accepted technique to make IoT benefit from the protocols developed over the last decades. This paper presents ESP Header Compression (EHC), a framework that enables compression of packets protected with Encapsulating Security Payload (ESP). EHC is composed of EHC Rules, targeting the compression of a specific field and organized according to EHC Strategies. Further, the paper presents Diet-ESP, an EHC Strategy that highly reduces the networking overhead of ESP packets to address the IoT security and bandwidth requirements. Diet-ESP results in sending fewer bytes which in turn reduces the number of required radio frames and thus battery consumption. The measurements showed that sending 10 byte application data on IEEE 802.15.4 radio networks secured with the standard ESP requires sending an additional frame. This results into a 95% energy overhead compared to the unprotected data, while Diet-ESP results only in a 3% overhead compared to unprotected data. This small overhead is achievable with some compressions being performed within the ESP stack which requires altering the same. Nevertheless, Diet-ESP remains fully security compliant to ESP and performs better than any other compression framework as far as ESP is considered.

Development of an Improved Intrusion Detection based Secured Robust Header Compression Technique

Development of an Improved Intrusion Detection based Secured Robust Header Compression Technique

Performance evaluation and implementation of IP and robust header compression schemes for TCP and UDP traffic in static and dynamic wireless contexts

Modern cellular networks utilising the long?term evolution (LTE) set of standards face an ever?increasing demand for mobile data from connected devices. Header compression is commonly employed to minimise the overhead for IP?based cellular network traffic. In this paper, we evaluate the three header compression implementations used by these networks with respect to their potential throughput increase and complexity for different mobile service scenarios over wireless IP networks. Specifically, we consider header compression as defined by (i) IP Header Compression (RFC 2507), (ii) Robust Header Compression version 1 (RFC 3095), and (iii) the recently updated Robust Header Compression version 2 (RFC 5225) with TCP/IP profile (RFC 6846). The contribution of this article is the performance evaluation of IP Header Compression (IPHC) for UDP and TCP, as well as its evaluation in contrast to the Robust Header Compression (RoHC) methods in a comparative overview for real?world mobile scenarios. Our results show that all implementations have great potential for saving bandwidth in IP?based wireless networks, even under varying channel conditions. While both RoHC versions generally provide more reliable results than IPHC, we find that on a unidirectional channel IPHC could perform better. However, if a TCP connection is prone to packet reordering (e.g., by retransmissions), IPHC?s performance drops drastically, while RoHC?s does not exhibit any significant performance reduction.

Prediction of RoHCv1 and RoHCv2 Compressor Utilities for VoIP

Modern cellular networks utilising the long{term evolution (LTE) and the coming 5G set of standards face an ever{increasing demand for low{latency mobile data from connected devices. Header compression is employed to min- imise the overhead for IP{based cellular network trac, thereby decreasing the overall bandwidth usage and, subsequently, transmission delays. Here, we employ machine learning approaches for the prediction of Robust Header Compression version 1's and version 2's compression utility for VoIP transmis- sions, which allows the compression to dynamically adapt to varying channel conditions. We evaluate various regression models employing r2 and mean square error scores next to complexity (number of coecients) based on an RTP specic training data set and separately captured live VoIP audio calls. We nd that the proposed weighted Ridge regression model explains about at least 50 % of the observed results and the accuracy score may be as high as 94 % for some of the VoIP transmissions.

6lo-RFID: A Framework for Full Integration of Smart UHF RFID Tags into the Internet of Things

Recent technological advancements have transformed UHF passive RFID tags into �smart� transponders enhanced with computational and sensing capabilities, thus legitimated to become fully-fledged components of the IoT. Nonetheless, RFID technology has not been addressed yet by the IETF 6lo working group among the various link layer technologies for running IPv6 over networks of resource-constrained nodes in the IoT. Research works in the scientific literature only consider proxy-based solutions for RFID inclusion in the IoT and do not suggest any ultimate approach to enable interoperability at the network and application layers. This article fills the gap by designing and testing a unified IPv6-based framework to access and manipulate RFID tags� resources by means of the standard CoAP. To this purpose, an adaptation layer, named 6lo-RFID, is specifically designed to run IPv6 over the RFID link technology. Key design aspects are addressed, such as the 6lo-RFID frame format and exchange, IPv6 header compression, fragmentation, network addressing and communication on the air interface. The designed solution is also compliant with the EPCglobal Class-1 Generation-2 standard for RFID. In addition, we manufactured a smart UHF RFID tag platform to demonstrate the full-IPv6 protocol stack and assess its performance for bidirectional real-time communications over the RFID radio interface.

A case for preamble compression in multi-clock-rate sampling devices for energy efficient idle listening

The state of the art in wireless communication is highly spectrum efficient but performs poorly in terms of energy efficiency. With widespread deployment, battery operated devices, escalating energy cost, and inherent energy inefficiency of the Carrier Sense Multiple Access protocol in wireless, it is of prime importance today to look for improved energy efficiency in wireless communication. One promising solution is to use multi clock-rate sampling devices in conjunction with frequency agnostic preamble detection. This reduces the power consumed by wireless devices in idle listening, without significantly affecting the throughput and spectrum efficiency. In this paper, we model such a device as a Markov chain and determine its performance in terms of power consumption and goodput, and discuss the elemental trade-off between the two. The analytical results are verified using extensive simulation and compared with existing techniques. A preamble construction scheme that allows devices with different downclocking levels to coexist in the same network is also explored. Finally, we propose a novel preamble compression scheme based on Robust Header Compression to provide improved performance and scalability.

Design and Realization of a Novel Header Compression Scheme for Ad Hoc Networks

IP header compression schemes offer a valuable measure for bandwidth preservation. Such schemes have been practically implemented in infrastructure-based IP networks for point-to-point links. However, minimal research and practical implementation efforts have been conducted in the direction of an IP header compression strategy that can meet the peculiar requirements of multi-hop ad hoc wireless networks. In this paper, we present a practically implemented multi-hop IP header compression scheme using the Robust Header Compression (ROHC) protocol suite. The scheme runs on a novel identifier (ID) based networking architecture, known as an ID-based ad hoc network (IDHOCNET). IDHOCNET additionally solves a number of bottlenecks of pure IP-based ad hoc networks that have emerged owing to IP address auto-configuration service, distributed naming and name resolution, and the role of an IP address as an identifier at the application layer. The proposed scheme was tested on a multi-hop test bed. The results show that the implemented scheme has better gain and requires only O (1) ROHC contexts.

Experience report: developing high performance HTTP/2 server in Haskell

While the speed of the Internet has been increasing, HTTP/1.1 has been plagued by head-of-line blocking, low concurrency and redundant headers. To solve these problems, HTTP/2 was standardized. This paper summarizes our experience implementing HTTP/2 in Haskell. We found several techniques to improve the performance of the header compression and identified a suitable data structure for HTTP/2 priority. Also, we showed that Haskell lightweight threads are useful for HTTP/2 where the common tactics of one lightweight thread per connection cannot be used. The HTTP/2 implementation of Warp, the popular HTTP server library in Haskell, ultimately provides better throughput than its HTTP/1.1 counterpart.

IPv6 Low Power Wireless Personal Area Network (6LoWPAN) for Networking Internet of Things (IoT) – Analyzing its Suitability for IoT

Background/Objectives: Internet of Things (IoT) is going to govern the future world where all devices will be connected with each-other. The expectation with the Internet of Things is that the increase in number of devices going to be truly dramatic. Method: With the increase in the number of devices, the amount of traffic will grow together with data. IoT will have huge number of power sensitive smaller devices and they're going to put significant constraint on the total bandwidth of the system. This paper analyses how 6LoWPAN, a practical developed for resource constrained IP based systems suitable for Internet of Things with respect to Internet Protocol. Findings/Applications: Internet protocols used to be fine-tuned, modified, changed to be able to accommodate the era of Internet of Things. 6LoWPAN has different features like, support for 64 bit or 16-bit addressing, targeted at low power networks including Bluetooth low energy, header compression for IPv base as well as for UDP headers, network auto configuration and neighbor discovery, support for multicast, unicast, and broadcast, supporting the concept of fragmentation. This makes 6LoWPAN a best suited protocol for IoT.

Performance Evaluation of Network Header Compression Schemes for UDP, RTP and TCP

Modern cellular networks utilising the Long–Term Evolution (LTE) set of standards face an ever–increasing demand for mobile data from connected devices. Header compression is employed to minimise the overhead for IP–based cellular network traffic. In this paper, we evaluate the three header compression implementations used by such networks with respect to their potential throughput increase and complexity for different mobile service scenarios. We compare RTP, UDP and TCP profile compressions regarding their compression gain and complexity. Specifically, we consider header compression as defined by (i) IP Header Compression (RFC 2507), (ii) Robust Header Compression version 1 (RFC 3095), and (iii) the recently updated Robust Header Compression version 2 (RFC 5225) with TCP/IP profile (RFC 6846). This paper presents the performance evaluation of these header compression schemes for UDP, RTP and TCP, for both IPv4 and IPv6 streams in error–free and error–prone scenarios. A comparison between the Robust Header Compression methods and IP Header Compression is also provided. Our results show that all implementations have great potential for saving bandwidth in IP–based wireless networks, even under varying channel conditions. We also present for the first time an analysis of certain RTP header fields which, depending on the transmission characteristics, could have high impact on the overall compression gain.

Design and implementation of a 6LoWPAN gateway for wireless sensor networks integration with the internet of things

The next big change in the internet paradigm is called the internet of things, in which even the simplest device is connected to the internet. Wireless technologies are important assets in the diffusion of this concept, as they allow the easy and seamless connection of all devices. Wireless sensor networks (WSNs) are being established for sensing and actuating critical applications, like industrial automation, domotics and remote patient monitoring. The 6LoWPAN protocol has been proposed as the key to integrate WSNs and internet procotols. It is based in the IEEE 802.15.4 standard, which is widely used in low power wireless networks. This paper evaluates the mechanisms of header compression and fragmentation of IPv6 datagrams proposed in the 6LoWPAN standard through experiments using a gateway prototype and IEEE 802.15.4 nodes.

Design and implementation of a 6LoWPAN gateway for wireless sensor networks integration with the internet of things

The next big change in the internet paradigm is called the internet of things, in which even the simplest device is connected to the internet. Wireless technologies are important assets in the diffusion of this concept, as they allow the easy and seamless connection of all devices. Wireless sensor networks (WSNs) are being established for sensing and actuating critical applications, like industrial automation, domotics and remote patient monitoring. The 6LoWPAN protocol has been proposed as the key to integrate WSNs and internet procotols. It is based in the IEEE 802.15.4 standard, which is widely used in low power wireless networks. This paper evaluates the mechanisms of header compression and fragmentation of IPv6 datagrams proposed in the 6LoWPAN standard through experiments using a gateway prototype and IEEE 802.15.4 nodes.

On the effectiveness of an optimization method for the traffic of TCP-based multiplayer online games

This paper studies the feasibility of using an optimization method, based on multiplexing and header compression, for the traffic of Massively Multiplayer Online Role Playing Games (MMORPGs) using TCP at the Transport Layer. Different scenarios where a number of flows share a common network path are identified. The adaptation of the multiplexing method is explained, and a formula of the savings is devised. The header compression ratio is obtained using real traces of a popular game and a statistical model of its traffic is used to obtain the bandwidth saving as a function of the number of players and the multiplexing period. The obtained savings can be up to 60 % for IPv4 and 70 % for IPv6. A Mean Opinion Score model from the literature is employed to calculate the limits of the multiplexing period that can be used without harming the user experience. The interactions between multiplexed and non-multiplexed flows, sharing a bottleneck with different kinds of background traffic, are studied through simulations. As a result of the tests, some limits for the multiplexing period are recommended: the unfairness between players can be low if the value of the multiplexing period is kept under 10 or 20 ms. TCP background flows using SACK (Selective Acknowledgment) and Reno yield better results, in terms of fairness, than Tahoe and New Reno. When UDP is used for background traffic, high values of the multiplexing period may stress the unfairness between flows if network congestion is severe.

Addressing the Bandwidth issue in End-to-End Header Compression over IPv6 tunneling Mechanism

One day IPv6 is going to be the default protocol used over the internet. But till then we are going to have the networks which IPv4, IPv6 or both networks. There are a number of migration technologies which support this transition like dual stack, tunneling & header translation. In this paper we are improving the efficiency of IPv6 tunneling mechanism, by compressing the IPv6 header of the tunneled packet as IPv6 header is of largest length of 40 bytes. Here the tunnel is a multi hop wireless tunnel and results are analyzed on the basis of varying bandwidth of wireless network. Here different network performance parameters like throughput, End-to-End delay, Jitter, and Packet delivery ratio are taken into account and the results are compared with uncompressed network. We have used Qualnet 5.1 Simulator and the simulation results shows that using header compression over multi hop IPv6 tunnel results in better network performance and bandwidth savings than uncompressed network.

On the Need of Source Address for Route-Error Delivery in 6LoWPAN

Low-power Wireless Personal Area Networks (LoWPANs) comprise devices that conform to the IEEE standard 802.15.4. These networks need to be connected with other wireless and wired networks in order to maximize the utilization of information and other resources which are mainly associated with the Internet Protocol (IP)-based networks. The transmission of IPv6 over Low Power Wireless Personal Area Networks (6LoWPANs), requires a fragmentation and reassembly layer that also carries out header compression for transmission efficiency. The existing proposed header format includes the originator’s address in adaptation layer, to ensure along with other issues, that in case of a link failure, route error messages are delivered back to the originator. We propose the Unicast Back-Propagation Mechanism (UBP) that delivers the Route Error Message (RERR) to the source even without having the originator’s address in 6LoWPAN adaptation layer packet format. We make use of MAC layer address for sending the RERR to the previous hop node, back tracking the route hop by hop, eventually to the source. The simulation results show that our solution provides considerable header compression yet shows better diagnostic performance as the RERR delivery mechanism in standard ad-hoc routing.

NETWORK OPTIMIZATION OF IPV6 NETWORKS USING TUNNEL HEADER COMPRESSION

IPv6 is the successor internet protocol which will eventually replace IPv4. These two protocols are not compatible with each other and it will take time to migrate towards IPv6, until then both the protocols need to coexist for a long time. The main overhead involved with both the protocols is header length of 20 bytes in case of IPv4 and of 40 bytes in case of IPv6. This overhead will affect the network performance specially over tunneling mechanism where one header is encapsulated inside another. Tunneling is widely deployed over the network for various purposes like network security, mobility and transition mechanism. Header compression can be applied to compress the excess protocol headers to improve the performance of network. In this paper we want to use header compression in context of 6 to 4 tunneling transition. Using header compression over 6 to 4 tunnels would result in better response times reduced packet size and reduced packet losses. We want to simulate this algorithm using EXata Cyber 1.1 simulator.

Bundle Protocol Header Compression

Delay Tolerant Networks (DTNs), especially the Bundle Protocol (BP), transmit data in self-contained bundles each of which carrying all necessary information to process it and route it to its destination. While this allows for long delays, link disruptions and higher loss rates and makes the BP well-suited for networks such as Wireless Sensor Networks (WSNs), it imposes a significant overhead in terms of the header sizes, as e. g. node addresses are denoted as full URIs, called Endpoint Identifiers (EIDs). While the Compressed Bundle Header Encoding introduces a special naming scheme to eradicate these URIs which reduces the header size to some extent, in this paper we present a novel, full-fledged header compression for the BP that can be applied stateless or stateful, i. e. without or with storing part of the bundle headers on forwarding nodes. The gains achievable with this approach are extensively evaluated with the simulation of bundles carefully generated from real-world network traffic on the one hand, and of realistically moving public transport vehicles with a traffic pattern often found in such Delay Tolerant Wireless Sensor Networks (DTWSNs) on the other hand.