2026-09-20T00:10:01Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/367972022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Steven G. Finn. Anderson, Brian C. (Brian Curtis) Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2007-03-12T17:54:37Z 2007-03-12T17:54:37Z 2005 2006 http://hdl.handle.net/1721.1/36797 79648732 Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2006. Includes bibliographical references (p. 63-64). ORCLE (Optical/RF Combined Link Experiment), is an airborne network in which aircraft have multiple directional antennas that are restricted in their pointing direction. A pair of aircraft in ORCLE can be linked if they both have an antenna pointing at each other. Four topology algorithms, which coordinate the pointing of the antennas and attempt to maximize a connectedness metric, are presented and analyzed using a custom 2D simulation platform. Three of the algorithms are based on the Relative Neighbor Graph (RNG): the first constrains the RNG to requirements of the ORCLE network, the second augments the constrained RNG with edges from the Delaunay Triangulation, and the third algorithm tries to improve on the second by adding edges to reduce the diameter. The final algorithm uses a novel concept of overlapping sets of nested convex hulls to select the links of the network. All algorithms are stateless and interface with a Target Transition Layer, which gradually migrates topologies to prevent a large number of edges from being lost simultaneously. Scenes with varying node density, number of terminals per node, fields of view, and re-targeting delays are used to test the algorithms against a wide range of possible situations. by Brian C. Anderson. M.Eng. 64 p. eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Topologies for ad-hoc networks utilizing directional antennas with restricted fields of view Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="64df8155-3662-4e94-af3d-3218f91c492d"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Topologies for ad-hoc networks utilizing directional antennas with restricted fields of view</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2006</PublicationDate> <Authors> <Author> <DisplayName>Anderson, Brian C. (Brian Curtis)</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>ORCLE (Optical/RF Combined Link Experiment), is an airborne network in which aircraft have multiple directional antennas that are restricted in their pointing direction. A pair of aircraft in ORCLE can be linked if they both have an antenna pointing at each other. Four topology algorithms, which coordinate the pointing of the antennas and attempt to maximize a connectedness metric, are presented and analyzed using a custom 2D simulation platform. Three of the algorithms are based on the Relative Neighbor Graph (RNG): the first constrains the RNG to requirements of the ORCLE network, the second augments the constrained RNG with edges from the Delaunay Triangulation, and the third algorithm tries to improve on the second by adding edges to reduce the diameter. The final algorithm uses a novel concept of overlapping sets of nested convex hulls to select the links of the network. All algorithms are stateless and interface with a Target Transition Layer, which gradually migrates topologies to prevent a large number of edges from being lost simultaneously. Scenes with varying node density, number of terminals per node, fields of view, and re-targeting delays are used to test the algorithms against a wide range of possible situations.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>