We consider the scenario of broadcasting for realtime applications and loss recovery via
instantly decodable network coding. Past work focused on minimizing the completion delay …

Consider a connected network of n nodes that all wish to recover k desired packets. Each
node begins with a subset of the desired packets and exchanges coded packets with its …

We consider a coded cooperative data exchange problem with the goal of generating a
secret key. In particular, we investigate the number of public transmissions required for a set …

We focus on secure data exchange among a group of wireless clients. The clients exchange
data by broadcasting linear combinations of packets over a lossless channel. The data …

We consider the problem of direct data exchange among a group of wireless clients in the
presence of an eavesdropper. An instance of this problem includes a set of packets X and a …

Utilizing device-to-device (D2D) connections among mobile devices is promising to meet the
increasing throughput demand over cellular links. In particular, when mobile devices are in …

Because the exchange of information among all the users in a large network can take a long
time, a successive omniscience protocol is proposed. Namely, subgroups of users first …

In this paper, we investigate the use of instantly decodable network coding (IDNC) for
improving two fundamental performance metrics, namely, the completion time (as a measure …

We consider the problem of minimizing the cost of cooperative data exchange between a
group of wireless clients. In this problem, a group of clients needs to exchange a set of …

We study the Relay-based Cooperative Data Exchange (RCDE) problem, where initially
each client has access to a subset of a set of n original packets, referred to as their side …