• Title/Summary/Keyword: Fixed clustering

Search Result 87, Processing Time 0.037 seconds

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.

Multi-Objective Genetic Algorithm based on Multi-Robot Positions for Scheduling Problems (스케줄링 문제를 위한 멀티로봇 위치 기반 다목적 유전 알고리즘)

  • Choi, Jong Hoon;Kim, Je Seok;Jeong, Jin Han;Kim, Jung Min;Park, Jahng Hyon
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.31 no.8
    • /
    • pp.689-696
    • /
    • 2014
  • This paper presents a scheduling problem for a high-density robotic workcell using multi-objective genetic algorithm. We propose a new algorithm based on NSGA-II(Non-dominated Sorting Algorithm-II) which is the most popular algorithm to solve multi-objective optimization problems. To solve the problem efficiently, the proposed algorithm divides the problem into two processes: clustering and scheduling. In clustering process, we focus on multi-robot positions because they are fixed in manufacturing system and have a great effect on task distribution. We test the algorithm by changing multi-robot positions and compare it to previous work. Test results shows that the proposed algorithm is effective under various conditions.

A Low-Power Clustering Algorithm Based on Fixed Radio Wave Radius in WSN (WSN에서 전파범위 기반의 저 전력 클러스터링 알고리즘)

  • Rhee, Chung Sei
    • Convergence Security Journal
    • /
    • v.15 no.3_1
    • /
    • pp.75-82
    • /
    • 2015
  • Recently, lot of researches on multi-level protocol have been done to balance the sensor node energy consumption of WSN and to improve the node efficiency to extend the life of the entire network. Especially in multi-hop protocol, a variety of models have been studied to improve energy efficiency and apply it in real system. In multi-hop protocol, we assume that energy consumption can be adjusted based on the distance between the sensor nodes. However, according to the physical property of the actual WSN, it's hard to establish this. In this paper, we propose low-power sub-cluster protocol to improve the energy efficiency based on the spread of distance. Compared with the previous protocols, the proposed protocol is energy efficient and can be effectively used in the wireless sensing network.

A design of the PSDG based semantic slicing model for software maintenance (소프트웨어의 유지보수를 위한 PSDG기반 의미분할모형의 설계)

  • Yeo, Ho-Young;Lee, Kee-O;Rhew, Sung-Yul
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.8
    • /
    • pp.2041-2049
    • /
    • 1998
  • This paper suggests a technique for program segmentation and maintenance using PSDG(Post-State Dependency Graph) that improves the quality of a software by identifying and detecting defects in already fixed source code. A program segmentation is performed by utilizing source code analysis which combines the measures of static, dynamic and semantic slicing when we need understandability of defect in programs for corrective maintanence. It provides users with a segmental principle to split a program by tracing state dependency of a source code with the graph, and clustering and highlighting, Through a modeling of the PSDG, elimination of ineffective program deadcode and generalization of related program segments arc possible, Additionally, it can be correlated with other design modeb as STD(State Transition Diagram), also be used as design documents.

  • PDF

Energy-Efficient Routing Protocol for Hybrid Ad Hoc Networks (하이브리드 애드 혹 네트워크에서의 에너지 효율성을 고려한 라우팅 알고리즘)

  • Park, Hye-Mee;Park, Kwang-Jin;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.133-140
    • /
    • 2007
  • Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

  • PDF

Two-stage Sampling for Estimation of Prevalence of Bovine Tuberculosis (이단계표본추출을 이용한 소결핵병 유병률 추정)

  • Pak, Son-Il
    • Journal of Veterinary Clinics
    • /
    • v.28 no.4
    • /
    • pp.422-426
    • /
    • 2011
  • For a national survey in which wide geographic region or an entire country is targeted, multi-stage sampling approach is widely used to overcome the problem of simple random sampling, to consider both herd- and animallevel factors associated with disease occurrence, and to adjust clustering effect of disease in the population in the calculation of sample size. The aim of this study was to establish sample size for estimating bovine tuberculosis (TB) in Korea using stratified two-stage sampling design. The sample size was determined by taking into account the possible clustering of TB-infected animals on individual herds to increase the reliability of survey results. In this study, the country was stratified into nine provinces (administrative unit) and herd, the primary sampling unit, was considered as a cluster. For all analyses, design effect of 2, between-cluster prevalence of 50% to yield maximum sample size, and mean herd size of 65 were assumed due to lack of information available. Using a two-stage sampling scheme, the number of cattle sampled per herd was 65 cattle, regardless of confidence level, prevalence, and mean herd size examined. Number of clusters to be sampled at a 95% level of confidence was estimated to be 296, 74, 33, 19, 12, and 9 for desired precision of 0.01, 0.02, 0.03, 0.04, 0.05, and 0.06, respectively. Therefore, the total sample size with a 95% confidence level was 172,872, 43,218, 19,224, 10,818, 6,930, and 4,806 for desired precision ranging from 0.01 to 0.06. The sample size was increased with desired precision and design effect. In a situation where the number of cattle sampled per herd is fixed ranging from 5 to 40 with a 5-head interval, total sample size with a 95% confidence level was estimated to be 6,480, 10,080, 13,770, 17,280, 20.925, 24,570, 28,350, and 31,680, respectively. The percent increase in total sample size resulting from the use of intra-cluster correlation coefficient of 0.3 was 22.2, 32.1, 36.3, 39.6, 41.9, 42.9, 42,2, and 44.3%, respectively in comparison to the use of coefficient of 0.2.

