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 how Multiple Description Coding (MDC) can improve the user's satisfaction for a group of heterogeneous destinations for video multicast over wireless ad hoc networks. Specifically, we explore the independent-description property of MDC with multiple paths to improve the user's satisfaction. In our approach, the assignment of multiple description (MD) video is randomly...
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network with n nodes distributed uniformly in a unit square, with each node acting as a source for independent information to be sent to a multicast group consisting of m randomly chosen destinations. We show that, under the protocol...
In this paper, we propose a new analytical model in order to evaluate the throughput of a wireless tandem network coding. Our analytical model is based on a multi-class open queueing network. In this model, we include two basic processes of network coding, i.e., packets combination and packets multicasting, in a suitable way considering the constraints of the queueing networks. To this end, we consider...
We consider multi-source multicast communication scenarios in which each node has an aggregate outbound traffic capacity and can directly communicate with any other node. This is motivated by peer-to-peer (P2P) information dissemination applications on the Internet in which the uplink capacity of nodes is usually the bottleneck, being several times smaller than the downlink capacity. We also allow...
In this paper, we study the problem of utility maximization in peer-to-peer (P2P) systems, in which aggregate utilities are maximized by running distributed algorithms on P2P nodes that are constrained by their uplink capacities. This may be understood as extending the seminal flow control framework in (F. P. Kelly et al., 1998) and (S. H. Low et al.,1999) from single-path unicast over general topology...
Network coding is a powerful technique introduced at the turn of the millennium, when a simple but far-reaching observation was made that, in communication networks, one can allow intermediate nodes to not only forward but also combine and process the incoming information flows [1]. Today, the field is attracting significant interest from engineers, computer scientists, and mathematicians in both...
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.