• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.100-103
• /
• 2019

Due to the fourth industrial revolution called 'fusion and connection', interest in 'high connectivity society' and 'highland society' is increasing, and related objects are not limited to automation and connected cars. The Internet of Things is the main concern of the 4th Industrial Revolution and it is expected to play an important role in establishing the basis of the next generation mobile communication service. Several domestic and foreign companies have been studying various types of LPWANs for the construction of the Internet based on things, and there is Semtech's LoRaWAN technology as representative. LoRaWAN is a long-distance, low-power network designed to manage a large number of devices and sensors, with communications from hundreds to thousands to thousands of devices and sensors. In this paper, we analyze the optimum node capacity of gateway for maximum performance while reducing resource waste in using LoRaWAN.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.25-34
• /
• 2011

In this paper, In this paper, we propose a Cooperative Routing Protocol (CooRP) for supporting network convergence and transmission services efficiently in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main contributions and features of this paper are as follows. First, the routing routes are decided on route stability based on entropy concepts using mobility of nodes within the direction guided line region to increase the operational lifetime of routes as well as reduce control overhead for route construction. Second, a cooperative data transmission strategy based on the constructed stable routing route is used to increase packet delivery ratio with advanced SNR. Third, a theoretical analysis for cooperative data transmission of the proposed CooRP with outage probability is presented. The performance evaluation of the proposed CooRP is performed via simulation using OPNET and analysis. The results of performance evaluation show that the proposed CooRP by using stable routing routes and cooperative transmission can increase packet delivery ratio efficiently.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.80-83
• /
• 2009

The most popular communication protocol is those defined by the IEEE 802.11 WLAN to support broadband internet connection. The demand for real-time multimedia service is increasing through WLAN on the road. The Hand-off function of mobile terminal is essential to support mobility. But, the hand-off function of IEEE 802.11 WLANs has the latency up to 300ms, and recent research has focusing on channel scanning and reconnection to AP and certification process of AP. It is also the lack of consideration in related works that hand-off happens frequently when the mobile node is moving. This paper proposed the hand-off algorithm that guarantees high throughput and estimates the point which may occur hand-off using GPS information and RSSI. We implement the proposed hand-off function that achieves the best performance.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.11
• /
• pp.385-392
• /
• 2016

Recently, Expectation Area-based Real-time Routing (EAR2) protocol has been proposed to support real-time routing in wireless sensor networks. EAR2 considers the expectation area of a mobile sink and uses flooding within the expectation area. However, flooding leads to excessive energy consumption and causes long delay against real-time routing. Moreover, since EAR2 uses single path to the expectation area, it is difficult to support reliable routing in sensor networks with high link failures. Thus, to overcome these limitation of EAR2, this paper proposes a reliable and real-time routing protocol based on virtual grids and multipath for mobile sinks. To support real-time routing, the proposed protocol considers expectation grids belonged to the expectation area. Instead of flooding within the expectation area, the proposed protocol uses multicasting to the expectation grids and single hop forwarding in an expectation grid because the multicasting can save much energy and the single hop forwarding can provide short delay. Also, the proposed protocol uses multipath to the expectation grids to deal with link failures for supporting reliable routing. Simulation results show that the proposed protocol is superior to the existing protocols.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.425-430
• /
• 2007

Without the aid of stationary infrastructure, maintaining routing information for all nodes is inefficient in the Mobile Ad hoc Networks(MANET). It is more efficient when every time routing information is necessary that the source node broadcasts a query message to neighbour nodes. The source node using Ad hoc On-Demand distance Vector(AODV), which is one of the routing protocols of MANET, uses the Expanding Ring Search(ERS) algorithm which finds a destination node efficiently. In order to reduce the congestion of the network, ERS algorithm does not broadcast Route REQuest(RREQ) messages in the whole network. When the timer expires, if source node does not receive Route REPly(RREP) messages from the destination node, it gradually increases TTL value and broadcasts RREQ messages. Existing AODV cost a great deal to find a destination node because it uses a fixed NODE_TRAVERSAL_TIME value. Without the message which is added in existing AODV protocols, this paper measures delay time among the neighbours' nodes by making use of HELLO messages. We propose Adaptive ERS(AERS) algorithm that makes NET_TRAVERSAL_TIME optimum which apply to the measured delay time to NODE_TRAVERSAL_TIME. AERS suppresses the unnecessary messages, making NET_TRAVERSAL_TIME optimum in this paper. So we will be able to improve a network performance. We prove the effectiveness of the proposed method through simulation.

• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.65-71
• /
• 2011

In this paper, the RFID / USN-based ad-hoc network structure is presented for efficient operation of a container terminal yard. Communication between fixed or mobile devices in the container terminal yard is accomplished through the ad-hoc node, to collect the status information of a container in real time. Any outside shipper of the container as well as central server allows to share the status information of a container through ad-hoc communication. In addition, to predict the maximum wireless transmission range of nodes by RFID tag position in the yard, LAODV (Location based AODV) routing protocol is proposed. The validity is proved by performance evaluation via computer simulation.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2010.04a
• /
• pp.339-342
• /
• 2010

