Linear network coding

Lecture Notes in Computer Science, 2014

Volunteer systems pose difficult challenges for data storage. Because of the extremely low reliability of volunteer nodes, these systems require so high redundancy that replication is infeasible. Erasure coding has been proposed to cope with this problem as it needs much less redundancy to achieve the same reliability. Its downside is that the reparation of the system creates high overhead, as fully decoding the original data is required to generate new coded data. Random linear coding has been proposed to be used as a data storage method, as it provides a better redundancy/reliability ratio, and less control overhead. We propose that it also helps in the reparation of the system, as decoding is not required; instead, coded data can be generated from already existing coded data. However, it may be possible that this iterative reparation leads to degradation of data over time; even more so, if sparse coding is used to increase compute efficiency. This paper examines the effects of random linear coding and the iterative reparation of the system. It shows the reliability that can be achieved with random linear coding in a highly volatile distributed system. We conclude that random linear coding can achieve high reliability even in highly volatile systems.

Science China Information Sciences, 2011

This paper discusses the question whether a network-matroid construction can be modified so that all matroid dependencies are reflected in the network. We propose a novel construction method for a matroidal network to address this issue. Furthermore, we investigate some properties of the matroidal network based on our construction method. New relations between the matroidal network and its associated matroid are developed through various examples.

Lecture Notes in Computer Science, 2009

This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More precisely, it is proved that perfect quantum network coding using free classical communication is possible over a network with k source-target pairs if there exists a classical linear (or even vector-linear) coding scheme over a finite ring. Our proof is constructive in that we give explicit quantum coding operations for each network node. This paper also gives an upper bound on the number of classical communication required in terms of k, the maximal fan-in of any network node, and the size of the network.

Lecture Notes in Computer Science, 2009

Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, network coding requires intermediate nodes to modify data packets en route; for this reason, standard signature schemes are inapplicable and it is a challenge to provide resilience to tampering by malicious nodes.

EURASIP Journal on Wireless Communications and Networking, 2010

This paper proposes a superimposed training strategy to estimate the individual frequency and channel parameters in an amplify-and-forward (AF) two-way relay network (TWRN). Two efficient suboptimal estimation algorithms and an iterative process to further improve the performance are proposed. The estimation Cramér-Rao Bound (CRB) on the proposed estimation strategy is also derived. The simulations confirm that the iterative estimation process converges rapidly and that the resultant estimation mean square error (MSE) approaches the CRB, especially for the case when the carrier frequency offset between the two source terminals is small.

Journal of Combinatorial Optimization, 2013

Network coding is a technique which can be used to improve the performance of multicast communications by performing encoding operations at intermediate nodes. In real-time multimedia communication applications, there are usually several weights associated with links, such as cost, delay, jitter, loss ratio, security, and so on. In this paper, we consider the problem of finding an optimal multicast sub-graph over coded packet networks, where the longest end-to-end weight from the source to each destination does not exceed an upper bound. First, a mixed integer programming model is proposed to formulate the problem which is NP-hard. Then, a column-generation approach is described for this problem, in which the problem is decomposed into a master linear programming problem and several integer programming sub-problems. Moreover, two methods based on linear and Lagrangian relaxation are proposed to compute a tight lower bound of the optimal solution value. Computational results show that the proposed algorithm provides an efficient way for solving the problem, even for relatively large networks.

2014 IEEE Global Communications Conference, 2014

The popularity of cloud applications surged in the last years. Billions of mobile devices remain always connected. Location services, online games, social networking and navigation are a just few examples of "always on" cloud applications in which the same or partially overlapping content is delivered to multiple users. In this paper, we propose a technique, called NC-CELL, which uses network coding to foster content distribution in mobile cellular networks. Specifically, NC-CELL implements a software module at mobile base stations (or eNodeBs) which scans in transit traffic and looks for opportunities to code packets destined to different mobile users together. The proposed approach can significantly improve cell throughput and is particularly relevant for delay tolerant content distribution.

Wireless Personal Communications, 2013

