Loading...

One-hop throughput of wireless networks with random connections

Shariatpanahi, S. P ; Sharif University of Technology | 2012

496 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/WCL.2012.031912.120084
  3. Publisher: 2012
  4. Abstract:
  5. 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. In a wireless network with n nodes, a simple one-hop scheme achieving the throughput scaling of order n 1/3-δ, for any arbitrarily small δ > 0, is proposed. This scheme is based on maximizing the number of successful concurrent transmissions. Such achievable throughput, along with the order n 1/3 upper bound derived by Cui et al., characterizes the throughput of one-hop schemes for the class of connection models with distribution having finite mean and variance
  6. Keywords:
  7. Achievable throughput ; Random connection model ; Wireless networks ; Concurrent transmission ; Connection model ; Upper Bound ; Wireless networks ; Throughput
  8. Source: IEEE Wireless Communications Letters ; Volume 1, Issue 3 , 2012 , Pages 205-208 ; 21622337 (ISSN)
  9. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175029