Computation of core capacity of wireless ad hoc networks

The core capacity region of energy-limited wireless ad hoc networks is defined as the set of achievable utility vectors that cannot be blocked by any coalition of the set of nodes. The core capacity region has been previously proved to be non-empty. In this paper, we present an algorithm to compute a utility vector in the core capacity region of wireless ad hoc networks. Our algorithm has a significantly smaller computational complexity than the application of Scarf´s algorithm or the polyhedral Scarf algorithm to this problem and can be used to assess the capacity of ad hoc networks that can grow from small wireless islands such as Wi-Fi hotspots to a grand wireless network in the future.