Proceedings of the 9th Annual International Conference on Mobile Computing and Networking 2003
DOI: 10.1145/938985.938991
|View full text |Cite
|
Sign up to set email alerts
|

Characterizing achievable rates in multi-hop wireless networks

Abstract: This paper considers the problem of determining the achievable rates in multi-hop wireless networks. We consider the problem of jointly routing the flows and scheduling transmissions to achieve a given rate vector. We develop tight necessary and sufficient conditions for the achievability of the rate vector. We develop efficient and easy to implement Fully Polynomial Time Approximation Schemes for solving the routing problem. The scheduling problem is a solved as a graph edge-coloring problem. We show that thi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
236
0

Year Published

2006
2006
2011
2011

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 271 publications
(237 citation statements)
references
References 13 publications
1
236
0
Order By: Relevance
“…System model. We take inspiration from the multi-commodity network design problem [55], a formulation already applied to throughput and capacity problems in wireless networks [29], [33]. We consider a directed graph (e.g., representing a transportation network) with node set N and arc set A, and a set of commodities C (e.g., goods).…”
Section: System Model and Optimal Solutionmentioning
confidence: 99%
“…System model. We take inspiration from the multi-commodity network design problem [55], a formulation already applied to throughput and capacity problems in wireless networks [29], [33]. We consider a directed graph (e.g., representing a transportation network) with node set N and arc set A, and a set of commodities C (e.g., goods).…”
Section: System Model and Optimal Solutionmentioning
confidence: 99%
“…[21] studies 27 joint congestion control and media access control for ad hoc wireless network, and formulates rate allocation as a utility maximization problem with the constraints that arise from contention for channel access. [22] uses a similar model to study this problem by jointly routing the flows and scheduling the transmissions to determine the achievable rates in multi-hop wireless networks. To sum up, all these works focus on the interaction between link and network layers, and try to characterize the achievable rate region at network layer.…”
Section: Related Workmentioning
confidence: 99%
“…The third constraint is the node capacity constraint in which the sum of the ingoing and outgoing flows should be less than the channel capacity. This is a necessary condition for scheduling feasibility [7]. Note that the node capacity constraint does not include any interference terms thanks to the beamforming antennas.…”
Section: The Lp Formulationmentioning
confidence: 99%
“…al. [7] studied the joint routing and scheduling problem to achieve a given rate vector. In the context of smart antennas, Yi et.…”
Section: Introductionmentioning
confidence: 99%