Buffer Scalability of Wireless Networks
Conference Paper

 Overview

 Research

 Identity

 Additional Document Info

 View All

Overview
abstract

We investigate the existence of scalable protocols that can achieve the capacity limit of c/ √N per sourcedestination pair in a large wireless network of N nodes when the buffer space of each node does not grow with the size of the network N. We show that there is no endtoend protocol that is capable of carrying out the limiting throughput of c/ √N with nodes that have constant buffer space. In other words, this limit is achievable only with devices whose buffers grow with the size of the network. On the other hand, we establish that there exists a protocol which realizes a slightly smaller throughput of c/ √N log N when devices have constant buffer space. Furthermore, we show that the required buffer space can be very small, capable of storing just a few packets. This is particularly important for wireless sensor networks where devices have limited resources. Finally, from a mathematical perspective, this paper furthers our understanding of the difficult problem of analyzing large queueing networks with finite buffers for which, in general, no explicit solutions are available. © 2006 IEEE.
author list (cited authors)

Jelenković, P. R., Momčilović, P., & Squillante, M. S.
publication date
publisher
published in
Research
keywords

Adhoc Wireless Network

Finite Buffer Queueing Network

Largescale Network

Scaling Laws

Wireless Sensor Network
Identity
Digital Object Identifier (DOI)
International Standard Book Number (ISBN) 10
International Standard Book Number (ISBN) 13
Additional Document Info