碩士 / 國立臺灣大學 / 電信工程學研究所 / 101 / Scalability is an important problem in large wireless ad hoc networks.
Traditional routing and capacity and derived with large overhead and
thus not realistic. In this thesis, inspired from social networks, we investigate
the scalability problem in ad hoc networks by analyzing the
search efficiency in the network. To explore the asymptotic result, we
use simple random walk to in random geometric graph to perform the
analysis. The results give some insight into the design of ad hoc network
which can support large amount of machines with low overhead.
| Identifer | oai:union.ndltd.org:TW/101NTU05435052 |
| Date | January 2013 |
| Creators | Chi-Heng Lin, 林紀亨 |
| Contributors | Kwang-Cheng Chen, 陳光禎 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | en_US |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 44 |
Page generated in 0.0136 seconds