Interference minimization in wireless networks

Proceedings - IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2010

Volumn , Issue , 2010, Pages 444-449

  Aslanyan, Hakob ^a   Rolim, Jose ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED NETWORKS; DISTANCE FUNCTIONS; LONG LINE; LOWER BOUNDS; MINIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; TOPOLOGY CONTROL; TRANSMISSION RADIUS; TRANSMISSION RANGES; WIRELESS SENSOR;

APPROXIMATION ALGORITHMS; HUMAN COMPUTER INTERACTION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS; UBIQUITOUS COMPUTING; WIRELESS SENSOR NETWORKS;

WIRELESS AD HOC NETWORKS;

EID: 79951776432     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EUC.2010.73     Document Type: Conference Paper

References (18)

1. Jamal N. Al-karaki and Ahmed E. Kamal. Routing techniques in wireless sensor networks: A survey. IEEE Wireless Communications, 11:6-28, 2004.
2. H. Aslanyan. Greedy set cover estimations. Computer Science and Information Technologies (CSIT), pages 143-144, 2003.
3. M. Benkert, J. Gudmundsson, H.J. Haverkort, and A. Wolff. Constructing interference-minimal networks. 32nd Conference on Theory and Practice of Computer Science, SOFSEM, LNCS, 3831:166-176, 2006. (Pubitemid 43966855)
4. D. Bilo and G. Proietti. On the complexity of minimizing interference in ad-hoc and sensor networks. 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS, LNCS, 4240:13-24, 2006.
5. E.D. Demaine, U. Feige, M.T. Hajiaghayi, and M. R. Salavatipour. Combination can be hard: Approximability of the unique coverage problem. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 162-171, 2006. (Pubitemid 43275237)
6. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM (JACM), 45(4):634-652, 1998. (Pubitemid 128488790)
7. M. Fussen, R. Wattenhofer, and A. Zollinger. Interference arises at the receiver. International Conference on Wireless Networks, Communications, and Mobile Computing (WIRELESSCOM), Maui, Hawaii, USA, 2005.
8. N. Garg, V.V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18:3-20, 1997.
9. J. Guo and R. Niedermeier. Exact algorithms and applications for treelike weighted set cover. Discrete Algorithms, 4(4):608-622, 2006. (Pubitemid 44692617)
10. M. M. Halldorsson and T. Tokuyama. Minimizing interference of a wireless ad-hoc network in a plane. Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS, 4240/2006:71-82, 2006.
11. T. Johansson and L. Carr-Motyckov. Reducing interference in ad hoc networks through topology control. 3rd ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), Cologne, Germany, pages 17-23, 2005. (Pubitemid 44030727)
12. D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
13. F. Kuhn, P. von Rickenbach, R. Wattenhofer, E. Welzl, and A. Zollinger. Interference in cellular networks: the minimum membership set cover proble. 11th International Computing and Combinatorics Conference, COCOON, LNCS, 3595:188-198, 2005. (Pubitemid 41450199)
14. S. Mecke and D. Wagner. Solving geometric covering problems by data reduction. 12th ESA, LNCS, 3221:760-771, 2004.
15. K. Moaveni-Nejad and X.-Y. Li. Low-interference topology control for wireless ad hoc networks, ad hoc & sensor wireless networks. Ad Hoc & Sensor Wireless Networks: An International Journal 1(1-2), pages -, 2005.
16. K. Pahlavan and A. H. Levesque. Wireless information networks. Wiley-Interscience, 1995.
17. N. Ruf and A. Schöbel. Set covering with almost consecutive ones property. Discrete Optimization, 1(2):215-228, 2004. (Pubitemid 40266102)
18. P. von Rickenbach, S. Schmid, R. Wattenhofer, and A. Zollinger. A robust interference model for wireless ad-hoc networks. 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), 2005.