Consensus Building in Sensor Networks and Long Term Planning for the National Airspace System Page: 4
View a full description of this thesis.
Extracted Text
The following text was automatically extracted from the image on this page using optical character recognition software:
Network structure has known to be crucial to the performance of consensus building [15].
In designing multi-group network structures for consensus building, one question is whether
there exists a quantitative relationship between the network structure and its performance,
especially in large-scale networks, where scalability is important. In this thesis, this issue was
addressed by studying the network design problem for some common hierarchical multi-group
structures. In order to represent the information flow in a multi-group DSN, it is beneficial
to describe a DSN using an equivalent graphical model that can abstract and capture its
connectivity patterns. Examples of some graphical models are illustrated in figure 2.1.
In this thesis, the focus is on the bipartite graph structure (figure 2.1a) which is widely
used in communications and has been recently adopted for sensor network applications [3, 19].
The objective is to investigate the effect of network structure on the convergence behavior
of consensus building strategies. Specifically, a structural approach is considered to study
the research questions of interest in consensus building, including whether consensus can
be reached by the network, what is the final consensus value, and how many iterations are
needed to reach the consensus. Direct inference of the convergence behavior of the consensus
strategies from DSN structures is one of the contributions of this thesis. These results in
turn, lead to efficient and scalable strategies for designing DSNs (e.g., the selection of the
number of leaders and network connections) to meet desirable performance requirements. It
is worthwhile to note that the structural approach also suggests a way to investigate algebraic
graph-theory related aspects by working with indirect graphs rather than the graph directly
associated with network dynamics. This approach can expose some hidden features of graph
structures and provide insightful analytical results on network dynamics that are not possible
otherwise.
Further, in section 2.1.2, the research problem is formulated, and in section 2.1.3, a brief
review of relevant literature is provided. The section 2.2 provides the condition for reaching
consensus and the consensus value that all sensor nodes finally agree to. The section 2.3,
Upcoming Pages
Here’s what’s next.
Search Inside
This thesis can be searched. Note: Results may vary based on the legibility of text within the document.
Tools / Downloads
Get a copy of this page or view the extracted text.
Citing and Sharing
Basic information for referencing this web page. We also provide extended guidance on usage rights, references, copying or embedding.
Reference the current page of this Thesis.
Akula, Naga Venkata Swathik. Consensus Building in Sensor Networks and Long Term Planning for the National Airspace System, thesis, May 2011; Denton, Texas. (https://digital.library.unt.edu/ark:/67531/metadc67954/m1/10/: accessed April 25, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; .