http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : ( Yueyun Shen ) (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
A Lifetime-Preserving and Delay-Constrained Data Gathering Tree for Unreliable Sensor Networks
( Yanjun Li ),( Yueyun Shen ),( Kaikai Chi ) 한국인터넷정보학회 2012 KSII Transactions on Internet and Information Syst Vol.6 No.12
A tree routing structure is often adopted for many-to-one data gathering and aggregation in sensor networks. For real-time scenarios, considering lossy wireless links, it is an important issue how to construct a maximum-lifetime data gathering tree with delay constraint. In this work, we study the problem of lifetime-preserving and delay-constrained tree construction in unreliable sensor networks. We prove that the problem is NP-complete. A greedy approximation algorithm is proposed. We use expected transmissions count (ETX) as the link quality indicator, as well as a measure of delay. Our algorithm starts from an arbitrary least ETX tree, and iteratively adjusts the hierarchy of the tree to reduce the load on bottleneck nodes by pruning and grafting its sub-tree. The complexity of the proposed algorithm is O(N<sup>4</sup>). Finally, extensive simulations are carried out to verify our approach. Simulation results show that our algorithm provides longer lifetime in various situations compared to existing data gathering schemes.
ScienceON
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
