On the power assignment problem in radio networks

Mobile Networks and Applications

Volumn 9, Issue 2, 2004, Pages 125-140

  Clementi, Andrea E F ^a   Penna, Paolo ^b   Silvestri, Riccardo ^c  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b ETH ZURICH   (Switzerland)

^c UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Ad hoc radio networks; Approximability; Energy consumption; NP completeness

Indexed keywords

APPROXIMATION THEORY; ELECTRIC POWER SUPPLIES TO APPARATUS; FREQUENCY ALLOCATION; FREQUENCY HOPPING; PROBLEM SOLVING; RADIO STATIONS;

AD HOC RADIO NETWORKS; POWER ASSIGNMENT PROBLEM;

RADIO EQUIPMENT;

EID: 1642272245     PISSN: 1383469X     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:MONE.0000013624.32948.87     Document Type: Article

References (26)

1. P. Alimonti and V. Kann, Hardness of approximating problems on cubic graphs, in: Proc. of 3rd Italian Conf. on Algorithms and Complexity, Lecture Notes in Computer Science, Vol. 1203 (Springer, 1997) pp. 288-298.
2. E. Arikan, Some complexity results about packet radio networks, IEEE Transactions on Information Theory 30 (1984) 456-461.
3. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi, Complexity and Approximation - Combinatorial Optimization Problems and their Approximability Properties (Springer, 1999).
4. B.S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of ACM 41 (1994) 153-180.
5. P. Berman and M. Karpinski, On some tighter inapproximability results, Electronic Colloquium on Computational Complexity, TR-29 (1998) http://www.eccc.uni-trier.de/eccc/.
6. I. Chlamtac and A. Farago, Making transmission schedules immune to topology changes in multihop packet radio networks, IEEE/ACM Transactions on Networking 2 (1994) 23-29.
7. B.S. Chlebus, L. Gasienec, A.M. Gibbons, A. Pelc and W. Ritter, Deterministic broadcasting in unknown radio networks, in: Proc. of 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (2000) pp. 861-870.
8. A.E.F. Clementi, P. Penna and R. Silvestri, Hardness results for the power range assignment problem in packet radio networks, in: Proc. of II International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX'99), Lecture Notes in Computer Science, Vol. 1671 (1999) pp. 197-208.
9. A.E.F. Clementi, P. Penna and R. Silvestri, The power range assignment problem in radio networks on the plane, in: Proc. of XVII Symposium on Theoretical Aspects of Computer Science (STACS'00), Lecture Notes in Computer Science, Vol. 1770 (2000) pp. 651-660.
10. P. Eades, A. Symvonis and S. Whitesides, Two algorithms for three dimensional orthogonal graph drawing, in: Proc. of Graph Drawing'96, Lecture Notes in Computer Science, Vol. 1190 (1996) pp. 139-154.
11. A. Ephemides and T. Truong, Scheduling broadcast in multihop radio networks, IEEE Transactions on Communications 30 (1990) 456-461.
12. M.R. Garey and D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completness (Freeman, New York, 1979).
13. J.D. Gibson (ed.), The Mobile Communications Handbook (CRC Press, 1996).
14. P. Gupta and P.R. Kumar, Critical power for asympotic connectivity in wireless networks, in: Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, eds. W.M. McEneany, G. Yin and Q. Zhang (Birkhäuser, Boston, 1998) pp. 547-566.
15. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica - Special Issue on Graph Drawing 16 (1996) 4-32. (Extended abstract appeared in Proc. of 33th IEEE FOCS (1992).)
16. L. M. Kirousis, E. Kranakis, D. Krizanc and A. Pelc, Power consumption in packet radio networks, in: Proc. of 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Vol. 1200 (1997) pp. 363-374.
17. R. Mathar and J. Mattfeldt, Optimal transmission ranges for mobile communication in linear multihop packet radio networks, Wireless Networks 2 (1996) 329-342
18. K. Pahlavan and A. Levesque, Wireless Information Networks (Wiley-Interscience, New York, 1995).
19. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, 1994).
20. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Science 43 (1991) 425-440.
21. P. Piret, On the connectivity of radio networks, IEEE Transactions on Information Theory 37 (1991) 1490-1492.
22. P. Raghavan and R. Motwani, Randomized Algorithms (Cambridge Univ. Press, 1995).
23. S. Ramanathan and E. Lloyd, Scheduling broadcasts in multi-hop radio networks, IEEE/ACM Transactions on Networking 1 (1993) 166-172.
24. R. Ramaswami and K. Parhi, Distributed scheduling of broadcasts in radio network, in: Proc. of INFOCOM (1989) pp. 497-504.
25. S. Ulukus and R.D. Yates, Stochastic power control for cellular radio systems, IEEE Transactions on Communications 46(6) (1996) 784-798.
26. L. Valiant, Universality considerations in VLSI circuits, IEEE Transactions on Computers 30 (1981) 135-140.