본 논문에서는 유/무선 임피던스 계측을 통하여 현장 타설 콘크리트의 강도 발현 모니터링 기법을 개발하였다. 최근 많이 사용되고 있는 고강도 콘크리트의 경우 강도 발현이 제대로 되지 않으면 건설 중 취성 파괴가 일어날 우려가 있으므로 현장에서의 강도 발현 모니터링이 중요시 되고 있다. 하지만 기존의 콘크리트 강도 평가 방법은 고가의 장비가 필요하거나 복잡한 수학식을 통하여 이루어 졌기에 현장에서는 효율적으로 사용되기 힘들었다. 이에 압전 센서 기반 임피던스 측정을 통하여 콘크리트의 강도 발현을 모니터링하는 기법을 제안하였다. 구조물의 임피던스는 구조물 손상이나 강도 변화와 같은 구조물의 물성 변화 발생 시 공진주파수가 이동하는 특징이 있다. 이를 기반으로 콘크리트 구조물의 공진주파수 변화를 관찰하여 대상 구조물의 강도를 모니터링하는 기법을 개발하였으며 유/무선 임피던스 계측을 동시에 실시하여 무선 임피던스 측정의 유효성을 평가하였다. 그리고 고강도 콘크리트에서의 적용을 평가하기 위하여 설계 강도 30MPa, 100MPa의 콘크리트에 대하여 유/무선 임피던스 측정을 실시하였다. 이를 통해 본 논문에서는 무선 임피던스 계측을 이용하여 접근하기 어려운 곳이나 케이블 연결이 어려운 곳에서도 실시간으로 구조물의 강도 발현 모니터링이 가능한 시스템을 제안하였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.263-274
• /
• 2010

Mutual exclusion that applied on existing systems was designed for static distributed systems. but now computing environments are going to mobile computing environments. Therefore a mutual exclusion algorithm in static distributed environments should be designed for new computing environments. So this paper proposes a mobile mutual exclusion algorithm to support the mutual exclusion of shared resources in mobile computer environments. Mobile computing resources as wireless hosts cause new issues because of their mobility and weakness and made mutual exclusion problem more complex than stationary distributed environments. So we proposed a new mobile token mutual exclusion algorithm with deadlock-free and starvation-free in mobile computing environments based on spanning tree topology and extend for mobile computing environments. The proposed algorithm minimizes message complexity in case of free hopping in cellular networks.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.599-603
• /
• 2006

유비쿼터스 센서 네트워크(Ubiquitous Sensor Network, USN)는 차세대 네트워크로 각광받고 있고 이러한 센서 네트워크의 보안에 대한 관심은 더욱 높아지고 있다. 왜냐하면 센서 네트워크를 외부 공격자로부터 보호하기 위해서는 센서 노드 사이의 암호화 통신과 인증 등이 필요하기 때문이다. 이를 위해서는 안전한 키 생성 및 폐기가 우선 이루어져야 한다. 지금까지 센서 네트워크를 위해 제안된 키 분배 프로토콜은 매우 다양하다. 그러나 이러한 프로토콜들이 기반하고 있는 가정들이 얼마나 안전하고 현실성 있는 지 분석되어 있지 않다. 키 분배의 대표적 프로토콜인 LEAP(Localized Encryption and Authentication Protocol)은 무선 센서 네트워크에 적합한 가정을 하였다고 알려져 있다. 본 논문에서는 이 LEAP 프로토콜을 USN 상에서 구현을 통해 이 가정의 현실성에 대해 분석해 볼 것이다. 이는 차후 다양한 키 분배 프로토콜을 연구 개발하는 데 있어서 상당한 도움이 될 거라 예상된다.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.515-524
• /
• 2005

As the number of the mobile nodes (MNs) increases in the networks, the signaling traffic generated by mobility management for MNs will increase explosively, and such a phenomenon will probably affect overall network performance. In this paper, we propose a novel analytical approach using a continuous-time Markov chain model and hierarchical network model for the analysis on the signaling load of representative IPv6 mobility support Protocols such as Mobile IPv6 (MIPv6) and Hierarchical Mobile IPv6 (HMIPv6). According to these analytical modeling, this paper derives the various signaling costs, which are generated by an MN during its average domain residence time when MIPv6 and HMIPv6 are deployed under the same network architecture, respectively. In addition, based on these derived costs, we investigate the effects of various mobility/traffic-related parameters on the signaling costs generated by an MN under MIPv6 and HMIPv6. The analytical results show that as the average moving speed of an MN gets higher and the binding lifetime is set . to the larger value, and as its average packet arrival rate gets lower, the total signaling cost generated during its average domain residence time under HMIPv6 will get relatively lower than that under MIPv6, and that under the reverse conditions, the total signaling cost under MIPv6 will get relatively lower than that under HMIPv6.