• Title/Summary/Keyword: Dynamic Mobility

Search Result 416, Processing Time 0.031 seconds

Optimal Routing Path Selection Algorithm in Ad-hoc Wireless Sensor Network (Ad-hoc 센서네트워크를 위한 최적 라우팅 경로 설정 알고리즘)

  • Jang In-Hun;Sim Kwee-Bo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.403-408
    • /
    • 2005
  • 다단계 호핑(multi-hop) 무선 센서네트워크의 라우팅 경로를 설정하는데 있어서 데이터 전송의 요구가 있는 경우에만 경로를 만드는 Demand-Driven 방식의 대표적인 방법이 DSR(Dynamic Source Routing)인데 라우트 레코드를 패킷에 실어 보내기 때문에 이 또한 센서노드들의 수가 많아질수록 패킷이 무거워질 수밖에 없다. 본 논문에서는 DSR 프로토콜을 기반 하면서도 라우팅 테이블을 적절히 이용하여 노드 수 증가에 대해 고정된 패킷크기를 가지도록 하였으며 라우팅 비용함수를 적용하여 각 센서노드들의 전원 소모량, 이동성(Mobility), 네트워크 내에서의 Traffic, 거리(Hop) 등을 복합적으로 고려한 안정적이고 신뢰성 있는 최적의 라우팅 설정 알고리즘을 제안한다.

  • PDF

Application Driven Cluster Based Group Key Management with Identifier in Mobile Wireless Sensor Networks

  • Huh, Eui-Nam;Nahar Sultana
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.1 no.1
    • /
    • pp.1-17
    • /
    • 2007
  • This paper proposes and analyzes a scalable and an efficient cluster based group key management protocol by introducing identity based infrastructure for secure communication in mobile wireless sensor networks. To ensure scalability and dynamic re-configurability, the system employs a cluster based approach by which group members are separated into clusters and the leaders of clusters securely communicate with each other to agree on a group key in response to changes in membership and member movements. Through analysis we have demonstrated that our protocol has a high probability of being resilient for secure communication among mobile nodes. Finally, it is established that the proposed scheme is efficient for secure positioning in wireless sensor networks.

Transmission Path Analysis of Noise and Vibration in a Rotary Compressor by Statistical Energy Analysis

  • Hwang, Seon-Woong;Jeong, Weui-Bong;Yoo, Wan-Suk;Kim, Kyu-Hwan
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.11
    • /
    • pp.1909-1915
    • /
    • 2004
  • The hermetic rotary compressor is one of the most important components of an air conditioning system since it has a great effect on both the performance and the noise and vibration of the system. Noise and vibration occurs due to gas pulsation during the compression process and to unbalanced dynamic force. In order to reduce noise and vibration, it is necessary to identify their sources and transmission path and effectively control them. Many approaches have been tried in order to identify the noise transmission path of a compressor. However, identification has proven to be difficult since the characteristics of compressor noise are complicated due to the interaction of the compressor parts and gas pulsation. In this study, the statistical energy analysis has been used to trace the energy flow in the compressor and to identify the transmission paths from the noise source to the exterior sound field.

Design and Control of a Hydraulic Driven Quadruped Walking Robot (유압구동식 4족보행 로봇의 설계 및 제어)

  • Kim, Tae-Ju;Won, Dae-Hee;Kwon, O-Hung;Park, Sang-Deok;Son, Woong-Hee
    • The Journal of Korea Robotics Society
    • /
    • v.2 no.4
    • /
    • pp.353-360
    • /
    • 2007
  • This paper proposes the trot gait pattern generation and online control methods for a quadruped robot to carry heavy loads and to move fast on uneven terrain. The trot pattern is generated from the frequency modulated pattern generation method based on the frequency modulated oscillator in order for the legged robots to be operated outdoor environment with the static and dynamic mobility. The efficiency and performance of the proposed method are verified through computer simulations and experiments using qRT-1/-2. In the experiments, qRT-2 which has two front legs driven by hydraulic linear actuators and two rear casters is used. The robot can trot at the speed up to 1.3 m/s on even surface, walk up and down the 20 degree inclines, and walk at 0.7 m/s on uneven surface. Also it can carry over 100 kg totally including 40 kg payload.

  • PDF

An Engine Structure-Borne Noise Analysis by Finite Element Method (유한요소법에 의한엔진 구조소음 해석)

  • 안상호;김주연;김규철
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.6 no.1
    • /
    • pp.122-133
    • /
    • 1998
  • This paper presents the static analysis, the modal analysis and the forced vibration analysis on engine structures to find out the structure-borne noise sources by finite element method. The deformation of engine structures under the maximum combu- stion gas force was calculated through the static analysis, and the resonance possibilities were predicted by the modal analysis which ascertains mode shapes and the corresponding frequencies of engine global and its major noise sources in engine surfaces were investigated with the forced vibration analysis by means of finding the transfer mobilities on engine surfaces due to the piston impact and the velocity levels due to the combustion in consideration of oil film stiffness and damping coefficients. Finally, the direction of engine structure-borne noise reduction can be estabilished by the above-mentioned analysis procedure and the reduction effect of cost on proto-type engine build-up is expected.

  • PDF

