We investigate the issue of path selection in multi-hop wireless networks with the goal of identifying a scheme that can select a path with the largest expected duration. To this end we first study the distribution of path duration. We show that, under a set of mild conditions, when the hop count along a path is large, the distribution of path duration can be well approximated by an exponential distribution even when the distributions of link durations are dependent and heterogeneous. Secondly, we investigate the statistical relation between a path duration and the durations of the links along the path. We prove that the parameter of the exponential distribution, which determines the expected duration of the path, is related to the link dur...
In this paper, we address the multicast routing problem for mobile ad hoc networks (MANETs). We pres...
While active queue management (AQM) mechanisms such as Random Early Detection (RED) are widely deplo...
We investigate how quickly phase transitions can occur in one-dimensional geometric random graph mod...
Abstract — We investigate the issue of path selection in multihop wireless networks with the goal of...
The performance of routing protocols in wireless ad-hoc networks is determined by a number of factor...
A theoretical analysis has shown that under a set of assumptions, the distribution of path duration ...
We first study the distribution of path duration in multi-hop wireless networks. We show that as the...
We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in w...
The Adaptive RED proposed by Feng is shown to have small packetdelay and queue length variation for ...
We study the resequencing delay caused by multipath routing. We use a queueing model which consists ...
Recent advances have resulted in queue-based algorithms for medium access control which operate in a...
In this paper we propose an algorithm for design and on the fly modification of the schedule of an a...
In this paper we address the problem of providing full connectivity in large (wide area) ad hoc netw...
Crump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing individuals to live for an ...
Recent research on opportunistic schedulers for wireless data transmissionhas shown that link utiliz...
In this paper, we address the multicast routing problem for mobile ad hoc networks (MANETs). We pres...
While active queue management (AQM) mechanisms such as Random Early Detection (RED) are widely deplo...
We investigate how quickly phase transitions can occur in one-dimensional geometric random graph mod...
Abstract — We investigate the issue of path selection in multihop wireless networks with the goal of...
The performance of routing protocols in wireless ad-hoc networks is determined by a number of factor...
A theoretical analysis has shown that under a set of assumptions, the distribution of path duration ...
We first study the distribution of path duration in multi-hop wireless networks. We show that as the...
We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in w...
The Adaptive RED proposed by Feng is shown to have small packetdelay and queue length variation for ...
We study the resequencing delay caused by multipath routing. We use a queueing model which consists ...
Recent advances have resulted in queue-based algorithms for medium access control which operate in a...
In this paper we propose an algorithm for design and on the fly modification of the schedule of an a...
In this paper we address the problem of providing full connectivity in large (wide area) ad hoc netw...
Crump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing individuals to live for an ...
Recent research on opportunistic schedulers for wireless data transmissionhas shown that link utiliz...
In this paper, we address the multicast routing problem for mobile ad hoc networks (MANETs). We pres...
While active queue management (AQM) mechanisms such as Random Early Detection (RED) are widely deplo...
We investigate how quickly phase transitions can occur in one-dimensional geometric random graph mod...