Time-slot assignment for TDMA-systems
In satellite communication as in other technical systems using the TDMA- technique (time division multiple access) the problem arises to decompose a given (n\(\times n)\)-matrix in a weighted sum of permutation matrices such that the sum of the weights becomes minimal. We show at first that an optimal solution of this problem can be obtained in \(O(n^ 4)\)-time using at most \(O(n^ 2)\) different permutation matrices. Thereafter we discuss shortly the decomposition in O(n) different matrices which turns out to be NP-hard. Moreover it is shown that an optimal decomposition using a class of 2n permutation matrices which are fixed in advance can be obtained by solving a classical assignment problem. This latter problem can be generalized by taking arbitrary Boolean matrices. The corresponding decomposition problem can be transformed to a special max flow min cost network flow problem, and is thus soluble by a genuinely polynomial algorithm.
- Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems
- Time allocation scheme in IEEE 802.15.3 TDMA mechanism
- Distributed Computing – IWDC 2005
- Algorithmic Aspects of Wireless Sensor Networks
- Optimal timeslot and channel allocation considering fairness for multicell CDMA/TDD systems
- An adaptive time slot assignment algorithm for variable bandwidth switching systems
- An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
- Time-slotted multiuser MIMO systems: beamforming and scheduling strategies
- Complexity of a 3-dimensional assignment problem
- scientific article; zbMATH DE number 3121294 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On the complexity of decomposing matrices arising in satellite communication
- Traffic assignment in communication satellites
- An exact algorithm for the general quadratic assignment problem
- The facility layout problem
- An algorithm for quadratic assignment problems
- Single and multiple period layout models for automated manufacturing systems
- Simulated annealing for machine layout problems in the presence of zoning constraints
- Comment on ``The facility layout problem
- Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
- Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
- SS/TDMA Satellite Communications withk-Permutation Switching Modes
- A heuristic for decomposing traffic matrices in TDMA satellite communication
- Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems
- Constrained partitioning problems
- An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
- Selected topics on assignment problems
- Integer quadratic optimization
- Pyramidal tours and the traveling salesman problem
- Maximizing the robustness of TDMA networks with applications to TTP/C
- A combinatorial algorithm for the TDMA message scheduling problem
- Time allocation scheme in IEEE 802.15.3 TDMA mechanism
- Time slot scheduling of compatible jobs
- A note on SS/TDMA satellite communication
- Random assignment problems
This page was built for publication: Time-slot assignment for TDMA-systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265947)
