메뉴 건너뛰기




Volumn 6091 LNCS, Issue , 2010, Pages 277-290

Resource optimization algorithm for sparse time-driven sensor networks

Author keywords

Minimum spanning tree; Network planning; Spanning tree; TDMA; Time driven sensor networks

Indexed keywords

APPLICATION REQUIREMENTS; LINK DISTANCE; MINIMUM SPANNING TREES; NETWORK LIFETIME; NETWORK PLANNING; NODE DEPLOYMENT; REDUCTION ALGORITHMS; RELAY NODE; RESOURCE OPTIMIZATION; SAMPLING LOCATION; SPANNING TREE; DATA GATHERING TREES;

EID: 77953261045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12963-6_22     Document Type: Conference Paper
Times cited : (1)

References (14)
  • 1
    • 13944283393 scopus 로고    scopus 로고
    • A survey on routing protocols for wireless sensor networks
    • DOI 10.1016/j.adhoc.2003.09.010, PII S1570870503000738
    • Akkaya, K., Younis, M.: A Survey on Routing Protocols for Wireless Sensor Networks. Ad Hoc Networks 3, 325-349 (2005) (Pubitemid 40266054)
    • (2005) Ad Hoc Networks , vol.3 , Issue.3 , pp. 325-349
    • Akkaya, K.1    Younis, M.2
  • 4
    • 0037739959 scopus 로고    scopus 로고
    • Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk
    • Goel, A., Estrin, D.: Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk. In: ACM Symposium on Discrete Algorithms (2003)
    • ACM Symposium on Discrete Algorithms (2003)
    • Goel, A.1    Estrin, D.2
  • 6
    • 51349108846 scopus 로고    scopus 로고
    • On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
    • Wu, Y., Fahmy, S., Shroff, N.B.: On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm. In: 27th Conference on Computer Communications, INFOCOM (2008)
    • 27th Conference on Computer Communications, INFOCOM (2008)
    • Wu, Y.1    Fahmy, S.2    Shroff, N.B.3
  • 7
    • 43949136957 scopus 로고    scopus 로고
    • Relay sensor placement in wireless sensor networks
    • DOI 10.1007/s11276-006-0724-8
    • Cheng, X., Du, D., Wang, L., Xu, B.: Relay Sensor Placement in Wireless Sensor Networks. Wireless Networks 14(3), 347-355 (2008) (Pubitemid 351704965)
    • (2008) Wireless Networks , vol.14 , Issue.3 , pp. 347-355
    • Cheng, X.1    Du, D.-Z.2    Wang, L.3    Xu, B.4
  • 8
    • 0006687948 scopus 로고    scopus 로고
    • Approximations for Steiner Trees with Minimum Number of Steiner Points
    • Chen, D., Du, D., Hu, X., Lin, G., Wang, L., Xue, G.: Approximations for Steiner Trees with Minimum Number of Steiner Points. Journal of Global Optimization 18(1), 17-33 (2000)
    • (2000) Journal of Global Optimization , vol.18 , Issue.1 , pp. 17-33
    • Chen, D.1    Du, D.2    Hu, X.3    Lin, G.4    Wang, L.5    Xue, G.6
  • 9
    • 32644439091 scopus 로고    scopus 로고
    • Relay node placement in large scale wireless sensor networks
    • DOI 10.1016/j.comcom.2004.12.032, PII S0140366405000459
    • Tang, J., Hao, B., Sen, A.: Relay Node Placement in Large Scale Wireless Sensor Networks. Computer Communications 29(4), 490-501 (2006) (Pubitemid 43243232)
    • (2006) Computer Communications , vol.29 , Issue.4 , pp. 490-501
    • Tang, J.1    Hao, B.2    Sen, A.3


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