메뉴 건너뛰기




Volumn 12, Issue 6, 2006, Pages 681-690

The effects of synchronization on topology-transparent scheduling

Author keywords

Ad hoc networks; Scheduling; Synchronization models

Indexed keywords

AD HOC NETWORKS; SYNCHRONIZATION MODELS;

EID: 33749614927     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-006-6528-z     Document Type: Article
Times cited : (22)

References (25)
  • 3
    • 0028378721 scopus 로고
    • Making transmission schedules immune to topology changes in multi-hop packet radio networks
    • I. Chlamtac and A. Faragó, Making transmission schedules immune to topology changes in multi-hop packet radio networks, IEEE/ACM Transactions on Networking 2(1) (1994) 23-29.
    • (1994) IEEE/ACM Transactions on Networking , vol.2 , Issue.1 , pp. 23-29
    • Chlamtac, I.1    Faragó, A.2
  • 4
    • 32644434726 scopus 로고    scopus 로고
    • Slot synchronized topology-transparent scheduling for sensor networks
    • W. Chu, C. J. Colbourn and V. R. Syrotiuk, Slot synchronized topology-transparent scheduling for sensor networks, Computer Communications 29(4) (2006) 421-428.
    • (2006) Computer Communications , vol.29 , Issue.4 , pp. 421-428
    • Chu, W.1    Colbourn, C.J.2    Syrotiuk, V.R.3
  • 6
    • 0344012603 scopus 로고    scopus 로고
    • A new recursive construction for optical orthogonal codes
    • W. Chu and S. W. Golomb, A new recursive construction for optical orthogonal codes, IEEE Transactions on Information Theory IT-49 (2003) 3072-3076.
    • (2003) IEEE Transactions on Information Theory , vol.IT-49 , pp. 3072-3076
    • Chu, W.1    Golomb, S.W.2
  • 7
    • 0003938168 scopus 로고    scopus 로고
    • C. J. Colbourn and J. H. Dinitz (editors) (CRC Press)
    • C. J. Colbourn and J. H. Dinitz (editors) CRC Handbook of Combinatorial Designs (CRC Press 1996).
    • (1996) CRC Handbook of Combinatorial Designs
  • 8
    • 0002350694 scopus 로고    scopus 로고
    • Applications of combinatorial designs to communications, cryptography, and networking
    • J. D. Lamb and D. A. Preece, (Eds.). London Mathematical Society, Lecture Note Series 267
    • C. J. Colbourn, J. H. Dinitz and D. R. Stinson, Applications of combinatorial designs to communications, cryptography, and networking, in Surveys in Combinatorics, J. D. Lamb and D. A. Preece, (Eds.), pp. 37-100. London Mathematical Society, Lecture Note Series 267 (1999).
    • (1999) Surveys in Combinatorics , pp. 37-100
    • Colbourn, C.J.1    Dinitz, J.H.2    Stinson, D.R.3
  • 9
    • 3543148316 scopus 로고    scopus 로고
    • Cover-free families and topology-transparent scheduling for MANETs
    • C. J. Colbourn, A. C. H. Ling and V. R. Syrotiuk, Cover-free families and topology-transparent scheduling for MANETs, Designs, Codes, and Cryptography 32(1-3) (2004) 35-65.
    • (2004) Designs, Codes, and Cryptography , vol.32 , Issue.1-3 , pp. 35-65
    • Colbourn, C.J.1    Ling, A.C.H.2    Syrotiuk, V.R.3
  • 12
    • 32644445167 scopus 로고    scopus 로고
    • Combinatorial group testing and its applications
    • World Scientific
    • D. -Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications, volume 12 of Series on Applied Mathematics. 2nd edition (World Scientific, 2000).
    • (2000) Series on Applied Mathematics. 2nd Edition , vol.12
    • Du, D.Z.1    Hwang, F.K.2
  • 13
    • 33749606822 scopus 로고    scopus 로고
    • Breakthrough reliable transport technology for data and live streaming delivery over imperfect networks
    • Digital Fountain, Inc. Breakthrough reliable transport technology for data and live streaming delivery over imperfect networks, Technology Licensing White Paper, (2004).
    • (2004) Technology Licensing White Paper
  • 14
    • 51249175955 scopus 로고
    • Families of finite sets in which no set is covered by the union others
    • P. Erdós, P. Frankl and Z. Fúredi, Families of finite sets in which no set is covered by the union others, Israel J. Math. 51 (1985) 79-89.
    • (1985) Israel J. Math. , vol.51 , pp. 79-89
    • Erdós, P.1    Frankl, P.2    Fúredi, Z.3
  • 15
    • 0027677867 scopus 로고
    • Topology control for multihop packet radio networks
    • L. Hu, Topology control for multihop packet radio networks, IEEE Transactions on Communications 41(10) (1993) 1471-1481.
    • (1993) IEEE Transactions on Communications , vol.41 , Issue.10 , pp. 1471-1481
    • Hu, L.1
  • 16
    • 0032098795 scopus 로고    scopus 로고
    • An optimal topology-transparent scheduling method in multihop packet radio networks
    • J.-H. Ju and V. O. K., Li, An optimal topology-transparent scheduling method in multihop packet radio networks, IEEE/ACM Transactions on Networking 6(3) (1998) 298-306.
    • (1998) IEEE/ACM Transactions on Networking , vol.6 , Issue.3 , pp. 298-306
    • Ju, J.-H.1    Li, V.O.K.2
  • 19
    • 0003902871 scopus 로고    scopus 로고
    • C. E. Perkins, (ed.), (Addison-Wesley, Reading, MA)
    • C. E. Perkins, (ed.), Ad Hoc Networks (Addison-Wesley, Reading, MA, 2000).
    • (2000) Ad Hoc Networks


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