Name
Title | ||
|---|---|---|
A Wireless Network Can Achieve Maximum Throughput Without Each Node Meeting All Others |
Abstract | ||
|---|---|---|
We study throughput scaling of an ad-hoc network where the nodes are restricted to move on vertical or horizontal lines on a square. A constant throughput is asymptotically achievable by the proposed scheduling algorithm, using in certain cases more than two hops strategies, without requiring each node to become the nearest neighbor of every other node. Hence the throughput result for one-dimensional mobility obtained by Diggavi et al. in Proc. IEEE ISIT, 2002 still holds under stricter mobility constraints. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ISIT.2005.1523720 | 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2 |
Keywords | Field | DocType |
nearest neighbor,ad hoc network,ad hoc networks,wireless network,scheduling,scheduling algorithm | k-nearest neighbors algorithm,Wireless network,Computer science,Scheduling (computing),Computer network,Maximum throughput scheduling,Throughput,Wireless ad hoc network,Scaling,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aurelie C. Lozano | 1 | 145 | 20.21 |
| S. R. Kulkarni | 2 | 2105 | 360.73 |