The maximum concurrent flow problem
Journal of the ACM (JACM)
Discrete Mathematics - Topics on domination
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Gossiping with Unit Messages in Known Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Theoretical Computer Science
Lower bounds on systolic gossip
Information and Computation
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing
Fundamentals of wireless communication
Fundamentals of wireless communication
Maximum Weighted Matching with Interference Constraints
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Hardness and approximation of Gathering in static radio networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Gathering algorithms on paths under interference constraints
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
IEEE Journal on Selected Areas in Communications
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations
Trustworthy Global Computing
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bandwidth allocation in cellular networks with multiple interferences
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Framework for optimizing the capacity of wireless mesh networks
Computer Communications
Optimal gathering in radio grids with interference
Theoretical Computer Science
On optimal k-fold colorings of webs and antiwebs
Discrete Applied Mathematics
Hi-index | 5.23 |
We define and study an optimization problem that is motivated by bandwidth allocation in radio networks. Because radio transmissions are subject to interference constraints in radio networks, physical space is a common resource that the nodes have to share in such a way, that concurrent transmissions do not interfere. The bandwidth allocation problem we study under these constraints is the following. Given bandwidth (traffic) demands between the nodes of the network, the objective is to schedule the radio transmissions in such a way that the traffic demands are satisfied. The problem is similar to a multicommodity flow problem, where the capacity constraints are replaced by the more complex notion of non-interfering transmissions. We provide a formal specification of the problem that we call round weighting. By modeling non-interfering radio transmissions as independent sets, we relate the complexity of round weighting to the complexity of various independent set problems (e.g. maximum weight independent set, vertex coloring, fractional coloring). From this relation, we deduce that in general, round weighting is hard to approximate within n^1^-^@e (n being the size of the radio network). We also provide polynomial (exact or approximation) algorithms e.g. in the following two cases: (a) when the interference constraints are specific (for instance for a network whose vertices belong to the Euclidean space), or (b) when the traffic demands are directed towards a unique node in the network (also called gathering, analogous to single commodity flow).