Balancing distance and lifetime in delay constrained ad hoc networks
This paper addresses the problem of optimizing the packet transmission schedule in an ad
hoc network with end-to-end delay constraints. The emphasis is to determine the proper …
hoc network with end-to-end delay constraints. The emphasis is to determine the proper …
Performance of multihop latency aware scheduling in delay constrained ad hoc networks
B Liang - … Conference on Communications, 2005. ICC 2005 …, 2005 - ieeexplore.ieee.org
This paper addresses the problem of optimizing packet transmission schedule at the
medium access control layer of an ad hoc network, in order to minimize the probability of …
medium access control layer of an ad hoc network, in order to minimize the probability of …
Packet prioritization in multihop latency aware scheduling for delay constrained communication
This paper addresses the problem of optimizing the packet transmission schedule in a
multihop wireless network with end-to-end delay constraints. The emphasis is to determine …
multihop wireless network with end-to-end delay constraints. The emphasis is to determine …
Scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints
This paper studies the problem of scheduling in single-hop wireless networks with real-time
traffic, where every packet arrival has an associated deadline and a minimum fraction of …
traffic, where every packet arrival has an associated deadline and a minimum fraction of …
Throughput-delay-reliability tradeoff in ad hoc networks
R Vaze - 8th International Symposium on Modeling and …, 2010 - ieeexplore.ieee.org
Delay-reliability (DR), and throughput-delay-reliability (TDR) tradeoffs in an ad hoc network
are derived for single hop and multi-hop transmission with automatic repeat request (ARQ) …
are derived for single hop and multi-hop transmission with automatic repeat request (ARQ) …
[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 …
Designing transmission schedules for wireless ad hoc networks to maximize network throughput
BJ Wolf, JL Hammond… - MILCOM 2005-2005 IEEE …, 2005 - ieeexplore.ieee.org
We present a method for maximizing the throughput of mobile ad hoc packet radio networks
using broadcast transmission scheduling. In such networks, a terminal may become a …
using broadcast transmission scheduling. In such networks, a terminal may become a …
On the delay limited capacity of ad hoc networks
E Perevalov, R Blum - Global Telecommunications Conference …, 2002 - ieeexplore.ieee.org
The problem of capacity of a wireless ad hoc network in the presence of a uniform end-to-
end delay constraint is explored. A general model for the random motion of the nodes is …
end delay constraint is explored. A general model for the random motion of the nodes is …
End-to-end delay in mobile ad hoc networks with generalized transmission range and limited packet redundancy
One of the challenging roadblocks stunting the development and commercialization of
mobile ad hoc networks (MANETs), is the lack of a thorough understanding of the …
mobile ad hoc networks (MANETs), is the lack of a thorough understanding of the …
Traffic allocation in delay-tolerant wireless ad hoc networks
MK Park, V Rodoplu - 2006 Wireless Telecommunications …, 2006 - ieeexplore.ieee.org
We analyze the problem of minimizing the energy required to send a faced amount of data
subject to delay constraints on portable networks. We develop a traffic allocation algorithm …
subject to delay constraints on portable networks. We develop a traffic allocation algorithm …