DISPERSION WITH CONNECTIVITY IN WIRELESS MESH NETWORKS

被引:0
作者
Yuceoglu, Birol [1 ]
Birbil, S. Ilker [2 ]
Gurbuz, Ozgur [2 ]
机构
[1] Migros TAS, Informat Technol Dept, R&D Ctr, TR-34758 Istanbul, Turkey
[2] Sabanci Univ, Fac Engn & Nat Sci, TR-34956 Istanbul, Turkey
关键词
Wireless mesh networks; wireless network deployment; dispersion problem; tree search; goal programming; LOCATION; ALGORITHM; FACILITY; MAXIMIN;
D O I
10.3934/jimo.2017074
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We study a multi-objective access point dispersion problem, where the conflicting objectives of maximizing the distance and maximizing the connectivity between the agents are considered with explicit coverage (or Quality of Service) constraints. We model the problem first as a multi-objective model, and then, we consider the constrained single objective alternatives, which we propose to solve using three approaches: The first approach is an optimal tree search algorithm, where bounds are used to prune the search tree. The second approach is a beam search heuristic, which is also used to provide lower bound for the first approach. The third approach is a straightforward integer programming approach. We present an illustrative application of our solution approaches in a real wireless mesh network deployment problem.
引用
收藏
页码:759 / 784
页数:26
相关论文
共 31 条
  • [1] Wireless mesh networks: a survey
    Akyildiz, IF
    Wang, XD
    Wang, WL
    [J]. COMPUTER NETWORKS, 2005, 47 (04) : 445 - 487
  • [2] In-building wideband partition loss measurements at 2.5 and 60 GHz
    Anderson, CR
    Rappaport, TS
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2004, 3 (03) : 922 - 928
  • [3] IPTV Home Networking via 802.11 Wireless Mesh Networks: An Implementation Experience
    Birlik, Firat
    Gurbuz, Ozgur
    Ercetin, Ozgur
    [J]. IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, 2009, 55 (03) : 1192 - 1199
  • [4] Approximation algorithms for a geometric set cover problem
    Brimkov, Valentin E.
    Leach, Andrew
    Wu, Jimmy
    Mastroianni, Michael
    [J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (7-8) : 1039 - 1052
  • [5] Cappanera P, 1999, Technical Report TR-99-11
  • [6] AN IMPROVED DISCRETE DYNAMIC-PROGRAMMING ALGORITHM FOR ALLOCATING RESOURCES AMONG INTERDEPENDENT PROJECTS
    CARRAWAY, RL
    SCHMIDT, RL
    [J]. MANAGEMENT SCIENCE, 1991, 37 (09) : 1195 - 1200
  • [7] A heuristic approach for the max-min diversity problem based on max-clique
    Della Croce, Federico
    Grosso, Andrea
    Locatelli, Marco
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (08) : 2429 - 2433
  • [8] Drezner Z, 2002, FACILITY LOCATION APPLICATIONS AND THEORY, P1
  • [9] Erkut E., 1992, Annals of Operations Research, V40, P209, DOI 10.1007/BF02060478
  • [10] Fekete S. P., 2000, Approximation Algorithms for Combinatorial Optimization. Third International Workshop, APPROX 2000. Proceedings (Lecture Notes in Computer Science Vol.1913), P132