The local delay in mobile Poisson networks
For communication between two neighboring nodes in wireless networks, the local delay is
defined as the time it takes a node to successfully transmit a packet. Previous research …
defined as the time it takes a node to successfully transmit a packet. Previous research …
Local delay in static and highly mobile Poisson networks with ALOHA
M Haenggi - 2010 IEEE International Conference on …, 2010 - ieeexplore.ieee.org
Communication between two neighboring nodes is the most basic operation in wireless
networks. Yet very little research has focused on the local delay, defined as the mean time it …
networks. Yet very little research has focused on the local delay, defined as the mean time it …
Local delay in Poisson networks with and without interference
M Haenggi - 2010 48th Annual Allerton Conference on …, 2010 - ieeexplore.ieee.org
Communication between two neighboring nodes is the most basic operation in wireless
networks. Yet very little research has focused on the local delay, defined as the mean time it …
networks. Yet very little research has focused on the local delay, defined as the mean time it …
The local delay in Poisson networks
M Haenggi - IEEE Transactions on Information Theory, 2012 - ieeexplore.ieee.org
Communication between two neighboring nodes is a very basic operation in wireless
networks. Yet very little research has focused on the local delay in networks with randomly …
networks. Yet very little research has focused on the local delay in networks with randomly …
The delay-optimal number of hops in poisson multi-hop networks
K Stamatiou, M Haenggi - 2010 IEEE International Symposium …, 2010 - ieeexplore.ieee.org
We study the delay and throughput in a wireless multihop network with sources that form a
Poisson point process and relays which are placed equidistantly on the source-destination …
Poisson point process and relays which are placed equidistantly on the source-destination …
[PDF][PDF] On achievable delay/capacity trade-offs in mobile ad hoc networks
G Sharma, R Mazumdar - Proc. IEEE WiOpt, 2004 - ece.uwaterloo.ca
Recent work of Gupta and Kumar (2000) has shown that in a multi-hop wireless network the
throughput capacity per source-destination pair goes to zero as the node density increases …
throughput capacity per source-destination pair goes to zero as the node density increases …
Bounds on the information propagation delay in interference-limited aloha networks
In a wireless network, the set of transmitting nodes changes frequently because of the MAC
scheduler and the traffic load. Analyzing the connectivity of such a network using static …
scheduler and the traffic load. Analyzing the connectivity of such a network using static …
A delay-minimizing routing strategy for wireless multi-hop networks
K Stamatiou, F Rossetto, M Haenggi… - … on Modeling and …, 2009 - ieeexplore.ieee.org
We consider a network where each route comprises a backlogged source, a number of
relays and a destination at a finite distance. The locations of the sources and the relays are …
relays and a destination at a finite distance. The locations of the sources and the relays are …
[PDF][PDF] Delay and capacity tradeoffs for wireless ad hoc networks with random mobility
G Sharma, RR Mazumdar - Submitted for publication, 2004 - Citeseer
In this paper, we study the delay and capacity trade-offs for wireless ad hoc networks with
random mobility. We consider some simple distributed scheduling and relaying protocols …
random mobility. We consider some simple distributed scheduling and relaying protocols …
Throughput and delay in random wireless networks with restricted mobility
J Mammen, D Shah - IEEE Transactions on Information Theory, 2007 - ieeexplore.ieee.org
Grossglauser and Tse (2001) introduced a mobile random network model where each node
moves independently on a unit disk according to a stationary uniform distribution and …
moves independently on a unit disk according to a stationary uniform distribution and …