• Title/Summary/Keyword: deployment algorithm

Search Result 227, Processing Time 0.023 seconds

Self-Localized Packet Forwarding in Wireless Sensor Networks

  • Dubey, Tarun;Sahu, O.P.
    • Journal of Information Processing Systems
    • /
    • v.9 no.3
    • /
    • pp.477-488
    • /
    • 2013
  • Wireless Sensor Networks (WSNs) are comprised of sensor nodes that forward data in the shape of packets inside a network. Proficient packet forwarding is a prerequisite in sensor networks since many tasks in the network, together with redundancy evaluation and localization, depend upon the methods of packet forwarding. With the motivation to develop a fault tolerant packet forwarding scheme a Self-Localized Packet Forwarding Algorithm (SLPFA) to control redundancy in WSNs is proposed in this paper. The proposed algorithm infuses the aspects of the gossip protocol for forwarding packets and the end to end performance of the proposed algorithm is evaluated for different values of node densities in the same deployment area by means of simulations.

LOS Analysis Algorithm for Mid-range Guided Weapon System (중거리지대공 유도무기체계 적용을 위한 가시선 분석 알고리듬 연구)

  • Lee, Han-Min
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.4
    • /
    • pp.642-649
    • /
    • 2010
  • LOS analysis is used for optimal deployment of mid-range guided weapon system or system engagement effectiveness simulation. Comparing to real-world, LOS analysis includes error sources such as coarse terrain data resolution, refraction of radio waves, and several ideal assumptions. In this research, exact LOS algorithm under assumption of constant earth curvature and error analysis of that is investigated. It proved that LOS algorithm under assumption of constant earth curvature has negligible error in mid-range guidance weapon system's scope.

Global Path Planning for an Autonomous Underwater Vehicle in a Vortical Current Field by Using Genetic Algorithm (유전자 알고리즘을 이용한 무인잠수정의 와조류장에서의 전역경로계획)

  • Lee, Ki-Young;Kim, Subum;Song, Chan-Hee
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.4
    • /
    • pp.473-480
    • /
    • 2013
  • The purpose of this paper is to demonstrate that the genetic algorithm can be useful for the global path planning when the obstacles and current field data are given. In particular, the possibilities for a novel type small AUV mission deployment in tidal regions, which experience vortical currents, were examined. Experimental simulations show feasibility and effective in generate the global path regardless of current and obstacles. By choosing an appropriate path in space, an AUV may both bypass adverse currents which are too fast to be overcome by the vehicle's motor and also exploit favorable currents to achieve far greater speeds than motors could otherwise provide, while substantially saving energy.

A Study on the ANP Application for the Construction of Integrated CEM Model (CEM통합모델 구축을 위한 ANP활용에 관한 연구)

  • Jin, Han-Xin;Lee, Chang-Ho
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2005.11a
    • /
    • pp.171-184
    • /
    • 2005
  • Today, the usage of DB already becomes an important issue for many companies' survival, especially, for the companies who have adopted CRM(Customer Relationship Management). CEM(Customer Experience Management), as a practical alternative, can settle it. In this paper, we use QFD(Quality Function Deployment) and GA(Genetic Algorithm)-based Group ANP(Analytic Network Process) to construct the Integrated CEM Model to help company decide the priorities of investment in customer experiences.

  • PDF

Study on efficient scheduing strategies for multiuser MIMO systems (멀티유저 MIMO 시스템에서 효과적인 스케쥴링 정책 연구)

  • Kim, Jae-Hong;Kim, Se-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.201-204
    • /
    • 2006
  • In this paper, we propose efficient scheduling strategy for Multi-user MIMO systems that find advantageous trade off solution between multiuser diversity and spatial diversity, spatial multiplexing technique. Specifically, we suggest P-SFS(Pseudo-SNR Fair scheduling) algorithm that consider throughput and fairness problem. also we propose channel aware Antenna deployment that decide how to use assigned multiple antennas by the information of each user's channel condition.

  • PDF

