MohammadTaghi Hajiaghayi
Nicole Immorlica
ABSTRACT
In ad hoc wireless networks, it is crucial to minimize power consumption while maintaining key network properties. This work studies power assignments of wireless devices that minimize power while maintaining k-fault tolerance. Specifically, we require all links established by this power setting be symmetric and form a k-vertex connected subgraph of the network graph. This problem is known to be NP-hard. We show current heuristic approaches can use arbitrarily more power than the optimal solution. Hence, we seek approximation algorithms for this problem. We present three approximation algorithms. The first algorithm gives an O(ka) approximation where a is the best approximation factor for the related problem in wired networks (the best a so far is in O(log k).) Then, using a more complicated algorithm and careful analysis, we achieve O(k) approximation for general graphs. We then present simple and practical distributed approximation algorithms for the cases of 2- and 3-connectivity in geometric graphs. In addition, we demonstrate how we can generalize this algorithm for k-connectivity in geometric graphs. Finally, we show that these approximation algorithms compare favorably with existing heuristics. We note that all algorithms presented in this paper can be used to minimize power while maintaining k-edge connectivity with guaranteed approximation factors.
- E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N. Tchervenski, and A. Zelikovsky. Power efficient range assignment in ad-hoc wireless networks. Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), 2003. To appear.]]Google Scholar
Cross Ref
- M Bahramgiri, M Hajiaghayi, and V.S. Mirrokni. Fault-tolerant and 3-dimensional distributed topology control algorithms wireless multi-hop networks. In Proceedings of the 11th IEEE International Conference on Computer Communications and Networks (ICCCN), pages 392--398. 2002.]]Google ScholarCross Ref
- M.A. Bassiouni and C. Fang. Dynamic channel allocation for linear macrocellular topology. Proceedings of the 13th ACM Symposium on Applied Computing (SAC), pages 382--388, 1998.]] Google ScholarDigital Library
- D.M. Blough, M. Leoncini, G. Resta, and P. Santi. On the symmetric range assignment problem in wireless ad hoc networks. Proceedings of the 2nd IFIP International Conference on Theoretical Computre Science (TCS), pages 71--82, 2002.]] Google ScholarDigital Library
- G Calinescu, I.L Mandoiu, and A. Zelikovsky. Symmetric connectivity with minimum power consumption in radio networks. In Proceedings of 17th IFIP World Computer Congress, pages 119--130. 2002.]] Google ScholarDigital Library
- Julien Cartigny, David Simplot, and Ivan Stojmenovic. Localized minimum-energy broadcasting in ad-hoc networks. In Proceedings of fiftieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 2003. To appear.]]Google ScholarCross Ref
- J. Cheriyan, S. Vempala, and A. Vetta. Approximation algorithms for minimum-cost k-vertex connected subgraphs. In Proceedings of the 34th ACM Symposium on the Theory of Computing (STOC),, pages 306--312. 2002.]] Google ScholarDigital Library
- A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. A worst-case analysis of an mst based herustic on construct energy-efficient broadcast trees in wireless networks. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 121--131. 2001.]] Google ScholarDigital Library
- A. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri. The minimum range assignment problem on linear radio networks. Proceedings of 8th Annual European Symposium on Algorithms (ESA), pages 143--154, 2000.]] Google ScholarDigital Library
- A.E.F. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven. Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. Proceedings of 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pages 23--38, 2002.]]Google Scholar
- A.E.F. Clementi, P. Penna, and R. Silvestri. Hardness results for the power range assignment problem in packet radio networks. Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 197--208, 1999.]] Google ScholarDigital Library
- Andras Frank. Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Math., 5(1):25--53, 1992.]] Google ScholarDigital Library
- Andras Frank and Eva Tardos. An application of submodular flows. Linear Algebra Appl., 114/115:329--348, 1989.]]Google ScholarCross Ref
- R. Gallager, P. Humbler, and P. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Programming Language Systems, 5:66--77, 1983.]] Google ScholarDigital Library
- M.X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296--317, 1995.]] Google ScholarDigital Library
- K. Jain. A factor 2 approximation for the generalized steiner network problem. Combinatorica, 21(1):39--60, 2001.]]Google ScholarCross Ref
- Samir Khuller and Balaji Raghavachari. Improved approximation algorithms for uniform connectivity problems. J. Algorithms, 21(2):434--450, 1996.]] Google ScholarDigital Library
- Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, and Andrzej Pelc. Power consumption in packet radio networks. Theoret. Comput. Sci., 243(1-2):289--305, 2000.]] Google ScholarDigital Library
- G. Kortsarz and Z. Nutov. Approximating node connectivity problems via set covers. In Proceedings of the third International WorkshoApproximation Algorithms for Combinatorial Optimization (APPROX), pages 194--205. 2000.]] Google ScholarDigital Library
- L. Li, J. Halpern, V. Bahl, Y.M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. In Proceedings of ACM Symposium on Principle of Distributed Computing (PODC), pages 264--273. 2001.]] Google ScholarDigital Library
- W. Liang. Constructing minimum-energy broadcast trees in wireless ad hoc networks. Proceedings of the third ACM international symposium on Mobile ad hoc networking and computing (MobiHoc), 2002. To appear.]] Google ScholarDigital Library
- E. Lloyd, R. Liu, M. Marathe, R. Ramanathan, and S. Ravi. Algorithmic aspects of topology control problems for ad hoc networks. Proceedings of the third ACM international symposium on Mobile ad hoc networking and computing, 2002.]] Google ScholarDigital Library
- R. Mathar and J Mattfeldt. Optimal transmission ranges for mobile communication in linear multihop packet radio networks. Wireless Networks, 2:329--342, 1996.]] Google ScholarDigital Library
- R. Ramanathan and R. Rosales-Hain. Topology control of multihop radio networks using transmit power adjustment. In Proceedings of ninetieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 404--413. March 2000.]]Google Scholar
- Volkan Rodoplu and Teresa H. Meng. Minimum energy mobile wireless networks. IEEE J. Selected Areas in Communications, 17(8):1633--1639, 1999.]]Google ScholarDigital Library
- Mader W. Ecken vom grad n in minimalen k-fach zusammenhangenden Graphen. Arch. Math. (Basel), 23:219--224, 1972.]]Google ScholarCross Ref
- P. Wan, A. Calinescu, X. Li, and O. Frieder. Minimum energy broadcast routing in static ad hoc wireless networks. In Proceedings of twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 607--617. 2001.]]Google ScholarCross Ref
- R. Wattenhofer, L. Li, V. Bahl, and Y.M. Wang. Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In Proceedings of twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 1388--1397. 2001.]]Google ScholarCross Ref
Index Terms
- Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Recommendations
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
In ad hoc wireless networks, it is crucial to minimize power consumption while maintaining key network properties. This work studies power assignments of wireless devices that minimize power while maintaining k-fault tolerance. Specifically, we require ...
Algorithmic aspects of topology control problems for ad hoc networks
MobiHoc '02: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computingTopology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying some specified properties. This paper considers such problems under several ...
Distributed fault-tolerant topology control in wireless multi-hop networks
In wireless multi-hop and ad-hoc networks, minimizing power consumption and at the same time maintaining desired properties of the network topology is of prime importance. In this work, we present a distributed algorithm for assigning minimum possible ...
Comments