A one-session multicast network, on which a coding scheme with networkcoding is defined, was implemented with a maximum common flow of $r$ -packets arriving simultaneously at $\vert T\vert $ sink nodes. Determining h...
详细信息
A one-session multicast network, on which a coding scheme with networkcoding is defined, was implemented with a maximum common flow of $r$ -packets arriving simultaneously at $\vert T\vert $ sink nodes. Determining how to order the $r$ -packets that emerge from the source node $s$ through their output $n$ -links, constitutes a combinatorial problem. In this work, the set of all the possible output configurations is constructed, where each configuration is a vector of packets tags of length equal to $n$ . Each tag has a length equal to $r$ . Through a combinatorial algorithm on the set of possible output configurations, a path is carried out on the graph representing the one-session multicast network. The path is based on a topological ordering of the multicast graph that allowed us finding all possible ways to order the output of the $r$ -packets from $s$ to the sink nodes in $T$ . An ordering configuration based on networkcoding is valid, if the coding of packets is achieved through a linear combination in the coding nodes and the decoding of packets in the sink nodes. This validation verifies, then, a one-session multicast solution. The proposal of this work is independent of the network topology, the maximum flow value, and the size of the packets.
The main focus of this paper is the resilience of communication protocols for data gathering in distributed, large scale, and dense networks. In our previous work, we have proposed the resilient methods based on rando...
详细信息
The main focus of this paper is the resilience of communication protocols for data gathering in distributed, large scale, and dense networks. In our previous work, we have proposed the resilient methods based on random behavior and data replications to improve route diversification, thus to take advantage of redundant network structure. Following these previous methods, we propose in this paper a new resilient method based on networkcoding techniques to improve resilience in Wireless Sensor networks (WSNs) for smart metering applications. More precisely, using our resilience metric based on a performance surface, we compare several variants of a well-known gradient based routing protocol with the previous methods (random routing and packet replications) and the new proposed methods (two networkcoding techniques). The proposed methods outperformed the previous methods in terms of data delivery success even in the presence of high attack intensity.
networkcoding is becoming essential part of network systems since it enhances system performance in various ways. To take full advantage of networkcoding, however, it is vital to guarantee low latency in the decodin...
详细信息
networkcoding is becoming essential part of network systems since it enhances system performance in various ways. To take full advantage of networkcoding, however, it is vital to guarantee low latency in the decoding process and thus parallelization of random networkcoding has drawn broad attention from the networkcoding community. In this paper, we investigate the problem of parallelizing random networkcoding for embedded sensor systems with multicore processors. Recently, general purpose graphics processing unit (GPGPU) technology has paved the way for parallelizing random networkcoding;however, it is not an option on embedded sensor nodes without GPUs and thus it is indispensable to leverage multicore processors which are becoming more common in embedded sensor nodes. We propose a novel random networkcoding parallelization technique that can fully exploit multicore processors. In our experiments, our parallel method exhibits over 150% throughput enhancement compared to existing state-of-the-art implementations on an embedded system.
In wireless sensor networks (WSNs), wireless links are unreliable and sensor nodes may be in sleep mode. Thus, many applications which require reliable broadcast cannot work properly if they lost some packets. In orde...
详细信息
In wireless sensor networks (WSNs), wireless links are unreliable and sensor nodes may be in sleep mode. Thus, many applications which require reliable broadcast cannot work properly if they lost some packets. In order to make sure every sensor node in the network receives all packets completely and correctly, retransmission of lost packets is indispensable. Many retransmission methods with networkcoding have been proposed but they do not catch coding opportunity. In this paper, real- time retransmission algorithm based on networkcoding (NCRR) is proposed to make the average number of transmissions as less as possible. During the transmission of original packets, we detect whether a certain time slot is suitable for retransmitting a coded packet based on recovery ratio. We analyze the number of transmissions with traditional retransmission and with networkcoding. Compared with existing approaches, simulation results show that our algorithm can effectively reduce the average number of transmissions and improve the transmission efficiency.
networkcoding is known to be effective in overcoming packet losses and packet reordering inmultihop wireless networks. Despite the benefits, networkcoding is hard to deploy without being compatible with TCP. To addr...
详细信息
networkcoding is known to be effective in overcoming packet losses and packet reordering inmultihop wireless networks. Despite the benefits, networkcoding is hard to deploy without being compatible with TCP. To address this problem, a seminal paper proposed a networkcoding scheme that adopts an ACK-based sliding-widow networkcoding approach. In this paper we show that the previous scheme may not suffice to mitigate the effects of packets received out of order in multipath wireless networks where severe packet reordering persists. We propose a modified networkcoding layer where the receiver acknowledges every degree of freedomby using the sequence number of a newly seen packet instead of using that of the oldest unseen packet so that the networkcoding layer can be compatible with a TCP variant for severe packet reordering. To reduce the decoding matrix size and the coding buffer size, our scheme allows retransmission at the networkcoding layer. Simulation results show that our scheme outperforms the exiting scheme in multipath wireless networks particularly when severe packet reordering persists.
We propose a set of distributed algorithms for improving the multicast throughput in wireless sensor networks. To this end, networkcoding is applied when exploiting path diversity with two disjoint paths to each mult...
详细信息
We propose a set of distributed algorithms for improving the multicast throughput in wireless sensor networks. To this end, networkcoding is applied when exploiting path diversity with two disjoint paths to each multicast group receiver. We depart from the traditional wisdom that the multicast topology from source to receivers needs to be a tree and propose a novel and distributed algorithm to construct a 2-redundant multicast graph (a directed acyclic graph) as the multicast topology, on which networkcoding is applied. We conduct both analytical and simulation-based studies to evaluate the effectiveness and performance of our algorithm.
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...
详细信息
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 networkcoding 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 networkcoding efficiently. In this paper, a lightweight networkcoding-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.
This paper proposes a multirate networkcoding scheme to improve the energy efficiency of wireless sensor networks (WSNs). Firstly, a five-layer network model is introduced, in which a perfect solution can always be a...
详细信息
This paper proposes a multirate networkcoding scheme to improve the energy efficiency of wireless sensor networks (WSNs). Firstly, a five-layer network model is introduced, in which a perfect solution can always be achieved. Then, a network topology which belongs to the five-layer network model will be established from the given sensor networks so that the receivers can receive data at a higher rate without introducing excessive additional transmissions, which improves the energy efficiency as a result. The performance of the proposed scheme is evaluated in a simulated instance, and the result shows that 9% of transmission overhead can be saved compared with traditional scheme.
This work proposes a model to solve the problem of networkcoding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functi...
详细信息
This work proposes a model to solve the problem of networkcoding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.
In order to increase the efficiency and security of file sharing in the next-generation networks, this paper proposes a large scale file sharing scheme based on secure networkcoding via device-to-device (D2D) communi...
详细信息
In order to increase the efficiency and security of file sharing in the next-generation networks, this paper proposes a large scale file sharing scheme based on secure networkcoding via device-to-device (D2D) communication. In our scheme, when a user needs to share data with others in the same area, the source node and all the intermediate nodes need to perform secure networkcoding operation before forwarding the received data. This process continues until all the mobile devices in the networks successfully recover the original file. The experimental results show that secure networkcoding is very feasible and suitable for such file sharing. Moreover, the sharing efficiency and security outperform traditional replication-based sharing scheme.
暂无评论