In recent times, there have been many advances in the field of information theory and wireless sensor network (WSN) technologies. Network coding is a new paradigm in data transport and promises to change many aspects of WSN. This paper proposes a network coding multipath routing algorithm in WSN (NC-WSN). It is typically proposed in order to increase the reliability of data transmission or to provide load balancing. We evaluate and compare our technique with several existing approaches by a set of simulations, using different scenarios and topologies. The simulations results suggest that the multipath diversity achieved with our proposition can significantly improve the network response time.

New Directions in Wireless Communications Research, 2009

Network coding, introduced by Ahlswede et al. in their pioneering work [1], has generated considerable research interest in recent years, and numerous subsequent papers, e.g., , have built upon this concept. One of the main advantages of network coding over traditional routed networks is in the area of multicast, where common information is transmitted from a source node to a set of terminal nodes. Ahlswede et al. showed in [1] that network coding can achieve the maximum multicast rate, which is not achievable by routing alone. When coding is used to perform multicast, the problem of establishing minimum cost multicast connection is equivalent to two effectively decoupled problems: one of determining the subgraph to code over and the other of determining the code to use over that subgraph. The latter problem has been studied extensively in , and a variety of methods have been proposed, which include employing simple random linear coding at every node. Such random linear coding schemes are completely decentralized, requiring no coordination between nodes, and can operate under dynamic conditions . These papers, however, all assume the availability of dedicated network resources.

Lecture Notes in Electrical Engineering, 2009

In this paper we would like to examine the potentiality of information technology systems. The modern business environment is characterized by dynamic products and services. A business environment is either expanding or contracting. Those changes have a relative flyer pace. In this paper we introduce the relationship within an IT system between the enabling communication technology on which it rests and the information needed by an organization. We first examine the cyclical nature of information and communication to describe the similarity between them. In the next part we examine the issues raised by the characteristics of information and how they affect, interact with, and relate to the communication system's configuration. Various examples illustrate all the issues in a practical way. Possible strategies for the management of this relationship are described in the second part of the paper, with examples. Finally, we conclude by summarizing some considerations and thoughts.

EURASIP Journal on Wireless Communications and Networking

The 1000-fold capacity increase envisioned by dense 5G networks results also in a tremendous increase in the energy consumption of the whole network. Utilizing relays in combination with physical-layer network coding (PNC) has been proposed as an energy-efficient solution to this problem by creating several short-distance low-power transmissions and by reducing the transmission time. However, deploying relay nodes can be very costly for dense networks. On the other hand, the proximity of transmitting nodes in dense networks allows the transmitting nodes to serve as relays and retransmit the signals overheard from other transmitting nodes using PNC. This approach has been shown to increase the spectral efficiency, but the impact on energy efficiency has not been studied yet. Therefore, in this paper, we analyze two approaches that exploit the overhearing capabilities of the transmitting nodes in terms of spectral efficiency, energy efficiency, and success rate. We then provide a low-complexity power control strategy that achieves a performance close to the optimal for each approach. We show that when at least one indirect link is stronger than the direct links, exploiting the overhearing capabilities of the transmitting nodes provides the highest performance in both the transmit power-dominated and circuit power-dominated regimes.

EURASIP Journal on Wireless Communications and Networking, 2017

In traditional store and forward protocols, lost packets have no impact on the delivery of other transmitted packets. With network coding, the impact of a packet loss may affect the decoding of other transmitted packets thus affecting the entire process of communication between nodes. In this work, we propose a new network coding model that allows generating, coding, decoding and transmission activities on the packets. Based on this model, the impact of lost packets on buffering and the complexity at the receiving nodes is studied and two new mechanisms are proposed to allow the recovery of lost packets. Compared to traditional linear network coding protocol, our mechanisms provide a significant performance amelioration in terms of number of transmissions required to recover from packet loss.

Future Internet, 2020

