• Title/Summary/Keyword: Path cost evaluation

Search Result 64, Processing Time 0.031 seconds

Probability Inference Heuristic based Non-Periodic Transmission for the Wireless Sensor Network (무선센서네트워크를 위한 확률추론 휴리스틱기반 비주기적 전송)

  • Kim, Gang-Seok;Lee, Dong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1689-1695
    • /
    • 2008
  • The development of low-power wireless communication and low-cost multi-functional smart sensor has enabled the sensor network that can perceive the status information in remote distance. Sensor nodes are sending the collected data to the node in the base station through temporary communication path using the low-cost RF communication module. Sensor nodes get the energy supply from small batteries, however, they are installed in the locations that are not easy to replace batteries, in general, so it is necessary to minimize the average power consumption of the sensor nodes. It is known that the RF modules used for wireless communication are consuming 20-60% of the total power for sensor nodes. This study suggests the probability inference heuristic based non-periodic transmission to send the collected information to the base station node, when the calculated value by probability is bigger than an optional random value, adapting real-time to the variation characteristics of sensing datain order to improve the energy consumption used in the transmission of sensed data. In this transmission method suggested, transmitting is decided after evaluation of the data sensed by the probability inference heuristic algorithm and the directly sensed data, and the coefficient that is needed for its algorithm is decided through the reappearance rate of the algorithm verification data.

Mobility Support Scheme Based on Machine Learning in Industrial Wireless Sensor Network (산업용 무선 센서 네트워크에서의 기계학습 기반 이동성 지원 방안)

  • Kim, Sangdae;Kim, Cheonyong;Cho, Hyunchong;Jung, Kwansoo;Oh, Seungmin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.11
    • /
    • pp.256-264
    • /
    • 2020
  • Industrial Wireless Sensor Networks (IWSNs) is exploited to achieve various objectives such as improving productivity and reducing cost in the diversity of industrial application, and it has requirements such as low-delay and high reliability packet transmission. To accomplish the requirement, the network manager performs graph construction and resource allocation about network topology, and determines the transmission cycle and path of each node in advance. However, this network management scheme cannot treat mobile devices that cause continuous topology changes because graph reconstruction and resource reallocation should be performed as network topology changes. That is, despite the growing need of mobile devices in many industries, existing scheme cannot adequately respond to path failure caused by movement of mobile device and packet loss in the process of path recovery. To solve this problem, a network management scheme is required to prevent packet loss caused by mobile devices. Thus, we analyse the location and movement cycle of mobile devices over time using machine learning for predicting the mobility pattern. In the proposed scheme, the network manager could prevent the problems caused by mobile devices through performing graph construction and resource allocation for the predicted network topology based on the movement pattern. Performance evaluation results show a prediction rate of about 86% compared with actual movement pattern, and a higher packet delivery ratio and a lower resource share compared to existing scheme.

Construction for the Design Project Management System(DPMS) (디자인 프로젝트 관리 시스템(DPMS)의 구성)

  • 우흥룡
    • Archives of design research
    • /
    • v.12 no.3
    • /
    • pp.227-234
    • /
    • 1999
  • We paid attention to the fact that a project will always tend to increase in size even if its scope is narrowing. The complexities and multidisciplinary aspects of projects require that the many parts should be put together so that the prime objectives- performance, time, and cost- are met. These aspects lead to the use of teams to solve problems that used to be solved by individuals. Firstly, We surveyed the design companies and their clients on the design projects, and categorized the design task into 5 phases, that are marketing, planning, idea development, presentation, and follow-up. Among the phases, the presentation has the most difficult task, longest processing time, and highest cost, whereas idea development phase has relatively low cost, longer processing time, and more difficult task. Most of the companies used to be faced several bottlenecks on their design projects - time control, budget control, and resource control. Secondly, for improving the project managing process, we adopted that dividing and analyzing the sub critical paths may help in the effective managing.(Badiru, Adedeji B., 1995) Some critical paths require almost as much attention as the critical path since they have a high potential of becoming critical when changes occur in the network. Therefrom we suggest the Total task weight(Gt) as a management formula for the design project management.${Gt=\mathrm{T}\ast\leftthreetimes\ast1/100}$<\TEX> ( Gt = Total task weight, mathrm{T} = Task Weight, \leftthreetimes= Criticality ) Thirdly, In order to support to managing for the design projects, we set up an application system, which is graphically planning and implementing a complex undertaking. It is helpful to make the control of a project easy. The DPMS(Design Project Management System), which has two sub system. One is Project Screening System(PSS), and another Project Managing System(PMS). In PMS, we divided the design project into three modules; Project Planning, Project Implementation, and Project Evaluation. As a result, the DPMS will contribute to supply the control of a project easily and effectively. Also teams are used for making decisions and taking action with the DPMS. But we need to get further studies on the relationships between the whole project and its tasks.

  • PDF

