메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages

Data dissemination to a large mobile network: Simulation of broadcast clouds

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST CLOUDS; DATA DISSEMINATION; WIRELESS CELLS;

EID: 33751051096     PISSN: 15516245     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MDM.2006.60     Document Type: Conference Paper
Times cited : (7)

References (10)
  • 1
    • 84976840503 scopus 로고
    • Broadcast Disks: Data management for asymmetric communication environments
    • San Jose, CA, May
    • Acharya, S., R. Alonso, M. Franklin and S. Zdonik. Broadcast Disks: Data management for asymmetric communication environments. Proceedings of ACM SIGMOD, San Jose, CA, May (1995).
    • (1995) Proceedings of ACM SIGMOD
    • Acharya, S.1    Alonso, R.2    Franklin, M.3    Zdonik, S.4
  • 2
    • 0033352389 scopus 로고    scopus 로고
    • RXW: A scheduling approach for large-scale on-demand data broadcast
    • Aksoy, D. and M. Franklin. RXW: A scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Transactions on Networking (1999) 7(6):846-860.
    • (1999) IEEE/ACM Transactions on Networking , vol.7 , Issue.6 , pp. 846-860
    • Aksoy, D.1    Franklin, M.2
  • 4
    • 0346207638 scopus 로고    scopus 로고
    • Adaptive broadcast protocols to support efficient and energy conserving retrieval from databases in mobile computing environments
    • Datta, A., D. VanderMeer, A. Celik and V. Kumar. Adaptive Broadcast Protocols to Support Efficient and Energy Conserving Retrieval from Databases in Mobile Computing Environments. ACM Transactions on Database Systems (1999) 24(1): 1-79.
    • (1999) ACM Transactions on Database Systems , vol.24 , Issue.1 , pp. 1-79
    • Datta, A.1    VanderMeer, D.2    Celik, A.3    Kumar, V.4
  • 5
    • 84968764938 scopus 로고    scopus 로고
    • NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
    • San Francisco, CA
    • Erlebach, T. and A. Hall. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, (2002), pp 194-202.
    • (2002) Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 194-202
    • Erlebach, T.1    Hall, A.2
  • 6
    • 0035790408 scopus 로고    scopus 로고
    • A new hybrid broadcast scheduling algorithm for asymmetric communication systems: Push and Pull data based on optimal cut-off point
    • July, Rome, Italy
    • Guo, Y., S. K. Das and C. M. Pinotti. A new hybrid broadcast scheduling algorithm for asymmetric communication systems: Push and Pull data based on optimal cut-off point. Proceedings of ACM MSWIM 2001, July 2001, Rome, Italy, pp 123-130.
    • (2001) Proceedings of ACM MSWIM 2001 , pp. 123-130
    • Guo, Y.1    Das, S.K.2    Pinotti, C.M.3
  • 7
    • 0032625521 scopus 로고    scopus 로고
    • Efficient algorithms for scheduling data broadcast
    • Hameed S. and N. H. Vaidya. Efficient algorithms for scheduling data broadcast. Wireless Networks 5 (1999) pp 183-193.
    • (1999) Wireless Networks , vol.5 , pp. 183-193
    • Hameed, S.1    Vaidya, N.H.2
  • 10
    • 0032667623 scopus 로고    scopus 로고
    • Broadcast scheduling for information distribution
    • Su C.-J., L. Tassiulas and V. J. Tsotras. Broadcast scheduling for information distribution. Wireless Networks 5 (1999) pp 137-147.
    • (1999) Wireless Networks , vol.5 , pp. 137-147
    • Su, C.-J.1    Tassiulas, L.2    Tsotras, V.J.3


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