4-edge-coloring graphs of maximum degree 3 in linear time
Information Processing Letters
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Active topology management in the future Airborne Networks (AN) can provide improved overall network throughput, efficiency, and scalability and is critical due to the high degree of platform dynamics involved. The RF links that form an airborne network must be established and reconfigured rapidly in response to aircraft joining and leaving the network, aircraft changing flight paths, and to changes in mission information flows, among other things. Additional technical challenges stem from the fact that the airborne nodes will use multiple directional and omni-directional antennas with differing antenna patterns. In this paper we present a Mobility Aware Topology Control (MAToC) solution for the Airborne Network. MAToC is comprised of deliberative and reactive topology planning components. MAToC utilizes a distributed protocol for airborne nodes for ad-hoc exchange of respective flight plan. Deliberative mode planning uses the collected flight plan information to assign optimal power, channel and boresight direction to the airborne antennas. Deliberative MAToC uses graph coloring algorithms for channel and timeslot assignment and uses geometric optimization methodology to assign antenna powers to maximize Signal to Interference and Noise Ratio (SINR). In the reactive mode, MAToC is responsible for link monitoring and link repair for fault-tolerance.