• Title/Summary/Keyword: Cluster Head

Search Result 430, Processing Time 0.023 seconds

An Efficient Core-Based Multicast Tree using Weighted Clustering in Ad-hoc Networks (애드혹 네트워크에서 가중치 클러스터링을 이용한 효율적인 코어-기반 멀티캐스트 트리)

  • Park, Yang-Jae;Han, Seung-Jin;Lee, Jung-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.377-386
    • /
    • 2003
  • This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.

Generation of single stranded DNA with selective affinity to bovine spermatozoa

  • Vinod, Sivadasan Pathiyil;Vignesh, Rajamani;Priyanka, Mani;Tirumurugaan, Krishnaswamy Gopalan;Sivaselvam, Salem Nagalingam;Raj, Gopal Dhinakar
    • Animal Bioscience
    • /
    • v.34 no.10
    • /
    • pp.1579-1589
    • /
    • 2021
  • Objective: This study was conducted to generate single stranded DNA oligonucleotides with selective affinity to bovine spermatozoa, assess its binding potential and explore its potential utility in trapping spermatozoa from suspensions. Methods: A combinatorial library of 94 mer long oligonucleotide was used for systematic evolution of ligands by exponential enrichment (SELEX) with bovine spermatozoa. The amplicons from sixth and seventh rounds of SELEX were sequenced, and the reads were clustered employing cluster database at high identity with tolerance (CD-HIT) and FASTAptamer. The enriched nucleotides were predicted for secondary structures by Mfold, motifs by Multiple Em for Motif Elicitation and 5' labelled with biotin/6-FAM to determine the binding potential and binding pattern. Results: We generated 14.1 and 17.7 million reads from sixth and seventh rounds of SELEX respectively to bovine spermatozoa. The CD-HIT clustered 78,098 and 21,196 reads in the top ten clusters and FASTAptamer identified 2,195 and 4,405 unique sequences in the top three clusters from the sixth and seventh rounds, respectively. The identified oligonucleotides formed secondary structures with delta G values between -1.17 to -26.18 kcal/mol indicating varied stability. Confocal imaging with the oligonucleotides from the seventh round revealed different patterns of binding to bovine spermatozoa (fluorescence of the whole head, spot of fluorescence in head and mid- piece and tail). Use of a 5'-biotin tagged oligonucleotide from the sixth round at 100 pmol with 4×106 spermatozoa could trap almost 80% from the suspension. Conclusion: The binding patterns and ability of the identified oligonucleotides confirms successful optimization of the SELEX process and generation of aptamers to bovine spermatozoa. These oligonucleotides provide a quick approach for selective capture of spermatozoa from complex samples. Future SELEX rounds with X- or Y- enriched sperm suspension will be used to generate oligonucleotides that bind to spermatozoa of a specific sex type.

Data Aggregation and Transmission Mechanism for Energy Adaptive Node in Wireless Sensor Networks (무선 센서네트워크 환경에서 에너지를 고려한 노드 적응적 데이터 병합 및 전달 기법)

  • Cho, Young-Bok;You, Mi-Kyung;Lee, Sang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.903-911
    • /
    • 2011
  • In this paper we proposed an energy adaptive data aggregation and transmission mechanism to solve the problem of energy limitation in wireless sensor networks (WSNs). Hierarchical structure methods are wildly used in WSNs to improve the energy efficiency. LEACH and TEEN protocols are the typical techniques. In these methods, all nodes, including nodes who have sensed data to transmit and nodes who haven't, are set frame timeslots in every round. MNs (member nodes) without sensed data keep active all the time, too. These strategies caused energy waste. Furthermore, if data collection in MNs is same to the previous transmission, it increases energy consumption. Most hierarchical structure protocols are developed based on LEACH. To solve the above problems, this paper proposed a method in which only MNs with sensed data can obtain allocated frame to transmit data. Moreover, if the MNs have same sensed data with previous, MNs turn to sleep mode. By this way redundant data transmission is avoided and aggregation in CH is lightened, too.

A Study of Intelligent Head Up Display System for Next Generation Vehicle (차세대 자동차를 위한 HUD 모니터 시스템에 관한 연구)

  • Yun, Sung-Ha;Son, Hui-Bae;Rhee, Young-Chul
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.4 no.1
    • /
    • pp.23-31
    • /
    • 2011
  • In this paper, the intelligent smart monitor system is implemented for the next generation vehicle. to mitigate the numerous effects of distractions within the vehicle, it is vital to put critical information where the driver can use it without affection focus on the road ahead. Audible alarms are useful supplements when used in conjunction with visual displays. But driving is an overwhelmingly visual task. To optimize a vehicle's active safety systems, more than just audible alarms are necessary. The driver needs a visual interface that focuses his or her attention on the road ahead. The most commonly viewed information in a vehicle is from the instrument cluster, where speed, tachometer, fuel, engine temperature, fuel gauge, turn indicators and warning lights provide the driver with an array of fundamental information. TFT LCD, LCD Back light led, plane mirror, lens and controllers parts were designed to intelligent integrated smart monitor system. Finally, in this paper, we analyze intelligent integrated smart monitor system for driver safety vehicles.

Efficient Clustering Algorithm based on Data Entropy for Changing Environment (상황변화에 따른 엔트로피 기반의 클러스터 구성 알고리즘)

  • Choi, Yun-Jeong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.12
    • /
    • pp.3675-3681
    • /
    • 2009
  • One of the most important factors in the lifetime of WSN(Wireless Sensor Network) is the limited resources and static control problem of the sensor nodes. In order to achieve energy efficiency and network utilities, sensor nodes can be well organized into one cluster and selected head node and normal node by dynamic conditions. Various clustering algorithms have been proposed as an efficient way to organize method based on LEACH algorithm. In this paper, we propose an efficient clustering algorithm using information entropy theory based on LEACH algorithm, which is able to recognize environmental differences according to changes from data of sensor nodes. To measure and analyze the changes of clusters, we simply compute the entropy of sensor data and applied it to probability based clustering algorithm. In experiments, we simulate the proposed method and LEACH algorithm. We have shown that our data balanced and energy efficient scheme, has high energy efficiency and network lifetime in two conditions.

