Formulations and algorithms for network design problems with connectivity requirements
Formulations and algorithms for network design problems with connectivity requirements
Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
A representation for crossing set families with applications to submodular flow problems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
Journal of Heuristics
Approximating node connectivity problems via set covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
INFORMS Journal on Computing
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
INFORMS Journal on Computing
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc networks
Mobile Networks and Applications
Minimum power configuration for wireless communication in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Optimal solutions for fault-tolerant topology control in wireless ad hoc networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.01 |
We consider the problem of assigning transmission powers to the nodes of an ad hoc wireless network, so that the total power consumed is minimized and the resulting network is biconnected, i.e., there are at least two node-disjoint paths between any pair of nodes. Biconnected communication graphs are important to ensure fault tolerance, since ad hoc networks are used in critical application domains where failures are likely to occur. A mixed integer programming formulation of the problem can be exactly solved to optimality by a commercial solver only for moderately sized problems. We recall a mixed integer programming formulation that can be exactly solved to optimality by a commercial solver only for very moderately sized problems. We propose a quick greedy algorithm and a GRASP with path-relinking heuristic for solving real-life sized problems. Computational experiments involving practical issues such as energy consumption and interference have been performed and reported for problems with up to 800 nodes, illustrating the effectiveness and the efficiency of the new algorithms. Both the greedy algorithm and the GRASP heuristic outperformed the best heuristic in the literature for very large problem sizes.