Minimum power assignment in wireless ad hoc networks with spanner property

Power assignment for wireless networks is to assign a power for each wireless node such that the induced communication graph has some required properties. We study the power assignment such that the induced communication graph is a spanner for the original communication graph when all nodes have the maximum power. A polynomial time algorithm is given to minimize the maximum assigned power. Then we propose a new polynomial time approximation method to minimize the total transmission radius of all nodes. We also give two heuristics and conduct extensive simulations to study their performance when we want to minimize the total assigned power of all nodes. Our simulations validate our theoretical claims.

[1]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[2]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[3]  Xiang-Yang Li,et al.  Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[4]  Joachim Gudmundsson,et al.  Improved Greedy Algorithms for Constructing Sparse Geometric Spanners , 2000, SWAT.

[5]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2005, Mob. Networks Appl..

[6]  Santosh S. Vempala,et al.  Approximation algorithms for minimum-cost k-vertex connected subgraphs , 2002, STOC '02.

[7]  Afonso Ferreira,et al.  The Minimum Range Assignment Problem on Linear Radio Networks , 2002, Algorithmica.

[8]  Joachim Gudmundsson,et al.  Constructing Plane Spanners of Bounded Degree and Low Weight , 2002, ESA.

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

[10]  Michiel H. M. Smid,et al.  Euclidean spanners: short, thin, and lanky , 1995, STOC '95.

[11]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[13]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  Peng-Jun Wan,et al.  Range Assignment for High Connectivity in Wireless Ad Hoc Networks , 2003, ADHOC-NOW.

[15]  Andrea E. F. Clementi,et al.  The Power Range Assignment Problem in Radio Networks on the Plane , 2000, STACS.

[16]  Artur Czumaj,et al.  Fault-Tolerant Geometric Spanners , 2004, Discret. Comput. Geom..

[17]  Xiang-Yang Li,et al.  Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[18]  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).

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

[20]  Gruia Calinescu,et al.  Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.

[21]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[22]  Afonso Ferreira,et al.  The Minimum Range Assignment Problem on Linear Radio Networks , 2000, ESA.

[23]  Madhav V. Marathe,et al.  Topology Control Problems under Symmetric and Asymmetric Power Thresholds , 2003, ADHOC-NOW.

[24]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[25]  Xiang-Yang Li,et al.  Efficient construction of low weighted bounded degree planar spanner , 2004, Int. J. Comput. Geom. Appl..

[26]  Eytan Modiano,et al.  Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.

[27]  Ernst Althaus,et al.  Power efficient range assignment in ad-hoc wireless networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[28]  Xiang-Yang Li,et al.  Power efficient and sparse spanner for wireless ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[29]  Xiang-Yang Li,et al.  Efficient Construction of Low Weight Bounded Degree Planar Spanner , 2003, COCOON.