메뉴 건너뛰기




Volumn 15, Issue 2-4, 2012, Pages 315-338

Data aggregation scheduling in uncoordinated duty-cycled wireless sensor networks under protocol interference model

Author keywords

Approximation algorithms; Breadth first search; Data aggregation scheduling; Duty cycle; Protocol interference model; Wireless sensor networks

Indexed keywords


EID: 84862869680     PISSN: 15519899     EISSN: 15520633     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (21)

References (27)
  • 1
    • 33646854367 scopus 로고    scopus 로고
    • Minimum data aggregation time problem in wireless sensor networks
    • X. J. Chen, X. D. Hu, and J. M. Zhu. (2005). Minimum data aggregation time problem in wireless sensor networks. Lecture Notes in Computer Science 3794, pages 133-142.
    • (2005) Lecture Notes in Computer Science 3794 , pp. 133-142
    • Chen, X.J.1    Hu, X.D.2    Zhu, J.M.3
  • 4
    • 50049112666 scopus 로고    scopus 로고
    • Dynamic forwarding over tree-on-dag for scalable data aggregation in sensor networks
    • K.-W. Fan, S. Liu, and P. Sinha. (2008). Dynamic forwarding over tree-on-dag for scalable data aggregation in sensor networks. IEEE Transactions on Mobile Computing, 16(10):1271-1284.
    • (2008) IEEE Transactions on Mobile Computing , vol.16 , Issue.10 , pp. 1271-1284
    • Fan, K.-W.1    Liu, S.2    Sinha, P.3
  • 5
    • 84945709831 scopus 로고
    • Algorithm 97: Shortest path
    • R.W. Floyd. (1962). Algorithm 97: Shortest path. Communications of the ACM, 5(6):345.
    • (1962) Communications of the ACM , vol.5 , Issue.6 , pp. 345
    • Floyd, R.W.1
  • 9
    • 34548398442 scopus 로고    scopus 로고
    • Asynchronous random sleeping for sensor networks
    • C. Hua and T.-S. P. Yum. (2007). Asynchronous random sleeping for sensor networks. ACM Transactions on Sensor Networks, 3(3):15.
    • (2007) ACM Transactions on Sensor Networks , vol.3 , Issue.3 , pp. 15
    • Hua, C.1    Yum, T.-S.P.2
  • 16
    • 50149115190 scopus 로고    scopus 로고
    • Optimizing lifetime for continuous data aggregation with precision guarantees in wireless sensor networks
    • X. Tang and J. Xu. (2008). Optimizing lifetime for continuous data aggregation with precision guarantees in wireless sensor networks. IEEE/ACMTransactions on Networking, 16(4):904-917.
    • (2008) IEEE/ACMTransactions on Networking , vol.16 , Issue.4 , pp. 904-917
    • Tang, X.1    Xu, J.2
  • 17
    • 1642408650 scopus 로고    scopus 로고
    • Distributed construction of connected dominating set in wireless ad hoc networks
    • P.-J. Wan, K. M. Alzoubi, and O. Frieder. (2004). Distributed construction of connected dominating set in wireless ad hoc networks. Mob. Netw. Appl., 9(2):141-149.
    • (2004) Mob. Netw. Appl. , vol.9 , Issue.2 , pp. 141-149
    • Wan, P.-J.1    Alzoubi, K.M.2    Frieder, O.3
  • 24
    • 70350545714 scopus 로고    scopus 로고
    • Optimal stochastic policies for distributed data aggregation in wireless sensor networks
    • Z. Ye, A. A. Abouzeid, and J. Ai. (2009). Optimal stochastic policies for distributed data aggregation in wireless sensor networks. IEEE/ACM Transactions on Networking, 17(5):1494-1507.
    • (2009) IEEE/ACM Transactions on Networking , vol.17 , Issue.5 , pp. 1494-1507
    • Ye, Z.1    Abouzeid, A.A.2    Ai, J.3


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