English
Related papers

Related papers: Centralized Versus Distributed Routing for Large-S…

200 papers

This paper presents a comparison of cluster-based position and non position-based routing protocols for mobile wireless sensor networks to outline design considerations of protocols for mobile environments. The selected protocols are…

Networking and Internet Architecture · Computer Science 2014-03-14 Shahzad Ali , Sajjad A. Madani , Atta ur Rehman Khan , Imran Ali Khan

The main goal of routing protocol is to efficiency delivers data from source to destination. All routing protocols are the same in this goal, but the way they adopt to achieve it is different, so routing strategy has an egregious role on…

Networking and Internet Architecture · Computer Science 2008-02-06 Kazem Jahanbakhsh , Marzieh Hajhosseini

In this work, we design and analyze novel distributed scheduling algorithms for multi-user MIMO systems. In particular, we consider algorithms which do not require sending channel state information to a central processing unit, nor do they…

Information Theory · Computer Science 2015-03-20 Joseph Kampeas , Asaf Cohen , Omer Gurewitz

As applications become more distributed to improve user experience and offer higher availability, businesses rely on geographically dispersed datacenters that host such applications more than ever. Dedicated inter-datacenter networks have…

Networking and Internet Architecture · Computer Science 2019-08-30 Mohammad Noormohammadpour

In wireless sensor networks (WSNs), the opportunistic routing has better performances on packet delivery probability than the deterministic routing. For reducing the transmission delay and duplicate transmission in opportunistic routing,…

Networking and Internet Architecture · Computer Science 2019-12-18 Ning Li , Alex X. Liu , Jose-Fernan Martinez-Ortega , Vicente Hernandez Diaz , Xin Yuan

Large scale decentralized communication systems have introduced the new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among…

Computational Geometry · Computer Science 2009-03-31 M. Ghaffari , B. Hariri , S. Shirmohammadi

Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput-optimality, these algorithms can either…

Networking and Internet Architecture · Computer Science 2016-04-04 Mehmet Karaca , Bjorn Landfeldt

The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve over time.To address this issue, bandwidth sharing techniques…

Networking and Internet Architecture · Computer Science 2017-11-28 Zaid Allybokus , Konstantin Avrachenkov , Jérémie Leguay , Lorenzo Maggi

Resilient routing in large-scale Low Earth Orbit (LEO) satellite networks remains a key challenge due to frequent and unpredictable link and node failures, potentially in response to cybersecurity breaches. While prior work has explored…

Networking and Internet Architecture · Computer Science 2025-09-15 Lyubomir Yanev , Pietro Ronchetti , Joshua Smailes , Martin Strohmeier

We develop new routing algorithms for a quantum network with noisy quantum devices such that each can store a small number of qubits. We thereby consider two models for the operation of such a network. The first is a continuous model, in…

Quantum Physics · Physics 2019-07-29 Kaushik Chakraborty , Filip Rozpedek , Axel Dahlberg , Stephanie Wehner

Recent technological advancements in satellite based quantum communication has made it a promising technology for realizing global scale quantum networks. Due to better loss distance scaling compared to ground based fiber communication,…

Quantum Physics · Physics 2022-05-27 Nitish K. Panigrahy , Prajit Dhara , Don Towsley , Saikat Guha , Leandros Tassiulas

This paper presents a new approach in the management of mobile ad hoc networks. Our alternative, based on mobile agent technology, allows the design of mobile centralized server in ad hoc network, where it is not obvious to think about a…

Networking and Internet Architecture · Computer Science 2010-07-15 Youcef Zafoune , Aicha Mokhtari , Rushed kanawati

Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information about the location of the destination. When the distance…

Information Theory · Computer Science 2007-07-13 Sundar Subramanian , Sanjay Shakkottai

In the paper, we investigate the delay-aware data transmission in renewable energy aided multi-carrier system. Besides utilizing the local renewables, the transmitter can also purchase grid power. By scheduling the amount of transmitted…

Information Theory · Computer Science 2015-07-07 Tian Zhang

In-network caching is likely to become an integral part of various networked systems (e.g., 5G networks, LPWAN and IoT systems) in the near future. In this paper, we compare and contrast model-based and machine learning approaches for…

Networking and Internet Architecture · Computer Science 2020-04-16 Adita Kulkarni , Anand Seetharam

We design dynamic routing policies for an overlay network which meet delay requirements of real-time traffic being served on top of an underlying legacy network, where the overlay nodes do not know the underlay characteristics. We pose the…

Networking and Internet Architecture · Computer Science 2019-04-19 Rahul Singh , Eytan Modiano

Caching is crucial in hybrid satellite-terrestrial networks to reduce latency, optimize throughput, and improve data availability by storing frequently accessed content closer to users, especially in bandwidth-limited satellite systems,…

Signal Processing · Electrical Eng. & Systems 2025-10-07 Zhou Zhang , Yizhu Wang , Saman Atapattu , Sumei Sun

A key technical requirement of any future quantum network is the ability to distribute quantum-entangled resources between two spatially separated points at a high rate and high fidelity. Entanglement distribution protocols based on…

Quantum Physics · Physics 2026-02-03 Nicholas Zaunders , Timothy C. Ralph

Consider a communication network with a source, a relay and a destination. Each time interval, the source may dynamically choose between a few possible coding schemes, based on the channel state, traffic pattern and its own queue status.…

Information Theory · Computer Science 2017-02-09 Asaf Cohen , Dennis Goeckel , Omer Gurewitz , Daniel S. Menasche , Mark Shifrin

In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the…

Information Theory · Computer Science 2015-03-20 Nikola Zlatanov , Robert Schober , Petar Popovski
‹ Prev 1 4 5 6 7 8 10 Next ›