메뉴 건너뛰기




Volumn 42, Issue 1, 2006, Pages 327-340

Wireless sensor networks: Scheduling for measurement and data reporting

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE APPLICATIONS; REMOTE SENSING; SATELLITE COMMUNICATION SYSTEMS; TOPOLOGY; TREES (MATHEMATICS);

EID: 33644927783     PISSN: 00189251     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAES.2006.1603426     Document Type: Article
Times cited : (63)

References (33)
  • 1
    • 0242537062 scopus 로고    scopus 로고
    • Divisible load theory: A new paradigm for load scheduling in distributed systems
    • Bharadwaj, V., Ghose, D., and Robertazzi, T. G. Divisible load theory: A new paradigm for load scheduling in distributed systems. Cluster Computing, 6 (2003), 7-18.
    • (2003) Cluster Computing , vol.6 , pp. 7-18
    • Bharadwaj, V.1    Ghose, D.2    Robertazzi, T.G.3
  • 2
    • 0004164686 scopus 로고    scopus 로고
    • Scheduling divisible loads in parallel and distributed systems
    • Los Alamitos, CA: IEEE Computer Society Press
    • Bharadwaj, V., Ghose, D., Mani, V., and Robertazzi, T. G. Scheduling divisible loads in parallel and distributed systems. Los Alamitos, CA: IEEE Computer Society Press, 1996.
    • (1996)
    • Bharadwaj, V.1    Ghose, D.2    Mani, V.3    Robertazzi, T.G.4
  • 3
    • 0038399884 scopus 로고    scopus 로고
    • Ten reasons to use divisible load theory
    • Robertazzi, T. G. Ten reasons to use divisible load theory. Computer, 36 (2003), 63-68.
    • (2003) Computer , vol.36 , pp. 63-68
    • Robertazzi, T.G.1
  • 4
    • 0012153339 scopus 로고    scopus 로고
    • Distributed processing of distributed jobs with communication startup costs
    • Blazewicz, J., and Drozdowski, M. Distributed processing of distributed jobs with communication startup costs. Discrete Applied Mathematics, 76 (1997), 21-41.
    • (1997) Discrete Applied Mathematics , vol.76 , pp. 21-41
    • Blazewicz, J.1    Drozdowski, M.2
  • 9
    • 4544381842 scopus 로고    scopus 로고
    • Design and performance analysis of divisible load scheduling strategies on arbitrary graphs
    • Yao, J., and Veeravalli, B. Design and performance analysis of divisible load scheduling strategies on arbitrary graphs. Cluster Computing, 7 (2004), 191-207.
    • (2004) Cluster Computing , vol.7 , pp. 191-207
    • Yao, J.1    Veeravalli, B.2
  • 10
    • 0027677172 scopus 로고
    • Processor equivalence for a linear daisy chain of load sharing processors
    • Robertazzi, T. G. Processor equivalence for a linear daisy chain of load sharing processors. IEEE Transactions on Aerospace and Electronic Systems, 29 (1993), 1216-1221.
    • (1993) IEEE Transactions on Aerospace and Electronic Systems , vol.29 , pp. 1216-1221
    • Robertazzi, T.G.1
  • 12
    • 0029546551 scopus 로고    scopus 로고
    • Scheduling divisible jobs on hypercubes
    • Blazewicz, J., and Drozdowski, M. Scheduling divisible jobs on hypercubes. Parallel Computing, 21 (1996), 1945-1956.
    • (1996) Parallel Computing , vol.21 , pp. 1945-1956
    • Blazewicz, J.1    Drozdowski, M.2
  • 16
    • 4644228468 scopus 로고    scopus 로고
    • Optimal algorithms for scheduling divisible workloads on heterogeneous systems
    • Presented at the 12th Heterogeneous Computing Workshops (HCW' 2003)
    • Beaumont, O., Legrand, A., and Robert, Y. Optimal algorithms for scheduling divisible workloads on heterogeneous systems. Presented at the 12th Heterogeneous Computing Workshops (HCW' 2003), 2003.
    • (2003)
    • Beaumont, O.1    Legrand, A.2    Robert, Y.3
  • 19
    • 33847162188 scopus 로고    scopus 로고
    • Sharing partitionable workloads in heterogeneous NOWs: Greedier is not better
    • Rosenberg, A. L. Sharing partitionable workloads in heterogeneous NOWs: greedier is not better. Cluster Computing, (2001), 124-131.
    • (2001) Cluster Computing , pp. 124-131
    • Rosenberg, A.L.1
  • 25
    • 0242443758 scopus 로고    scopus 로고
    • Topology management for sensor networks: Exploiting latency and density
    • Schurgers, C., Tsiatsis, V., Ganeriwal, S., and Srivastava, M. Topology management for sensor networks: Exploiting latency and density. ACM MobiHOC'02, 2002, 135-145.
    • (2002) ACM MobiHOC'02 , pp. 135-145
    • Schurgers, C.1    Tsiatsis, V.2    Ganeriwal, S.3    Srivastava, M.4
  • 26
    • 0035789814 scopus 로고    scopus 로고
    • Localized algorithms in wireless ad-hoc networks: Location discovery and sensor exposure
    • MobiHOC
    • Megeurdichian, S., Slijepcevic, S., Karayan, V., and Potkonjak, M. Localized algorithms in wireless ad-hoc networks: Location discovery and sensor exposure. MobiHOC, 2001, 106-116.
    • (2001) , pp. 106-116
    • Megeurdichian, S.1    Slijepcevic, S.2    Karayan, V.3    Potkonjak, M.4
  • 31
    • 0035392857 scopus 로고    scopus 로고
    • A survey of energy efficient network protocols for wireless networks
    • Jones, C. E., Sivalingam, K. M., Agrawal, P., and Chen, J. C. A survey of energy efficient network protocols for wireless networks. Wireless Networks, 7 (2001), 343-358.
    • (2001) Wireless Networks , vol.7 , pp. 343-358
    • Jones, C.E.1    Sivalingam, K.M.2    Agrawal, P.3    Chen, J.C.4
  • 32
    • 0033885342 scopus 로고    scopus 로고
    • Energy conserving routing in wireless ad-hoc networks
    • Chang, J., and Tassiulas, L. Energy conserving routing in wireless ad-hoc networks. In Proceedings of IEEE INFOCOM 2000, 2000.
    • (2000) Proceedings of IEEE INFOCOM , pp. 2000
    • Chang, J.1    Tassiulas, L.2


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