Constrained Node Placement and Assignment in Mobile Backbone Networks

Loading...
Thumbnail Image
Authors
Craparo, E.M.
Subjects
Advisors
Date of Issue
2010-12
Date
December 15-17, 2010
Publisher
Language
Abstract
This paper describes new algorithms for mobile backbone network optimization. In this hierarchical communication framework, mobile backbone nodes (MBNs) are deployed to provide communication support for regular nodes (RNs). While previous work has assumed that MBNs are unconstrained in position, this work models constraints in MBN location. This paper develops an exact technique for maximizing the number of RNs that achieve a threshold throughput level, as well as a polynomial-time approximation algorithm for this problem. The approximation algorithm carries a performance guarantee of 12, and we demonstrate that this guarantee is tight in some problem instances.
Type
Article
Description
Series/Report No
Department
Operations Research
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
49th IEEE Conference on Decision and Control December 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections