Topology Control Problems under Symmetric and Asymmetric Power Thresholds

We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The properties considered are connectivity, bounded diameter and minimum node degree. The optimization objective is to minimize the total power assigned to nodes. As these problems are NP-hard in general, our focus is on developing approximation algorithms with provable performance guarantees. We present results under both symmetric and asymmetric power threshold models.

[1]  R. Ravi,et al.  Bicriteria Network Design Problems , 1994, J. Algorithms.

[2]  Andrzej Pelc,et al.  Power Consumption in Packet Radio Networks (Extended Abstract) , 1997, STACS.

[3]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[5]  Ram Ramanathan,et al.  On the performance of ad hoc networks with beamforming antennas , 2001, MobiHoc '01.

[6]  Mauro Leoncini,et al.  On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks , 2002, IFIP TCS.

[7]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2002, MobiHoc '02.

[8]  Acm Sigmobile.  MobiHoc 2001 : Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking & Computing, October 4-5, 2001, Long Beach, California, USA , 2001 .

[9]  Wen-Tsuen Chen,et al.  The strongly connecting problem on multihop packet radio networks , 1989, IEEE Trans. Commun..

[10]  Ion I. Mandoiu,et al.  Symmetric Connectivity with Minimum Power Consumption in Radio Networks , 2002, IFIP TCS.

[11]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, Inf. Comput..

[12]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[13]  Guy Kortsarz,et al.  Approximating the Weight of Shallow Steiner Trees , 1999, Discret. Appl. Math..

[14]  Andrea E. F. Clementi,et al.  Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks , 1999, RANDOM-APPROX.