Journal of Industrial and Management Optimization (JIMO)

Dispersion with connectivity in wireless mesh networks
Page number are going to be assigned later 2017

doi:10.3934/jimo.2017074      Abstract        References        Full text (681.8K)      

Birol Yüceoğlu - R & D Center, Information Technologies Department, Migros T.A.S., 34758, Istanbul, Turkey (email)
Ş. İlker Birbil - Faculty of Engineering and Natural Sciences, Sabanci University, Üniversite Caddesi No:27 Tuzla, 34956 Istanbul, Turkey (email)
Özgür Gürbüz - Faculty of Engineering and Natural Sciences, Sabanc University, 34956, Istanbul, Turkey (email)

1 I. F. Akyildiz, X. Wang and W. Wang, Wireless mesh networks: A survey, Computer Networks, 47 (2005), 445-487.
2 C. R. Anderson and T. S. Rappaport, In-building wideband partition loss measurements at 2.5 and 60 GHz, IEEE Transactions on Wireless Communications, 3 (2004), 922-928.
3 F. Birlik, Ö. Gürbüz and Ö. Erçetin, Iptv home networking via 802.11 wireless mesh networks: An implementation experience, IEEE Transactions on Consumer Electronics, 55 (2009), 1192-1199.
4 V. E. Brimkov, A. Leach, J. Wu and M. Mastroianni, Approximation algorithms for a geometric set cover problem, Discrete Applied Mathematics, 160 (2012), 1039-1052.       
5 P. Cappanera, A survey on obnoxious facility location problems, Tech. Rep. TR-99-11, University of Pisa, 1999.
6 R. L. Carraway and R. L. Schmidt, An improved discrete dynamic programming algorithm for allocating resources among interdependent projects, Management Science, 37 (1991), 1195-1200.
7 F. D. Croce, A. Grosso and M. Locatelli, A heuristic approach for the max-min diversity problem based on max-clique, Computers & Operations Research, 36 (2009), 2429-2433.       
8 Z. Drezner and H. W. Hamacher, Facility Location. Applications and Theory, Berlin: Springer, 2002.       
9 E. Erkut and S. Neuman, A multiobjective model for locating undesirable facilities, Annals of Operations Research, 40 (1992), 209-227.
10 S. Fekete and H. Meijer, Maximum dispersion and geometric maximum weight cliques, in APPROX '00: Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization, (London, UK), Springer-Verlag, (2000), 132-143.       
11 Ö. Gürbüz and H. Owen, Power control based QoS provisioning for multimedia in W-CDMA, ACM Wireless Networks (WINET), 8 (2002), 37-44.
12 R. Heydari and E. Melachrinoudis, Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives, European Journal of Operational Research, 223 (2012), 452-460.       
13 P. T. Kabamba, S. M. Meerkov and C. Y. Tang, Optimal, suboptimal, and adaptive threshold policies for power efficiency of wireless networks, IEEE Transactions on Information Theory, 51 (2005), 1359-1376.       
14 R. L. Keeney and H. Raiffa, Decisions with Multiple Objectives, New York: John Wiley, 1976.       
15 A. M. Khedr and W. Osamy, Mobility-assisted minimum connected cover in a wireless sensor network, Journal of Parallel and Distributed Computing, 72 (2012), 827-837.
16 A. H. Land and A. G. Doig, An automatic method of solving discrete programming problems, Econometrica, 28 (1960), 497-520.       
17 E. Macambira, An application of tabu search heuristic for the maximum edge-weighted subgraph problem, Annals of Operations Research, 117 (2002), 175-190.       
18 C. Malandraki and R. B. Dial, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, European Journal of Operational Research, 90 (1996), 45-55.
19 R. E. Marsten and T. L. Morin, A hybrid approach to discrete mathematical programming, Mathematical Programming, 14 (1978), 21-40.       
20 E. Melachrinoudis and Z. Xanthopulos, Semi-obnoxious single facility location in euclidean space, Computers & Operations Research, 30 (2003), 2191-2209.       
21 E. Melachrinoudis, Bicriteria location of a semi-obnoxious facility, Computers & Industrial Engineering, 37 (1999), 581-593.
22 A. T. Murray and R. L. Church, Solving the anti-covering location problem using lagrangian relaxation, Computers & Operations Research, 24 (1997), 127-140.
23 Y. Ohsawa, Bicriteria euclidean location associated with maximin and minimax criteria, Naval Research Logistics (NRL), 47 (2000), 581-592.       
24 Y. Ohsawa and K. Tamura, Efficient location for a semi-obnoxious facility, Annals of Operations Research, 123 (2003), 173-188.       
25 J. Rakas, D. Teodorovic and T. Kim, Multi-objective modeling for determining location of undesirable facilities, Transportation Research Part D: Transport and Environment, 9 (2004), 125-138.
26 M. Rebai, M. L. berre, H. Snoussi, F. Hnaien, and L. Khoukhi, Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks, Computers & Operations Research, 59 (2015), 11-21.       
27 O. Simeone, A. Maeder, M. Peng, O. Sahin and W. Yu, Cloud radio access network: Virtualizing wireless access for dense heterogeneous systems, Journal of Communications and Networks, 18 (2016), 135-149.
28 A. J. V. Skriver and K. A. Andersen, The bicriterion semi-obnoxious location (bsl) problem solved by an [epsilon]-approximation, European Journal of Operational Research, 146 (2003), 517-528.       
29 J. L. Williams, J. W. Fisher and A. S. Willsky, Approximate dynamic programming for communication-constrained sensor network management, IEEE Transactions on Signal Processing, 55 (2007), 4300-4311.       
30 D. Wood, An algorithm for finding a maximum clique in a graph, Operation Research Letters, 21 (1997), 211-217.       
31 IBM, IBM ILOG CPLEX Optimizer, http://www.ibm.com/software/commerce/optimization/cplex-optimizer/, Last retrieved April 2015.
32 The 5G Infrastructure Public Private Partnership, https://5g-ppp.eu/.

Go to top