Network tomography has emerged as one of the lean approaches for efficient network monitoring, especially aiming at addressing the ever-increasing requirements for scaling and efficiency in modern network architectures and infrastructures. In this paper, we explore network coding and compressed sensing as enabling technologies in the context of network tomography. Both approaches capitalize on algebraic tools for achieving accuracy while allowing scaling of operation as the size of the monitored network increases. Initially, a brief overview of the tomographic problems and the related classification of methods is provided to better comprehend the problems encountered and solutions provided to date. Subsequently, we present representative approaches that employ either one of the aforementioned technologies and we comparatively describe their fundamental operation. Eventually, we provide a qualitative comparison of features and approaches that can be used for further research and technology development for network monitoring in future Internet infrastructures.

Sensors, 2014

Wireless Visual Sensor Networks (WVSNs) where camera-equipped sensor nodes can capture, process and transmit image/video information have become an important new research area. As compared to the traditional wireless sensor networks (WSNs) that can only transmit scalar information (e.g., temperature), the visual data in WVSNs enable much wider applications, such as visual security surveillance and visual wildlife monitoring. However, as compared to the scalar data in WSNs, visual data is much bigger and more complicated so intelligent schemes are required to capture/process/ transmit visual data in limited resources (hardware capability and bandwidth) WVSNs. WVSNs introduce new multidisciplinary research opportunities of topics that include visual sensor hardware, image and multimedia capture and processing, wireless communication and networking. In this paper, we survey existing research efforts on the visual sensor hardware, visual sensor coverage/deployment, and visual data capture/ processing/transmission issues in WVSNs. We conclude that WVSN research is still in an early age and there are still many open issues that have not been fully addressed. More new novel multidisciplinary , cross-layered, distributed and collaborative solutions should be devised to tackle these challenging issues in WVSNs.

IEEE Information Theory Workshop 2010 (ITW 2010), 2010

Linear operator channels (LOCs) are motivated by the communications through networks employing random linear network coding (RLNC). Following the recent information theoretic results about LOCs, we propose two coding schemes for LOCs and evaluate their performance. These schemes can be used in networks employing RLNC without constraints on the network size and the field size. Our first scheme makes use of rank-metric codes and generalizes the rank-metric approach of subspace coding proposed by Silva et al.. Our second scheme applies linear coding. The second scheme can achieve higher rate than the first scheme, while the first scheme can make use of existing encoding/decoding algorithms of rank-metric codes. Our coding schemes require only the expectation of the rank of the transformation matrix. The second scheme can also be realized ratelessly without any priori knowledge of channel statistics.

Journal of the Chinese Institute of Engineers, 2012

The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content. This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden.

Entropy

The Drop when seen (DWS) technique, an online network coding strategy is capable of making a broadcast transmission over erasure channels more robust. This throughput optimal strategy reduces the expected sender queue length. One major issue with the DWS technique is the high computational complexity. In this paper, we present a randomized version of the DWS technique (rDWS), where the unique strength of the DWS, which is the sender’s ability to drop a packet even before its decoding at receivers, is not compromised. Computational complexity of the algorithms is reduced with rDWS, but the encoding is not throughput optimal here. So, we perform a throughput efficiency analysis of it. Exact probabilistic analysis of innovativeness of a coefficient is found to be difficult. Hence, we carry out two individual analyses, maximum entropy analysis, average understanding analysis, and obtain a lower bound on the innovativeness probability of a coefficient. Based on these findings, innovative...

EURASIP Journal on Wireless Communications and Networking, 2017

Link layer network coding (LLNC) promises to provide high throughput in relay networks through combining packets at the relays and trading communication for computation. The emerging area of physical layer network coding (PLNC) exploits the electromagnetic nature of signals and eliminates the need for addition at the packet level, while making signal design and coding schemes adaptable to the channel conditions. Although network coding has been extensively studied recently, physical layer network coding has not received the attention it deserves. Several recent works introduced the pollution attack at the network layer; however, the network performance at the physical layer with pollution attacks has not been evaluated before. The main challenge with the pollution attack involves propagation of the corrupted packets in an epidemic manner, which degrades performance of the network. As PLNC schemes boost up the network throughput, a thorough study evaluating this superiority to the LLNC scheme in presence of an intruder is necessary. The robustness of both schemes towards an attack have been studied in this article.

