• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.196-206
• /
• 2009

Over the last five years, relaying or multihop techniques have been intensively researched as means for potentially improving link performance of wireless networks. However, the data rates of relays are often limited because they cannot transmit and receive on the same frequency simultaneously. This limitation has come to the attention of researchers, and recently a number of relay techniques have been proposed specifically to improve the data efficiency of relaying protocols. This paper surveys transmission protocols that employ first single relays, then multiple relays and finally multiple antenna relays. A common feature of these techniques is that novel signal processing techniques are required in the relay network to support increased data rates. This paper presents results and discussion that highlight the advantages of these approaches.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.242-245
• /
• 2002

Authentication protocol as a part of security system has been growth rapidly since it was known that sending clear text password in the network is unsecured. Many protocols could be noted proposed to strengthen the authentication process. In 1985 an attempt to safeguard network services within Athena project resulting on the born of Kerberos 〔1〕〔8〕, one of the protocol that has a lot of attention from the research community. Several years later researchers were discovered some weaknesses carried by this protocol 〔2〕〔21〕. In 1992. EKE was introduced by Bellovin and Merrit. Since that time, many protocols introduced could be considered as its variant 〔5〕〔9〕〔13〕〔14〕. Some other protocols such as OKE〔5〕 and SRP〔18〕 although claimed different from EKE, they have the same basic mechanism in holding authentication process. Here, we explain the mechanism of those protocols, their strength and their weaknesses and shortcomings. Due to the limitations of the number of paper pages, only two types of authentication protocol can be explained here i.e EKE and SRP.

• Journal of applied mathematics & informatics
• /
• 제26권1_2호
• /
• pp.235-249
• /
• 2008

On-demand routing protocol in ad hoc network is that establishes a route to a destination node only when it is required by a source node. But, it is necessary to reestablish a new route when an active route breaks down. The reconstruction process establishes another route by flooding messages from the source to the destination, cause not only heavy traffic but also long delays in route discovery. A good method for analyzing performance of protocols is important for deriving better systems. In this paper, we suggest the numerical formulas of a representative on-demand routing protocol AODV, ARMP, and RRAODV to estimate the performance of these routing protocols for analyzing the performance of these protocols. The proposed analytical models are very simple and straightforward. The results of analysis show good agreement with the results of computer simulations.

• 디지털산업정보학회논문지
• /
• 제16권2호
• /
• pp.61-68
• /
• 2020

Nuclear power plants have a lower cost of power generation, and they are more eco-friendly than other power generation plants. Also, we need to prepare nuclear plant accidents because of their severe damage. In the event of a safety accident, such as a radiation leak, by applying a wireless sensor network to a nuclear power plant, many sensor nodes can be used to monitor radiation and transmit information to an external base station to appropriately respond to the accident. However, applying a wireless sensor network to nuclear power plants requires routing protocols that consider the sensor network size and bypass obstacles such as plant buildings. In general, the hierarchical-based routing protocols are efficient in energy consumption. In this study, we look into the problems that may occur if hierarchical-based routing protocols are applied to nuclear power plants and propose improved routing protocols to solve these problems. Simulation results show that the proposed routing protocol is more effective in energy consumption than the existing LEACH protocol.

• 제어로봇시스템학회논문지
• /
• 제6권12호
• /
• pp.1099-1105
• /
• 2000

The interactive bicycle simulator presented in this paper consists of a Stewart platform manipulator, magneto-rheological steering and braking devices, and a visual simulator. To provide a rider with reality, these devices should be controlled in real-time and motions of the devices and the visual should be also synchronized. If any of the devices and the visual gets unsynchronized due to significant blocking of control signals, the reality of the simulator is no longer secured. This paper presents communication protocols that minimize the blocked time of the control processes to guarantee the synchronization. The protocols are designed based on IPC (InterProcess Communications) of QNX, TCP/IP, and serial communication. The performance of the designed communication protocols is evaluated with the implemented bicycle simulator, and found satisfactory.