An Improved Technique of Fitness Evaluation for Automated Test Data Generation (테스트 데이터 자동 생성을 위한 적합도 평가 방법의 효율성 향상 기법)

  • Lee, Sun-Yul;Choi, Hyun-Jae;Jeong, Yeon-Ji;Bae, Jung-Ho;Kim, Tae-Ho;Chae, Heung-Suk
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.12
    • /
    • pp.882-891
    • /
    • 2010
  • Many automated dynamic test data generation technique have been proposed. The techniques evaluate fitness of test data through executing instrumented Software Under Test (SUT) and then generate new test data based on evaluated fitness values and optimization algorithms. Previous researches and experiments have been showed that these techniques generate effective test data. However, optimization algorithms in these techniques incur much time to generate test data, which results in huge test case generation cost. In this paper, we propose a technique for reducing the time of evaluating a fitness of test data among steps of dynamic test data generation methods. We introduce the concept of Fitness Evaluation Program (FEP), derived from a path constraint of SUT. We suggest a test data generation method based on FEP and implement a test generation tool, named ConGA. We also apply ConGA to generate test cases for C programs, and evaluate efficiency of the FEP-based test case generation technique. The experiments show that the proposed technique reduces 20% of test data generation time on average.

Accelerating Keyword Search Processing over XML Documents using Document-level Ranking (문서 단위 순위화를 통한 XML 문서에 대한 키워드 검색 성능 향상)

  • Lee, Hyung-Dong;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.33 no.5
    • /
    • pp.538-550
    • /
    • 2006
  • XML Keyword search enables us to get information easily without knowledge of structure of documents and returns specific and useful partial document results instead of whole documents. Element level query processing makes it possible, but computational complexity, as the number of documents grows, increases significantly overhead costs. In this paper, we present document-level ranking scheme over XML documents which predicts results of element-level processing to reduce processing cost. To do this, we propose the notion of 'keyword proximity' - the correlation of keywords in a document that affects the results of element-level query processing using path information of occurrence nodes and their resemblances - for document ranking process. In benefit of document-centric view, it is possible to reduce processing time using ranked document list or filtering of low scored documents. Our experimental evaluation shows that document-level processing technique using ranked document list is effective and improves performance by the early termination for top-k query.

The Preference of Housing for the Elderly among the Middle-aged Households for Aging Society (고령화 사회에 대비한 중년층의 노후 주거선호 - 광주지역의 대학생 자녀를 둔 학부형을 대상으로 -)

  • Kim Mi-Hee
    • Journal of the Korean housing association
    • /
    • v.17 no.1
    • /
    • pp.117-126
    • /
    • 2006
  • This study was conducted as a survey to find out middle-aged persons's housing preferences for a future elderly housing and to grasp background characteristics of persons influencing the preferences and the effect of elderly's aging situations on the changes of their preferences. A sample of 300 middle-aged people was selected purposely from parents of university students living in Gwang-ju city. Questionnaires were administered to parents by students and analysed with SPSS Windows 10 program. Middle-aged persons's housing preferences were differed according to elderly's aging situations, in the case of healthy situation, they tended to prefer to stay present house without their children in irrespective to couple or single, whereas in the case of unhealthy situation, they tended to prefer to live with their children. and couples showed preferences for planned housing for the elderly and singles showed preferences for elderly housing facilities with care services. The most important characteristics of elderly housing among middle-aged people was a places where they can enjoy leisure and provide home-help services, located in the suburbs. Also middle-aged persons were likely to prefer to a green spaces such as garden, path for walking, and madang for the elderly housing. Needs for community care services (NCCS) were required above the average. Among the items of NCCS, a visiting medical examination was the most demanding, and a visiting nursing services, a emergency calling bell, and home repairs were sequently followed in the level of needs. The characteristics of the elderly housing which preferred to and needs for community care services were influenced by middle-aged persons's age, gender, subjective evaluation of economic abilities, tenure status, the cost of living, and the size of housing. This findings suggests that it must to be considered to develop various types of the elderly housing depending on socioeconomic status.