Design and Measured Data Analysis of a Shipboard Indoor Signal Propagation Characteristics Based on Three Way Signature Sequence Packet Mode (세방향 서명 수열 패킷 방식 기반 선내 전파 전달특성 측정시스템 설계 및 분석)

  • Kim, Jeong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.1
    • /
    • pp.193-197
    • /
    • 2015
  • Recently, the new issues for the safety and the information delivery system in the ship are raised. The deployment and the efficient algorithms of deploying the wireless sensor networks instead of using the built-in wired networks or the setup of the new wired networks is more desirable than the deployment of the wired networks in a ship after its final production since it can reduce the cost and the time of the brand new wired networks by reshaping some of the internal structure of the ship. In this paper, the shipboard signal propagation measurement system based on the signature sequence-three way slave mode are designed and its measureed data are analysed after measuring the signal propagation characteristics. Consequently, it is expected that the reliable and cost-effective signal measurement system with the three way algorithm for the deployment of the shipboard wireless networks can be achieved.

An Efficient Service Function Chains Orchestration Algorithm for Mobile Edge Computing

  • Wang, Xiulei;Xu, Bo;Jin, Fenglin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.12
    • /
    • pp.4364-4384
    • /
    • 2021
  • The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

A Methodology for Constructing Function Tree & Fault Tree in Reliability Analysis (신뢰성 분석을 위한 Function Tree 및 Fault Tree 구성 방법에 관한 연구)

  • Ha, Sung-Do;Lee, Eon-Kyung;Kang, Dal-Mo
    • Proceedings of the KSME Conference
    • /
    • 2001.06c
    • /
    • pp.333-338
    • /
    • 2001
  • Fault tree is a widely used methodology for analyzing product reliability. The fault trees are usually constructed using the experiences of expert reliability engineers in top-down approaches and have different structures according to each expert's subjectivity. In this work it is tried to find a general method for the fault tree construction based on the function tree that is the result of product function deployment. Based on the function tree, the method has the advantage of resulting an objective fault tree since the faults are defined as the opposite concept of functions. The fault tree construction of this work consists of the following steps: 1) definition of product primary function with the viewpoints of product operation and configuration, 2) construction of functional relation chart using a grouping algorithm, 3) abstraction of functional block diagram according to operation sequences and configuration of a product, 4) construction of function tree for each viewpoint, and 5) construction of fault tree by matching the function tree and simplification of the result.

  • PDF

A Markov Game based QoS Control Scheme for the Next Generation Internet of Things (미래 사물인터넷을 위한 마르코프 게임 기반의 QoS 제어 기법)

  • Kim, Sungwook
    • Journal of KIISE
    • /
    • v.42 no.11
    • /
    • pp.1423-1429
    • /
    • 2015
  • The Internet of Things (IoT) is a new concept associated with the future Internet, and it has recently become a popular concept to build a dynamic, global network infrastructure. However, the deployment of IoT creates difficulties in satisfying different Quality of Service (QoS) requirements and achieving rapid service composition and deployment. In this paper, we propose a new QoS control scheme for IoT systems. The Markov game model is applied in our proposed scheme to effectively allocate IoT resources while maximizing system performance. The results of our study are validated by running a simulation to prove that the proposed scheme can promptly evaluate current IoT situations and select the best action. Thus, our scheme approximates the optimum system performance.

Study of Data Placement Schemes for SNS Services in Cloud Environment

  • Chen, Yen-Wen;Lin, Meng-Hsien;Wu, Min-Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.3203-3215
    • /
    • 2015
  • Due to the high growth of SNS population, service scalability is one of the critical issues to be addressed. The cloud environment provides the flexible computing and storage resources for services deployment, which fits the characteristics of scalable SNS deployment. However, if the SNS related information is not properly placed, it will cause unbalance load and heavy transmission cost on the storage virtual machine (VM) and cloud data center (CDC) network. In this paper, we characterize the SNS into a graph model based on the users' associations and interest correlations. The node weight represents the degree of associations, which can be indexed by the number of friends or data sources, and the link weight denotes the correlation between users/data sources. Then, based on the SNS graph, the two-step algorithm is proposed in this paper to determine the placement of SNS related data among VMs. Two k-means based clustering schemes are proposed to allocate social data in proper VM and physical servers for pre-configured VM and dynamic VM environment, respectively. The experimental example was conducted and to illustrate and compare the performance of the proposed schemes.