• Title/Summary/Keyword: Event Aggregation

Search Result 30, Processing Time 0.026 seconds

An Energy Efficient and Low Latency MAC Protocol Using RTS Aggregation for Wireless Sensor Networks (무선 센서 네트워크에서 RTS 통합을 이용한 에너지 효율성과 낮은 지연을 갖는 MAC 프로토콜)

  • Lee, Dong-Ho;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.326-336
    • /
    • 2008
  • Wireless sensor networks have been studied with two typical applications called event-driven and periodic monitoring. Although these applications have different core requirements, they have the same low latency requirement. However, main issue of the protocol in wireless sensor networks was focused on an energy efficiency, so it has not considered the latency problem. In this paper, we propose the RA-MAC, an energy efficient and low latency MAC protocol using a new channel access mechanism and the RTS Aggregation scheme for wireless sensor networks. Our simulation results show that the RA-MAC provides energy savings and latency reduction.

A Study on the Energy Efficient Data Aggregation Method for the Customized Application of Underwater Wireless Sensor Networks (특정 응용을 위한 수중센서네트워크에서 에너지 효율적인 데이터통합 방법 연구)

  • Kim, Sung-Un;Park, Seon-Yeong;Yu, Hyung-Cik
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.11
    • /
    • pp.1438-1449
    • /
    • 2011
  • UWSNs(Underwater Wireless Sensor Networks) need effective modeling fitted to the customized type of application and its covering area. In particular it requires an energy efficient data aggregation method for such customized application. In this paper, we envisage the application oriented model for monitoring the pollution or intrusion detection over a given underwater area. The suggested model is based on the honeycomb array of hexagonal prisms. In this model, the purpose of data aggregation is that the head node of each layer(cluster) receives just one event data arrived firstly and transfer this and its position data to the base station effectively in the manner of energy efficiency and simplicity without duplication. Here if we apply the existent data aggregation methods to this kind of application, the result is far from energy efficiency due to the complexity of the data aggregation process based on the shortest path or multicast tree. In this paper we propose three energy efficient and simple data aggregation methods in the domain of cluster and three in the domain of inter-cluster respectively. Based on the comparative performance analysis of the possible combination pairs in the two domains, we derive the best energy efficient data aggregation method for the suggested application.

Design and Implementation of Malicious Application Detection System Using Event Aggregation on Android based Mobile Devices (안드로이드 모바일 단말에서의 이벤트 수집을 통한 악성 앱 탐지 시스템 설계 및 구현)

  • Ham, You Joung;Lee, Hyung-Woo
    • Journal of Internet Computing and Services
    • /
    • v.14 no.3
    • /
    • pp.35-46
    • /
    • 2013
  • As mobile terminal environment gets matured, the use of Android platform based mobile terminals has been growing high. Recently, the number of attacks by malicious application is also increasing as Android platform is vulnerable to private information leakage in nature. Most of these malicious applications are easily distributed to general users through open market or internet and an attacker inserts malicious code into malicious app which could be harmful tool to steal private data and banking data such as SMS, contacts list, and public key certificate to a remote server. To cope with these security threats more actively, it is necessary to develop countermeasure system that enables to detect security vulnerability existing in mobile device and take an appropriate action to protect the system against malicious attacks. In this sense, this paper aggregates diverse system events from multiple mobile devices and also implements a system to detect attacks by malicious application.

Robust Data, Event, and Privacy Services in Real-Time Embedded Sensor Network Systems (실시간 임베디드 센서 네트워크 시스템에서 강건한 데이터, 이벤트 및 프라이버시 서비스 기술)

  • Jung, Kang-Soo;Kapitanova, Krasimira;Son, Sang-H.;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.37 no.6
    • /
    • pp.324-332
    • /
    • 2010
  • The majority of event detection in real-time embedded sensor network systems is based on data fusion that uses noisy sensor data collected from complicated real-world environments. Current research has produced several excellent low-level mechanisms to collect sensor data and perform aggregation. However, solutions that enable these systems to provide real-time data processing using readings from heterogeneous sensors and subsequently detect complex events of interest in real-time fashion need further research. We are developing real-time event detection approaches which allow light-weight data fusion and do not require significant computing resources. Underlying the event detection framework is a collection of real-time monitoring and fusion mechanisms that are invoked upon the arrival of sensor data. The combination of these mechanisms and the framework has the potential to significantly improve the timeliness and reduce the resource requirements of embedded sensor networks. In addition to that, we discuss about a privacy that is foundation technique for trusted embedded sensor network system and explain anonymization technique to ensure privacy.

