| dc.contributor.advisor |
Reddy, A. L. N. |
en_US |
| dc.contributor.advisor |
Loguinov, Dmitri |
en_US |
| dc.creator |
Iyer, Bharat Vishwanathan, 1978- |
en_US |
| dc.date.accessioned |
2005-02-17T20:59:34Z |
|
| dc.date.available |
2005-02-17T20:59:34Z |
|
| dc.date.created |
2003-12 |
en_US |
| dc.date.issued |
2005-02-17T20:59:34Z |
|
| dc.identifier.uri |
http://handle.tamu.edu/1969.1/1359 |
|
| dc.description.abstract |
Many large-scale random graphs (e.g., the Internet) exhibit complex topology, nonhomogeneous spatial node distribution, and preferential attachment of new nodes. Current topology models for ad-hoc networks mostly consider a uniform spatial distribution of nodes and do not capture the dynamics of evolving, real-world graphs, in which nodes "gravitate" toward popular locations and self-organize into non-uniform clusters. In this thesis, we first investigate two constraints on scalability of ad-hoc networks – network reliability and node capacity. Unlike other studies, we analyze network resilience to node and link failure with an emphasis on the growth (i.e., evolution) dynamics of the entire system. Along the way, we also study important graph-theoretic properties of ad-hoc networks (including the clustering coefficient and the expected path length) and strengthen our generic understanding of these systems. Finally, recognizing that under existing uniform models future ad-hoc networks cannot scale beyond trivial sizes, we argue that ad-hoc networks should be modeled from an evolution standpoint, which takes into account the well-known "clustering" phenomena observed in all real-world graphs. This model is likely to describe how future ad-hoc networks will self-organize since it is well documented that information content distribution among end-users (as well as among spatial locations) is non-uniform (often heavy-tailed). Results show that node capacity in the proposed evolution model scales to larger network sizes than in traditional approaches, which suggest that non-uniformly clustered, self-organizing, very large-scale ad-hoc networks may become feasible in the future. |
en_US |
| dc.description.provenance |
Made available in DSpace on 2005-02-17T20:59:34Z (GMT). No. of bitstreams: 1
etd-tamu-2003C-2003082511-Iyer-1.pdf: 387969 bytes, checksum: 151a2561bde8786505b265475fd6aac8 (MD5) |
en |
| dc.format.extent |
387969 bytes |
|
| dc.format.medium |
electronic |
en_US |
| dc.format.mimetype |
application/pdf |
|
| dc.language.iso |
en_US |
en_US |
| dc.publisher |
Texas A&M University |
en_US |
| dc.subject |
wireless networks |
en_US |
| dc.subject |
evolution models |
en_US |
| dc.subject |
scalability |
en_US |
| dc.subject |
capacity |
en_US |
| dc.title |
Capacity and scale-free dynamics of evolving wireless networks |
en_US |
| thesis.degree.department |
Electrical Engineering |
en_US |
| thesis.degree.discipline |
Electrical Engineering |
en_US |
| thesis.degree.grantor |
Texas A&M University |
en_US |
| thesis.degree.name |
M. S. |
en_US |
| thesis.degree.level |
Masters |
en_US |
| dc.contributor.committeeMember |
Kundur, Deepa |
en_US |
| dc.contributor.committeeMember |
Bhattacharyya, S. |
en_US |
| dc.type.genre |
Electronic Thesis |
en_US |
| dc.type.material |
text |
en_US |
| dc.format.digitalOrigin |
born digital |
en_US |
Browse