Related papers: Simple Coding Techniques for Many-Hop Relaying
In vehicular communications, traffic-related information should be spread over the network as quickly as possible to maintain a safe and reliable transportation system. This motivates us to develop more efficient information propagation…
We consider the age of information in a multihop multicast network where there is a single source node sending time-sensitive updates to $n^L$ end nodes, and $L$ denotes the number of hops. In the first hop, the source node sends updates to…
We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that are built into the existing redundancy of the system, we propose a…
We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number…
This paper considers the basic $\mathcal{PULL}$ model of communication, in which in each round, each agent extracts information from few randomly chosen agents. We seek to identify the smallest amount of information revealed in each…
In this paper, two-hop communication between a source and a destination with the aid of an intermediate relay node is considered. Both the source and intermediate relay node are assumed to operate under statistical quality of service (QoS)…
Interference management has become a key factor in regulating transmissions in wireless communication networks. To support effective interference management schemes, it can be essential to have prior knowledge about the network topology. In…
In this paper we consider a network of processors aiming at cooperatively solving linear programming problems subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
We consider the problem of selecting $k$ seed nodes in a network to maximize the minimum probability of activation under an independent cascade beginning at these seeds. The motivation is to promote fairness by ensuring that even the least…
In this paper, we aim to explore the stochastic performance limit of large-field-size Random Linear Streaming Codes (RLSCs) in multi-hop relay networks. In our model, a source transmits a sequence of streaming messages to a destination…
Link state routing protocols such as OSPF or IS-IS currently use only best paths to forward IP packets throughout a domain. The optimality of sub-paths ensures consistency of hop by hop forwarding although paths, calculated using Dijkstra…
Random linear network coding (RLNC) unicast protocol is analyzed over a rapidly-changing network topology. We model the probability mass function (pmf) of the dissemination time as a sequence of independent geometric random variables whose…
The present work proposes a new approach to energy effiency for filtering of a system interconnected by a Multi-Hop network. The minimization of the energy cost per time unit is obtained through limiting the number of packets retransmission…
It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous…
Inspired by emerging applications in vehicular networks, we address the problem of achieving high-reliability and low-latency communication in multi-hop wireless networks. We propose a new family of Automatic-Repeat-Requests (ARQs) based…
WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel.…
Cooperative multicast is an effective solution to address the bottleneck problem of single-hop broadcast in wireless networks. By incorporating with the random linear network coding technique, the existing schemes can reduce the…
In this paper, we consider a multihop wireless sensor network with multiple relay nodes for each hop where the amplify-and-forward scheme is employed. We present algorithmic strategies to jointly design linear receivers and the power…
Suppose that we have two parties that possess each a binary string. Suppose that the length of the first string (document) is $n$ and that the two strings (documents) have edit distance (minimal number of deletes, inserts and substitutions…
In this paper, we study Coded relay (Crelay) in multi-hop wireless networks. Crelay exploits both partial packets and overhearing capabilities of the wireless nodes, and uses Forward Error Correction code in packet forwarding. When a node…