A genetic approach to comprehend the complex and dynamic event of floral development: a review

  • Jatindra Nath Mohanty;Swayamprabha Sahoo;Puspanjali Mishra
    • Genomics & Informatics
    • /
    • v.20 no.4
    • /
    • pp.40.1-40.8
    • /
    • 2022
  • The concepts of phylogeny and floral genetics play a crucial role in understanding the origin and diversification of flowers in angiosperms. Angiosperms evolved a great diversity of ways to display their flowers for reproductive success with variations in floral color, size, shape, scent, arrangements, and flowering time. The various innovations in floral forms and the aggregation of flowers into different kinds of inflorescences have driven new ecological adaptations, speciation, and angiosperm diversification. Evolutionary developmental biology seeks to uncover the developmental and genetic basis underlying morphological diversification. Advances in the developmental genetics of floral display have provided a foundation for insights into the genetic basis of floral and inflorescence evolution. A number of regulatory genes controlling floral and inflorescence development have been identified in model plants such as Arabidopsis thaliana and Antirrhinum majus using forward genetics, and conserved functions of many of these genes across diverse non-model species have been revealed by reverse genetics. Transcription factors are vital elements in systems that play crucial roles in linked gene expression in the evolution and development of flowers. Therefore, we review the sex-linked genes, mostly transcription factors, associated with the complex and dynamic event of floral development and briefly discuss the sex-linked genes that have been characterized through next-generation sequencing.

Inhibitory Effects of PD98059, SB203580, and SP600125 on α-and δ-granule Release and Intracellular Ca2+ Levels in Human Platelets

  • Kwon, Hyuk-Woo
    • Biomedical Science Letters
    • /
    • v.24 no.3
    • /
    • pp.253-262
    • /
    • 2018
  • Platelets are activated at sites of vascular injury via several molecules, such as adenosine diphosphate, collagen and thrombin. Full platelet aggregation is absolutely essential for normal hemostasis. Moreover, this physiological event can trigger circulatory disorders, such as thrombosis, atherosclerosis, and cardiovascular disease. Therefore, platelet function inhibition is a promising approach in preventing platelet-mediated circulatory disease. Many studies reported the involvement of mitogen-activated protein kinases (MAPKs) signaling pathways in platelet functions. However, these studies were limited. Thus, we examined MAPK signaling pathways in human platelets using specific MAPK inhibitors, such as PD98059, SB203580, and SP600125. We observed that these inhibitors were involved in calcium mobilization and influx in human platelets. They also suppressed thrombin-induced ${\alpha}$- and ${\delta}$-granule release. These results suggest that PD98059, SB203580, and SP600125 exhibit $Ca^{2+}$ antagonistic effects.

Heterogeneous 입력원을 갖는 ATM 스위치의 셀 손실확률 추정을 위한 Hybrid 시뮬레이션 기법

  • 김지수;전치혁
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1996.05a
    • /
    • pp.9-9
    • /
    • 1996
  • 광대역 종합정보 통신망의 핵심요소라 할 수 있는 ATM 스위치의 성능척도 중 가장 중요하게 다루어지고 있는 것은 셀 손실확률과 셀 전달지연시간이다. 이 중에서도 샐 손실확률기 추정에 대한 연구가 활발히 진행되고 있는데, ATM 스위치는 손실에 민감한 트래픽까지도 제대로 다루기 위하여 정도까지의 샐 손실확률을 보장할 수 있어야 한다. 이와같은 희소사건(rare event)의 확률 추정에 있어 원하는 정도의 precision을 가능한한 적은비용으로 얻어내기 위한 분산축소기법은 필수적이라 할 수 있다. Homogeneous 입력원을 갖는 ATM 스위치의 셀 손실확률 추정에 관련된 이전의 연구결과는 시뮬레이션과 분석적기법을 혼합시켜 얻어지는 새로운 개념의 추정치, 즉 hybrid 시뮬레이션 추정치의 도입을 통하여 상당한 정도의 분산축소 효과를 거둘 수 있음을 나타내주고 있다. 본 연구는 이에 대한 확장으로, 각각의 도착 프로세스가 서로 다른heterogeneous 입력원을 갖는 ATM 스위치의 셀 손실화률 추정에 적용될 수 있는 hybrid 시뮬레이션 기법을 개발하고자 한다. 사용된 모델은 이산시간대기모델()로 각입력원의 도착 프로세스는 Interrupted Bernoulli Process로 가정하였으며, 분석적 기법의 적용을 위한 입력원 통합(aggregation) 알고리듬과 실제 시뮬레이션 방법 등을 제시하였다. 또한 제시된 기법의 성능은 기존의 일반적인 시뮬레이션 추정치를 이용하여 얻어진 결과와의 비교를 통하여 분석되었다.

  • PDF

