Cost minimization in wireless networks with a bounded and unbounded number of interfaces

Networks

Volumn 53, Issue 3, 2009, Pages 266-275

  Klasing, Ralf ^a   Kosowski, Adrian ^b   Navarra, Alfredo ^c  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^c UNIVERSITY OF PERUGIA   (Italy)

Author keywords

Approximation algorithm; Cost minimization; Energy saving; Inapproxim ability; Multi interface network; Wireless network

Indexed keywords

ACTIVE INTERFACE; APPROXIMATION FACTOR; APPROXIMATION RESULTS; APRIORI; BOUNDED DEGREE; COMPLETE GRAPHS; COST MINIMIZATION; ENERGY SAVING; GRAPH G; INAPPROXIM-ABILITY; MINIMUM COST; MULTI-INTERFACE NETWORK; NONUNIFORM; RADIO INTERFACE; SWITCH-ON; WIRELESS DEVICES;

APPROXIMATION ALGORITHMS; GRAPH THEORY; OPTIMIZATION; PHOTOVOLTAIC EFFECTS; SET THEORY; WIRELESS NETWORKS;

COSTS;

EID: 65949103628     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20266     Document Type: Article

References (16)

1. G. Ausiello, A. D'Atri, and M. Protasi, Structure preserving reductions among convex optimization problems, J Comput Syst Sci 21 (1980), 136-153.
2. B.S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J ACM 41 (1994), 153-180.
3. H.L. Bodlaender, Dynamic programming on graphs with bounded treewidth, Proc 15th Inter Colloquium on Automata, Lang and Program (ICALP), Vol. 317 of LNCS, 1988, pp. 105-118.
4. R.L. Brooks, On coloring the nodes of a network, Proc Cambridge Philos Soc 37 (1941), 194-197.
5. M. Caporuscio, A. Carzaniga, and A.L. Wolf, Design and evaluation of a support service for mobile, wireless publish/subscribe applications, IEEE Trans Software Eng 29 (2003), 1059-1071.
6. M. Caporuscio, D. Charlet, V. Issarny, and A. Navarra, Energetic performance of service-oriented multi-radio networks: Issues and perspectives, Proc 6th Inter Workshop Software Perform (WOSP), ACM Press, 2007, pp. 42-45.
7. V. Chvátal, A greedy heuristic for the set-covering problem, Math Oper Res 4 (1979), 233-235.
8. R. Cilibrasi, Z. Lotker, A. Navarra, S. Perennes, and P. Vitanyi, About the lifespan of peer to peer networks, Proc 10th Inter Conf Prin Distrib Syst (OPODIS), Vol. 4305 of LNCS, 2006, pp. 288-302.
9. S. Even, Graph algorithms, Computer Science Press, 1979.
10. M.R. Garey and D.S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, W. H. Freeman and Company, New York, 1979.
11. A.V. Goldberg and R.E. Tarjan, A new approach to the maximum-flow problem, J ACM 35 (1988), 921-940.
12. R. Klasing, A. Kosowski, and A. Navarra, Cost minimisation in multi-interface networks, Proc 1 st EuroFGI Inter Conf Network Control and Optim (NET-COOP), 2007, Vol. 4465 of Lecture Notes in Computer Science, Springer-Verlag, pp. 276-285.
13. A. Kosowski and A. Navarra, Cost minimisation in unbounded multi-interface networks, Proc 2nd PPAM Workshop Sched Parallel Comput (SPC), 2008, Vol. 4967 of Lecture Notes in Computer Science, Springer-Verlag, pp. 1039-1047.
14. D.W. Matula and L.L. Beck, Smallest-last ordering and clustering and graph coloring algorithms, J ACM 30 (1983), 417-427.
15. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J Comput Syst Sci 43 (1991), 425-440.
16. R. Raz and S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, Proc 29th Annual ACM Sympo Theory of Comput, ACM, New York, NY, 1997, pp. 475-484.