A Performance Improvement Scheme for a Wireless Internet Proxy Server Cluster (무선 인터넷 프록시 서버 클러스터 성능 개선)

  • Kwak, Hu-Keun;Chung, Kyu-Sik
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.415-426
    • /
    • 2005
  • Wireless internet, which becomes a hot social issue, has limitations due to the following characteristics, as different from wired internet. It has low bandwidth, frequent disconnection, low computing power, and small screen in user terminal. Also, it has technical issues to Improve in terms of user mobility, network protocol, security, and etc. Wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. In this paper, wireless internet proxy server clusters are used for the wireless Internet because their caching, distillation, and clustering functions are helpful to overcome the above limitations and needs. TranSend was proposed as a clustering based wireless internet proxy server but it has disadvantages; 1) its scalability is difficult to achieve because there is no systematic way to do it and 2) its structure is complex because of the inefficient communication structure among modules. In our former research, we proposed the All-in-one structure which can be scalable in a systematic way but it also has disadvantages; 1) data sharing among cache servers is not allowed and 2) its communication structure among modules is complex. In this paper, we proposed its improved scheme which has an efficient communication structure among modules and allows data to be shared among cache servers. We performed experiments using 16 PCs and experimental results show 54.86$\%$ and 4.70$\%$ performance improvement of the proposed system compared to TranSend and All-in-one system respectively Due to data sharing amount cache servers, the proposed scheme has an advantage of keeping a fixed size of the total cache memory regardless of cache server numbers. On the contrary, in All-in-one, the total cache memory size increases proportional to the number of cache servers since each cache server should keep all cache data, respectively.

The Development of the Vehicles Information Detector (Al 기법을 이용한 차량 정보 수집 장비 개발)

  • Moon, Hak-Yong;Ryu, Seung-Ki;Kim, Young-Chun;Byeon, Sang-Cheol;Choi, Do-Hyuk
    • Proceedings of the KIEE Conference
    • /
    • 2002.07b
    • /
    • pp.1283-1285
    • /
    • 2002
  • This study is developed vehicle information detector using loop and piezo sensors. This study would analyze the over all problems concerning our road conditions, environmental matters and unique features of our traffic matters; moreover, with these it would develope the hardware, software, car classification algorithm applied by artificial intelligence and traffic monitoring program which can be easily fixed. This can be divided into traffic detecting algorithm and car classification algorithm. Especially, we have developed the car classification algorithm used by C-means Fuzzy Clustering method.

  • PDF

A Study of Wireless Sensor Network Routing Protocols for Maintenance Access Hatch Condition Surveillance

  • Lee, Hoo-Rock;Chung, Kyung-Yul;Jhang, Kyoung-Son
    • Journal of Information Processing Systems
    • /
    • v.9 no.2
    • /
    • pp.237-246
    • /
    • 2013
  • Maintenance Access Hatches are used to ensure urban safety and aesthetics while facilitating the management of power lines, telecommunication lines, and gas pipes. Such facilities necessitate affordable and effective surveillance. In this paper, we propose a FiCHS (Fixed Cluster head centralized Hierarchical Static clustering) routing protocol that is suitable for underground maintenance hatches using WSN (Wireless Sensor Network) technology. FiCHS is compared with three other protocols, LEACH, LEACH-C, and a simplified LEACH, based on an ns-2 simulation. FiCHS was observed to exhibit the highest levels of power and data transfer efficiency.

An Improved Zone-Based Routing Protocol for Heterogeneous Wireless Sensor Networks

  • Zhao, Liquan;Chen, Nan
    • Journal of Information Processing Systems
    • /
    • v.13 no.3
    • /
    • pp.500-517
    • /
    • 2017
  • In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets.