Throughput-storage tradeoff in ad hoc networks
Throughput-storage tradeoff in ad hoc networks
复制标题
DOI：
10.1109/infcom.2005.1498538
复制
发表时间：
2005-03
期刊：
影响因子：
--
通讯作者：
Jeffrey D. Herdtner;E. Chong
中科院分区：
文献类型：
--
作者：
Jeffrey D. Herdtner;E. Chong
Gupta和Kumar（2000）证明了具有n个随机位置节点的静态ad hoc网络的吞吐量容量为/spl Theta/（/spl radic/（n/log n））。Grossglauser和Tse表明，节点移动性将容量增加到/spl Theta/（n），这是一个实质性的改进。实现最大容量需要节点通过其他节点中继传输。每个节点都必须有一个中继缓冲区，用于在将数据包转发到目的地之前临时存储数据包。我们建立，如果中继缓冲区的大小是有界的一个常数以上，那么移动性并没有大幅增加的吞吐量容量的移动的ad hoc网络。特别是，我们证明了有限缓冲区的移动的网络的容量是最多/spl θ/（/spl radic/n）。最后，我们建立了一个标度律的关系，表征吞吐量容量和中继缓冲区大小之间的根本权衡。特别是，我们表明，吞吐量的能力是最多/spl θ/（/spl radic/（nb/sub n/）），其中B/sub n/是中继缓冲区的大小。
Gupta and Kumar (2000) showed that the throughput capacity of static ad hoc networks with n randomly positioned nodes is /spl Theta/(/spl radic/(n/log n)). Grossglauser and Tse showed that node mobility increases the capacity to /spl Theta/(n), a substantial improvement. Achieving maximum capacity requires nodes to relay transmissions through other nodes. Each node must have a relay buffer for temporarily storing packets before forwarding them to their destination. We establish that if relay buffer sizes are bounded above by a constant, then mobility does not substantially increase the throughput capacity of mobile ad hoc networks. In particular, we show that the capacity of mobile networks with finite buffers is at most /spl Theta/(/spl radic/n). Finally we establish a scaling law relationship that characterizes the fundamental tradeoff between throughput capacity and relay buffer size. In particular, we show that the throughput capacity is at most /spl Theta/(/spl radic/(nb/sub n/)), where b/sub n/ is the size of the relay buffers.