Abstract
This paper discusses stochastic characteristics of hierarchical multi?hop wireless networks. It is assumed that terminals and base stations are distributed according to specific distributions, respectively. It is also assumed that a multi?hop wireless network is logically divided into clusters by a clustering algorithm. In this paper, the Lowest ID Cluster algorithm and another simple clustering algorithm are considered. Using theoretical techniques based on the stochastic geometry, this paper analyzes fundamental characteristics of the multi?hop wireless networks with the clustering algorithms.
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 callDisclaimer: 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.
