English
Related papers

Related papers: Achieving Non-Zero Information Velocity in Wireles…

200 papers

We study the stability of wireless networks under stochastic arrival processes of packets, and design efficient, distributed algorithms that achieve stability in the SINR (Signal to Interference and Noise Ratio) interference model.…

Networking and Internet Architecture · Computer Science 2012-10-18 Eyjolfur I. Asgeirsson , Magnus M. Halldorsson , Pradipta Mitra

We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this…

Data Structures and Algorithms · Computer Science 2019-07-01 Vincenzo Bonifaci , Peter Korteweg , Alberto Marchetti-Spaccamela , Leen Stougie

Micro-energy harvesting wireless network (MEHWN) enables a perpetual network deployment that cannot be achieved in traditional battery-operated counterparts. Despite its sustainability, end-to-end delay in an MEHWN could be very large, due…

Networking and Internet Architecture · Computer Science 2019-08-21 Qi Chen , Qing Yang

In networks of mobile autonomous agents, e.g. for data acquisition, we may wish to maximize data transfer or to reliably transfer a minimum amount of data, subject to quality of service or energy constraints. These requirements can be…

Information Theory · Computer Science 2020-01-14 Omar James Faqir , Eric C. Kerrigan , Deniz Gündüz

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

This paper presents a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks. We derive a new unified multi-parameter cut-set bound on the capacity of networks of arbitrary…

Information Theory · Computer Science 2013-05-02 Georgios Rodolakis

We investigate the use of network coding for information dissemination over a wireless network. Using network coding allows for a simple, distributed and robust algorithm where nodes do not need any information from their neighbors. In this…

Information Theory · Computer Science 2016-11-18 Mohammad Hamed Firooz , Sumit Roy

Practical wireless networks are finite, and hence non-stationary with nodes typically non-homo-geneously deployed over the area. This leads to a location-dependent performance and to boundary effects which are both often neglected in…

Information Theory · Computer Science 2014-01-03 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral

We study the problem of geometric optimization of medium access control in multi-hop wireless network. We discuss the optimal placements of simultaneous transmitters in the network and our general framework allows us to evaluate the…

Information Theory · Computer Science 2012-08-02 Salman Malik , Philippe Jacquet , Cedric Adjih

We present a controller and transmission policy design procedure for nonlinear wireless networked control systems. Our objective is to ensure the stability of the closed-loop system, in a stochastic sense, together with given control…

Systems and Control · Electrical Eng. & Systems 2022-07-06 Vineeth S. Varma , Romain Postoyan , Daniel E. Quevedo , Irinel-Constantin Morarescu

The effect of signals on stability, throughput region, and delay in a two-user slotted ALOHA based random-access system with collisions is considered. This work gives rise to the development of random access G-networks, which can model…

Information Theory · Computer Science 2019-02-08 Ioannis Dimitriou , Nikolaos Pappas

In this letter, we characterize the performance of broadcast approach with continuum of transmission layers in random wireless networks where the channel state information (CSI) is assumed to be known only at the receiver. By modeling the…

Information Theory · Computer Science 2019-04-09 Praful D. Mankar , Harpreet S. Dhillon

A novel solution is proposed to undertake a frequent task in wireless networks, which is to let all nodes broadcast information to and receive information from their respective one-hop neighboring nodes. The contribution is two-fold. First,…

Information Theory · Computer Science 2015-03-17 Lei Zhang , Dongning Guo

We consider a line network of nodes, connected by additive white Gaussian noise channels, equipped with local feedback. We study the velocity at which information spreads over this network. For transmission of a data packet, we give an…

Information Theory · Computer Science 2024-10-28 Elad Domanovitz , Anatoly Khina , Tal Philosof , Yuval Kochman

We consider a multihop wireless system. There are multiple source-destination pairs. The data from a source may have to pass through multiple nodes. We obtain a channel scheduling policy which can guarantee end-to-end mean delay for the…

Networking and Internet Architecture · Computer Science 2018-11-27 Ashok Krishnan K. S. , Vinod Sharma

Despite the long history of research on slotted ALOHA, the exact analysis of the average delay is still in question as the performance of each node is coupled with the activity of other nodes. In this paper, we consider a network comprised…

Systems and Control · Electrical Eng. & Systems 2023-07-13 Seyed Ali Hashemian , Farid Ashtiani

A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…

Information Theory · Computer Science 2012-05-23 Rahul Vaze

The notion of age-of-information (AoI) is investigated in the context of large-scale wireless networks, in which transmitters need to send a sequence of information packets, which are generated as independent Bernoulli processes, to their…

Information Theory · Computer Science 2020-12-24 Howard H. Yang , Chao Xu , Xijun Wang , Daquan Feng , Tony Q. S. Quek

We quantify the throughput capacity of wireless multi-hop networks with several medium access schemes. We analyze pure ALOHA scheme where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion…

Networking and Internet Architecture · Computer Science 2011-11-10 Salman Malik , Philippe Jacquet , Cedric Adjih

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi