Related papers: Network Coding Based Evolutionary Network Formatio…
Network coding has the potential to improve the overall throughput of a network by combining different streams of data and forwarding them. In wireless networks, the wireless channel provide an excellent medium for physical layer network…
In this paper, we analyze the delay performance of an ad-hoc dynamic network where random network coding and broadcast are used in combination to distribute the messages. The analysis is comprehensive for that we consider M-to-N broadcast…
In this paper, we consider a three node, two-way relay system with digital network coding over static channels where all link gains are assumed to be constant during transmission. The aim is to minimize total energy consumption while…
This work aims to jointly optimize the coding and node selection to minimize the processing time for distributed computing tasks over wireless edge networks. Since the joint optimization problem formulation is NP-hard and nonlinear, we…
Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for wireless random networks. We prove that the capacity of…
We focus on a particular form of network coding, reverse carpooling, in a wireless network where the potentially coded transmitted messages are to be decoded immediately upon reception. The network is fixed and known, and the system…
The quest to understand structure-function relationships in networks across scientific disciplines has intensified. However, the optimal network architecture remains elusive, particularly for complex information processing. Therefore, we…
Distributed medium access control (MAC) protocols are essential for the proliferation of low cost, decentralized wireless local area networks (WLANs). Most MAC protocols are designed with the presumption that nodes comply with prescribed…
This paper investigates the benefits of cooperation and proposes a relay activation strategy for a large wireless network with multiple transmitters. In this framework, some nodes cooperate with a nearby node that acts as a relay, using the…
We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network topology changes frequently. That is, for each time slot links…
In secure network coding, there is a possibility that the eavesdropper can improve her performance when she changes (contaminates) the information on the attacked edges (active attack) and chooses the attacked edges adaptively (adaptive…
This paper considers a framework where data from correlated sources are transmitted with help of network coding in ad-hoc network topologies. The correlated data are encoded independently at sensors and network coding is employed in the…
Network embeddings learn to represent nodes as low-dimensional vectors to preserve the proximity between nodes and communities of the network for network analysis. The temporal edges (e.g., relationships, contacts, and emails) in dynamic…
Ad-hoc wireless networks are of increasing importance in communication and are frequently constrained by energy use. Here we propose a distributed, non-hierarchical adaptive method using preferential detachment for adjusting node…
Network coding is an effective idea to boost the capacity of wireless networks, and a variety of studies have explored its advantages in different scenarios. However, there is not much analytical study on throughput and end-to-end delay of…
We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate…
The coupling of scale-free networks with mobile unstructured networks is certainly unusual. In mobile networks, connections active at a given instant are constrained by the geographical distribution of mobile nodes, and by the limited…
Opportunistic analysis has traditionally relied on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks,…
We consider the resource allocation problem in cooperative wireless networks wherein nodes perform mutual information accumulation. We consider a unicast setting and arbitrary arrival processes at the source node. Source arrivals can be…
Networks are central to many economic and organizational applications, including workplace team formation, social platform recommendations, and classroom friendship development. In these settings, networks are modeled as graphs, with agents…