메뉴 건너뛰기




Volumn 20, Issue 3, 2012, Pages 956-969

Sparse WiFi deployment for vehicular internet access with bounded interconnection gap

Author keywords

Roadside WiFi; sparse coverage

Indexed keywords

DATA SERVICES; EXPECTED DELAY; FEASIBLE SOLUTION; IN-SITU; INTERMITTENT CONNECTIVITY; MOBILE USERS; MOVING VEHICLES; NP-HARD; OPEN WIFI ACCESS; OPERATIONAL COSTS; PERFORMANCE GUARANTEES; ROAD NETWORK; SPARSE COVERAGE; VEHICULAR INTERNET ACCESS; WI-FI DEPLOYMENT;

EID: 84862547885     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2011.2170218     Document Type: Article
Times cited : (30)

References (47)
  • 1
    • 70349660165 scopus 로고    scopus 로고
    • Alpha coverage: Bounding the interconnection gap for vehicular Internet access
    • Apr.
    • Z. Zheng, P. Sinha, and S. Kumar, "Alpha coverage: Bounding the interconnection gap for vehicular Internet access," in Proc. IEEE INFOCOM Mini-Conf. , Apr. 2009, pp. 2831-2835.
    • (2009) Proc. IEEE INFOCOM Mini-Conf. , pp. 2831-2835
    • Zheng, Z.1    Sinha, P.2    Kumar, S.3
  • 2
    • 84862550044 scopus 로고    scopus 로고
    • WiMAX technology [Online]
    • "WiMAX technology," WiMAX Forum, Beaverton, OR [Online]. Available: http://www. wimaxforum. org
    • WiMAX Forum, Beaverton, or
  • 3
    • 84885434718 scopus 로고    scopus 로고
    • VeriWise asset intelligence Fairfield, CT [Online]
    • "VeriWise asset intelligence," General Electric Company, Fairfield, CT [Online]. Available: http://www. ge. com/equipmentservices/ assetintelligence/
    • General Electric Company
  • 7
    • 60149104098 scopus 로고    scopus 로고
    • Cabernet: Vehicular content delivery using WiFi
    • Sep.
    • J. Eriksson, H. Balakrishnan, and S. Madden, "Cabernet: Vehicular content delivery using WiFi," in Proc. ACM MobiCom, Sep. 2008, pp. 199-210.
    • (2008) Proc. ACM MobiCom , pp. 199-210
    • Eriksson, J.1    Balakrishnan, H.2    Madden, S.3
  • 8
    • 8344283536 scopus 로고    scopus 로고
    • Drive-thru Internet: IEEE 802. 11b for 'automobile' users
    • Mar.
    • J. Ott and D. Kutscher, "Drive-thru Internet: IEEE 802. 11b for 'automobile' users," in Proc. IEEE INFOCOM, Mar. 2004, vol. 1, pp. 362-373.
    • (2004) Proc. IEEE INFOCOM , vol.1 , pp. 362-373
    • Ott, J.1    Kutscher, D.2
  • 9
    • 85118207081 scopus 로고    scopus 로고
    • Measurements of in-motion 802. 11 networking
    • Apr.
    • R. Gass, J. Scott, and C. Diot, "Measurements of in-motion 802. 11 networking," in Proc. WMCSA, Apr. 2006, pp. 69-74.
    • (2006) Proc. WMCSA , pp. 69-74
    • Gass, R.1    Scott, J.2    Diot, C.3
  • 11
    • 78650759659 scopus 로고    scopus 로고
    • Relays, base stations and meshes: Enhancing mobile networks with infrastructure
    • Sep.
    • N. Banerjee, M. Corner, D. Towsley, and B. Levine, "Relays, base stations and meshes: Enhancing mobile networks with infrastructure," in Proc. ACM MobiCom, Sep. 2008, pp. 81-91.
    • (2008) Proc. ACM MobiCom , pp. 81-91
    • Banerjee, N.1    Corner, M.2    Towsley, D.3    Levine, B.4
  • 14
    • 84860803336 scopus 로고    scopus 로고
    • U. S. Census Bureau, Washington DC [Online]
    • "2008 TIGER/Line shapefiles," U. S. Census Bureau, Washington, DC, 2008 [Online]. Available: http://www. census. gov/geo/www/tiger/tgrshp2008/ tgrshp2008. html
    • (2008) 2008 TIGER/Line Shapefiles
  • 16
    • 0032661528 scopus 로고    scopus 로고
    • On the optimal placement of web proxies in the Internet
    • B. Li, M. J. Golin, G. F. Italiano, X. Deng, and K. Sohraby, "On the optimal placement of web proxies in the Internet," in Proc. IEEE INFOCOM, 1999, vol. 3, pp. 1282-1290.
    • (1999) Proc. IEEE INFOCOM , vol.3 , pp. 1282-1290
    • Li, B.1    Golin, M.J.2    Italiano, G.F.3    Deng, X.4    Sohraby, K.5
  • 18
    • 69249202580 scopus 로고    scopus 로고
    • On the placement of infrastructure overlay nodes
    • Aug.
    • S. Roy, H. Pucha, Z. Zhang, Y. C. Hu, and L. Qiu, "On the placement of infrastructure overlay nodes," IEEE/ACM Trans. Netw. , vol. 17, no. 4, pp. 1298-1311, Aug. 2009.
    • (2009) IEEE/ACM Trans. Netw. , vol.17 , Issue.4 , pp. 1298-1311
    • Roy, S.1    Pucha, H.2    Zhang, Z.3    Hu, Y.C.4    Qiu, L.5
  • 19
    • 18244368690 scopus 로고    scopus 로고
    • Placement of proxy-based multicast overlays
    • DOI 10.1016/j.comnet.2004.11.019, PII S1389128604003391
    • M.-Y. Wu, Y. Zhu, and W. Shu, "Placement of proxy-based multicast overlays," Comput. Netw. , vol. 48, pp. 627-655, 2005. (Pubitemid 40626648)
    • (2005) Computer Networks , vol.48 , Issue.4 , pp. 627-655
    • Wu, M.-Y.1    Zhu, Y.2    Shu, W.3
  • 20
    • 33748037385 scopus 로고    scopus 로고
    • Mobile backbone networks-Construction and maintenance
    • May
    • A. Srinivas, G. Zussman, and E. Modiano, "Mobile backbone networks-Construction and maintenance," in Proc. ACM MobiHoc, May 2006, pp. 166-177.
    • (2006) Proc. ACM MobiHoc , pp. 166-177
    • Srinivas, A.1    Zussman, G.2    Modiano, E.3
  • 21
    • 33750829660 scopus 로고    scopus 로고
    • Gateway placement optimization in wireless mesh networks with QoS constraints
    • DOI 10.1109/JSAC.2006.881606, 1717626
    • 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. (Pubitemid 44711716)
    • (2006) IEEE Journal on Selected Areas in Communications , vol.24 , Issue.11 , pp. 2127-2136
    • Aoun, B.1    Boutaba, R.2    Iraqi, Y.3    Kenward, G.4
  • 23
    • 33747172362 scopus 로고    scopus 로고
    • Maximizing the spread of influence through a social network
    • D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in Proc. ACM SIGKDD, 2003, pp. 137-146.
    • (2003) Proc. ACM SIGKDD , pp. 137-146
    • Kempe, D.1    Kleinberg, J.2    Tardos, E.3
  • 24
    • 0021897852 scopus 로고
    • APPROXIMATION SCHEMES FOR COVERING AND PACKING PROBLEMS IN IMAGE PROCESSING AND VLSI.
    • DOI 10.1145/2455.214106
    • D. S. Hochbaum andW. Maass, "Approximation schemes for covering and packing problems in image processing and VLSI," J. ACM, vol. 32, no. 1, pp. 130-136, 1985. (Pubitemid 15599048)
    • (1985) Journal of the ACM , vol.32 , Issue.1 , pp. 130-136
    • Hochbaum Dorit, S.1    Maass Wolfgang2
  • 25
    • 85045636699 scopus 로고    scopus 로고
    • Maintaining sensing coverage and connectivity in large sensor networks
    • H. Zhang and J. Hou, "Maintaining sensing coverage and connectivity in large sensor networks," Ad Hoc Sensor Wireless Netw. , vol. 1, no. 1-2, pp. 89-124, 2005.
    • (2005) Ad Hoc Sensor Wireless Netw. , vol.1 , Issue.1-2 , pp. 89-124
    • Zhang, H.1    Hou, J.2
  • 29
    • 70349668916 scopus 로고    scopus 로고
    • Trap coverage: Allowing coverage holes of bounded diameter in wireless sensor networks
    • Apr.
    • P. Balister, Z. Zheng, S. Kumar, and P. Sinha, "Trap coverage: Allowing coverage holes of bounded diameter in wireless sensor networks," in Proc. IEEE INFOCOM, Apr. 2009, pp. 136-144.
    • (2009) Proc. IEEE INFOCOM , pp. 136-144
    • Balister, P.1    Zheng, Z.2    Kumar, S.3    Sinha, P.4
  • 30
    • 0034486529 scopus 로고    scopus 로고
    • Optimum positioning of base stations for cellular radio networks
    • DOI 10.1023/A:1019263308849
    • R. Mathar and T. Niessen, "Optimum positioning of base stations for cellular radio networks," Wireless Netw. , vol. 6, no. 6, pp. 421-428, 2000. (Pubitemid 32160156)
    • (2000) Wireless Networks , vol.6 , Issue.6 , pp. 421-428
    • Mathar, R.1    Niessen, T.2
  • 32
    • 49049084465 scopus 로고    scopus 로고
    • Catching elephants with mice: Sparse sampling for monitoring sensor networks
    • S. Gandhi, S. Suri, and E. Welzl, "Catching elephants with mice: Sparse sampling for monitoring sensor networks," in Proc. ACM SenSys, 2007, pp. 261-274.
    • (2007) Proc. ACM SenSys , pp. 261-274
    • Gandhi, S.1    Suri, S.2    Welzl, E.3
  • 33
    • 85011017713 scopus 로고    scopus 로고
    • Adaptive fastest path computation on a road network: A traffic mining approach
    • Sep.
    • H. Gonzalez, J. Han, X. Li, M. Myslinska, and J. P. Sondag, "Adaptive fastest path computation on a road network: A traffic mining approach," in Proc. VLDB, Sep. 2007, pp. 794-805.
    • (2007) Proc. VLDB , pp. 794-805
    • Gonzalez, H.1    Han, J.2    Li, X.3    Myslinska, M.4    Sondag, J.P.5
  • 35
    • 0346009267 scopus 로고    scopus 로고
    • Multiway cuts in node weighted graphs
    • N. Garg, V. V. Vazirani, and M. Yannakakis, "Multiway cuts in node weighted graphs," J. Algor. , vol. 50, no. 1, pp. 49-61, 2004.
    • (2004) J. Algor. , vol.50 , Issue.1 , pp. 49-61
    • Garg, N.1    Vazirani, V.V.2    Yannakakis, M.3
  • 36
    • 0030127682 scopus 로고    scopus 로고
    • Approximate max-flow min-(multi)cut theorems and their applications
    • N. Garg, V. V. Vazirani, and M. Yannakakis, "Approximate max-flow min-(multi)cut theorems and their applications," SIAM J. Comput. , vol. 25, no. 2, pp. 235-251, 1996. (Pubitemid 126577270)
    • (1996) SIAM Journal on Computing , vol.25 , Issue.2 , pp. 235-251
    • Garg, N.1    Vazirani, V.V.2    Yannakakis, M.3
  • 37
    • 0000114717 scopus 로고    scopus 로고
    • Approximating fractional multicommodity flow independent of the number of commodities
    • L. Fleischer, "Approximating fractional multicommodity flow independent of the number of commodities," SIAM J. Discrete Math. , vol. 13, no. 4, pp. 505-520, 2000.
    • (2000) SIAM J. Discrete Math. , vol.13 , Issue.4 , pp. 505-520
    • Fleischer, L.1
  • 38
    • 84976775257 scopus 로고
    • Color-coding,"
    • N. Alon, R. Yuster, and U. Zwick, "Color-coding," J. ACM, vol. 42, no. 4, pp. 844-856, 1995.
    • (1995) J. ACM , vol.42 , Issue.4 , pp. 844-856
    • Alon, N.1    Yuster, R.2    Zwick, U.3
  • 39
    • 0037411883 scopus 로고    scopus 로고
    • An approximation algorithm for computing longest paths
    • M. G. Scutellà, "An approximation algorithm for computing longest paths," Eur. J. Oper. Res. , vol. 148, pp. 584-590, 2003.
    • (2003) Eur. J. Oper. Res. , vol.148 , pp. 584-590
    • Scutellà, M.G.1
  • 40
    • 0037739972 scopus 로고    scopus 로고
    • Improved results for directed multicut
    • A. Gupta, "Improved results for directed multicut," in Proc. ACM-SIAM SODA, 2003, pp. 454-455.
    • (2003) Proc. ACM-SIAM SODA , pp. 454-455
    • Gupta, A.1
  • 42
    • 0027647527 scopus 로고
    • Improved bounds for the max-flow minmulticut ratio for planar and-free graphs
    • É. Tardos and V. V. Vazirani, "Improved bounds for the max-flow minmulticut ratio for planar and-free graphs," Inf. Process. Lett. , vol. 47, no. 2, pp. 77-80, 1993.
    • (1993) Inf. Process. Lett. , vol.47 , Issue.2 , pp. 77-80
    • ́, T.E.1    Vazirani, V.V.2
  • 43
    • 0001024505 scopus 로고
    • On the uniform convergence of relative frequencies of events to their probabilities
    • V. Vapnik and A. Chervonenkis, "On the uniform convergence of relative frequencies of events to their probabilities," Theory Probab. Appl. , vol. 16, no. 2, pp. 264-280, 1971.
    • (1971) Theory Probab. Appl. , vol.16 , Issue.2 , pp. 264-280
    • Vapnik, V.1    Chervonenkis, A.2
  • 44
    • 25044445636 scopus 로고
    • Almost optimal set covers in finite VC-dimension
    • H. Brönnimann and M. T. Goodrich, "Almost optimal set covers in finite VC-dimension," Discrete Comput. Geometry, vol. 14, no. 1, pp. 463-479, 1995.
    • (1995) Discrete Comput. Geometry , vol.14 , Issue.1 , pp. 463-479
    • Brönnimann, H.1    Goodrich, M.T.2
  • 45
    • 77951688930 scopus 로고    scopus 로고
    • Highway dimension, shortest paths, and provably efficient algorithms
    • Jan.
    • I. Abraham, A. Fiat, A. V. Goldberg, and R. F. Werneck, "Highway dimension, shortest paths, and provably efficient algorithms," in Proc. ACM-SIAM SODA, Jan. 2010, pp. 782-793.
    • (2010) Proc. ACM-SIAM SODA , pp. 782-793
    • Abraham, I.1    Fiat, A.2    Goldberg, A.V.3    Werneck, R.F.4
  • 46
    • 77953318869 scopus 로고
    • Mutually repellant sampling
    • D.-Z. Du and P. M. Pardalos, Eds. Norwell, MA: Kluwer
    • S.-H. Teng, "Mutually repellant sampling," in Minmax and its Applications, D.-Z. Du and P. M. Pardalos, Eds. Norwell, MA: Kluwer, 1995, pp. 129-140.
    • (1995) Minmax and Its Applications , pp. 129-140
    • Teng, S.-H.1
  • 47
    • 25644450392 scopus 로고    scopus 로고
    • Perfect simulation and stationarity of a class of mobility models
    • Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
    • J.-Y. L. Boudec and M. Vojnoví, "Perfect simulation and stationarity of a class of mobility models," in Proc. IEEE INFOCOM, 2005, vol. 4, pp. 2743-2754. (Pubitemid 41382387)
    • (2005) Proceedings - IEEE INFOCOM , vol.4 , pp. 2743-2754
    • Le Boudec, J.-Y.1    Vojnovic, M.2


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