Backpressure routing

In queueing theory, a discipline within the mathematical theory of probability, the backpressure routing algorithm is a method for directing traffic… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2006-2018
051020062018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The increase of demand for mobile data services requires a massive network densification. A cost-effective solution to this… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
In this work, we explore the performance of backpressure routing and scheduling for TCP flows over wireless networks. TCP and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We study routing and scheduling algorithms for relay-assisted, multi-channel downlink wireless networks (e.g., OFDM-based… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Backpressure routing and scheduling, with throughput-optimal operation guarantee, is a promising technique to improve throughput… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Wireless sensor networks are increasingly being deployed in real-world applications ranging from energy monitoring to water-level… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
2012
2012
We suggest and analyze algorithms for routing in ad-hoc networks that exploit mutual-information accumulation at receiving nodes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We… (More)
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In this paper we consider an alternative, highly agile In this paper we consider an alternative, highly agile approach called… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider the problem of optimal scheduling and routing in an ad-hoc wireless network with multiple traffic streams and time… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 5
Is this relevant?