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.
In this paper, we investigate the benefits of applying a form of network coding known as random linear coding (RLC) to unicast applications in disruption-tolerant networks (DTNs). Under RLC, nodes store and forward random linear combinations of packets as they encounter each other. For the case of a single group of packets originating from the same source and destined for the same destination, we...
This paper proposes Peer-to-Peer (P2P) Communication to share the resources in fast manner with the help of large area communication between the nodes in the network. The big size and good stability properties of P2P files in network give rise to the use of highly effective capacity planning and topology matching techniques as a promising solution to manage P2P communications in shared area network...
Churn resilience is an important issue for current Peer-to-Peer(P2P) networks, where peers dynamically and freely join and leave the system with or without warning. In this paper we focus on improving an existing anonymous peer-to-peer network design [8] by adding churn-resilience to it. Churn resilience is achieved by employing the properties of threshold secret sharing schemes. The paper describes...
Network coding is known to be a promising technology to increase the bandwidth capacity in wireless networks. To our best knowledge, there is limited work on studying the available bandwidth for a given path with network coding. This paper presents a new method to estimate the available bandwidth of a path that considers network coding and wireless interference simultaneously. We show that our estimated...
The Hierarchically Distributed Tree (HD Tree) is a novel distributed data structure built over a complete tree. The purpose of proposing this new data structure is to better support multi-dimensional range query in the distributed environment. HD Tree doubles the number of neighbors at the cost of doubling total links of a tree. The routing operation in HD Tree is supposed to be highly error-resilient...
Network coding aware routing protocols have been an interesting research topic in recent years. In this paper, we explore similar routing gains with physical layer coding techniques. A source routing protocol S3 is proposed to be implemented with a routing metric called iETT. By extending the traditional ETT measurement, iETT provides a simple way to make the routing protocol interference-aware. To...
In any communication network, the maximum number of link-disjoint paths between any pair of communicating nodes, S and T, is limited by the S-T minimum link-cut. Multipath routing protocols have been proposed in the literature to make use of these S-T paths in enhancing the survivability of the S-T information flow. This is usually done by using a subset of these paths to forward redundant data from...
There has been much research focusing on the routing problem in delay tolerant networks (DTNs). Much of the work has mainly focused on coding schemes for message distribution, while other work has been done on the probabilistic forwarding. Coding schemes achieve higher delivery rate via redundancy before forwarding, while probabilistic forwarding efficiently limits the abuse of the store and forward...
In this paper, we propose a priority (or progressive) linear coding based opportunistic routing mechanism (OR-PLC) for H.264 video streaming over multi-hop ad hoc networks. OR-PLC assigns different error protection priorities to video packets according to their perceptual importance to mitigate error propagation problem so that the video quality is enhanced in receiver. Furthermore, OR-PLC exploits...
The selection of routes is an important issue in wireless networks when network coding is used. Existing research formulate network-coding-aware routing as a linear optimization program. However, deploying such method in real wireless networks is impractical. To solve this issue, in this paper, a practical network-coding aware routing protocol is proposed for unicast sessions in wireless networks...
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...
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,...
Network coding is a class of routing algorithms offering increased throughput and improved robustness to random failures. With traditional routing, intermediate nodes in the network may only forward unmodified packets. With network coding, instead, intermediate nodes are allowed to forward linear combinations of received packets. Original data can be reconstructed after collecting sufficiently many...
In this paper, we analyze the performance of a peer-to-peer (P2P) distributed storage network based on the overlay architecture defined by the Wuala project. Although the original system is based on efficient erasure codes, e.g., Reed-Solomon codes, we investigate the use of a "simple" network coding strategy, which leverages on the well-known idea of randomized network coding. In particular,...
We consider the problem of gathering correlated sensor data by a sink node in a wireless sensor network. We design efficient distributed protocols to maximize the network lifetime subject to nodal energy constraints. Many existing approaches address the routing layer only, but the routing often interacts with physical-layer power control and MAC-layer link access. We present a first effort to maximize...
In this paper we consider a linear optimization approach for studying download finish times in peer-to-peer networks that allow but do not require coding. We demonstrate that using the network coding framework simplifies analysis even in scenarios where the optimal solution does not require coding. For example, we use the network coding framework to disprove the claim of Ezovski et al. that in the...
Network coding is known as a promising approach to improve wireless network throughput. However, it is only applicable when different flows are routed through a certain coding structure. One of the fundamental issues is to accurately identify the coding structures and optimally utilize the coding nodes. In this paper, we formally establish general coding conditions to identify multiple coding nodes...
Network coding is an efficient technique to increase network capacity. COPE is a promising forwarding mechanism which can utilize network coding in a practical way. Different routing algorithms utilizing COPE may have different gains from network coding. In this paper, we discuss the importance of coding-aware routing and the tradeoff between load-balanced and coding-aware routing. We then propose...
Network coding has been proved as an effective way to enhance the throughput of the multihop wireless ad hoc networks in both unicast and multicast traffics. However, in a random network topology with non-coding-aware routing protocols, the performance enhancement may be limited because the packet routing scheme does not take advantage of the possibility of network coding. In this paper, we propose...
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.