The Effect on Activity of Cerebral Cortex by Key-point Control of The Adult Hemiplegia with fMRI (fMRI를 이용한 성인 편마비의 항조절점 운동이 대뇌피질의 활성화에 미치는 효과)

  • Lee Won-Kil
    • The Journal of Korean Physical Therapy
    • /
    • v.15 no.3
    • /
    • pp.295-345
    • /
    • 2003
  • This study investigated activation of cerebral cortex in patients with hemiplegia that was caused by neural damage. Key-point control movement therapy of Bobath was performed for 9 weeks in 3 subjects with hemiplegia and fMRI was used to compare and analyze activated degree of cerebral cortex in these subjects. fMRI was conducted using the blood oxygen level-dependent(BOLD) technique at 3.0T MR scanner with a standard head coil. The motor activation task consisted of finger flexion-extension exercise in six cycles(one half-cycles = 8 scans = $3\;sec{\times}\;8\;=\;24\;sec$). Subjects performed this task according to visual stimulus that sign of right hand or left hand twinkled(500ms on, 500ms off). After mapping activation of cerebral motor cortex on hand motor function, below results were obtained. 1. Activation decreased in primary motor area, whereas it increased in supplementary motor area and visual association area(p<.001). 2. Activation was observed in bilateral medial frontal gyrus, middle frontal gyrus of left cerebrum, inferior frontal gyrus, inter-hemispheric, fusiform gyrus of right cerebrum, superior parietal lobule of parietal lobe and precuneus in subjedt 1, parahippocampal gyrus of limbic lobe and cingulate gyrus in subject 2, and inferior frontal gyrus of right frontal lobe, middle frontal gyrus, and inferior parietal lobule of left cerebrum in subject 3 (p<.001). 3. Activation cluster extended in declive of right cellebellum posterior lobe in subject 1, culmen of anterior lobe and declive of posterior lobe in subject 2, and dentate gyrus of anterior lobe, culmen and tuber of posterior lobe in subject 3 (p<.001). In conclusion, these data showed that Key-point control movement therapy of Bobath after stroke affect cerebral cortex activation by increasing efficiency of cortical networks. Therefore mapping of brain neural network activation is useful for plasticity and reorganization of cerebral cortex and cortico-spinal tract of motor recovery mechanisms after stroke.

  • PDF

A Study on the Location and the Types of Enterprise in Ochang Technopolis in Chungcheongbuk-do(Province), Korea (충북지역 오창과학단지의 입지와 기업유형)

  • Jeon, Dong Ho;Joo, Kyung Sik
    • Journal of the Korean association of regional geographers
    • /
    • v.18 no.4
    • /
    • pp.400-413
    • /
    • 2012
  • The purpose of this study was to look into the formation process and characteristics of local high-tech industrial complex with an example of the Ochang Scientific Industrial Complex and analyzed the characteristics by business type and size, transfer process of the companies in the Complex. For this purpose, statistical data of the companies were analyzed and a survey of them was conducted, and the following results were obtained. First, the Ochang Scientific Industrial Complex was created for agglomeration of IT industries in early days but now there are IT industries and BT industries mixed due to internal and external economic condition. Second, there are more small and medium companies than large companies in the Ochang Scientific Industrial Complex. These companies are in the stage of developing new products and marketing, and many of them were parts and materials developers of core technology or high innovation with venture identification. Third, high rates of the companies in the Ochang Scientific Industrial Complex came from the capital area and the Chungcheong area and the companies which moved in the Complex with their head quarters accounted for more than 70 percent. Fourth, the companies were classified into 5 types according to the type of product and the level of technical innovation.

  • PDF

A Backtracking Search Framework for Constraint Satisfaction Optimization Problems (제약만족 최적화 문제를 위한 백트래킹 탐색의 구조화)

  • Sohn, Surg-Won
    • The KIPS Transactions:PartA
    • /
    • v.18A no.3
    • /
    • pp.115-122
    • /
    • 2011
  • It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.

Performance Analysis of Hierarchical Routing Protocols for Sensor Network (센서 네트워크를 위한 계층적 라우팅 프로토콜의 성능 분석)

  • Seo, Byung-Suk;Yoon, Sang-Hyun;Kim, Jong-Hyun
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.4
    • /
    • pp.47-56
    • /
    • 2012
  • In this study, we use a parallel simulator PASENS(Parallel SEnsor Network Simulator) to predict power consumption and data reception rate of the hierarchical routing protocols for sensor network - LEACH (Low-Energy Adaptive Clustering Hierarchy), TL-LEACH (Two Level Low-Energy Adaptive Clustering Hierarchy), M-LEACH (Multi hop Low-Energy Adaptive Clustering Hierarchy) and LEACH-C (LEACH-Centralized). According to simulation results, M-LEACH routing protocol shows the highest data reception rate for the wider area, since more sensor nodes are involved in the data transmission. And LEACH-C routing protocol, where the sink node considers the entire node's residual energy and location to determine the cluster head, results in the most efficient energy consumption and in the narrow area needed long life of sensor network.

The Routing Algorithm for Wireless Sensor Networks with Random Mobile Nodes

  • Yun, Dai Yeol;Jung, Kye-Dong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.38-43
    • /
    • 2017
  • Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.