Energy Efficient Clustering Algorithm for Surveillance and Reconnaissance Applications in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 감시·정찰 응용의 클러스터링 알고리즘 연구)

  • Kong, Joon-Ik;Lee, Jae-Ho;Kang, Jiheon;Eom, Doo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1170-1181
    • /
    • 2012
  • Wireless Sensor Networks(WSNs) are used in diverse applications. In general, sensor nodes that are easily deployed on specific areas have many resource constrains such as battery power, memory sizes, MCUs, RFs and so on. Hence, first of all, the efficient energy consumption is strongly required in WSNs. In terms of event states, event-driven deliverly model (i.e. surveillance and reconnaissance applications) has several characteristics. On the basis of such a model, clustering algorithms can be mostly used to manage sensor nodes' energy efficiently owing to the advantages of data aggregations. Since a specific node collects packets from its child nodes in a network topology and aggregates them into one packet to relay them once, amount of transmitted packets to a sink node can be reduced. However, most clustering algorithms have been designed without considering can be reduced. However, most clustering algorithms have been designed without considering characteristics of event-driven deliverly model, which results in some problems. In this paper, we propose enhanced clustering algorithms regarding with both targets' movement and energy efficiency in order for applications of surveillance and reconnaissance. These algorithms form some clusters to contend locally between nodes, which have already detected certain targets, by using a method which called CHEW (Cluster Head Election Window). Therefore, our proposed algorithms enable to reduce not only the cost of cluster maintenance, but also energy consumption. In conclusion, we analyze traces of the clusters' movements according to targets' locations, evaluate the traces' results and we compare our algorithms with others through simulations. Finally, we verify our algorithms use power energy efficiently.

An Effect of Aggregation of Point Features to Areal Units on K-Index (점사상의 지역단위 집계가 K-지표에 미치는 영향)

  • Lee Byoung-Kil
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.24 no.1
    • /
    • pp.131-138
    • /
    • 2006
  • Recently, data gathering and algorithm developing are in progress for the GIS application using point feature. Several researches prove that verification of the spatial clustering and evaluation of inter-dependencies between event and control are possible. On the other hand, most of the point features as GIS data are gathered by indirect method, such as address geo-coding, rather than by direct method, such as field surveying. Futhermore, lots of statistics by administrative district based on the point features have no coordinates information of the points. In this study, calculating the K-index in GIS environment, to evaluate the effect of aggregation of raw data on K-index, K-indices estimated from raw data (parcel unit), topographically aggregated data (block unit), administratively aggregated data (administrative district unit) are compared and evaluated. As a result, point feature, highly clustered in local area, is largely distorted when aggregated administratively. But, the K-indices of topographically aggregated data is very similar to the K-indices of raw data.

A Robust Scheme for Emergency Message Delivery in Vehicle Communications on Freeway (고속도로상의 차량간 통신에서 에러에 강한 긴급메시지 전달 기법)

  • Park, Jeong-Seo;Park, Tae-Keun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1113-1121
    • /
    • 2010
  • The Vehicle Safety Communications (VSC) is one of VANET applications for preventing vehicle accidents, and it utilizes vehicle-to-vehicle communication to exchange emergency messages. To propagate such messages in VSC, several schemes based on selective flooding have been proposed. Their common idea is that an emergency message is relayed by one of vehicles receiving the message. However, the schemes do not consider the transmission errors and duplications of an emergency event. In the schemes, if there are transmission errors and a vehicle detects a hazard, there may be vehicles which fail to receive an emergency message. If k vehicles detect a hazard, k emergency messages are created and propagated. The duplications of an event increase reliability of the message delivery but decrease efficiency. In this paper, we propose an emergency message delivery scheme which is efficient and robust to transmission errors. Our proposed scheme utilizes clustering for massage aggregation and retransmissions in a cluster. It also uses an acknowledgment mechanism for reliable inter-cluster communication. Our simulation results show that the proposed scheme outperforms Least Common Neighbor Flooding which is one of the selective flooding schemes.