Automated antenna positioning algorithms for wireless fixed-access networks

Journal of Heuristics

Volumn 13, Issue 3, 2007, Pages 243-263

  Ben Shimol, Yehuda ^a   Ben Moshe, Boaz ^b   Ben Yehezkel, Yoav ^a   Dvir, Amit ^a   Segal, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b ARIEL UNIVERSITY   (Israel)

Author keywords

Automated antenna positioning; Fixed access wireless networks; Rural areas; Terrain preprocessing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DIRECTIONAL PATTERNS (ANTENNA); TELECOMMUNICATION LINKS; WIRELESS NETWORKS;

ANTENNA POSITIONING ALGORITHMS; AUTOMATED ANTENNA POSITIONING; AUTOMATED HEURISTICS; MAINTENANCE COSTS; TERRAIN PREPROCESSING;

ANTENNAS;

EID: 34248325620     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-007-9015-5     Document Type: Article

References (27)

1. Agrawal, P.K., Har-Peled, S., Sharir, M., Varadarajan, K.R.: Approximate shortest paths on a convex polytope in three dimensions. J. ACM 44, 567-584 (1997)
2. Anderson, H.R., McGeehan, J.P.: Optimizing microcell base station locations using simulated annealing techniques. In: Proc. of the IEEE Vehicular Technology Conference, pp. 858-862 (1994)
3. Available at http://www.alvarion.com/
4. Available at http://www.hexagonltd.com/
5. Available at http://www.schema.com/
6. Ben-Moshe, B.: Geometric facility location optimization, Ph.D. Thesis, Ben-Gurion University of the Negev (2004)
7. Berman, P., Ramaiyer, V.: Improved approximations for the Steiner tree problem. J. Algorithms 17, 381-408 (1994)
8. Blaunstein, N.: Radio Propagation in Cellular Networks. Artech House, Boston (1999)
9. Calgeri, P., Kuonen, P., Nielsen, F.: Combinatorial optimization algorithms for radio network planning. Theor. Comput. Sci. 263, 235-245 (2001)
10. Efroymson, M.A., Ray, T.L.: A branch and bound algorithm for plant location. Oper. Res. 14, 361-368 (1966)
11. Feige, U.: A threshold of ln n for approximating set cover (preliminary version). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 314-318 (1996)
12. Hao, J.K., Dorne, R., Galinier, P.: Tabu search for frequency assignment in mobile radio networks. J. Heuristics 4, 47-62 (1998)
13. Har-Peled, S.: Constructing approximate shortest path maps in three dimensions. SIAM J. Comput. 28, 1187-1197 (1999) Hougardy, S., Prömel, H.J.: A 1.598 approximation algorithm for the Steiner problem in graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 448-453 (1999)
14. Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Elsevier, Amsterdam (1992)
15. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85-103. Plenum, New York (1972)
16. Karpinsky, M., Zelikovsky, A.: New approximation algorithms for the Steiner tree problem. J. Comb. Optim. 1, 47-65 (1997)
17. Mitchell, J.S., Geometric Shortest Paths and Network Optimization. Handbook of Computational Geometry. North-Holland, Amsterdam (2000)
18. Prömel, H.J., Steger, A.: RNC-approximation algorithms for the Steiner problem. In: Proc. Symposium on Theoretical Aspects of Computer Science, pp. 559-570 (1997)
19. Prömel, H.J., Steger, A., The Steiner Tree Problem: A Tour through Graphs, Algorithms and Complexity. Vieeg & Shohn (2002)
20. Robins, G., Zelikovsky, A.: Tighter bounds for graph Steiner tree approximation. SIAM J. Discret. Math. 19, 122-134 (2005)
21. Sherali, H.D., Pendyala, C.M., Rappaport, T.S.: Optimal location of transmitters for micro-cellular radio communication system design. IEEE J. Sel. Areas Commun. 14, 662-673 (1996)
22. Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japonica 24, 573-577 (1980)
23. Tan, X.: Approximation algorithms for the watchman route and zookeeper's problems. J. Discret. Appl. Math. 136, 363-376 (2004)
24. Tutschku, K.: Demand-based radio network planning of cellular mobile communication system. In: Infocom 98 Conference, pp. 1054-1061 (1998)
25. Vasquez, M., Hao, J.K.: A heuristic approach for antenna positioning in cellular networks. J. Heuristics 7, 443-472 (2001)
26. Zelikovsky, A.: An 11/6-approximation algorithm for the network Steiner problem. Algorithmica 9, 463-470 (1993)
27. Zelikovsky, A., Better approximation bounds for the network and Euclidian Steiner Tree problems. University of Virginia, 1996, CS-96-06