An Energy Efficient Clustering Scheme with Mobility Prediction for Dynamic Wireless Sensor Networks (동적 무선 센서 네트워크 상의 노드 이동성 예측을 융합한 에너지 효율기반 클러스트링 기법)

  • Jang, Woo-Hyun;Chang, Hyeong-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06a
    • /
    • pp.412-415
    • /
    • 2011
  • 본 논문에서는 정적 무선 센서 네트워크상의 클러스터링 기법인 EECS(Energy Efficient Clustering Scheme)의 노드와 Base Station간의 거리를 고려한 head 선출 과정에 노드의 이동성 및 미래 위치 예측을 융합하여 확장한 새로운 동적환경상의 클러스터링 기법 EECS-M(Energy Efficient Clustering Scheme in Mobile wireless sensor networks)을 제안한다. 실험을 통하여 EECS-M이 동적 환경상의 LEACH-M, WCA 및 정적 환경상의 EECS, LEACH 클러스터링 알고리즘들에 비해 life time 및 life time 대비 네트워크의 잔여 에너지 측면에서 성능향상을 가진다는 것을 보인다.

Efficient Mobile Node Authentication in WSN (센서 네트워크에서 이동성이 있는 센서 노드의 효율적인 인증 방안)

  • Shon, Tae-Shik;Han, Kyu-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5B
    • /
    • pp.833-839
    • /
    • 2010
  • Mobility of sensor node is one of the rising issues in Wireless Sensor Networks (WSN). However, current security researches on WSN only consider static environments. Thus they are not sufficient to be deployed in the dynamic environment where the resource is limited. In this paper, we propose the efficient node authentication and key exchange protocol that reduces the overhead in node re-authentication.

Optimum Design of Hermetic Compressor Joumal Bearing with Alternative Refrigerant Application (대체냉매 적용에 따른 밀폐형 압축기 저널베어링의 최적설계)

  • 이규한;김정우;이장희
    • Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
    • /
    • 1998.04a
    • /
    • pp.218-227
    • /
    • 1998
  • Present study is undertaken to optimize the lubrication reliability and frictional loss of the dynamically-loaded journal bearing in hermetic reciprocating compressor with alternative refrigerant R600a application. Thermodynamic and dynamic analysis has been conducted to investigate cylinder pressure variations by substitution alternative refrigerant R600a for R12. The modeling of the dynamics of the compressor mechanism has been performed with lumped mass method. A mathematical model is developed for analyzing the dynamics of the journal bearing system with the mobility method. It takes into account the effects of the refrigerant species, aspect ratio, clearance ratio and surface roughness. A corresponding computer program is described which enables to obtain the minimum film thickness and frictional loss. Design optimization is graphically performed by parametric studies of the aspect ratio and clearance ratio.

  • PDF

Adaptive Partition-Based Address Allocation Protocol in Mobile Ad Hoc Networks

  • Kim, Ki-Il;Peng, Bai;Kim, Kyong-Hoon
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.2
    • /
    • pp.141-147
    • /
    • 2009
  • To initialize and maintain self-organizing networks such as mobile ad hoc networks, address allocation protocol is essentially required. However, centralized approaches that pervasively used in traditional networks are not recommended in this kind of networks since they cannot handle with mobility efficiently. In addition, previous distributed approaches suffer from inefficiency with control overhead caused by duplicated address detection and management of available address pool. In this paper, we propose a new dynamic address allocation scheme, which is based on adaptive partition. An available address is managed in distributed way by multiple agents and partitioned adaptively according to current network environments. Finally, simulation results reveal that a proposed scheme is superior to previous approach in term of address acquisition delay under diverse simulation scenarios.

Autonomous, Scalable, and Resilient Overlay Infrastructure

  • Shami, Khaldoon;Magoni, Damien;Lorenz, Pascal
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.378-390
    • /
    • 2006
  • Many distributed applications build overlays on top of the Internet. Several unsolved issues at the network layer can explain this trend to implement network services such as multicast, mobility, and security at the application layer. On one hand, overlays creating basic topologies are usually limited in flexibility and scalability. On the other hand, overlays creating complex topologies require some form of application level addressing, routing, and naming mechanisms. Our aim is to design an efficient and robust addressing, routing, and naming infrastructure for these complex overlays. Our only assumption is that they are deployed over the Internet topology. Applications that use our middleware will be relieved from managing their own overlay topologies. Our infrastructure is based on the separation of the naming and the addressing planes and provides a convergence plane for the current heterogeneous Internet environment. To implement this property, we have designed a scalable distributed k-resilient name to address binding system. This paper describes the design of our overlay infrastructure and presents performance results concerning its routing scalability, its path inflation efficiency and its resilience to network dynamics.