International Journal of System Assurance Engineering and Management, 2012

Parallel network coding is a new communication paradigm that takes advantage of the broadcast using characteristics of network coding for parallel architectures. Network coding has recently developed as an innovative paradigm for optimization problems for high-scale communication between several nodes of these architectures. In previous work, a decentralized approach by optimizing parallel communication with the use of network coding has been proposed. In the present paper, the chance of communication failure is evaluated and an efficient solution (PAC: LF-RM) for such situations is proposed. It is shown that since communication failure may occur and is not avoidable so to overcome such failure and the data loss, buffering at an alternate degree of network nodes will reduce this stipulation. This paper explores the combination of network coding and node buffering for handling communication failure situation in the 2D Mesh network and results are presented for various cases of communication failures.

Electronics, 2021

Wireless sensor networks (WSNs) have been widely used for applications in numerous fields. One of the main challenges is the limited energy resources when designing secure routing in such networks. Hierarchical organization of nodes in the network can make efficient use of their resources. In this case, a subset of nodes, the cluster heads (CHs), is entrusted with transmitting messages from cluster nodes to the base station (BS). However, the existence of selfish or pollution attacker nodes in the network causes data transmission failure and damages the network availability and integrity. Mainly, when critical nodes like CH nodes misbehave by refusing to forward data to the BS, by modifying data in transit or by injecting polluted data, the whole network becomes defective. This paper presents a secure protocol against selfish and pollution attacker misbehavior in clustered WSNs, known as (SSP). It aims to thwart both selfish and pollution attacker misbehaviors, the former being a fo...

Wireless Personal Communications, 2013

In this paper, first, we propose Star-NC, a new network coding (NC) scheme for multiple unicast sessions in an n-input n-output star structure. Then, we evaluate the network throughput of this coding scheme in wireless mesh network over the traditional non-NC transmission. Our scheme benefits from the proximity of all the nodes around the relay node and employs a more general form of overhearing different from other schemes such as COPE. We found that the gain of our NC scheme depends on both the star size and the routing pattern of the unicast transmissions. Based on this, we identify both the situations which the maximum gain is achievable and a lower bound for the expected value of the gain in the case of random routing pattern. Next, we propose an analytical framework for studying throughput gain of our Star-NC scheme in general wireless network topologies. Our theoretical formulation via linear programming provides a method for finding source-destination routes and utilizing the best choices of our NC scheme to maximize the throughput. Finally, we evaluate our model for various networks, traffic models and routing strategies over coding-oblivious routing. We also compare the throughput gain of our scheme with COPE-type NC scheme. We show that Star-NC exploits new coding opportunities different from COPE-type NC and thus can be used with or without this scheme. The results show that Star-NC has often better performance than COPE for a directional traffic model which is a typical model in wireless mesh networks. Moreover, we found that, joint Star and COPE-type NC has better throughput performance than each of Star or COPE alone.

Journal of Circuits, Systems and Computers, 2019

Most of the existing peer-to-peer (P2P) content distribution schemes carry out a random or rarest piece first content dissemination procedure to avoid duplicate transmission of the same pieces of data and rare pieces of data occurring in the network. This problem is solved using P2P content distribution based on network coding scheme. Network coding scheme uses random linear combination of coded pieces. Hence, the above-stated problem is solved easily and simply. Our proposed mechanism uses network coding mechanism in which several contents having the same message are grouped into different groups and coding operation is performed only within the same group. The interested peers are also divided into several groups with each group having the responsibility to spread one set of contents of messages. The coding system is designed to assure the property that any subset of the messages can be utilized to decode the original content as long as the size of the subset is suitably large. To...

