• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

DMCA

Capacity of Ad Hoc Wireless Networks

Cached

  • Download as a PDF

Download Links

  • [www.comp.nus.edu.sg]
  • [www.cs.cornell.edu]
  • [amsterdam.lcs.mit.edu]
  • [www.pdos.lcs.mit.edu]
  • [www.pdos.csail.mit.edu]
  • [www.cs.cornell.edu]
  • [www.cse.sc.edu]
  • [pdos.csail.mit.edu]
  • [pdos.csail.mit.edu]
  • [pdos.csail.mit.edu]
  • [pdos.csail.mit.edu]
  • [www.comp.nus.edu]
  • [pdos.csail.mit.edu]
  • [pdos.csail.mit.edu]
  • [www.lcdf.org]
  • [pdos.csail.mit.edu]
  • [pdos.lcs.mit.edu]
  • [pdos.csail.mit.edu]
  • [pdos.csail.mit.edu]
  • [www.pdos.lcs.mit.edu]
  • [www.news.cs.nyu.edu]
  • [www.news.cs.nyu.edu]
  • [www.news.cs.nyu.edu]
  • [www.ai.mit.edu]
  • [www.csl.mtu.edu]
  • [ssal.cs.purdue.edu]
  • [pecolab.colorado.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jinyang Li , Charles Blake , Douglas S. J. De Couto , Hu Imm Lee , Robert Morris
Citations:634 - 14 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Li_capacityof,
    author = {Jinyang Li and Charles Blake and Douglas S. J. De Couto and Hu Imm Lee and Robert Morris},
    title = { Capacity of Ad Hoc Wireless Networks},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examines these factors alone and in combination, using simulation and analysis from first principles. Our results include both specific constants and general scaling relationships helpful in understanding the limitations of wireless ad hoc networks. We examine interactions of the 802.11 MAC and ad hoc forwarding and the effect on capacity for several simple configurations and traffic patterns. While 802.11 discovers reasonably good schedules, we nonetheless observe capacities markedly less than optimal for very simple chain and lattice networks with very regular traffic patterns. We validate some simulation results with experiments. We also show that the traffic pattern determines whether an ad hoc network’s per node capacity will scale to large networks. In particular, we show that for total capacity to scale up with network size the average distance between source and destination nodes must remain small as the network grows. Non-local traffic patterns in which this average distance grows with the network size result in a rapid decrease of per node capacity. Thus the question “Are large ad hoc networks feasible?” reduces to a question about the likely locality of communication in such networks.

Keyphrases

ad hoc wireless network    traffic pattern    network size    average distance    node capacity    wireless ad hoc network    large network    likely locality    total capacity    network grows    destination node    local radio interaction    question large ad hoc network    first principle    good schedule    ad hoc network    ad hoc forwarding    simple chain    others packet    several simple configuration    regular traffic pattern    simulation result    lattice network    rapid decrease    early simulation experience    non-local traffic pattern    network size result    specific constant    achievable capacity   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University