Paper Info
Title
Scalability of Wireless Networks
Abstract
This paper investigates the existence of scalable protocols that can achieve the capacity limit of c/radicN per source-destination 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. It is shown that there is no end-to-end protocol capable of carrying out the limiting throughput of c/radicN 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, the paper establishes that there exists a protocol which realizes a slightly smaller throughput of c/radicNlogN when devices have constant buffer space. Furthermore, it is shown 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, the 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
Year
DOI
Venue
2007
10.1109/TNET.2007.892846
Networking, IEEE/ACM Transactions
Keywords
Field
DocType
protocols,queueing theory,wireless sensor networks,capacity limit,finite buffers,queueing networks,scalable protocols,wireless network scalability,wireless sensor network,Ad hoc wireless networks,finite-buffer queueing networks,large-scale networks,local cooperation,scaling laws,wireless sensor networks
Wireless network,Computer science,Network packet,Computer network,Capacity limit,Queueing theory,Throughput,Wireless sensor network,Limiting,Distributed computing,Scalability
Journal
Volume
Issue
ISSN
15
2
1063-6692
Citations 
PageRank 
References 
10
1.15
12
Authors
3
Name
Order
Citations
PageRank
Predrag R. Jelenkovic121929.99
Petar Momčilović2868.14
Mark S. Squillante31366157.28