ACM SIGCOMM Computer Communication Review, 2007

Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a strict schedule on routers' access to the medium. Although the scheduler delivers opportunistic gains, it misses some of the inherent features of the 802.11 MAC. For example, it prevents spatial reuse and thus may underutilize the wireless medium. It also eliminates the layering abstraction, making the protocol less amenable to extensions to alternate traffic types such as multicast. This paper presents MORE, a MAC-independent opportunistic routing protocol. MORE randomly mixes packets before forwarding them. This randomness ensures that routers that hear the same transmission do not forward the same packets. Thus, MORE needs no special scheduler to coordinate routers and can run directly on top of 802.11. Experimental results from a 20-node wireless testbed show that MORE's medi...

EURASIP Journal on Wireless Communications and Networking, 2014

The key issue in determining the lifetime of wireless sensor network (WSN) is the energy burning up of individual node. The cluster based routing improves the energy usage of WSN compared to other routing approach. In this paper, an effective multi-level cluster algorithm using link correlation is proposed for heterogeneous WSN. The level-k hierarchy with single-hop communication between nodes within a cluster is achieved using link correlation. The heterogeneous nodes are adopted as level-k cluster heads and implementing network coding on those nodes increases network lifetime significantly. Meanwhile, implementing time division multiple access (TDMA) technique within a cluster creates an organized cluster architecture improving the energy efficiency.

International Journal of Distributed Sensor Networks, 2015

When data owners publish their data to a cloud storage, data integrity and availability become typical problems because the cloud servers are never trusted. To address these problems, researchers proposed the Proof of Retrievability (POR) protocol which allows a verifier to check and repair the data stored in the cloud servers. Based on the POR protocol, the network coding technique is commonly applied to increase the efficiency in data transmission and data repair. However, most previous schemes neither consider a practical scenario nor use the network coding efficiently. In this paper, a lightweight network coding-based POR scheme, called MD-POR (Multisource and Direct Repair for Proof of Retrievability) is proposed. Unlike previous schemes, the proposed MD-POR scheme allows multiple clients who have different secret keys to participate in the scheme. Moreover, the MD-POR scheme supports the direct repair feature in which a corrupted data can be recovered by the servers without burdening the clients. The MD-POR scheme also supports public authentication feature in which a third party auditor is employed to check the servers, and the client is thus free of the responsibility of periodically checking the servers. Furthermore, the MD-POR scheme is constructed based on a symmetric key setting.

Lecture Notes in Computer Science, 2016

Proof Of Retrievability (POR) is a protocol that supports a data owner to check whether the data stored in cloud servers is available, intact and retrievable. Based on the POR, network coding technique has been applied to increase efficiency and throughput in data transmission and data repair. Although many network codingbased PORs have been proposed, most of them have not considered a practical scenario in which not only the data owner can check and can retrieve the data stored in the untrusted servers, but also an untrusted user can check and can retrieve the data stored in the servers without learning the secret keys of the data owner. This scenario occurs commonly in reality. For instance, in a data provision-payment system, the user must pay money to get data stored in the servers. In this paper, we propose a new network coding-based POR, named POR-2P (a network coding-based POR for data Provision-Payment system), to deal with this scenario. Furthermore, the complexity analysis and the performance evaluation show that the POR-2P is very efficient and applicable for a real cloud system.

Computer Networks, 2022

Future wireless networks must serve dense mobile networks with high data rates, keeping energy requirements to a possible minimum. The small cell-based network architecture and device-to-device (D2D) communication are already being considered part of 5G networks and beyond. In such environments, network coding (NC) can be employed to achieve both higher throughput and energy efficiency. However, NC-enabled systems need to address security challenges specific to NC, such as pollution attacks. All integrity schemes against pollution attacks generally require proper key distribution and management to ensure security in a mobile environment. Additionally, the mobility requirements in small cell environments are more challenging and demanding in terms of signaling overhead. This paper proposes a blockchain-assisted key distribution protocol tailored for MAC-based integrity schemes, which combined with an uplink reference signal (UL RS) handover mechanism, enables energy efficient secure NC. The performance analysis of the protocol during handover scenarios indicates its suitability for ensuring high level of security against pollution attacks in dense small cell environments with multiple adversaries being

