• 제목/요약/키워드: Application protocol

검색결과 1,507건 처리시간 0.03초

무선 센서 네트워크 기반 에너지 효율성이 개선된 MAC 프로토콜 설계 (Design by Improved Energy Efficiency MAC Protocol based on Wireless Sensor Networks)

  • 이철승
    • 한국전자통신학회논문지
    • /
    • 제12권3호
    • /
    • pp.439-444
    • /
    • 2017
  • 무선 센서 네트워크 기술은 유비쿼터스 컴퓨팅 환경의 급성장중인 기술이며 다양한 분야에서 응용과 연구가 진행 되고 있다. 무선 센서 네트워크를 구성하는 센서 노드들은 분산 네트워크 환경에서 배터리를 이용하여 Life cycle을 유지하기 때문에 QoS 요구보다는 에너지 효율이 매우 중요하다. 이러한 사항을 고려하여 IEEE802.15.4의 MAC 프로토콜에서는 트래픽에 적응적인 MAC 프로토콜 연구와 무선 센서 네트워크 환경에 신뢰성과 효율성이 강조된 표준화 작업을 진행중에 있지만, 에너지 효율이 줄어든 만큼 센서 노드의 응답속도가 떨어지는 문제점을 지니고 있다. 이에 본 논문은 동기식 방식과 하이브리드 방식의 MAC 프로토콜을 분석하여 전체네트워크의 에너지 효율이 개선된 MAC 프로토콜을 설계하였다.

An Enhanced Mutual Key Agreement Protocol for Mobile RFID-enabled Devices

  • Mtoga, Kambombo;Yoon, Eun-Jun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제1권1호
    • /
    • pp.65-71
    • /
    • 2012
  • Mobile RFID is a new application that uses a mobile phone as an RFID reader with wireless technology and provides a new valuable service to users by integrating RFID and ubiquitous sensor network infrastructures with mobile communication and wireless Internet. Whereas the mobile RFID system has many advantages, privacy violation problems on the reader side are very concerning to individuals and researchers. Unlike in regular RFID environments, where the communication channel between the server and reader is assumed to be secure, the communication channel between the backend server and the RFID reader in the mobile RFID system is not assumed to be safe. Therefore it has become necessary to devise a new communication protocol that secures the privacy of mobile RFID-enabled devices. Recently, Lo et al. proposed a mutual key agreement protocol that secures the authenticity and privacy of engaged mobile RFID readers by constructing a secure session key between the reader and server. However, this paper shows that this protocol does not meet all of the necessary security requirements. Therefore we developed an enhanced mutual key agreement protocol for mobile RFID-enabled devices that alleviates these concerns. We further show that our protocol can enhance data security and provide privacy protection for the reader in an unsecured mobile RFID environment, even in the presence of an active adversary.

  • PDF

효율적인 USN 관리를 위한 CoAP 프로토콜 분석 및 적용방안 (CoAP Protocol Applying Method for Efficiency USN Management)

  • 민경주;유상근;김용운;김형준;정회경
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2010년도 추계학술대회
    • /
    • pp.507-509
    • /
    • 2010
  • 제한된 자원을 갖는 센서 노드들을 이용하여 온도, 습도 등의 센싱 된 정보를 효율적으로 관리하기 위하여 IETF 워킹그룹에서 CoAP 프로토콜을 제안하고, 인터넷 드래프트 상태에 있다. 센서 노드나 네트워크 장비들에 응용 프로토콜이 탑재되면, 프로토콜의 규격에 맞추어 효율적으로 센서 정보의 수집 및 활용이 가능하다. 하지만, 제한된 자원의 한계로 인해, 이를 센서 노드들에 적용하기 위해서는 CoAP-Lite 형태로 탑재되어야 하는데, 이러한 모델에서의 문제점을 분석하고, 이를 적용하기 위한 방법을 제안한다.

  • PDF

REVIEW ON ENERGY EFFICIENT OPPORTUNISTIC ROUTING PROTOCOL FOR UNDERWATER WIRELESS SENSOR NETWORKS

  • Ismail, Nasarudin;Mohamad, Mohd Murtadha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권7호
    • /
    • pp.3064-3094
    • /
    • 2018
  • Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design.

전력제어 시스템을 위한 SNA 프로토콜 제안 및 설계 (Proposal and Design of a Novel SNA Protocol for the Power Control System)

  • 박민지;이동민;민상원
    • 한국통신학회논문지
    • /
    • 제35권8B호
    • /
    • pp.1122-1128
    • /
    • 2010
  • 본 논문에서는 전력제어 시스템에서 서버 및 클라이언트 방식으로 적용 가능한 SNA 프로토콜을 제안 및 설계했다. SNA 프로토콜은 전력제어를 필요로 하는 기기에서의 모드 전환, context 정보의 저장 위치, 사용자 트리거 등의 정보를 포함할 수 있다. 이러한 SNA 프로토콜을 홈 네트워크에 적용하였으며 설계한 SNA 프로토콜의 검증과 전력제어 시스템에서 요구되는 기능들의 수행 여부 확인을 위해 홈 게이트웨이와 홈 네트워크 기기에 각각 탑재된 SNA server 및 client 간에 송수신 되는 메시지 플로우와 state transition diagram을 이용하였다.

