Network capacity region and minimum energy function for a delay-tolerant mobile ad hoc network

Authors:
Rahul Urgaonkar;Michael J. Neely
Affiliations:
Department of Electrical Engineering, University of Southern California, Los Angeles, CA;Department of Electrical Engineering, University of Southern California, Los Angeles, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 11
Cited 0

Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Impact of interference on multi-hop wireless network performance

Proceedings of the 9th annual international conference on Mobile computing and networking
Dynamic power allocation and routing for satellite and wireless networks with time varying channels

Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels

IEEE/ACM Transactions on Networking (TON)
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network coding applications

Foundations and Trends® in Networking
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the super-critical regime

IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks

IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks

IEEE Transactions on Information Theory
Stability and capacity of regular wireless networks

IEEE Transactions on Information Theory
Capacity of wireless erasure networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate two quantities of interest in a delay-tolerant mobile ad hoc network: the network capacity region and the minimum energy function. The network capacity region is defined as the set of all input rates that the network can stably support considering all possible scheduling and routing algorithms. Given any input rate vector in this region, the minimum energy function establishes the minimum time-average power required to support it. In this paper, we consider a cell-partitioned model of a delay-tolerant mobile ad hoc network with general Markovian mobility. This simple model incorporates the essential features of locality of wireless transmissions as well as node mobility and enables us to exactly compute the corresponding network capacity and minimum energy function. Furthermore, we propose simple schemes that offer performance guarantees that are arbitrarily close to these bounds at the cost of an increased delay.