A graph theoretical approach for network coding in wireless body area networks

Byrne, Eimear; Manada, Akiko; Marinkovic, Stevan; Popovici, Emanuel

doi:10.1109/isit.2011.6034156

Cited by 5 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We provide a necessary and sufficient condition on the graph representation of a coding scheme for full packet retrieval at the terminal T extending [1,Theorem III.1]. For the remainder of this paper, when a case with n packets and redundancy r is given, we let C = {f 1 , f 2 , .…”

Section: Decodable Graphsmentioning

confidence: 99%

See 1 more Smart Citation

A Graph Theoretical Analysis of Low-Power Coding Schemes for One-Hop Networks

Byrne,

Manada

2016

Preprint

Self Cite

View full text Add to dashboard Cite

Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In this paper, coding schemes arising from incidence matrices of graphs are proposed. An analysis of the resilience of such codes to erasures is given using graph theoretical arguments; decodability of a graph is characterized in terms of the rank of its incidence matrix. Bounds are given on the number of decodable subgraphs of a graph and the number of edges that must be deleted in order to arrive at an undecodable subgraph. Algorithms to construct codes that are optimal with respect to these bounds are presented.

show abstract

Section: Decodable Graphsmentioning

confidence: 99%

“…when only the summation of two packets is allowed. The analysis for the case that packets are vectors over GF (2) has been considered in [1], [8]. These schemes have the practical advantage of very low complexity encoding and decoding [9].…”

mentioning

confidence: 99%

A Graph Theoretical Analysis of Low-Power Coding Schemes for One-Hop Networks

Byrne,

Manada

2016

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Thus, in the second category, instead of developing reliable routing, the authors switch their interests to information coding. For examples, E. Byrne, et al [7] designed a coding scheme which can increase the probability of successful decoding based on graph theory. Y. Hamada, et al [8] proposed a scheme to reduce packet error rate by using Luby Transform (LT) codes [9].…”

Section: Introductionmentioning

confidence: 99%

A Packet-Interleaving Scheme Using RS Code for Burst Errors in Wireless Sensor Networks

Sheu

Kuo

Chou

2015

WSN

View full text Add to dashboard Cite

In this paper, we propose a packet-interleaving scheme (PIS) for increasing packet reliability under burst errors in wireless sensor networks (WSN). In a WSN, packet errors could occur due to weak signal strength or interference. These erroneous packets have to be retransmitted, which will increase network load substantially. The proposed PIS, encoding data using Reed-Solomon (RS) codes, can classify data into two different types: high-reliability-required (HRR) data and non-HRR data. An HRR packet is encoded with a short RS symbol, while a non-HRR packet with a long RS symbol. When an HRR and a non-HRR packet arrive at a sensor, they are interleaved on a symbol-by-symbol basis. Thus, the effect of burst errors (BE) is dispersed and consequently the uncorrectable HRR packets can be reduced. For the purpose of evaluation, two models, the uniform bit-error model (UBEM) and the on-off bit-error model (OBEM), are built to analyze the packet uncorrectable probability. In the evaluation, we first change the lengths of BE, then we vary the shift positions in a BE period, and finally we increase the number of correctable symbols to observe the superiority of the proposed PIS in reducing packet uncorrectable probability.

show abstract

“…More specifically, [11] presents algorithms with the approximation ratios of Ω( √ n · log n · log log n) and Ω(log n · log log n), for the scalar and vector linear solutions for the CIC problem, respectively. In [12] authors presented a sparse network coding scheme for robust communication in wireless body area networks. In the proposed scheme, each transmitted packet is a combination of at most two original packets.…”

Section: Introductionmentioning

confidence: 99%

“…In the proposed scheme, each transmitted packet is a combination of at most two original packets. However, [12] assumes a different setting and the proposed techniques are not applicable to the Index Coding problem.…”

Section: Introductionmentioning

confidence: 99%

Finding Sparse Solutions for the Index Coding Problem

Chaudhry

Asad

Sprintson

et al. 2011

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

View full text Add to dashboard Cite

The Index Coding problem has recently attracted a significant attention from the research community. In this problem, a server needs to deliver data to a set of wireless clients over the broadcast channel. Each client requires one or more packets, but it might have access to the packets requested by other clients as side information. The goal is to deliver the required data to each client with minimum number of transmissions.In this paper, we focus on finding sparse solutions to the Index Coding problem. In a sparse solution each transmitted packet is a linear combination of at most two original packets. We focus both on scalar and vector versions of the problem. For the scalar case, we present a polynomial time algorithm that achieves an approximation ratio of 2 − 1 √ n . For the vector case, we present a polynomial time algorithm that identifies an optimal solution to the problem. Our simulation studies demonstrate that our algorithms achieve good performance in practical scenarios.

show abstract

A graph theoretical approach for network coding in wireless body area networks

Cited by 5 publications

References 6 publications

A Graph Theoretical Analysis of Low-Power Coding Schemes for One-Hop Networks

A Graph Theoretical Analysis of Low-Power Coding Schemes for One-Hop Networks

A Packet-Interleaving Scheme Using RS Code for Burst Errors in Wireless Sensor Networks

Finding Sparse Solutions for the Index Coding Problem

Contact Info

Product

Resources

About