Capacity of multi-channel wireless networks with random (c, f) assignment

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 = O(logn), and each node has a single interface assigned a random f subset of channels, the capacity is (W f cnlogn ) and O(W prnd nlogn ), and conjectured that capacity is (W prnd nlogn ). We now present a lower bound construction that yields capacity (W prnd nlogn ) for all c = O(logn) and 2 f c. This establishes the capacity under random (c, f ) assignment as (W prnd nlogn ). The surprising implication of this result is that when f = ( c), random (c, f ) assignment yields capacity of the same order as attainable via unconstrained switching. Also of interest is the routing/scheduling procedure we utilize to achieve capacity, which marks a significant point of departure from the construction used to obtain the previous lower bound of (W f cnlogn ). This procedure requires synchr...

• Type: Conference
• Year: 2007
• Where: MOBIHOC
• Authors: Vartika Bhandari, Nitin H. Vaidya
• Keywords: Assignment Yields Capacity, MOBIHOC 2007, Transport Capacity, W Prnd Nlogn, Wireless Networks