activity
20062018
most citedInterference Functionals in Poisson Networks

63 citations · 158 across the 6 of their papers we have counts for

collaborators

7 papers

cs.IT2018★ 1 cited

A Simple Network of Nodes Moving on the Circle

Dimitris Cheliotis, Ioannis Kontoyiannis, Michail Loulakis +1

Two simple Markov processes are examined, one in discrete and one in continuous time, arising from idealized versions of a transmission protocol for mobile, delay-tolerant networks…

cs.IT2018

Packet Speed and Cost in Mobile Wireless Delay-Tolerant Networks

Riccardo Cavallari, Stavros Toumpis, Roberto Verdone +1

A mobile wireless delay-tolerant network (DTN) model is proposed and analyzed, in which infinitely many nodes are initially placed on R^2 according to a uniform Poisson point proce…

cs.IT2014★ 63 cited

Interference Functionals in Poisson Networks

Udo Schilcher, Stavros Toumpis, Martin Haenggi +3

We propose and prove a theorem that allows the calculation of a class of functionals on Poisson point processes that have the form of expected values of sum-products of functions.…

cs.NI2013★ 1 cited

Packet Travel Times in Wireless Relay Chains under Spatially and Temporally Dependent Interference

Alessandro Crismani, Udo Schilcher, Stavros Toumpis +2

We investigate the statistics of the number of time slots that it takes a packet to travel through a chain of wireless relays. Derivations are performed assuming an interferenc…

cs.IT2013★ 38 cited

Cooperative Relaying in Wireless Networks under Spatially and Temporally Correlated Interference

Alessandro Crismani, Udo Schilcher, Günther Brandner +2

We analyze the performance of an interference-limited, decode-and-forward, cooperative relaying system that comprises a source, a destination, and relays, placed arbitrarily on…

cs.NI2007★ 19 cited

Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic

Stavros Toumpis

We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results…

cs.NI2006★ 36 cited

Opti{c,m}al: Optical/Optimal Routing in Massively Dense Wireless Networks

R. Catanuto, S. Toumpis, G. Morabito

We study routing for massively dense wireless networks, i.e., wireless networks that contain so many nodes that, in addition to their usual microscopic description, a novel macrosc…