Lecture Notes in Computer Science, 2006

Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framework for many interesting questions about Kolmogorov complexity.

EURASIP Journal on Wireless Communications and Networking, 2010

A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes, simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11). This paper shows that the concept of network coding can be applied at the physical layer to turn the broadcast property into a capacity-boosting advantage in wireless ad hoc networks. Specifically, we propose a physical-layer network coding (PNC) scheme to coordinate transmissions among nodes. In contrast to "straightforward" network coding which performs coding arithmetic on digital bit streams after they have been received, PNC makes use of the additive nature of simultaneously arriving electromagnetic (EM) waves for equivalent coding operation. And in doing so, PNC can potentially achieve 100% and 50% throughput increases compared with traditional transmission and straightforward network coding, respectively, in 1D regular linear networks with multiple random flows. The throughput improvements are even larger in 2D regular networks: 200% and 100%, respectively.

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2010

This paper investigates the capacity of a wireless two-way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate between the two end nodes. We give an upper bound of the capacity by applying the cut-set theorem. We prove that this upper bound can be approached in low SNR region using "separated" multiple access for uplinks from the end nodes to the relay in which the data from the end nodes are individually decoded at the relay; and network-coding broadcast for downlinks from the relay to the end nodes in which the relay mixes the information from end nodes before forwarding. We further prove that the capacity is approachable in high SNR region using physical-layer network coding (PNC) multiple access for uplinks, and network-coding broadcast for downlinks. From our proof and observations, we conjecture that the upper bound may be achieved with PNC in all SNR regions.

EURASIP Journal on Wireless Communications and Networking, 2008

We consider joint optimization of data routing and resource allocation in multicast multihop wireless networks where interference between links is taken into account. The use of network coding in such scenarios leads to a nonconvex optimization problem. By applying the probability collectives (PCs) technique the original problem is turned into a new problem which is convex over probability distributions. The resulting problem is then further decomposed into a data routing subproblem at network layer and a power allocation subproblem at physical layer in order to achieve a cross-layer distributed solution for the whole range of SINR values. The proposed approach is also extended to minimum cost multicast problems and routing problems based on multicommodity flow and single Steiner tree, resulting in new distributed algorithms for such problems.

Lecture Notes in Computer Science, 2009

Recently, random linear network coding has been widely applied in peer-to-peer network applications. Instead of sharing the raw data with each other, peers in the network produce and send encoded data to each other. As a result, the communication protocols have been greatly simplified, and the applications experience higher end-to-end throughput and better robustness to network churns. Since it is difficult to verify the integrity of the encoded data, such systems can suffer from the famous pollution attack, in which a malicious node can send bad encoded blocks that consist of bogus data. Consequently, the bogus data will be propagated into the whole network at an exponential rate. Homomorphic hash functions (HHFs) have been designed to defend systems from such pollution attacks, but with a new challenge: HHFs require that network coding must be performed in GF(q), where q is a very large prime number. This greatly increases the computational cost of network coding, in addition to the already computational expensive HHFs. This paper exploits the potential of the huge computing power of Graphic Processing Units (GPUs) to reduce the computational cost of network coding and homomorphic hashing. With our network coding and HHF implementation on GPU, we observed significant computational speedup in comparison with the best CPU implementation. This implementation can lead to a practical solution for defending against the pollution attacks in distributed systems.

Transactions on Emerging Telecommunications Technologies, 2016

This paper proposes 2 novel network coding approaches for diffusion-based nanonetworks. In these 2 methods, messages from nanomachines are jointly decoded at the receiver, and in one of the methods multiple molecule types are simultaneously employed to provide simultaneous communications over both nanomachine-to-relay and relay-to-nanomachine channels. As a result of the simultaneous use of the channel, each communication channel is allowed to use longer symbol intervals. This, in turn, results in a drastically reduced intersymbol interference component in all channels and enables communicating over longer ranges with higher data rates. The performance of the proposed communication system is investigated both analytically and via computer simulations.

