Search

The user datagram protocol is the most widely used protocol for streaming multimedia data over the Internet. Like other protocols at the network and transport layers, it uses the Internet Checksum (IC) to detect channel errors. The consequence of this is that each corrupted packet is dropped, which can degrade the quality of service perceived by a user. In this paper, the authors present a solution to this problem based on integer codes capable of correcting single and double adjacent errors. The presented codes are a generalization of the IC, which makes them easy to implement in software. [ABSTRACT FROM AUTHOR]

The need for fast communication has led to the introduction of 100 Gbps optics in local area networks (LANs). To avoid retransmission of corrupted packets, in some LANs, the CRC codes were replaced by Reed‐Solomon (RS) codes. Although this solution has met its primary goal, it has two drawbacks: first, the payload size was significantly reduced, and second, each network node had to be equipped with much more complex hardware, which increased the cost of the network. Starting from the fact that the vast majority of corrupted packets contain only single errors, in this paper, a simple strategy for error control in 100 Gbps optical LANs is presented. More precisely, instead of protecting the data with the CRC or RS codes, using integer codes is suggested that can correct single errors and detect two types of burst errors: l‐bit burst errors within one b‐bit byte and h‐bit burst errors within two b‐bit bytes (1 ≤ h < l < b). Unlike the CRC or RS codes, the proposed ones use integer and lookup table operations, which are supported by all processors. In addition, the proposed codes can be interleaved without delay and without using any additional hardware. This feature allows the decoder not only to process larger data sets in parallel, but also to detect all double burst errors. [ABSTRACT FROM AUTHOR]

The paper presents a novel efficient encoding and decoding method for self‐correction and anti‐interference used in big data product tracing system based on the cyclic code theory. The principle of constructing code set is first illustrated. Then the specific encoding and decoding methods suitable for the algebra rules are invented in sequence for efficiency. At last, to test the new coding system, the paper accelerates the decoding time by OpenMP more than 36 times. The error‐correcting code presents its perfect recovery property with a recovery rate of more than 95% under 60% damage rate. In analyzing its efficiency, the encoding process only costs 0.0045 second in average while the time of decoding method will increase with the damage rate's ascending, but it can be controlled within 16 seconds. In comparison to other coding patterns in the references, the newly error‐correcting and anti‐interference coding method achieves a balance in complexity, encoding rate, and decoding time with its priority in recovering rate under the damage rate of 60%. [ABSTRACT FROM AUTHOR]

Summary: Internet of Things (IoT) is connected to heterogeneous devices. Efficient adaptive scheduling with encoding and decoding of data is an unaddressed issue in IoT. This paper processes the data under three major hierarchy: namely, adaptability, scheduling of data, and network coding for that data. The reliable access to the information is ensured by a device which is a primary eminence in IoT. Device must be able to adapt itself according to the changes in the network and to maintain its reliability as well as transparency and seamless access to the resources. To enhance the performance of the data dissemination, the scheduling process is investigated using the spatial grouping in IoT devices; this is achieved by joint spatial and code domain scheduling scheme, and the novel preconfigured access scheme is coined in order to minimize the collision rate of arbitrary access; during the data dissemination, the erasure coding scheme is used for the encoding and decoding of packets which provides optimal redundancy. We carried the simulation using Contiki and it shows the proposed Polymorphic Erasure Coding with Markov decision Adaptability and Neural networks (PECMAN) improves in terms of cost, overhead, and delay when compared with Multi‐user Shared Access (EMUSA), Polynomial‐time Optimal Storage Allocation (OSA) scheme, and Event‐Aware Back pressure Scheduling Scheme (EABS). [ABSTRACT FROM AUTHOR]

Wireless body area networks (WBANs) have been developed as human body monitoring systems to predict, diagnose and treat diseases. The two important concerns for WBAN are sensor lifetime and latency. Because the signal transmission in WBAN takes place in or around the human body, the fading and collision of the channel due to other existing wireless devices affect the packet error rate significantly. Hence, the lifetime and latency of the sensor are crucial. To mitigate these problems, a cognitive radio (CR) based WBAN can be a promising solution. In this paper, a cognitive forward error control mechanism for CR-based WBAN has been presented. Several issues in CR-based networks have been addressed so far to cope with energy and latency issues. However, the error control mechanism has not been investigated for CR networks. Furthermore, existing studies of the error control mechanism for wireless sensor networks cannot be applied to the CR network because of the opportunistic spectrum access mechanism (i.e. the intermittent availability of spectrum resources). The method presented in this paper adaptively selects the number of hops to the sink and adjusts the redundancy to minimize the expected latency and energy consumption. The mathematical analysis and numerical comparison show that the proposed method achieves better performance in terms of latency and energy efficiency in the multihop CR sensor network. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Generalized balanced tournament packings (GBTPs) extend the concept of generalized balanced tournament designs introduced by Lamken and Vanstone (1989). In this paper, we establish the connection between GBTPs and a class of codes called equitable symbol weight codes (ESWCs). The latter were recently demonstrated to optimize the performance against narrowband noise in a general coded modulation scheme for power line communications. By constructing classes of GBTPs, we establish infinite families of optimal ESWCs with code lengths greater than alphabet size and whose narrowband noise error-correcting capability to code length ratios do not diminish to zero as the length grows. [ABSTRACT FROM AUTHOR]

Summary: Cloud storage is gaining popularity as it relieves the data owners from the burden of data storage and maintenance cost. However, outsourcing data to third‐party cloud servers raise several concerns such as data availability, confidentiality, and integrity. Recently, regenerating codes have gained popularity because of their low repair bandwidth while ensuring data availability. In this paper, we propose a secure regenerating code‐based cloud storage (SRCCS) scheme, which utilizes the verifiable computation property of homomorphic encryption scheme to check the integrity of outsourced data. In this work, an error‐correcting code (ECC)–based homomorphic encryption scheme (HES) is employed to simultaneously provide data privacy as well as error correction while supporting efficient integrity verification. In SRCCS, server regeneration process is initiated on detection of data corruption events in order to ensure data availability. The ECC‐based HES significantly reduces the probability of server regeneration and minimizes the repair cost. Extensive theoretical analysis and simulation results validate the security, efficiency, and practicability of the proposed scheme. [ABSTRACT FROM AUTHOR]