Abstract

AbstractWe address large, random network topologies that are typical in ad hoc and sensor networks. In these systems we need at least two different types of scalability. First, we want that with growing network size the topology remains connected, so that communication is possible between nodes. Second, it is also necessary that the individual nodes can operate with limited energy and complexity, which requires that the number of neighbors of any node remains bounded. Unfortunately, these global vs. local scalability requirements conflict with each other, as it is known, under very general conditions, that full connectivity can only be achieved with infinitely growing node degrees. Therefore, it is important to quantify how large part of the random topology can be still expected to belong to a connected component if the nodes are confined to some bounded degree. We investigate this issue in a model that is more general than previously investigated random wireless network topology models. In our general model we derive an asymptotically optimal trade-off between node degrees and the fraction of nodes that form a connected component.KeywordsScalabilitynetwork topologyconnectivitynode degrees

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.