Real-time Data Enhancement of 3D Underwater Terrain Map Using Nonlinear Interpolation on Image Sonar (비선형 보간법을 이용한 수중 이미지 소나의 3 차원 해저지형 실시간 생성기법)

  • Ingyu Lee;Jason Kim;Sehwan Rho;Kee–Cheol Shin;Jaejun Lee;Son-Cheol Yu
    • Journal of Sensor Science and Technology
    • /
    • v.32 no.2
    • /
    • pp.110-117
    • /
    • 2023
  • Reconstructing underwater geometry in real time with forward-looking sonar is critical for applications such as localization, mapping, and path planning. Geometrical data must be repeatedly calculated and overwritten in real time because the reliability of the acoustic data is affected by various factors. Moreover, scattering of signal data during the coordinate conversion process may lead to geometrical errors, which lowers the accuracy of the information obtained by the sensor system. In this study, we propose a three-step data processing method with low computational cost for real-time operation. First, the number of data points to be interpolated is determined with respect to the distance between each point and the size of the data grid in a Cartesian coordinate system. Then, the data are processed with a nonlinear interpolation so that they exhibit linear properties in the coordinate system. Finally, the data are transformed based on variations in the position and orientation of the sonar over time. The results of an evaluation of our proposed approach in a simulation show that the nonlinear interpolation operation constructed a continuous underwater geometry dataset with low geometrical error.

A Resource Adaptive Data Dissemination Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 자원 적응형 데이터 확산프로토콜)

  • Kim, Hyun-Tae;Choi, Nak-Sun;Jung, Kyu-Su;Jeon, Yeong-Bae;Ra, In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.11
    • /
    • pp.2091-2098
    • /
    • 2006
  • In this paper, it proposes a protocol of resource adaptive data dissemination for sensor nodes in a wireless sensor network. In general, each sensor node used in a wireless sensor network delivers the required information to the final destination by conducting cooperative works such as sensing, processing, and communicating each other using the battery power of a independent sensor node. So, a protocol used for transferring the acquired information to users through the wireless sensor network can minimize the power consumption of energy resource given to a sensor node. Especially, it is very important to minimize the total amount of power consumption with a method for handling the problems on implosion. data delivery overlapping, and excessive message transfer caused by message broadcasting. In this paper, for the maintaining of the shortest path between sensor nodes, maximizing of the life time of a sensor node and minimizing of communication cost, it presents a method for selecting the representative transfer node for an event arising area based on the negotiation scheme and maintaining optimal transfer path using hop and energy information. Finally, for the performance evaluation, we compare the proposed protocol to existing directed diffusion and SPIN protocol. And, with the simulation results, we show that the proposed protocol enhances the performance on the power consumption rate when the number of overall sensor nodes in a sensor network or neighbor sensor nodes in an event area are increased and on the number of messages disseminated from a sensor node.

A Stochastic User Equilibrium Transit Assignment Algorithm for Multiple User Classes (다계층을 고려한 대중교통 확률적사용자균형 알고리즘 개발)

  • Yu, Soon-Kyoung;Lim, Kang-Won;Lee, Young-Ihn;Lim, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.165-179
    • /
    • 2005
  • The object of this study is a development of a stochastic user equilibrium transit assignment algorithm for multiple user classes considering stochastic characteristics and heterogeneous attributes of passengers. The existing transit assignment algorithms have limits to attain realistic results because they assume a characteristic of passengers to be equal. Although one group with transit information and the other group without it have different trip patterns, the past studies could not explain the differences. For overcoming the problems, we use following methods. First, we apply a stochastic transit assignment model to obtain the difference of the perceived travel cost between passengers and apply a multiple user class assignment model to obtain the heterogeneous qualify of groups to get realistic results. Second, we assume that person trips have influence on the travel cost function in the development of model. Third, we use a C-logit model for solving IIA(independence of irrelevant alternatives) problems. According to repetition assigned trips and equivalent path cost have difference by each group and each path. The result comes close to stochastic user equilibrium and converging speed is very fast. The algorithm of this study is expected to make good use of evaluation tools in the transit policies by applying heterogeneous attributes and OD data.

Enhanced PMIPv6 Route Optimization Handover using PFMIPv6 in Mobile Cloud Environment (모바일 클라우드 환경에서 PFMIPv6를 이용한 향상된 PMIPv6 경로 최적화 핸드오버 기법)

  • Na, Je-Gyun;Seo, Dae-Hee;Nah, Jae-Hoon;Mun, Young-Song
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.12
    • /
    • pp.17-23
    • /
    • 2010
  • In the mobile cloud computing, the mobile node should request and receive the services while being connected. In PMIPv6, all packets sent by mobile nodes or correspondent nodes are transferred through the local mobility anchor. This unnecessary detour still results in high delivery latency and significant processing cost. Several PMIPv6 route optimization schemes have been proposed to solve this issue. However, they also suffer from the high signaling costs and handover latency when determining the optimized path. We propose the route optimization handover scheme which adopts the prediction algorithm in PFMIPv6. In the proposed scheme, the new mobile access gateway establishes the bi-directional tunnel with the correspondent node's MAG using the context message when the mobile node's handover is imminent. This tunnel may eliminate the need of separate route optimization procedure. Hence, the proposed scheme can reduce the signaling cost than other conventional schemes do. Analytical performance evaluation is preformed to show the effectiveness of the proposed scheme. The result shows that our scheme is more effective than other schemes.