지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 저널정보
- Korean Institute of Information Scientists and Engineers 한국정보과학회 학술발표논문집 한국정보과학회 2010 한국컴퓨터종합학술대회 논문집 제37권 제1호(D)
- 발행연도
- 2010.6
- 수록면
- 360 - 365 (6page)
이용수
초록· 키워드
오류제보하기
In this paper, we present a distributed algorithm for detecting dynamic event regions in wireless sensor network with the consideration on energy saving. Our model is that the sensing field is monitored by a large number of randomly distributed sensors with low-power battery and limited functionality, and that the event region is dynamic with motion or changing the shape.
At any time that the event happens, we need some sensors awake to detect it and to wake up its k-hop neighbors to detect further events. Scheduling for the network to save the total power-cost or to maximize the monitoring time has been studied extensively. Our scheme is that some predetermined sensors, called critical sensors are awake all the time and when the event is detected by a critical sensor the sensor broadcasts to the neighbors to check their sensing area. Then the neighbors check their area and decide whether they wake up or remain in sleeping mode with certain criteria.
Our algorithm uses only 2 bit of information in communication between sensors, thus the total communication cost is low, and the speed of detecting all event region is high. We adapt two kinds of measure for the wake-up decision. With suitable threshold values, our algorithm can be applied for many applications and for the trade-off between energy saving and the efficiency of event detection.
At any time that the event happens, we need some sensors awake to detect it and to wake up its k-hop neighbors to detect further events. Scheduling for the network to save the total power-cost or to maximize the monitoring time has been studied extensively. Our scheme is that some predetermined sensors, called critical sensors are awake all the time and when the event is detected by a critical sensor the sensor broadcasts to the neighbors to check their sensing area. Then the neighbors check their area and decide whether they wake up or remain in sleeping mode with certain criteria.
Our algorithm uses only 2 bit of information in communication between sensors, thus the total communication cost is low, and the speed of detecting all event region is high. We adapt two kinds of measure for the wake-up decision. With suitable threshold values, our algorithm can be applied for many applications and for the trade-off between energy saving and the efficiency of event detection.
목차
Abstract
1. Introduction
2. Distributed algorithm to detect event regions
3. Control of thresholds α and β
4. Simulations
5. Conclusions and Future works
References
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Distributed Event Detection Algorithm considering Tradeoff between Accuracy and Cost
정보과학회논문지 : 정보통신
2011 .04
-
이벤트 기반 센서의 신호 처리 연구 동향
대한전자공학회 학술대회
2020 .08
-
재실 감지 센서를 이용한 다용도 스마트 센서 개발
한국생산제조학회지
2015 .02
-
Fast Sensor Scheduling for Estimation of Networked Sensor Systems
제어로봇시스템학회 국제학술대회 논문집
2009 .08
-
The Design of an Extended Complex Event Model based on Event Correlation using Aspect Oriented Programming
한국컴퓨터정보학회논문지
2017 .10
-
A Novel Approach for Deriving Test Scenarios and Test Cases from Events
JIPS(Journal of Information Processing Systems)
2012 .01
-
Cluster Based Object Detection in Wireless Sensor Network
한국정보과학회 학술발표논문집
2006 .10
-
Wake-on-Sensor 기반의 복합형 무선 화재 감지 모듈 설계
한국통신학회 학술대회논문집
2015 .01
-
상태천이모델 기반의 센서 노드 설계
멀티미디어학회논문지
2017 .08
-
Event-based Real-time Optical Flow Estimation
제어로봇시스템학회 국제학술대회 논문집
2017 .10
-
기준 컬러센서를 이용한 고정밀 광 측정센서
대한전자공학회 학술대회
2017 .06
-
Event Detection on Motion Activities Using a Dynamic Grid
JIPS(Journal of Information Processing Systems)
2015 .01
-
기하학적 확률을 이용한 무선 센서 노드의 웨이크 업 알고리즘 기법
센서학회지
2013 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2010-569-003102922