메뉴 건너뛰기




Volumn 16, Issue 5, 2011, Pages 451-463

Fault tolerant data aggregation scheduling with local information in wireless sensor networks

Author keywords

data aggregation; fault tolerated; local information; wireless sensor networks

Indexed keywords

CONNECTED DOMINATING SETS; DATA AGGREGATION; FAULT TOLERATED; FAULT-TOLERANT; LOCAL INFORMATION; SCHEDULING STRATEGIES; TIME COST; WIRELESS SENSOR;

EID: 80053518244     PISSN: 10070214     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1007-0214(11)70065-7     Document Type: Article
Times cited : (21)

References (15)
  • 2
    • 70450177431 scopus 로고    scopus 로고
    • Minimum-latency aggregation scheduling in multihop wireless networks
    • Wan Pengjun, Huang S C H, Wang Lixin, et al. Minimum-latency aggregation scheduling in multihop wireless networks. In: MobiHoc. New Orleans, USA, 2009: 185-193.
    • (2009) MobiHoc. New Orleans, USA , pp. 185-193
    • Pengjun, W.1    Huang, S.C.H.2    Lixin, W.3
  • 4
    • 70349658421 scopus 로고    scopus 로고
    • Distributed data aggregation scheduling in wireless sensor networks
    • Yu B, Li J, Li Y. Distributed data aggregation scheduling in wireless sensor networks. In: IEEE INFOCOM. Rio de Janeiro, Brazil, 2009: 2159-2167.
    • (2009) IEEE INFOCOM. Rio de Janeiro, Brazil , pp. 2159-2167
    • Yu, B.1    Li, J.2    Li, Y.3
  • 5
    • 70450181298 scopus 로고    scopus 로고
    • An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
    • Xu Xiaohua, Wang Shiguang, Mao Xufei, et al. An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks. In: FOWANC. New Orleans, USA, 2009: 47-56.
    • (2009) FOWANC. New Orleans, USA , pp. 47-56
    • Xiaohua, X.1    Shiguang, W.2    Xufei, M.3
  • 6
    • 34548324833 scopus 로고    scopus 로고
    • Nearly constant approximation for data aggregation scheduling in wireless sensor networks
    • DOI 10.1109/INFCOM.2007.50, 4215632, Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
    • Huang S C H, Wan P J, Vu C T, et al. Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: IEEE INFOCOM. Anchorage, USA, 2007: 366-372. (Pubitemid 47334250)
    • (2007) Proceedings - IEEE INFOCOM , pp. 366-372
    • Huang, S.C.-H.1    Wan, P.-J.2    Vu, C.T.3    Li, Y.4    Yao, F.5
  • 8
    • 0036377260 scopus 로고    scopus 로고
    • Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks
    • DOI 10.1109/71.980024
    • I Stojmenovic, M Seddigh, J Zunic Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks IEEE Transactions on Parallel and Distributed Systems 13 1 2002 14 25 (Pubitemid 35037238)
    • (2002) IEEE Transactions on Parallel and Distributed Systems , vol.13 , Issue.1 , pp. 14-25
    • Stojmenovic, I.1    Seddigh, M.2    Zunic, J.3
  • 9
    • 85011431372 scopus 로고    scopus 로고
    • On calculating connected dominating set for efficient routing in ad hoc wireless networks
    • Wu Jie, Li Hailan. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of DIAL-M. Seattle, USA, 1999: 7-14.
    • (1999) Proceedings of DIAL-M. Seattle, USA , pp. 7-14
    • Jie, W.1    Hailan, L.2
  • 11
    • 34548133404 scopus 로고    scopus 로고
    • Hierarchical and fault-tolerant data aggregation in wireless sensor networks
    • San Juan, Puerto Rico
    • Larrea M, Martín C, Astrain J J. Hierarchical and fault-tolerant data aggregation in wireless sensor networks. In: 2nd International Symposium on Wireless Pervasive Computing (ISWPC). San Juan, Puerto Rico, 2007.
    • (2007) 2nd International Symposium on Wireless Pervasive Computing (ISWPC)
    • Larrea M, M.1
  • 13
    • 80053541947 scopus 로고    scopus 로고
    • Decentralized fault-tolerant connected dominating set algorithm formobile ad-hoc networks
    • Schleich J, Bouvry P, Le Thi Hoai An. Decentralized fault-tolerant connected dominating set algorithm formobile ad-hoc networks. In: ICWN. Las Vegas, USA, 2009: 354-360.
    • (2009) ICWN. Las Vegas, USA , pp. 354-360
    • Schleich, J.1    Bouvry, P.2    Le Thi Hoai, An.3
  • 14
    • 80053526128 scopus 로고    scopus 로고
    • Construction of fault tolerant connected dominating sets in WSN
    • 313
    • Bian Yongzhao, Wang Jun, Yu Haibin, et al. Construction of fault tolerant connected dominating sets in WSN. Application Research of Computers, 2010, 27(1): 292-293, 313.
    • (2010) Application Research of Computers , vol.27 , Issue.1 , pp. 292-293
    • Yongzhao, B.1    Jun, W.2    Haibin, Y.3


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