EURASIP Journal on Advances in Signal Processing, 2015

In this paper, we consider network transmissions over a single or multiple parallel two-hop lossy paths. These scenarios occur in applications such as sensor networks or WiFi offloading. Random linear network coding (RLNC), where previously received packets are re-encoded at intermediate nodes and forwarded, is known to be a capacity-achieving approach for these networks. However, a major drawback of RLNC is its high encoding and decoding complexity. In this work, a systematic network coding method is proposed. We show through both analysis and simulation that the proposed method achieves higher end-to-end rate as well as lower computational cost than RLNC for finite field sizes and finite-sized packet transmissions.

Mobile Information Systems, 2015

In recent times, there have been many developments in wireless sensor network (WSN) technologies using coding theory. Fast and efficient protection schemes for data transfer over the WSN are some of the issues in coding theory. This paper reviews the issues related to the application of the joint rateless-network coding (RNC) within the WSN in the context of packet protection. The RNC is a method in which any node in the network is allowed to encode and decode the transmitted data in order to construct a robust network, improve network throughput, and decrease delays. To the best of our knowledge, there has been no comprehensive discussion about RNC. To begin with, this paper briefly describes the concept of packet protection using network coding and rateless codes. We therefore discuss the applications of RNC for improving the capability of packet protection. Several works related to this issue are discussed. Finally, the paper concludes that the RNC-based packet protection scheme ...

SIAM Journal on Computing, 2013

We present a new algebraic formulation for computing edge connectivities in a directed graph, using ideas developed in network coding. This reduces the problem of computing edge connectivities to solving systems of linear equations, thus allowing us to use tools in linear algebra to design new algorithms. Using the algebraic formulation, we obtain faster algorithms for computing single source edge connectivities and all pairs edge connectivities. In some settings, the amortized time to compute the edge connectivity for one pair is sublinear. Through this connection, we have also found an interesting use of expanders and superconcentrators to design fast algorithms for some graph connectivity problems.

IEEE Access

In this article, a new multicast protocol is introduced at the session layer, which is based on network coding and is called the Network Coding Datagram Protocol (NCDP). The NCDP protocol is specifically designed for content delivery systems that utilize multicast data transmission from multiple sources. The development of the NCDP packet and its operational logic takes into consideration the variability of the protocols used in conjunction with it, as well as the packet header processing algorithms for routing nodes-coders. Additionally, a virtual laboratory bench is proposed to facilitate research on the operation of the protocol. The article also includes the results of testing the NCDP protocol in networks with butterfly and diamond topologies, with a comparison between simple sequential multicast transmission and network coding transmission.

International Journal of Networking and Computing

Mobile ad-hoc networks (MANETs) have limited network resources such as node battery capacity and wireless frequency bands. Therefore, to ensure efficient broadcast communication in such networks, it is critical to reduce unnecessary packet transfers and maximize the use of network resources and power. Network coding (NC) is a technique for reducing the number of transmitted packets over a network and maximizing the use of devices and network resources. The packet-reduction benefits obtained using NC depend considerably on network topology. In this study, we propose an NC method particularly designed for MANETs. In our approach, the nodes switch the type of transmission between an uncoded transmission (simple broadcast) and a coded transmission (NC) based on the estimated neighboring node's proximity. The effectiveness of the proposed method was evaluated using computer simulations. Our evaluations demonstrated that the proposed method can reduce the number of packets in the network without decreasing the packet delivery rate.

PloS one, 2016

Publish/subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Publish/subscribe supports the flexible development of large-scale, event-driven and ubiquitous systems. Publish/subscribe is prevalent in a number of application domains such as social networking, distributed business processes and real-time mission-critical systems. Many publish/subscribe applications are sensitive to message loss and violation of privacy. To overcome such issues, we propose a novel method of using secret sharing and replication techniques. This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks. We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance. Moreover, a thorough evaluation is done through a case study on s...

