ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Retrieval of the Extreme Values under Deadline Constraints in Wireless Sensor Networks
Cited 0 time in scopus Download 47 time Share share facebook twitter linkedin kakaostory
저자
백승준, Xiaohan Yu, 이교구, 김현학
발행일
201105
출처
Sensors, v.11 no.5, pp.5229-5252
ISSN
1424-8220
출판사
MDPI AG
DOI
https://dx.doi.org/10.3390/s110505229
협약과제
11MB2100, 스마트and그린 빌딩용 자가충전 지능형 센서노드 플랫폼 핵심기술 개발, 김종대
초록
We consider a problem of retrieving the extreme value among sensed data under deadline constraints in wireless sensor networks with potential applications to alarm systems. The sensed data is mapped to a score which we adopt as a unified measure of the relative urgency of the data. The objective is to retrieve the data with the maximum score. We propose fully distributed schemes for contention based medium access and data combining. The proposed medium access scheme uses a randomized back-off which is controlled based on the score of the data to be transmitted. Data combining techniques are proposed to further suppress unnecessary traffic and reduce contention. The key observation is that one should aggressively prioritize packets with high score, up to an extent that does not incur excessive contention in channel access. Designed to capture such aspect, the proposed scheme is shown to substantially decrease the latency of the retrieval. © 2011 by the authors; licensee MDPI, Basel, Switzerland.
키워드
Distributed algorithm, Latency, Medium access control, Wireless sensor networks
KSP 제안 키워드
Back-off, Channel Access(CA), Contention-based, Data combining, Distributed algorithm, Distributed schemes, Extreme values, Fully distributed, Maximum score, Medium Access Control, Potential applications
본 저작물은 크리에이티브 커먼즈 저작자 표시 (CC BY) 조건에 따라 이용할 수 있습니다.
저작자 표시 (CC BY)