Capacity of Multi-Channel Wireless Networks with Random Channel Assignment: A Tight Bound
ILLINOIS UNIV AT URBANA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
The issue of transport capacity of a randomly deployed wireless network under random c, f channel assignment was considered by us in 1. We showed in 1 that when the number of available channels is c Olog n, and each node has a single interface assigned a random f subset of channels, the capacity is OmegaW x square root of fcn log n and OW x square root of Prndn log n, and conjectured that optimal capacity was ThetaW x square root of PrndN log n. We now present a lower bound construction that yields capacity OmegaW x square root of Prndn log n whenever f 101 log 1925 log cf. Thus for values of c and f that satisfy f 101 log 1925 log cf, the optimal capacity under random c,f assignment is proved to be ThetaW x square root of Prndn log n. n log n . We conjecture that this would be the case for all 2 f c for any given c Olog n.
- Computer Systems
- Computer Systems Management and Standards