Power assignment in radio networks with two power levels

Algorithmica (New York)

Volumn 47, Issue 2, 2007, Pages 183-201

  Carmi, Paz ^a   Katz, Matthew J ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Approximation algorithm; NP hardness; Radio networks; Range assignment

Indexed keywords

APPROXIMATION ALGORITHMS; NP HARDNESS; RADIO NETWORKS; RANGE ASSIGNMENT;

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; RADIO COMMUNICATION; RADIO STATIONS; RADIO TRANSMITTERS;

TELECOMMUNICATION NETWORKS;

EID: 33846865842     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-1230-1     Document Type: Article

References (19)

1. P. Alimonti and V. Kann. Hardness of Approximating Problems on Cubic Graphs. Proc. 3rd Italian Conf. Algorithms and Complexity, LNCS 1203, pp. 288-298, 1997.
2. E. Althaus, G. Cǎlinescu, I. I. Mǎndoiu, S. Prasad, N. Tchervenski, and A. Zelikovsky. Power Efficient Range Assignment in Ad-Hoc Wireless Networks. Proc. IEEE Wireless Communications and Networking Conference (WCNC), pp. 1889-1894, 2003.
3. D. M. Blough, M. Leoncini, G. Resta, and P. Santi. On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. Proc. 2nd IFIP Int. Conf. Theoretical Computer Science, pp. 71-82, 2002.
4. G. Cǎlinescu, I. I. Mǎndoiu, and A. Z. Zelikovsky. Symmetric Connectivity with Minimum Power Consumption in Radio Networks. Proc. 2nd IFIP Int. Conf. Theoretical Computer Science, pp. 119-130, 2002.
5. A. E. F. Clementi, P. Crescenzi, P. Penna, and R. Silvestri. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. Proc. 18th Annual Sympos. Theoretical Aspects of Computer Science (STACS), LNCS 2010, pp. 121-131, 2001.
6. A. E. F. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica 35(2):95-110, 2003.
7. A. E. F. Clementi, G. Huiban, P. Penna, G. Rossi, and Y. C. Verhoeven. On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. Proc. Int. Parallel and Distributed Processing Sympos. (IPDPS), p. 222, 2003.
8. A. E. F. Clementi, P. Penna, and R. Silvestri. On the Power Assignment Problem in Radio Networks. Mobile Networks and Applications 9(2): 125-140, 2004.
9. R-c Duh and M. Fürer. Approximation of k-Set Cover by Semi-Local Optimization. Proc. 29th Annual ACM Sympos. Theory Computing (STOC), pp. 256-264, 1997.
10. S. Even. Graph Algorithms. Computer Science Press, Rockville, MD, 1979.
11. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
12. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power Consumption in Packet Radio Networks. Theoretical Computer Science 243(1-2):289-305, 2000.
13. W. Liang. Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks. Proc. 3rd ACM Int. Sympos. Mobile Ad-Hoc Networking and Computing, pp. 112-122, 2002.
14. S. Micali and V. V. Vazirani. An 0(√VE) Algorithm for Finding Maximum Matching in General Graphs. Proc. 21st Annual IEEE Sympos. Foundations of Computer Science (FOCS), pp. 17-27, 1980.
15. I. Papadimitriou and L. Georgiadis. Energy-Aware Broadcasting in Wireless Networks. Proc. Modeling and Optimization in Mobile, Ad-Hoc, and Wireless Networks (WiOpt), pp. 267-277, 2003.
16. L. Valiant. Universality Considerations in VLSI Circuits. IEEE Transactions on Computers 30:135-140, 1981.
17. P.-J. Wan, G. Cǎlinescu, X.-Y. Li, and O. Frieder. Minimum-Energy Broadcast Routing in Static Ad-Hoc Wireless Networks. ACM Wireless Networks 8:607-617, 2002.
18. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. Proc. IEEE INFOCOM, pp. 585-594, 2000.
19. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. Algorithms for Energy-Efficient Multicasting in Static Ad-Hoc Wireless Networks. Mobile Networks and Applications 6(3):251-263, 2001.