Related papers: The Carrier Pigeon Internet Protocol: An Algorithm…
Transmission Control Protocol (TCP) is the dominant reliable transport protocol utilized in the Internet. Improving the performance of TCP associated with the presence of multi-hop is one of the research challenges in wireless mesh…
A quantum network, which involves multiple parties pinging each other with quantum messages, could revolutionize communication, computing and basic sciences. The future internet will be a global system of various packet switching quantum…
In overlay networks, both local and long-distance links appear as a single hop to a routing protocol. Traditional routing metrics (based on hop count or packet loss) fail to take the differences between such links into account. In this…
The Internet has undergone dramatic changes in the past 15 years, and now forms a global communication platform that billions of users rely on for their daily activities. While this transformation has brought tremendous benefits to society,…
This paper analyzes the fundamental trade-offs that occur in the co-design of pilot resource allocations in orthogonal frequency-division multiplexing signals for both ranging (via time-of-arrival estimation) and communications. These…
We investigate the unicast problem for ad-hoc networks in the plane using MIMO techniques. In particular, we use the multi-node beamforming gain and present a self-synchronizing algorithm for the necessary carrier phase synchronization.…
We provide an analytical study of the impact of packet skipping and opportunistic network coding on the timely communication of messages through a single network element. In a first step, we consider a single-server queueing system with…
In a number of practical scenarios a wireless device needs to mark its presence, for instance, to some access point. That enables the access point to assign the device its transmission slot or update the count of the network nodes. Many…
Pairing is the most powerful tool in cryptography that maps two points on the elliptic curve to the group over the finite field. Mostly cryptographers consider pairing as a black box and use it for implementing pairing-based cryptographic…
Individuals traversing challenging obstacles are faced with a decision: they can adopt traversal strategies that minimally disrupt their normal locomotion patterns or they can adopt strategies that substantially alter their gait, conferring…
Flooding provides important control and route establishment functionality for a number of unicast and multicast protocols in Mobile Ad Hoc Networks. Considering its wide use as a building block for other network layer protocols, the…
This paper studies low-latency streaming codes for the multi-hop network. The source is transmitting a sequence of messages (streaming messages) to a destination through a chain of relays where each hop is subject to packet erasures. Every…
With the increasing demand and complexity of networks, factors such as balancing the load, improving the performance, reducing delay and finding optimal path between nodes in a computer network have become crucial. The traditional routing…
This paper addresses the fundamental characteristics of information exchange via multihop network coding over two-way relaying in a wireless ad hoc network. The end-to-end rate regions achieved by time-division multihop (TDMH), MAC-layer…
The quantum Internet relies on the ability to distribute entangled quantum bits (ebits) between quantum memories at the end nodes, to perform applications like blind or distributed quantum computing that are impossible if end nodes are…
Message passing neural networks (MPNNs) operate on graphs by exchanging information between neigbouring nodes. MPNNs have been successfully applied to various node-, edge-, and graph-level tasks in areas like molecular science, computer…
Nowadays distributed computing approach has become very popular due to several advantages over the centralized computing approach as it also offers high performance computing at a very low cost. Each router implements some queuing mechanism…
We study the efficiency of the gradient mechanism of message transfer in a $2-d$ communication network of regular nodes and randomly distributed hubs. Each hub on the network is assigned some randomly chosen capacity and hubs with lower…
This document gives a specification for the model used in [1]. It presents a simple way of optimizing mutual information between some input and the attractors of a (noisy) network, using a genetic algorithm. The nodes of this network are…
To account for the randomness of propagation channels and interference levels in hierarchical spectrum sharing, a novel approach to multihop routing is introduced for cognitive random access networks, whereby packets are randomly routed…