메뉴 건너뛰기




Volumn 242, Issue , 2013, Pages 76-91

Broadcasting on-demand data with time constraints using multiple channels in wireless broadcast environments

Author keywords

Competitive analysis; Data overlapping; Latency; Miss rate; NP hard; On demand data broadcasting

Indexed keywords

COMPETITIVE ANALYSIS; DATA BROADCASTING; DATA OVERLAPPING; LATENCY; MISS-RATE; NP-HARD;

EID: 84878107449     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2013.04.026     Document Type: Article
Times cited : (13)

References (25)
  • 6
    • 34548136620 scopus 로고    scopus 로고
    • Broadcast schedules and query processing for K nearest neighbors search on multi-dimensional index trees in a multi-channel environment
    • S.-Y. Fu, C.-M. Liu, Broadcast schedules and query processing for K nearest neighbors search on multi-dimensional index trees in a multi-channel environment, in: Proceedings of the 2006 IEEE International Conference on Systems, Man and Cybernetics, vol. 3, 2006, pp. 2646-2651.
    • (2006) Proceedings of the 2006 IEEE International Conference on Systems, Man and Cybernetics , vol.3 , pp. 2646-2651
    • Fu, S.-Y.1    Liu, C.-M.2
  • 9
    • 84855469255 scopus 로고    scopus 로고
    • Processing generalized k-nearest neighbor queries on a wireless broadcast stream
    • H. Jung, Y.D. Chung, and L. Liu Processing generalized k-nearest neighbor queries on a wireless broadcast stream Information Sciences 188 2012 64 79
    • (2012) Information Sciences , vol.188 , pp. 64-79
    • Jung, H.1    Chung, Y.D.2    Liu, L.3
  • 10
    • 4544231084 scopus 로고    scopus 로고
    • Scheduling broadcasts with deadlines
    • J.-H. Kim, and K.-Y. Chwa Scheduling broadcasts with deadlines Theoretical Computer Science 325 3 2004 479 488
    • (2004) Theoretical Computer Science , vol.325 , Issue.3 , pp. 479-488
    • Kim, J.-H.1    Chwa, K.-Y.2
  • 11
    • 0038527464 scopus 로고    scopus 로고
    • On the complexity of minimizing the number of late jobs in unit time open shop
    • S.A. Kravchenko On the complexity of minimizing the number of late jobs in unit time open shop Discrete Applied Mathematics 100 1-2 2000 127 132
    • (2000) Discrete Applied Mathematics , vol.100 , Issue.12 , pp. 127-132
    • Kravchenko, S.A.1
  • 16
    • 77956394806 scopus 로고    scopus 로고
    • On-demand broadcast for multiple-item requests in a multiple-channel environment
    • K. Liu, and V.C.S. Lee On-demand broadcast for multiple-item requests in a multiple-channel environment Information Sciences 180 22 2010 4336 4352
    • (2010) Information Sciences , vol.180 , Issue.22 , pp. 4336-4352
    • Liu, K.1    Lee, V.C.S.2
  • 17
    • 84862796137 scopus 로고    scopus 로고
    • Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems
    • J. Lv, V.C.S. Lee, M. Li, and E. Chen Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems Data & Knowledge Engineering 73 2012 23 42
    • (2012) Data & Knowledge Engineering , vol.73 , pp. 23-42
    • Lv, J.1    Lee, V.C.S.2    Li, M.3    Chen, E.4
  • 20
    • 84862826258 scopus 로고    scopus 로고
    • Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments
    • J.-Y. Wang Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments Information Sciences 199 2012 93 108
    • (2012) Information Sciences , vol.199 , pp. 93-108
    • Wang, J.-Y.1
  • 21
    • 31344449346 scopus 로고    scopus 로고
    • Time-critical on-demand data broadcast: Algorithms, analysis, and performance evaluation
    • J. Xu, X. Tang, and W.-C. Lee Time-critical on-demand data broadcast: algorithms, analysis, and performance evaluation IEEE Transactions on Parallel and Distributed Systems 17 2006 3 14
    • (2006) IEEE Transactions on Parallel and Distributed Systems , vol.17 , pp. 3-14
    • Xu, J.1    Tang, X.2    Lee, W.-C.3
  • 24
    • 70350318011 scopus 로고    scopus 로고
    • Effective generation of data broadcast schedules with different allocation numbers for multiple wireless channels
    • S.-Y. Yi, S. Nam, and S. Jung Effective generation of data broadcast schedules with different allocation numbers for multiple wireless channels IEEE Transactions on Knowledge and Data Engineering 20 5 2008 668 677
    • (2008) IEEE Transactions on Knowledge and Data Engineering , vol.20 , Issue.5 , pp. 668-677
    • Yi, S.-Y.1    Nam, S.2    Jung, S.3


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