We investigate the existence of scalable protocols that can achieve the capacity limit of 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 end-to-end protocol that is capable of carrying out the limiting throughput of
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
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 in 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.
By: Predrag R. Jelenkovic; Petar Momcilovic; Mark S. Squillante
Published in: RC23781 in 2005
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .