{
  "id": "1111.1827",
  "version": "v1",
  "published": "2011-11-08T08:42:40.000Z",
  "updated": "2011-11-08T08:42:40.000Z",
  "title": "One-Hop Throughput of Wireless Networks with Random Connections",
  "authors": [
    "Seyed Pooya Shariatpanahi",
    "Babak Hossein Khalaj",
    "Kasra Alishahi",
    "Hamed Shah-Mansouri"
  ],
  "comment": "Submitted to IEEE Communications Letters",
  "categories": [
    "cs.IT",
    "math.IT"
  ],
  "abstract": "We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the throughput scaling of order $n^{1/3-\\delta}$, for any $\\delta>0$, is proposed, where $n$ is the number of nodes. Such achievable throughput, along with the order $n^{1/3}$ upper bound derived by Cui et al., characterizes the throughput capacity of one-hop schemes for the class of connection models with finite mean and variance.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-11-08T08:42:40.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "wireless networks",
      "one-hop throughput",
      "random connection model",
      "finite mean",
      "common distribution"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1111.1827P"
    }
  }
}