Show simple item record

dc.contributor.authorZhang, Haotian
dc.date.accessioned2012-08-29 13:07:43 (GMT)
dc.date.available2012-08-29 13:07:43 (GMT)
dc.date.issued2012-08-29T13:07:43Z
dc.date.submitted2012
dc.identifier.urihttp://hdl.handle.net/10012/6890
dc.description.abstractIn this thesis, we consider the problem of diffusing information resiliently in networks that contain misbehaving nodes. Previous strategies to achieve resilient information diffusion typically require the normal nodes to hold some global information, such as the topology of the network and the identities of non-neighboring nodes. However, these assumptions are not suitable for large-scale networks and this necessitates our study of resilient algorithms based on only local information. We propose a consensus algorithm where, at each time-step, each normal node removes the extreme values in its neighborhood and updates its value as a weighted average of its own value and the remaining values. We show that traditional topological metrics (such as connectivity of the network) fail to capture such dynamics. Thus, we introduce a topological property termed as network robustness and show that this concept, together with its variants, is the key property to characterize the behavior of a class of resilient algorithms that use purely local information. We then investigate the robustness properties of complex networks. Specifically, we consider common random graph models for complex networks, including the preferential attachment model, the Erdos-Renyi model, and the geometric random graph model, and compare the metrics of connectivity and robustness in these models. While connectivity and robustness are greatly different in general (i.e., there exist graphs which are highly connected but with poor robustness), we show that the notions of robustness and connectivity are equivalent in the preferential attachment model, cannot be very different in the geometric random graph model, and share the same threshold functions in the Erdos-Renyi model, which gives us more insight about the structure of complex networks. Finally, we provide a construction method for robust graphs.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectInformation Diffusionen
dc.subjectResilienceen
dc.subjectConsensusen
dc.subjectComplex Networksen
dc.titleNetwork Robustness: Diffusing Information Despite Adversariesen
dc.typeMaster Thesisen
dc.comment.hiddenMy thesis includes work that I have already published but the publishers do not require written permission. And publication is pending and I wish to delay web access/display for four months from the date of submission.en
dc.pendingfalseen
dc.subject.programElectrical and Computer Engineeringen
uws-etd.degree.departmentElectrical and Computer Engineeringen
uws-etd.degreeMaster of Applied Scienceen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages