메뉴 건너뛰기




Volumn 5, Issue 5, 2018, Pages 3823-3836

Efficient Network Planning for Internet of Things with QoS Constraints

Author keywords

Cost optimization; fog computing; gateway placement; Internet of Things (IoT); sensor network; smart city

Indexed keywords

COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; COSTS; FOG COMPUTING; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; INTERNET OF THINGS; QUALITY OF SERVICE; RADIO TRANSCEIVERS; SENSOR NETWORKS; SMART CITY; TRANSCEIVERS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 85048857049     PISSN: None     EISSN: 23274662     Source Type: Journal    
DOI: 10.1109/JIOT.2018.2849327     Document Type: Article
Times cited : (28)

References (28)
  • 1
    • 84941085241 scopus 로고    scopus 로고
    • Internet of Things: A survey on enabling technologies, protocols, and applications
    • A. Al-Fuqaha, M. Guizani, M. Mohammadi, M. Aledhari, and M. Ayyash, "Internet of Things: A survey on enabling technologies, protocols, and applications, " IEEE Commun. Surveys Tuts., vol. 17, no. 4, pp. 2347-2376, 2015.
    • (2015) IEEE Commun. Surveys Tuts , vol.17 , Issue.4 , pp. 2347-2376
    • Al-Fuqaha, A.1    Guizani, M.2    Mohammadi, M.3    Aledhari, M.4    Ayyash, M.5
  • 3
    • 84883239199 scopus 로고    scopus 로고
    • Convergence of MANET and WSN in IoT urban scenarios
    • Oct
    • P. Bellavista, G. Cardone, A. Corradi, and L. Foschini, "Convergence of MANET and WSN in IoT urban scenarios, " IEEE Sensors J., vol. 13, no. 10, pp. 3558-3567, Oct. 2013.
    • (2013) IEEE Sensors J , vol.13 , Issue.10 , pp. 3558-3567
    • Bellavista, P.1    Cardone, G.2    Corradi, A.3    Foschini, L.4
  • 4
    • 34548850872 scopus 로고    scopus 로고
    • A survey on clustering algorithms for wireless sensor networks
    • A. A. Abbasi and M. Younis, "A survey on clustering algorithms for wireless sensor networks, " Comput. Commun., vol. 30, nos. 14-15, pp. 2826-2841, 2007.
    • (2007) Comput. Commun , vol.30 , Issue.14-15 , pp. 2826-2841
    • Abbasi, A.A.1    Younis, M.2
  • 5
    • 13844296355 scopus 로고    scopus 로고
    • Wireless mesh networks: A survey
    • I. F. Akyildiz, X. Wang, and W. Wang, "Wireless mesh networks: A survey, " Comput. Netw., vol. 47, no. 4, pp. 445-487, 2005.
    • (2005) Comput. Netw , vol.47 , Issue.4 , pp. 445-487
    • Akyildiz, I.F.1    Wang, X.2    Wang, W.3
  • 6
    • 39149099807 scopus 로고    scopus 로고
    • Strategies and techniques for node placement in wireless sensor networks: A survey
    • M. Younis and K. Akkaya, "Strategies and techniques for node placement in wireless sensor networks: A survey, " Ad Hoc Netw., vol. 6, no. 4, pp. 621-655, 2008.
    • (2008) Ad Hoc Netw , vol.6 , Issue.4 , pp. 621-655
    • Younis, M.1    Akkaya, K.2
  • 7
    • 17744379156 scopus 로고    scopus 로고
    • Optimizing the placement of integration points in multi-hop wireless networks
    • R. Chandra, L. Qiu, K. Jain, and M. Mahdian, "Optimizing the placement of integration points in multi-hop wireless networks, " in Proc. ICNP, 2004, pp. 271-282.
    • (2004) Proc. ICNP , pp. 271-282
    • Chandra, R.1    Qiu, L.2    Jain, K.3    Mahdian, M.4
  • 8
    • 48449097274 scopus 로고    scopus 로고
    • Gateway placement for throughput optimization in wireless mesh networks
    • F. Li, Y. Wang, X.-Y. Li, A. Nusairat, and Y. Wu, "Gateway placement for throughput optimization in wireless mesh networks, " Mobile Netw. Appl., vol. 13, no. 1-2, pp. 198-211, 2008.
    • (2008) Mobile Netw. Appl , vol.13 , Issue.1-2 , pp. 198-211
    • Li, F.1    Wang, Y.2    Li, X.-Y.3    Nusairat, A.4    Wu, Y.5
  • 9
    • 33750829660 scopus 로고    scopus 로고
    • Gateway placement optimization in wireless mesh networks with QoS constraints
    • Nov
    • B. Aoun, R. Boutaba, Y. Iraqi, and G. Kenward, "Gateway placement optimization in wireless mesh networks with QoS constraints, " IEEE J. Sel. Areas Commun., vol. 24, no. 11, pp. 2127-2136, Nov. 2006.
    • (2006) IEEE J. Sel. Areas Commun , vol.24 , Issue.11 , pp. 2127-2136
    • Aoun, B.1    Boutaba, R.2    Iraqi, Y.3    Kenward, G.4
  • 10
    • 50049089808 scopus 로고    scopus 로고
    • Gateway placement with QoS constraints in wireless mesh networks
    • Y. Drabu and H. Peyravi, "Gateway placement with QoS constraints in wireless mesh networks, " in Proc. IEEE 7th Int. Conf. Netw. (ICN), 2008, pp. 46-51.
    • (2008) Proc IEEE 7th Int. Conf. Netw. (ICN) , pp. 46-51
    • Drabu, Y.1    Peyravi, H.2
  • 13
    • 80053326017 scopus 로고    scopus 로고
    • A simulated annealing algorithm for router nodes placement problem in wireless mesh networks
    • F. Xhafa, A. Barolli, C. Sánchez, and L. Barolli, "A simulated annealing algorithm for router nodes placement problem in wireless mesh networks, " Simulat. Model. Pract. Theory, vol. 19, no. 10, pp. 2276-2284, 2011.
    • (2011) Simulat. Model. Pract. Theory , vol.19 , Issue.10 , pp. 2276-2284
    • Xhafa, F.1    Barolli, A.2    Sánchez, C.3    Barolli, L.4
  • 14
    • 84931260093 scopus 로고    scopus 로고
    • An iterated Tabu search heuristic for the single source capacitated facility location problem
    • Feb
    • S. C. Ho, "An iterated Tabu search heuristic for the single source capacitated facility location problem, " Appl. Soft Comput., vol. 27, pp. 169-178, Feb. 2015.
    • (2015) Appl. Soft Comput , vol.27 , pp. 169-178
    • Ho, S.C.1
  • 15
    • 84938634538 scopus 로고    scopus 로고
    • Social-Aware dynamic router node placement in wireless mesh networks
    • C.-C. Lin, P.-T. Tseng, T.-Y. Wu, and D.-J. Deng, "Social-Aware dynamic router node placement in wireless mesh networks, " Wireless Netw., vol. 22, no. 4, pp. 1235-1250, 2016.
    • (2016) Wireless Netw , vol.22 , Issue.4 , pp. 1235-1250
    • Lin, C.-C.1    Tseng, P.-T.2    Wu, T.-Y.3    Deng, D.-J.4
  • 17
    • 33747142749 scopus 로고    scopus 로고
    • The capacity of wireless networks
    • Mar
    • P. Gupta and P. R. Kumar, "The capacity of wireless networks, " IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
    • (2000) IEEE Trans. Inf. Theory , vol.46 , Issue.2 , pp. 388-404
    • Gupta, P.1    Kumar, P.R.2
  • 18
    • 84976826673 scopus 로고
    • Voronoi diagrams-A survey of a fundamental geometric data structure
    • F. Aurenhammer, "Voronoi diagrams-A survey of a fundamental geometric data structure, " ACM Comput. Surveys, vol. 23, no. 3, pp. 345-405, 1991.
    • (1991) ACM Comput. Surveys , vol.23 , Issue.3 , pp. 345-405
    • Aurenhammer, F.1
  • 19
    • 84959182223 scopus 로고    scopus 로고
    • Uncapacitated and capacitated facility location problems
    • Boston, MA, USA Springer
    • V. Verter, "Uncapacitated and capacitated facility location problems, " in Foundation of Location Analysis, vol. 155. Boston, MA, USA: Springer, 2011, pp. 25-37.
    • (2011) Foundation of Location Analysis , vol.155 , pp. 25-37
    • Verter, V.1
  • 20
    • 0020102027 scopus 로고
    • Least squares quantization in PCM
    • Mar
    • S. P. Lloyd, "Least squares quantization in PCM, " IEEE Trans. Inf. Theory, vol. IT-28, no. 2, pp. 129-136, Mar. 1982.
    • (1982) IEEE Trans. Inf. Theory , vol.28 , Issue.2 , pp. 129-136
    • Lloyd, S.P.1
  • 22
    • 79954632157 scopus 로고    scopus 로고
    • K-means requires exponentially many iterations even in the plane
    • A. Vattani, "K-means requires exponentially many iterations even in the plane, " Discr. Comput. Geom., vol. 45, no. 4, pp. 596-616, 2011.
    • (2011) Discr. Comput. Geom , vol.45 , Issue.4 , pp. 596-616
    • Vattani, A.1
  • 23
    • 0036647190 scopus 로고    scopus 로고
    • An efficient k-means clustering algorithm: Analysis and implementation
    • Jul
    • T. Kanungo et al., "An efficient k-means clustering algorithm: Analysis and implementation, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 7, pp. 881-892, Jul. 2002.
    • (2002) IEEE Trans. Pattern Anal. Mach. Intell , vol.24 , Issue.7 , pp. 881-892
    • Kanungo, T.1
  • 24
    • 44649120234 scopus 로고    scopus 로고
    • A nearly linear-Time approximation scheme for the Euclidean k-median problem
    • S. G. Kolliopoulos and S. Rao, "A nearly linear-Time approximation scheme for the Euclidean k-median problem, " SIAM J. Comput., vol. 37, no. 3, pp. 757-782, 2007.
    • (2007) SIAM J. Comput , vol.37 , Issue.3 , pp. 757-782
    • Kolliopoulos, S.G.1    Rao, S.2
  • 25
    • 0014724359 scopus 로고
    • An algorithm for finding shortest routes from all source nodes to a given destination in general networks
    • J. Y. Yen, "An algorithm for finding shortest routes from all source nodes to a given destination in general networks, " Quart. Appl. Math., vol. 27, no. 4, pp. 526-530, 1970.
    • (1970) Quart. Appl. Math , vol.27 , Issue.4 , pp. 526-530
    • Yen, J.Y.1
  • 27
    • 85056970814 scopus 로고    scopus 로고
    • Accessed Oct
    • IBM ILOG CPLEX for Python. Accessed: Oct. 2016. [Online]. Available: http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/index.html
    • (2016) IBM ILOG CPLEX for Python


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.