• Title/Summary/Keyword: clustering protocol

Search Result 229, Processing Time 0.023 seconds

Design and Implementation of a Management Framework for Ubiquitous Sensor Networks Based on Clustering (클러스터링 기반 유비쿼터스 센서 네트워크 관리 프레임워크의 설계 및 구현)

  • Lee, Jong-Eon;Cha, Si-Ho;Cho, Kuk-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.174-183
    • /
    • 2008
  • In this paper we design and implement a sensor network management framework(SNMF) for ubiquitous sensor networks(USNs). The SNMF employs the policy-based management approach for the autonomous and energy-efficient management of USNs. Moreover, a new light-weight policy distribution protocol called TinyCOPS-PR is designed and USN PIB for low-level policy is also defined. This allows the high-level policies defined by an administrator to translate into the specific low-level policies. The low-level policies are executed on sensor nodes so it can fulfill the proper management actions. The sensor nodes that receive some policies from an administrator perform local management actions according to those policies. SNMF can therefore realize small energy consumption and bring long network lifetime. It can also manage USNs automatically with a minimum of human interference.

The Factor Clustering of Growing Stock Changes by Forest Policy using Principal Component Analysis (주성분 분석을 이용한 산림정책별 입목축적변화의 요인 군집)

  • Shin, Hye-Jin;Kim, Eui-Gyeong;Kim, Dong-Hyeon;Kim, Hyeon-Guen
    • Journal of agriculture & life science
    • /
    • v.46 no.2
    • /
    • pp.1-8
    • /
    • 2012
  • This study is a precedent study for deriving transfer function model between growing stock and forest management policies. Its goal is to solve the multicollinearity between forest works inducing growing stock changes through principal component analysis using annual time series data from 1997 to 2008. As the results, the total explanatory power showed 91.4% on the summarized 3 principal components. They were renamed 'good forest management' 'pest & insets management' 'forest fires' for conceptualization on the derived each component.

Lifetime Escalation and Clone Detection in Wireless Sensor Networks using Snowball Endurance Algorithm(SBEA)

  • Sathya, V.;Kannan, Dr. S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1224-1248
    • /
    • 2022
  • In various sensor network applications, such as climate observation organizations, sensor nodes need to collect information from time to time and pass it on to the recipient of information through multiple bounces. According to field tests, this information corresponds to most of the energy use of the sensor hub. Decreasing the measurement of information transmission in sensor networks becomes an important issue.Compression sensing (CS) can reduce the amount of information delivered to the network and reduce traffic load. However, the total number of classification of information delivered using pure CS is still enormous. The hybrid technique for utilizing CS was proposed to diminish the quantity of transmissions in sensor networks.Further the energy productivity is a test task for the sensor nodes. However, in previous studies, a clustering approach using hybrid CS for a sensor network and an explanatory model was used to investigate the relationship between beam size and number of transmissions of hybrid CS technology. It uses efficient data integration techniques for large networks, but leads to clone attacks or attacks. Here, a new algorithm called SBEA (Snowball Endurance Algorithm) was proposed and tested with a bow. Thus, you can extend the battery life of your WSN by running effective copy detection. Often, multiple nodes, called observers, are selected to verify the reliability of the nodes within the network. Personal data from the source centre (e.g. personality and geographical data) is provided to the observer at the optional witness stage. The trust and reputation system is used to find the reliability of data aggregation across the cluster head and cluster nodes. It is also possible to obtain a mechanism to perform sleep and standby procedures to improve the life of the sensor node. The sniffers have been implemented to monitor the energy of the sensor nodes periodically in the sink. The proposed algorithm SBEA (Snowball Endurance Algorithm) is a combination of ERCD protocol and a combined mobility and routing algorithm that can identify the cluster head and adjacent cluster head nodes.This algorithm is used to yield the network life time and the performance of the sensor nodes can be increased.

TTCG : Three-Tier Context Gathering Technique for Mobile Devices (이동 단말기를 위한 Three-Tier 상황정보 수집 기법)

  • Sho, Su-Hwan;Kim, Seung-Hoon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.1
    • /
    • pp.64-72
    • /
    • 2009
  • Previous research on sensor networks mainly focused on efficient transmission of data from sensors to fixed sink nodes. Recently there has been active research on mobile sink nodes, but the re-search of an environment where both fixed sink nodes and mobile sinks are present at the same time is rather scarce. This paper proposes a technique for context gathering by mobile devices with the sink functionality added through fixed sinks under a previously built, cluster based multi hop sensor network environment. To this end, clustering of mobile devices were done based on the fixed sinks of a previously built sensor network, and by using appropriate fixed sinks, context gathering was made possible. By mathematical comparison with TTDD routing protocol, which was proposed for mobile sinks, it was conformed that performance increases in energy with the number of mobile sinks, and with the number of movements by mobile devices.

