Distributed algorithms for dynamic topology construction and their applications
Name
59552556-MIT.pdf
Description
Full printable version
Size
6.81 MB
Format
Adobe PDF
Checksum (MD5)
1ccffec0a615264c849ca870aa57c496
Author(s)
Law, Ching, 1975-
Advisor(s)
Kai-Yeung Siu.
Date Issued
2004
Publisher
Massachusetts Institute of Technology
Abstract
(cont.) of piconets is close to optimal, and any device is a member of at most two piconets.
We introduce new distributed algorithms that dynamically construct network topologies. These algorithms not only adapt to dynamic topologies where nodes join and leave, but also actively set up and remove links between the nodes, to achieve certain global graph properties. First, we present a novel distributed algorithm for constructing overlay networks that are composed of d Hamilton cycles. The protocol is decentralized as no globally-known server is required. With high probability, the constructed topologies are expanders with O(logd n) diameters and ... second largest eigenvalues. Our protocol exploits the properties of random walks on expanders. A new node can join the network in O(logd n) time with O(dlogd n) messages. A node can leave in O(1) time with O(d) messages. Second, we investigate a layered construction of the random expander networks that can implement a distributed hash table. Layered expanders can achieve degree-optimal routing at O(log n/log log n) time, where each node has O(log n) neighbors. We also analyze a self-balancing scheme for the layered networks. Third, we study the resource discovery problem, in which a network of machines discover one another by making network connections. We present two randomized algorithms to solve the resource discovery problem in O(log n) time. Fourth, we apply the insight gained from the resource discovery algorithms on general networks to ad hoc wireless networks. A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. We present and analyze a new randomized distributed protocol for Bluetooth scatternet formation. We prove that our protocol achieves O(log n) time complexity and O(n) message complexity. In the scatternets formed by our protocol, the number
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 155-162).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