Two-Pathway Model for Enhancement of Protocol Reverse Engineering

  • Goo, Young-Hoon;Shim, Kyu-Seok;Baek, Ui-Jun;Kim, Myung-Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권11호
    • /
    • pp.4310-4330
    • /
    • 2020
  • With the continuous emergence of new applications and cyberattacks and their frequent updates, the need for automatic protocol reverse engineering is gaining recognition. Although several methods for automatic protocol reverse engineering have been proposed, each method still faces major limitations in extracting clear specifications and in its universal application. In order to overcome such limitations, we propose an automatic protocol reverse engineering method using a two-pathway model based on a contiguous sequential pattern (CSP) algorithm. By using this model, the method can infer both command-oriented protocols and non-command-oriented protocols clearly and in detail. The proposed method infers all the key elements of the protocol, which are syntax, semantics, and finite state machine (FSM), and extracts clear syntax by defining fine-grained field types and three types of format: field format, message format, and flow format. We evaluated the efficacy of the proposed method over two non-command-oriented protocols and three command-oriented protocols: the former are HTTP and DNS, and the latter are FTP, SMTP, and POP3. The experimental results show that this method can reverse engineer with high coverage and correctness rates, more than 98.5% and 99.1% respectively, and be general for both command-oriented and non-command-oriented protocols.

A new experimental protocol to quantitatively assess the motor control capability of low-back pain patinents during dynamic trunk movement

  • Kim, J.Y.
    • 대한인간공학회:학술대회논문집
    • /
    • 대한인간공학회 1995년도 추계학술대회논문집
    • /
    • pp.156-163
    • /
    • 1995
  • An experimental protocol was developed and tested in this study in order to quantify the motor control capability of the trunk movement for both healthy subjects and low-back pain (LBP) patients. Information processing capacity (bits/second) (Fitts, 1954) and dynamic motor perfor- mance such as flexion/extension velocity and acceleration were measured as motor control parameters under the controlled range of motion (ROM). In this study, the original experimental propocol (Kim et al., 1993, 1994) was re-designed to reduce the length of the test via a series of statistical analyses for clinical application. The accuracy of the shortened protocol was statistically examined and indicated no difference conpared to the original protocol in terms of evaluating information processing capacity. This protocol was also tested among ten healthy subjects and ten LBP patients for validation purpose. The results showed that the information processing capacity was not significantly diffenent between two groups due to the large variation although there was an apparent mean difference. Average movement time showed a significant increase in LBP patients com- pared to healthy subjects. In conclusion, it was found that the new short experimental protocol could quantify the motor control capability of neuromuscular system of the trunk and also showed the applicability to patient population.

  • PDF

연속시간 다개체 시스템에 대한 LQ-역최적 상태일치 프로토콜 및 군집제어 응용 (LQ Inverse Optimal Consensus Protocol for Continuous-Time Multi-Agent Systems and Its Application to Formation Control)

  • 이재영;최윤호
    • 제어로봇시스템학회논문지
    • /
    • 제20권5호
    • /
    • pp.526-532
    • /
    • 2014
  • In this paper, we present and analyze a LQ (Linear Quadratic) inverse optimal state-consensus protocol for continuous-time multi-agent systems with undirected graph topology. By Lyapunov analysis of the state-consensus error dynamics, we show the sufficient conditions on the algebraic connectivity of the graph to guarantee LQ inverse optimality and closed-loop stability. A more relaxed stability condition is also provided in terms of the algebraic connectivity. Finally, a formation control protocol for multiple mobile robots is proposed based on the target LQ inverse optimal consensus protocol, and the simulation results are provided to verify the performance of the proposed LQ inverse formation control method.

ZERO-KNOWLEDGE GROUP IDENTIFICATION AND HIDDEN GROUP SIGNATURE FOR SMART CARDS USING BILINEAR PAIRINGS

  • Lee, Young Whan;Choi, Byung Mun
    • 충청수학회지
    • /
    • 제20권4호
    • /
    • pp.355-366
    • /
    • 2007
  • In this paper, we propose a new blind group identification protocol and a hidden group signature protocol as its application. These protocols involve many provers and one verifier such that (1) the statement of all the provers are proved simultaneously, (2) and also all the provers using computationally limited devices (e.g. smart cards) have no need of computing the bilinear pairings, (3) but only the verifier uses the bilinear pairings. A. Saxena et al. proposed a two-round blind (group) identification protocol in 2005 using the bilinear pairings. But it reveals weakness in the active-intruder attack, and all the provers as well as the verifier must have devices computing bilinear pairings. Comparing their results, our protocol is secure from the active-intruder attack and has more fit for smart cards. In particular, it is secure under only the assumption of the hardness of the Discrete-Logarithm Problem in bilinear groups.

  • PDF