A Life time improvement Method of SVM application LEACH protocol in Wireless Sensor Networks (SVM을 적용한 LEACH 프로토콜 기반 무선센서네트워크의 수명 개선 방법)

  • Pyo, Se Jun;Jo, Yong-Ok;Ok, Tae-Seong;Bang, Jong-Dae;Keshav, Tushar;Lee, Seong-Ho;Ryu, Hui-Eun;Lee, Yeonwoo;Bae, Jinsoo;Lee, Seong-Ro
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.606-608
    • /
    • 2011
  • 무선 센서 네트워크는 특정지역에 센서 노드를 설치하여 주변 정보 또는 특정 목적의 데이터를 수집하고, 그 정보를 수집하는 싱크(Sink)로 구성되어 있다. 무선 센서 네트워크의 수명은 망을 구성하는 센서 노드의 베터리 소비에 따라 수명이 결정 되고 하나의 노드가 죽기 시작하면서부터 급격하게 센서 노드의 베터리 소비가 커져 빠르게 죽는다. 무선 센서 네트워크를 구성하는 센서노드는 라우팅, 센싱을 수행하기 때문에 베터리 소비에 많은 부담을 가지고 있다. 본 논문은 무선 센서 네트워크의 대표적 클러스터링 기반 라우팅 기법인 LEACH(Low - Energy Adaptive Clustering Hierarchy)프로토콜에 SVM(Support Vector Machine)을 적용하여 센서노드의 균형적인 베터리 소비로 망을 효율적으로 관리하고 망의 수명을 개선 할 수 있는 방법을 제안 한다. 이러한 센서 노드의 균형적인 베터리 소비로 무선센서 네트워크의 수명을 개선 한다. 실험결과 기존의 LEACH 프로토콜보다 우수한 성능을 보인다.

Cluster-based P2P scheme considering node mobility in MANET (MANET에서 장치의 이동성을 고려한 클러스터 기반 P2P 알고리즘)

  • Wu, Hyuk;Lee, Dong-Jun
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.6
    • /
    • pp.1015-1024
    • /
    • 2011
  • Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.

Literature Review Nursing Intervention for Developmental Support on Preterm Infants (미숙아의 발달지지를 위한 간호중재에 관한 문헌연구)

  • Kim, Tae-Im;Sim, Mi-Kyung
    • Korean Parent-Child Health Journal
    • /
    • v.4 no.1
    • /
    • pp.35-55
    • /
    • 2001
  • Recently attention has been focused on the effects of early intervention, or its lack, on both normal and preterm infants. Particularly numerous studies suggest that premature infants are not necessarily understimulated but instead are subjected to inappropriate stimulation. Developmental support and sensory stimulation have become clinical opportunities in which nursing practice can impact on the neurobehavioral outcome of premature infants. Developmental care has been widely accepted and implemented in neonatal intensive care units across the country. Increasingly, attention and concern in caring for low-birth-weight infants and premature infants has led clinicians in the field to explore the effects of a complex of interventions designed to create and maintain a developmentally supportive environment; to provide age-appropriate sensory input; and to protect the infant from inappropriate, excessive and stressful stimulation. The components of developmental care include modifications of the macro-environment to reduce NICU light and sound levels, care clustering, nonnutritive sucking, and containment strategies, such as flexed positioning or swaddling. Sensory stimulation of the premature infants is presented to standardize the modification of a developmental intervention based on physiologic and behavioral cues. The most appropriate type of stimuli are those that are sensitive to infant cues. Evaluation of infant physiological and behavioral responds to specific intervention stimuli may help to identify more appropriate interventions based on infants' cues. A critical question confronting the clinician is that of determining when the evidence supporting a change in practice is sufficient to justify making that change. There are acknowledged limitations in the current studies. Many of the studies examined had small sample sizes; used nonprobability sampling; and used a phase lag design, which introduces the possibility of threats to internal validity and limits the generalizability of the results. Although many issues regarding the effects of developmental interventions remain unresolved, the available research base documents significant benefits of developmental care for LBW infants in consistent outcomes, without significant adverse effects. Particularly, although the individual studies vary somewhat in the definition of specific outcomes measured, instrumentation used, time and method of data collection, and preparaion of the care providers, in all studies, infants receiving the full protocol of individualized developmentally supportive care had improvements in some aspect of four areas of infant functioning: level of respiratory or oxygen support, the establishment of oral feeding; length of hospital stay, and infant behavioral regulation. In summary, based on the available literature, individualized developmental intervention should be incorporated into standard practice in neonatal intensive care. And this implementation needs to be coupled with ongoing research to evaluate the impact of an individualized developmental care programs on the short- and long-tenn health outcomes of LBW infants.

  • PDF

