Name
Abstract | ||
|---|---|---|
In this paper, we study the delay/throughput trade- off with opportunistic relaying over channels with random connections, in which the channel connections are independent and identically distributed (i.i.d.). Previous work which proposed an opportunistic relaying scheme has focused on the throughput analysis only, we show that the opportunistic relaying scheme provides an upper bound of O(n) delay, including full effects of queueing in the network model. In addition, we use the redundant scheduling algorithm to reduce the upper bound of delay scaling to O(n/√(log n)). Furthermore, we prove two key inequalities that capture the various tradeoffs inherent in the broad class of opportunistic relaying protocols, which indicate the tradeoff of delay/throughput ≥ O(n/log n), illustrating that no scheduling and routing algorithm can simultaneously yield lower delay and higher throughput. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/GLOCOM.2011.6134561 | GLOBECOM |
Keywords | Field | DocType |
protocols,scheduling,delay-throughput trade-off analysis,opportunistic relaying scheme,redundant scheduling algorithm,queueing theory,wireless networks,delays,radio networks,opportunistic relaying protocols,wireless channels,upper bound,delay scaling,independent and identically distributed,network model,scheduling algorithm,ad hoc network,wireless network,redundancy,ad hoc networks,throughput | Wireless network,Scheduling (computing),Computer science,Upper and lower bounds,Computer network,Communication channel,Real-time computing,Queueing theory,Independent and identically distributed random variables,Throughput,Wireless ad hoc network | Conference |
ISSN | ISBN | Citations |
1930-529X E-ISBN : 978-1-4244-9267-1 | 978-1-4244-9267-1 | 2 |
PageRank | References | Authors |
0.40 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yufeng Wang | 1 | 76 | 6.43 |
| Shengshan Cui | 2 | 26 | 3.66 |
| Ravi Sankar | 3 | 656 | 55.66 |
| Salvatore D. Morgera | 4 | 220 | 25.66 |