The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider a two-way relay system where two sources exchange information with the assistance of multiple, non-cooperative, relay nodes. Specifically, we propose a capacity upper bound for the two-way relay channel and derive the achievable regions for different relay strategies, such as the amplify-and-forward (AF), the decode-and-forward (DF) and the compress-and-forward (CF). Furthermore, the upper...
We consider the problem of accessing large data files stored at multiple locations across a content distribution, peer-to-peer, or massive storage network. We assume that the data is stored in either original form, or encoded form at multiple network locations. Clients access the data through simultaneous downloads from several servers across the network. The central problem in this context is to...
Cooperative Peer-to-Peer (P2P) information repair has been proposed to mitigate the packet loss among mobile peers during the 3G Cellular Base Station (BS) broadcast. Then network coding based P2P information exchange algorithms have been proposed to further improve the network performance, e.g., PIE algorithm and DNC-CPR algorithm. In this paper, we propose a connected dominating set (CDS) based...
The features that DTN protocol architecture offers are particularly appealing to handle intermittent links and disruption events, by means of the Custody Transfer option. On the other hand, the implementation of long erasure codes proved to be promising to contrast short fading events in long delay networks, where the high latency makes the use of ARQ schemes less profitable. This paper proposes a...
The operation of communication protocols is conventionally independent of the information being transmitted. This paper puts forth the notion of protocol coding to refer to transmission strategies in which data can be encoded by modulating the protocol actions according to the information message. We focus on communication in the presence of half-duplex constraints, where the task of the protocol...
This paper focuses on the security problem in unreliable wireless ad hoc networks when involving network coding. A typical example of misbehaviors by bad nodes is presented to show the misbehavior propagation problem of network coding. To reduce the influence of bad nodes, we propose to combine network coding with trust scheme. In our trusted network coding, a trust model is established according...
This paper considers a large-scale wireless sensor network where sensor readings are occasionally collected by a mobile sink, and sensor nodes are responsible for temporarily storing their own readings in an energy-efficient and storage-efficient way. Existing data persistence schemes based on erasure codes do not utilize the correlation between sensor data, and their decoding ratio is always larger...
The spatial correlation among the images retrieved from distributed video sensors leads to considerable data redundancy, thus resulting in significant performance degradation in energy efficiency and QoS satisfaction. In this paper, a correlation-aware QoS routing algorithm (CAQR) is proposed to efficiently deliver visual information under QoS constraints by exploiting the correlation among video...
Network coding is an effective method to improving relay efficiency by reducing the number of transmissions. However, its performance is limited by several factors such as packet length mismatch and rate mismatch. Although the former may be solved by re-framing, the latter remains a challenge and is likely to greatly degrade the efficiency of network coding. In this paper, we re-interpret network...
In this paper we propose an adaptive Wyner-Ziv (WZ) coding scheme for non-binary correlated sources with side information at the decoder. At the encoder, a low density parity check (LDPC) code is employed to implement Slepian-Wolf (SW) coding for each bit-plane independently. The joint "source-channel" decoder, which combines SW decoding and dequantizing in a single step, preserves the symbol-domain...
The distributed optimal path planning (D-OPP) problem has been a bottleneck restricting the performance of Peer-to-Peer (P2P) workflow systems which have met the development trend of workflow systems and been one of the most important domains of Distributed computing. The essence of this problem is to solve the dynamical global optimization in local views without centralized mechanism. Aiming at this...
Recently, in classical P2P overlay networks, with applying replication technique, a single peer is replaced by a cluster of peers in order to tolerant Byzantine failures. In this paper, a novel robust and secure scheme for storage overlay networks is proposed by applying erasure coding technique to reduce redundancy and enhance privacy protection. For achieving a lightweight data privacy protection,...
As a superior approach for peer-to-peer (P2P) streaming live media, mesh-based overlay has made much success due to its potential scalability and ease of deployment. Peers in mesh streaming systems employ a swarming content delivery mechanism to exchange resources. However, the limited availability of new content heavily affects the quality of delivered stream. Aiming at leveraging and optimizing...
The usual network message transmission is based on store and forward mechanism. The network node does not process the network messages. Network coding theory has changed this routing form. Toimprove the network transmission capacity, it allows nodes to encode the transmitting messages. Some researches show that the network coding theory makes the node reach the maximal network traffic introduced by...
Distributed storage systems aim at providing a reliable storage over unreliable nodes thorough introducing redundancy. In these systems when a node is failed to retain the previous reliability a newcomer is connected to existing nodes and downloads the same amount of information as the damage node. Thus, a great deal of data transferring, called the repair bandwidth, is imposed to the system. Recently,...
Peer-to-peer video streaming systems are overlay networks used to distribute, among other types of content, live video content to large sets of users by relying on network and computing resources directly provided by users that are receiving the video stream. In this paper, we analyze the impact of two optimization techniques that can be adopted in peer-to-peer video streaming systems, with tree or...
Peer-to-peer networks are an increasingly popular solution for the distribution of media content to a large number of users, with limited investments for network infrastructures. In this paper we focus on mesh-based, also referred to as generic, unstructured, or data-driven, peer-to-peer video streaming systems. We carry out a performance analysis of these systems, analyzing their sensitivity to the...
Peer-to-peer video streaming systems are overlay networks used to distribute, among other types of content, live video content to large sets of users by relying on computing and network resources directly provided by users that are receiving video streaming services. Peer-to-peer video streaming systems with tree or forest topology are typically push-based, since the video content is provided by parent...
Undoubtedly, peer-to-Peer (P2P) technology is an effectively method for delivering streaming media content over the internet. However, current P2P stream systems also suffer many problems, such as huge bandwidth consumption, less effective in heterogeneous environment, protection of important data, etc. Scalable video coding (SVC), as an extension of H.264/AVC standard, has attracted many researchers...
Data allocation in layered P2P streaming has been proved to be a NP-Complete problem. The existing algorithms are heuristic and based on the greedy idea, which can not get the global solution. In order to develop a new algorithm for this problem, we define the concept of `Data Blocks for Choosing', set up a mathematic model of integer programming without restriction, and propose a novel genetic simulated...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.