EURASIP Journal on Wireless Communications and Networking, 2011

This paper considers the reliable transmission for wireless multicast networks where multiple sources want to distribute information to a set of destinations with assistance of a relay. Basically, the reliability of a communication link is assured via automatic repeat request (ARQ) protocols. In the context of multisource multicast networks, the challenge is how to retransmit the lost or erroneous packets efficiently. In traditional approaches, the retransmission of lost packets from a single source is treated separately, and thus it may cause a considerable delay. To solve this problem, we propose the relay detects, combines, and forwards the packets which are lost at destinations using network coding. In the proposed ARQ protocol, the relay detects packets from different sources and combines the lost packets using NC. In particular, two packet-combination algorithms are developed to guarantee that all lost packets are retransmitted with the smallest number of retransmissions. Furthermore, we analyze the transmission bandwidth and provide the numerical results to demonstrate the superior performance of the proposed ARQ protocol over some existing schemes.

Wireless Personal Communications, 2019

This paper proposed a novel algorithm called Efficiency Network Coding (ENC) for wireless mesh networks. The ENC algorithm is based on COPE protocol and consists of two parts: In the first part, ENC codes the packets which have a smaller difference in size than other packets and so uses less bandwidth to code and send packets. In the second part, the nodes which their packets are in front of virtual queue and the ones which their packets are in front of output queue participate in coding. Therefore, ENC increases coding opportunities and takes less time for sending packets. The proposed ENC is implemented in NS2.34 with TCP-New Reno on COPE framework and compared with the throughput of TCP in COPE. The results of this paper show that the throughput of the proposed ENC is greater than that of COPE in most cases. The time complexity of ENC depends on the overhear packets in the nodes and can be less, equal, or more than COPE in different conditions.

IEICE ESS Fundamentals Review, 2022

This paper deals with the Shannon cipher system, secret sharing communication systems, secret sharing systems, secure network coding, and wiretap channel coding, which are tools for the secure coding of information based on information theory. In coding problems, it is usually studied how to achieve the perfect secrecy of information. However, in this paper, we show that we can achieve secure coding even in the case of no-perfect secrecy. We divide secret information into several pieces, and we achieve perfect secrecy for every piece individually to insure the security of information. On the other hand, by allowing the nonperfect secrecy of the whole information, we can decrease the bit length of random number and/or codewords. Hence, the coding techniques shown in this paper attain secure and efficient coding in the above coding systems.

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications

In this paper we establish fundamental limitations to the benefit of network coding in terms of energy and throughput in multihop wireless networks. Thereby we adopt two well accepted scenarios in the field: single multicast session and multiple unicast sessions. Most of our results apply to arbitrary wireless network and are, in particular, not asymptotic in kind. In terms of throughput and energy saving we prove that the gain of network coding of a single multicast session is at most a constant factor. Also, we present a lower bound on the expected number of transmissions of multiple unicast sessions under an arbitrary network coding. We identify scenarios for which the network coding gain for energy saving becomes surprisingly close to 1, in some cases even exactly 1, corresponding to no benefit at all. Interestingly, we prove that the gain of network coding in terms of transport capacity is bounded by a constant factor π in any arbitrary wireless network and for all traditional channel models. This shows that the traditional bounds on the transport capacity [1]-[4] do not change more than constant factor π if we employ network coding. As a corollary, we find that the gain of network coding on the throughput of large scale homogeneous wireless networks is asymptotically bounded by a constant. Note that our result is more general than the previous work [5] and it is obtained by a different technique. In conclusion, we show that in contrast to wired networks, the network coding gain in wireless networks is constraint by fundamental limitations.

2010

We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding solutions, where the maximum is over all configurations. It is shown that if coding and routing solutions are using the same transmission range, the benefit in d-dimensional networks is at least 2d/ √ d . Moreover, it is shown that if the transmission range can be optimized for routing and coding individually, the benefit in 2-dimensional networks is at least 3. Our results imply that codes following a decode-and-recombine strategy are not always optimal regarding energy efficiency.