2026-09-19T19:46:53Zhttps://dspace.mit.edu/server/oai/request

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

Eytan Modiano. Bunting, Zachary S. (Zachary Shane) Massachusetts Institute of Technology. Operations Research Center. Massachusetts Institute of Technology. Operations Research Center Sloan School of Management 2013-12-06T20:51:31Z 2013-12-06T20:51:31Z 2013 http://hdl.handle.net/1721.1/82872 864014847 Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2013. Cataloged from PDF version of thesis. Includes bibliographical references (pages 91-93). We investigate two distinct problems in military radio networking. In the first problem, we study a mobile airborne multi-hop wireless network. The mobility of the nodes leads to dynamic link capacities requiring changes to the topology by adding and removing links. Changes are intended to minimize maximum link load. Mixed integer linear programming is used to periodically find topological modifications resulting in optimal performance. To reduce computation and the rate of changes to the topology, we design and employ heuristic algorithms. We present several such algorithms of differing levels of complexity, and model performance using each. A comparison of the results of each method is given. In the second problem, we study a ground multi-hop wireless network. Scalability is an issue for such ground tactical radio networks, as increasing numbers of nodes and flows compete for the capacity of each link. The introduction of a relay node allows additional routes for traffic flows. Greater benefit is achieved by fixing the relay node at a higher elevation to allow it to broadcast to all other nodes simultaneously, thereby reducing the number of hops packets must travel. We use a combination of linear programming (LP) and novel bounds on the achievable network performance to investigate the benefits of such a relay node. We show that a relay node provides moderate improvement under an all-to-all unicast traffic model and more substantial improvement for broadcast traffic patterns. by Zachary S. Bunting. S.M. 93 pages 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 Operations Research Center. Improving performance through topology management and wireless scheduling in military multi-hop radio networks Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="1cc34e0b-6b5c-47c1-95f3-4672bb728a3c"> <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>Improving performance through topology management and wireless scheduling in military multi-hop radio networks</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2013</PublicationDate> <Authors> <Author> <DisplayName>Bunting, Zachary S. (Zachary Shane)</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>Operations Research Center.</Keyword> <Abstract>We investigate two distinct problems in military radio networking. In the first problem, we study a mobile airborne multi-hop wireless network. The mobility of the nodes leads to dynamic link capacities requiring changes to the topology by adding and removing links. Changes are intended to minimize maximum link load. Mixed integer linear programming is used to periodically find topological modifications resulting in optimal performance. To reduce computation and the rate of changes to the topology, we design and employ heuristic algorithms. We present several such algorithms of differing levels of complexity, and model performance using each. A comparison of the results of each method is given. In the second problem, we study a ground multi-hop wireless network. Scalability is an issue for such ground tactical radio networks, as increasing numbers of nodes and flows compete for the capacity of each link. The introduction of a relay node allows additional routes for traffic flows. Greater benefit is achieved by fixing the relay node at a higher elevation to allow it to broadcast to all other nodes simultaneously, thereby reducing the number of hops packets must travel. We use a combination of linear programming (LP) and novel bounds on the achievable network performance to investigate the benefits of such a relay node. We show that a relay node provides moderate improvement under an all-to-all unicast traffic model and more substantial improvement for broadcast traffic patterns.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>