東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Practical algorithms to discover deg...

Vitolo, Thomas J.

FindBook

Google Book

Amazon

博客來

Practical algorithms to discover degree constrained spanning trees in sparsely connected graphs.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Practical algorithms to discover degree constrained spanning trees in sparsely connected graphs./
Author:	Vitolo, Thomas J.
Description:	139 p.
Notes:	Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: .
Contained By:	Dissertation Abstracts International71-11B.
Subject:	Applied Mathematics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3430449
ISBN:	9781124297781

Practical algorithms to discover degree constrained spanning trees in sparsely connected graphs.
Vitolo, Thomas J.

Practical algorithms to discover degree constrained spanning trees in sparsely connected graphs. - 139 p.

Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: .

Thesis (Ph.D.)--Boston University, 2011.

Choosing a network topology to connect communication nodes subject to specific objectives, constraints, and properties is a broadly studied problem, with approaches varying widely depending on the hardware capabilities and limitations, the required performance criteria, and the available budget. This thesis is motivated by a topology problem in which naval, ground, air, and space vehicles require secure, high bandwidth data communications across long distances in an unstable environment. Each wireless connection in the network requires a pair of directional antennae; the connection is point-to-point line-of-sight, not broadcast over a wider region. While some nodes may be stationary, stable, and secure, the majority of the hundreds of nodes in the network are moving. As a result, a line-of-sight connection between a pair of nodes is subject to predictable and unpredictable interruption. Because the network is constantly evolving, new topologies must be generated very quickly so that network connectivity is maintained.

ISBN: 9781124297781Subjects--Topical Terms:

1669109
Applied Mathematics.

Practical algorithms to discover degree constrained spanning trees in sparsely connected graphs.
LDR:02788nam 2200301 4500 001 1393179
005 20110311132625.5
008 130515s2011 ||||||||||||||||| ||eng d
020 $a 9781124297781
035 $a (UMI)AAI3430449
035 $a AAI3430449
040 $a UMI $c UMI
100 1 $a Vitolo, Thomas J. $3 1671674
245 1 0 $a Practical algorithms to discover degree constrained spanning trees in sparsely connected graphs.
300 $a 139 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: .
500 $a Adviser: David Castanon.
502 $a Thesis (Ph.D.)--Boston University, 2011.
520 $a Choosing a network topology to connect communication nodes subject to specific objectives, constraints, and properties is a broadly studied problem, with approaches varying widely depending on the hardware capabilities and limitations, the required performance criteria, and the available budget. This thesis is motivated by a topology problem in which naval, ground, air, and space vehicles require secure, high bandwidth data communications across long distances in an unstable environment. Each wireless connection in the network requires a pair of directional antennae; the connection is point-to-point line-of-sight, not broadcast over a wider region. While some nodes may be stationary, stable, and secure, the majority of the hundreds of nodes in the network are moving. As a result, a line-of-sight connection between a pair of nodes is subject to predictable and unpredictable interruption. Because the network is constantly evolving, new topologies must be generated very quickly so that network connectivity is maintained.
520 $a This thesis defines the connectivity problem as finding a modified degree-constrained spanning tree. It develops optimal algorithms which can generate the topology backbone for large point-to-point wireless networks quickly, even in networks with hundreds of nodes. The algorithms presented are compared to other network generating algorithms. This thesis extends the algorithms to new variations of this topology problem including scenarios where the antennae in the network consist of multiple incompatible technologies, and uses discrete time stages to maximize full connectivity over a time horizon. The results of the thesis provide algorithms for the design of real-time topology maintenance algorithms, as well as bounds for comparison with the performance of faster heuristic approaches for topology maintenance.
590 $a School code: 0017.
650 4 $a Applied Mathematics. $3 1669109
650 4 $a Operations Research. $3 626629
650 4 $a Computer Science. $3 626642
690 $a 0364
690 $a 0796
690 $a 0984
710 2 $a Boston University. $3 1017454
773 0 $t Dissertation Abstracts International $g 71-11B.
790 1 0 $a Castanon, David, $e advisor
790 $a 0017
791 $a Ph.D.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3430449