Related papers: Coding Improves the Optimal Delay-Throughput Trade…
We consider cooperative relay communication in a fading channel environment under the Orthogonal Amplify and Forward (OAF) and Orthogonal and Non-Orthogonal Selection Decode and Forward (OSDF and NSDF) protocols. For all these protocols, we…
Since the packet is transmitted to a set of relaying nodes in opportunistic routing strategy, so the transmission delay and the duplication transmission are serious. For reducing the transmission delay and the duplicate transmission, in…
Exchange of crucial and confidential information leads to the unprecedented attention on the security problem in wireless networks. Though the security has been studied in a number of works, the joint optimization of the physical layer…
We consider a Mobile Ad-hoc NETworks (MANET) formed by "n" nodes that move independently at random over a finite square region of the plane. Nodes exchange data if they are at distance at most "r" within each other, where r>0 is the node…
We consider Mobile Ad-hoc Network (MANET) with transmitters located according to a Poisson point in the Euclidean plane, slotted Aloha Medium Access (MAC) protocol and the so-called outage scenario, where a successful transmission requires…
We consider a full-duplex decode-and-forward system, where the wirelessly powered relay employs the time-switching protocol to receive power from the source and then transmit information to the destination. It is assumed that the relay node…
Nowadays, multimedia and real-time applications consume much network resources and so, need high flow rates and very small transfer delay. The current ad hoc networks (MANETs), in their original state, are not able to satisfy the…
Scaling neural network training increasingly depends on synchronous data-parallelism, yet full-precision gradient all-reduce imposes a severe communication bottleneck. We propose Decoupled Momentum Optimization (DeMo), a drop-in replacement…
In large scale distributed computing systems, communication overhead is one of the major bottlenecks. In the map-shuffle-reduce framework, which is one of the major distributed computing frameworks, the communication load among servers can…
The topologies of predictable dynamic networks are continuously dynamic in terms of node position, network connectivity and link metric. However, their dynamics are almost predictable compared with the ad-hoc network. The existing routing…
Mission critical data dissemination in massive Internet of things (IoT) networks imposes constraints on the message transfer delay between devices. Due to low power and communication range of IoT devices, data is foreseen to be relayed over…
In this work, we investigate a multi-source multi-cast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal…
In a multi-input multi-output (MIMO) full-duplex network, where an in-band full-duplex infrastruc- ture node communicates with two half-duplex mobiles supporting simultaneous up- and downlink flows, the inter-mobile interference between the…
Realizing delay-capacity in intermittently connected mobile networks remains a largely open question, with state-of-the-art routing schemes typically focusing either on delay or on capacity. We show the feasibility of routing with both high…
The interplay between timeliness and rate efficiency is investigated in packet erasure broadcast channels with feedback. A scheduling framework is proposed in which coding actions, as opposed to users, are scheduled to attain desired…
In this paper, we have analyzed the effect of node mobility on the performance of AOMDV multipath routing protocol. This routing protocol in ad hoc network has been analyzed with random way point mobility model only. This is not sufficient…
The various routing protocols in Mobile Ad hoc Networks follow different strategies to send the information from one node to another. The nodes in the network are non static and they move randomly and are prone to link failure which makes…
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e.…
We study an online hypergraph matching problem with delays, motivated by ridesharing applications. In this model, users enter a marketplace sequentially, and are willing to wait up to $d$ timesteps to be matched, after which they will leave…
The increasing traffic demand in cellular networks has recently led to the investigation of new strategies to save precious resources like spectrum and energy. Direct device-to-device (D2D) communication becomes a promising solution if the…