• 정보보호학회지
• /
• 제12권2호
• /
• pp.62-76
• /
• 2002

비형식적인 방법으로 부주의하게 설계 및 검증된 암호프로토콜은 시스템의 안전성에 대한 공격을 허용하는 중대한 결함이나 오류를 포함하기 쉽다. 이러한 암호프로토콜의 결함이나 오류를 모두 발견해내는 것은 결코 쉬운 작업이 아니며, 따라서 암호프로토콜의 체계적인 설계와 검증을 위한 정형화된 방법이 필요하다. 본 논문에서는 이 분야의 기술 동향에 대해서 살펴보고, 향후 연구에서 진행할 현실적인 개발 방법을 제안하도록 한다.

• Journal of information and communication convergence engineering
• /
• 제3권3호
• /
• pp.163-166
• /
• 2005

The Key exchange protocols are very crucial tools to provide the secure communication in the broadband satellite access network. They should be required to satisfy various requirements such as security, Key confirmation, and Key freshness. In this paper, Two authenticated key exchange protocols TPEKE-E(Two Pass Encrypted Key Exchange-Exchange-Efficient) and TPEKE-S(Two Pass Encrypted Key xchange-Secure) are introduced. A basic idea of the protocols is that a password can be represented by modular addition N, and the number of possible modular addition N representing the password is $2^N$. The TPEKE-E is secure against the attacks including main-in-the-middle attack and off-line dictionary attack, and the performance is excellent so as beyond to comparison with other authenticated key exchange protocols. The TPEKE-S is a slight modification of the TPEKE-E. The TPEKE-S provides computational in feasibility for learning the password without having performed off line dictionary attack while preserving the performance of the TPEKE-E.

• 한국정보통신학회논문지
• /
• 제7권2호
• /
• pp.208-213
• /
• 2003

Ad hoc 무선망은 중앙 집중화된 관리 혹은 표준화된 지원 서비스의 도움 없이 임시 네트워크를 형성시킨 wireless mobile host들의 집합이다. 이러한 환경에서는 무선 전송 전파 범위의 한계 때문에 하나의 mobile host로 패킷을 목적지에 전송하기 위해서는 다른 host들간의 협력이 필수적이며, 경로설정 프로토콜이 중요한 요소로 여겨진다. 이론적인 면에서 On-demand 경로설정방식이 Table-driven방식보다 효율적인 방식으로 제시되고 있다. 본 논문에서는 기존에 제시된 두 가지 경로설정방식 프로토콜의 대표적인 DSDV, DSR 방식을 시뮬레이션을 통해 성능을 비교 분석하여 효율적인 라우팅 프로토콜을 제시하고자 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1462-1476
• /
• 2017

The current literature on discrete-time Markov chain (DTMC) based analysis of IEEE 802.15.6 MAC protocols for wireless body area networks (WBANs), do not consider the ACK timeout state, wherein the colliding nodes check the ill fate of their transmissions, while other contending nodes perform backoff check that slot as usual. In this paper, our DTMC model accurately captures the carrier sense multiple access with collision avoidance (CSMA/CA) mechanism of IEEE 802.15.6 medium access control (MAC) and allows the contending nodes performing backoff to utilize the ACK timeout slot during collisions. The compared rigorous results are obtained by considering a non-ideal channel in non-saturation conditions, and CSMA/CA parameters pertaining to UWB PHY of IEEE 802.15.6 MAC protocols.

• ETRI Journal
• /
• 제31권4호
• /
• pp.460-462
• /
• 2009

The emerging wireless networks require the design of new authentication protocols due to their dynamic nature and vulnerable-to-attack structure. Recently, Wu and others proposed a wireless authentication protocol which is claimed to be an improvement of the authentication protocol proposed by Lee and others which provides user anonymity. In this letter, we show that these protocols have a common flaw and that these protocols fail to provide user anonymity. We also propose a modification method to solve this problem.