Mesh Networks: Fundamental Limits
We continue with our analysis of ad hoc internets. In the previous chapter we were concerned with routing and transmission scheduling to support point-to-point flows. We had assumed that the network graph was given and that it was connected. We had also assumed that the set of allowable link activation vectors was given. Since these can be derived from the node locations, we essentially assumed that the latter were given. In this chapter we will explore the limits of two fundamental properties of wireless networks—connectivity and capacity—without assuming that the node locations are known. For a random deployment, we will first derive the requirement to make the network connected. In the connectivity ...
Get Wireless Networking now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