A Study of Key Pre-distribution Scheme in Hierarchical Sensor Networks (계층적 클러스터 센서 네트워크의 키 사전 분배 기법에 대한 연구)

  • Choi, Dong-Min;Shin, Jian;Chung, Il-Yong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.1
    • /
    • pp.43-56
    • /
    • 2012
  • Wireless sensor networks consist of numerous small-sized nodes equipped with limited computing power and storage as well as energy-limited disposable batteries. In this networks, nodes are deployed in a large given area and communicate with each other in short distances via wireless links. For energy efficient networks, dynamic clustering protocol is an effective technique to achieve prolonged network lifetime, scalability, and load balancing which are known as important requirements. this technique has a characteristic that sensing data which gathered by many nodes are aggregated by cluster head node. In the case of cluster head node is exposed by attacker, there is no guarantee of safe and stable network. Therefore, for secure communications in such a sensor network, it is important to be able to encrypt the messages transmitted by sensor nodes. Especially, cluster based sensor networks that are designed for energy efficient, strongly recommended suitable key management and authentication methods to guarantee optimal stability. To achieve secured network, we propose a key management scheme which is appropriate for hierarchical sensor networks. Proposed scheme is based on polynomial key pool pre-distribution scheme, and sustain a stable network through key authentication process.

Personalized Recommendation System for IPTV using Ontology and K-medoids (IPTV환경에서 온톨로지와 k-medoids기법을 이용한 개인화 시스템)

  • Yun, Byeong-Dae;Kim, Jong-Woo;Cho, Yong-Seok;Kang, Sang-Gil
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.3
    • /
    • pp.147-161
    • /
    • 2010
  • As broadcasting and communication are converged recently, communication is jointed to TV. TV viewing has brought about many changes. The IPTV (Internet Protocol Television) provides information service, movie contents, broadcast, etc. through internet with live programs + VOD (Video on demand) jointed. Using communication network, it becomes an issue of new business. In addition, new technical issues have been created by imaging technology for the service, networking technology without video cuts, security technologies to protect copyright, etc. Through this IPTV network, users can watch their desired programs when they want. However, IPTV has difficulties in search approach, menu approach, or finding programs. Menu approach spends a lot of time in approaching programs desired. Search approach can't be found when title, genre, name of actors, etc. are not known. In addition, inserting letters through remote control have problems. However, the bigger problem is that many times users are not usually ware of the services they use. Thus, to resolve difficulties when selecting VOD service in IPTV, a personalized service is recommended, which enhance users' satisfaction and use your time, efficiently. This paper provides appropriate programs which are fit to individuals not to save time in order to solve IPTV's shortcomings through filtering and recommendation-related system. The proposed recommendation system collects TV program information, the user's preferred program genres and detailed genre, channel, watching program, and information on viewing time based on individual records of watching IPTV. To look for these kinds of similarities, similarities can be compared by using ontology for TV programs. The reason to use these is because the distance of program can be measured by the similarity comparison. TV program ontology we are using is one extracted from TV-Anytime metadata which represents semantic nature. Also, ontology expresses the contents and features in figures. Through world net, vocabulary similarity is determined. All the words described on the programs are expanded into upper and lower classes for word similarity decision. The average of described key words was measured. The criterion of distance calculated ties similar programs through K-medoids dividing method. K-medoids dividing method is a dividing way to divide classified groups into ones with similar characteristics. This K-medoids method sets K-unit representative objects. Here, distance from representative object sets temporary distance and colonize it. Through algorithm, when the initial n-unit objects are tried to be divided into K-units. The optimal object must be found through repeated trials after selecting representative object temporarily. Through this course, similar programs must be colonized. Selecting programs through group analysis, weight should be given to the recommendation. The way to provide weight with recommendation is as the follows. When each group recommends programs, similar programs near representative objects will be recommended to users. The formula to calculate the distance is same as measure similar distance. It will be a basic figure which determines the rankings of recommended programs. Weight is used to calculate the number of watching lists. As the more programs are, the higher weight will be loaded. This is defined as cluster weight. Through this, sub-TV programs which are representative of the groups must be selected. The final TV programs ranks must be determined. However, the group-representative TV programs include errors. Therefore, weights must be added to TV program viewing preference. They must determine the finalranks.Based on this, our customers prefer proposed to recommend contents. So, based on the proposed method this paper suggested, experiment was carried out in controlled environment. Through experiment, the superiority of the proposed method is shown, compared to existing ways.