• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2006년도 하계종합학술발표회 논문 초록집
• /
• pp.743-743
• /
• 2006

• International journal of advanced smart convergence
• /
• 제5권1호
• /
• pp.59-65
• /
• 2016

In this paper, we're compared network protocol which is network lifetime longer when using LEACH Protocol, SEP, and TEEN in a heterogeneous Wireless Sensor Network with a Large Sensor Area. Also, we propose a method of divided layer the wide-area sensor filed and transmitting a multi-hop to improve the network lifetime. And we're compared network protocol which is network lifetime more improved apply the proposed method to LEACH Protocol, SEP, and TEEN. We tried to compare results, TEEN showed the best network lifetime. Apply the proposed method to divided the sensor field, L-TEEN (Layered TEEN)'s network lifetime rates of improvement is highest.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.549-549
• /
• 2000

In the previous work, we dealt with a traffic analysis of network-based control system and its architecture using the CAN protocol. It is difficult to determine an optimal network architecture for a specific system. In this paper, we propose the architecture of network-based control system applicable to a specific AGV system with manipulator arms. We define the fixed number of periodic messages to be occurred in this system. In the proposed system architecture, we analyse its traffic for the real-time communication of all messages, determine the optimal sampling period of an analog sensor to be satisfied with the required specification and the number of possible sensors to be added through simulation.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 추계학술대회 논문집
• /
• pp.511-514
• /
• 2002

In may automated systems such as manufacturing systems and process plants, an industrial network or fieldbus is a very important component for the exchange of various and sometimes crucial information. Some of the information has a tendency to rapidly lose its value as time elapses after its creation. Such information or data is called real-time data that includes sensor values and control commands. In order to deliver these data in time, the fieldbus network should be tailored to have short delay with respect to the individual time limit of various data. Fine-tuning the network for a given traffic requires the knowledge on the relationship between the protocol parameters such as timer values and the performance measure such as network delay. This paper presents a mathematical performance model to calculate communication delays of the Profibus FMS network when the timer value TTR and the traffic characteristics are given. The results of this model is compared to those from experiments to assess the model's validity.

• 스마트미디어저널
• /
• 제8권2호
• /
• pp.21-28
• /
• 2019

최근의 에너지 하베스팅 무선 센서 네트워크에 대한 연구는 제한된 에너지 자원 문제를 해결하여 네트워크 수명을 효율적으로 연장시킬 수 있는 기술 개발에 집중되고 있다. 에너지 하베스팅 기술은 무선신호에 포함된 에너지를 이용하여 배터리를 충전시킴으로써 네트워크 수명을 지속적으로 연장시킬 수 있는 장점을 지니고 있으나 에너지를 수확하는 시간 동안에는 데이터를 전송할 수 없기 때문에 에너지 수확양이 증가할수록 데이터 전송지연도 증가하는 문제점을 지니고 있다. 이에 따라 에너지 하베스팅 무선 센서 네트워크를 설계할 때에는 네트워크 수명 연장뿐만 아니라 전송지연 축소 문제를 모두 고려하여야 한다. 본 논문에서는 네트워크에 유입되는 트래픽 양과 수확되는 에너지양에 따라 데이터 전송에 필요한 에너지를 계산하고 패킷데이터의 전송 시간을 조절함으로써 종단간 네트워크 지연을 최소화하는 MAC 프로토콜을 제안한다. 이를 위해 에너지 수확 시간을 측정하여 네트워크의 수면 시간을 조절하는 에너지 관리 메커니즘을 설계한다. 또한, 시뮬레이션을 이용한 성능평가를 통하여 기존의 MAC 프로토콜보다 에너지 소비량과 종단간 지연 측면에서 성능이 향상됨을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1817-1827
• /
• 2014

As a new type of wireless network, Ad hoc network does not depend on any pre-founded infrastructure, and it has no centralized control unit. The computation and transmission capability of each node are limited. In this paper, a self-updating one-time password mutual authentication protocol for Ad hoc network is proposed. The most significant feature is that a hash chain can update by itself smoothly and securely through capturing the secure bit of the tip. The updating process does not need any additional protocol or re-initialization process and can be continued indefinitely to give rise to an infinite length hash chain, that is, the times of authentication is unlimited without reconstructing a new hash chain. Besides, two random variable are added into the messages interacted during the mutual authentication, enabling the protocol to resist man-in-the-middle attack. Also, the user's identity information is introduced into the seed of hash chain, so the scheme achieves anonymity and traceability at the same time.

• 전자공학회논문지A
• /
• 제29A권7호
• /
• pp.10-18
• /
• 1992

In this paper, a simulation model for scope and filter parameters in CMIS/CMIP, OSI management protocol, has been discussed and the suitable scope type was represented by analyzing optimal polling time in network management system, queue size and response time. Scope and filter parameters in MGet, M-Set, M-Action, and =M-Delete services provide a scheme to select some managed objects, and the results are largely varied according to a scope type requested and the outcome of filtering. It has been simulated each scope type and all scope type mixed in a network by varying the offered load and a polling time. On the same time, the response time, queue size of the managing system and a delay time have been measured. As a results, the suitable scope type and polling time enhancing the network performance on the OSI network management is proposed.

• 한국통신학회논문지
• /
• 제25권8A호
• /
• pp.1238-1246
• /
• 2000

파장 분할 다중화(WDM) 기반의 다중 채널 망에서는 송신 노드의 수신 노드가 메시지 전송 기간동안 동일한 파장으로 동조될 수 있도록 하는 효율적인 프로토콜을 제안한다 이 프로토콜에서는 일단 송신 노드가 하나의 데이터 채널을 점유하면 메시지 전송이 완료되기 전까지는 점유한 데이터 채널을 독점적으로 사용할 수 있으며 따라서 송수신 장치의 변조로 인한 오버헤드를 줄일수 있다 또한 제안된 프로토콜은 전체 정보를 필요로 하지 않기 때문에 망에 접속되어 있는 노드의 수의 변화에 무관하게 동작할 수 있으며 어떠한 새로운 노드도 망이 초기화 요구없이 언제든지 망에 접속할 수 있다 이 프로토콜을 이용하면 데이터 채널과 목적지 충돌 현상도 방지할 수 있다 제안된 프로토콜은 유한 노드 수의 모델에서 분석되었으며 처리율-지연 특성이 성능 측정을 위한 파라메타로서 조사되었다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권4호
• /
• pp.38-43
• /
• 2017

Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1223-1236
• /
• 2014

With the extension of wireless technology, vehicular ad hoc networks provide important services for the dissemination of general data and emergency warnings. However, since, the vehicle topology frequently changes from a dense to a sparse network depending on the speed of the moving vehicles and the time of day, vehicular ad hoc networks require a protocol that can facilitate the efficient and reliable dissemination of emergency messages in a highly mobile environment under dense or intermittent vehicular connectivity. Therefore, this paper proposes a new vehicular broadcast protocol, called BL-CAST, that can operate effectively in both dense and sparse network scenarios. As a low overhead multi-hop broadcast protocol, BL-CAST does not rely on the periodic exchange of beacons for updating location information. Instead, the location information of a vehicle is included in a broadcast message to identify the last rebroadcasting vehicle in an intermittently connected network. Simulation results show that BL-CAST outperforms the DV-CAST protocol in terms of the end-to-end delay, message delivery ratio and network overhead.