Results 1 -
4 of
4
A new computational approach for maximum link activation in wireless networks under the SINR model
- IEEE Trans. Wireless Commun
, 2011
"... Abstract-A fundamental and computationally challenging optimization task in wireless networks is to maximize the number of simultaneous transmissions, subject to signal-to-noise-andinterference ratio (SINR) requirements at the receivers. The conventional approach guaranteeing global optimality is t ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
Abstract-A fundamental and computationally challenging optimization task in wireless networks is to maximize the number of simultaneous transmissions, subject to signal-to-noise-andinterference ratio (SINR) requirements at the receivers. The conventional approach guaranteeing global optimality is to solve an integer programming model with explicit SINR constraints. These constraints are however numerically very difficult. We develop a new integer programming algorithm based on a much more effective representation of the SINR constraints. Computational experiments demonstrate that the new approach performs significantly better in proving optimality.
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
"... We consider two approaches for solving the classical minimum vertex coloring problem, that is the problem of coloring the vertices of a graph so that adjacent vertices have different colors, minimizing the number of used colors, namely Constraint Programming and Column Generation. Constraint Program ..."
Abstract
- Add to MetaCart
We consider two approaches for solving the classical minimum vertex coloring problem, that is the problem of coloring the vertices of a graph so that adjacent vertices have different colors, minimizing the number of used colors, namely Constraint Programming and Column Generation. Constraint Programming is able to solve very efficiently many of the benchmarks, but suffers from the lack of effective bounding methods. On the contrary, Column Generation provides tight lower bounds by solving the fractional vertex coloring problem exploited in a Branch-and-Price algorithm, as already proposed in the literature. The Column Generation approach is here enhanced by using Constraint Programming to solve the pricing subproblem and to compute heuristic solutions. Moreover new techniques are introduced to improve the performance of the Column Generation approach in solving both the linear relaxation and the integer problem. We report extensive computational results applied to the benchmark instances: we are able to prove optimality of 11 new instances, and to improve the best known lower bounds on other 17 instances. Moreover we extend the solution approaches to a generalization of the problem known as Minimum Vertex Graph Multicoloring Problem where a given number of colors has to be assigned to each vertex.
Time and Throughput Efficient Scheduling for Data Gathering in Wireless Sensor Networks
, 2013
"... Wireless sensor networks have become a very important tool for monitoring physical and environmental conditions over a wide area. These networks are distributed collections of small sensor nodes. Typically, sensor nodes collect data that must converge to a single sink location, possibly across mul ..."
Abstract
- Add to MetaCart
Wireless sensor networks have become a very important tool for monitoring physical and environmental conditions over a wide area. These networks are distributed collections of small sensor nodes. Typically, sensor nodes collect data that must converge to a single sink location, possibly across multiple hops. The data on the way to sink location can be aggregated inside the network. This aggregation convergecast process requires significant coordination between the sensor nodes in the selection of routes, and in the scheduling of the
Arbitrary Ad Hoc Networks: Comparison of Cooperative and Hop-by-Hop Forwarding
"... Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding ..."
Abstract
- Add to MetaCart
(Show Context)
Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding
