Capacity Estimation of Peer-to-Peer Networks based on a Flow Deviation Approach
Michael Tan, Anthony S. Acampora · 2007
We consider a wireless network with n peer-to-peer nodes that are randomly distributed over some service area. Given the traffic and channel gain matrix, we use the flow deviation (FD) method to find an upper bound on the achievable capacity of the network, assuming no interference. In addition, we show that the achievable capacity without interference is lower- bounded by 2/3 of the upper bound in special cases and 1/3 of the upper bound in the worst case.