• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 추계학술대회 논문집 학회본부
• /
• pp.101-105
• /
• 1997

This paper presents the worst-case time-delay in CAN(Controller Area Network) system through the mathematical model. Time-delay in the CAN system is devided into a generation delay, a transmission delay and a delivery delay. This paper also measures the performance represented in terms of the number of station, transmission speed, data size etc. by using the computer simulation.

• 대한수학회논문집
• /
• 제34권2호
• /
• pp.685-699
• /
• 2019

This research is focused on a continuous epidemic model of transmission of Plasmodium vivax malaria with a time delay. The model is represented as a system of ordinary differential equations with delay. There are two equilibria, which are the disease-free state and the endemic equilibrium, depending on the basic reproduction number, $R_0$, which is calculated and decreases with the time delay. Moreover, the disease-free equilibrium is locally asymptotically stable if $R_0<1$. If $R_0>1$, a unique endemic steady state exists and is locally stable. Furthermore, Hopf bifurcation is applied to determine the conditions for periodic solutions.

• 인터넷정보학회논문지
• /
• 제2권2호
• /
• pp.23-36
• /
• 2001

차별화 서비스(Differentiated Services) 망에서 실시간 멀티캐스트를 지원하기 위해서 EF(Expedite Forwarding) PHB(Per Hop Behavior)를 사용하여 전송한다면 EF PHB와 멀티캐스트 플로우의 특성 때문에 EF 멀티캐스트 플로우가 증가하게 될 경우 망의 관리나 자원 관리가 어렵다. 또한 LBE(Lower Than Best-effort) PHB를 이용한 멀티캐스트 전송은 전송지연을 보장할 수 없다는 단점이 있다. 이러한 문제를 해결하기 위하여 본 논문에서는 AF(Assured Forwarding) PHB를 이용하여, 허용 가능한 홉 당 지연시간 이내에서 처리를 해줄 수 있는 저지연 멀티캐스트(Low-delay Multicast)라는 새로운 PHB를 제안하고, 이를 위한 차별화 서비스 망에서의 핵심요소인 첫 흘 라우터. 내부 라우터. 경계 라우터들의 큐 구조를 설계하고 각 라우터들에서의 큐 관리 및 스케줄링 기법을 설계한다.

• Journal of Information Processing Systems
• /
• 제7권2호
• /
• pp.241-260
• /
• 2011

In earlier days, most of the data carried on communication networks was textual data requiring limited bandwidth. With the rise of multimedia and network technologies, the bandwidth requirements of data have increased considerably. If a network link at any time is not able to meet the minimum bandwidth requirement of data, data transmission at that path becomes difficult, which leads to network congestion. This causes delay in data transmission and might also lead to packet drops in the network. The retransmission of these lost packets would aggravate the situation and jam the network. In this paper, we aim at providing a solution to the problem of network congestion in mobile ad hoc networks [1, 2] by designing a protocol that performs routing intelligently and minimizes the delay in data transmission. Our Objective is to move the traffic away from the shortest path obtained by a suitable shortest path calculation algorithm to a less congested path so as to minimize the number of packet drops during data transmission and to avoid unnecessary delay. For this we have proposed a protocol named as Congestion Aware Selection Of Path With Efficient Routing (CASPER). Here, a router runs the shortest path algorithm after pruning those links that violate a given set of constraints. The proposed protocol has been compared with two link state protocols namely, OSPF [3, 4] and OLSR [5, 6, 7, 8].The results achieved show that our protocol performs better in terms of network throughput and transmission delay in case of bulky data transmission.

• 한국정보통신학회논문지
• /
• 제12권1호
• /
• pp.205-214
• /
• 2008

수많은 센서 노드들을 이용하여 주변환경으로부터 정보를 수집하는 센서네트워크에서 많은 양의 패킷을 빠르게 전송하기 위해서는 패킷 전송간에 지연을 최소화하여 효율성을 높일 필요가 있다. 센서네트워크에서 이벤트에 기반하여 동작하는 운영 체제에서는 주로 주기적으로 발생하는 Timer Event를 이용하여 연속적으로 패킷을 전송한다. 하지만 무선 센서네트워크의 특성상 패킷을 전송하는데 소요되는 시간이 매우 가변적이기 때문에 적합한 주기를 설정하기가 매우 어렵다. Timer Event의 발생주기에 따라 패킷 전송간에 지연이 증가하거나 전송요청이 실패 할 수 있다. 본 논문에서는 패킷 전송 작업이 완료되었음을 알려 주는 SendDone Event를 이용하여 연속적인 패킷전송 시 지연을 줄여 주는 ESTEO기법을 제안한다. ESTEO에서는 패킷 전송이 완료된 시점에 즉시 다음 패킷을 전송하기 때문에 패킷을 전송하는데 소요되는 시간에 상관없이 패킷 전송간에 지연이 발생하지 않는다. 따라서 연속적으로 대량의 패킷을 전송할 때 높은 전송율을 제공할 수 있다.

• 한국멀티미디어학회논문지
• /
• 제18권4호
• /
• pp.492-498
• /
• 2015

In general, data packets from sensor nodes are transferred to the sink node in a wireless sensor networks. So many data packets are gathered around the sink node, resulting in significant packet collision and delay. In this paper, we propose an efficient packet transmission mechanism for multi-hop wireless sensor networks. The proposed mechanism is composed of two modes. One mode works between sink node and 1-hop nodes from sink. In this mode, data packets are transmitted in predefined time slots to reduce collisions. The other mode works between other nodes except sink node. In this mode, duplicated packets from neighbor nodes can be detected and dropped using some control signals. Our numerical analysis and simulation results show that our mechanism outperforms X-MAC and RI-MAC in terms of energy consumption and transmission delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권6호
• /
• pp.1357-1378
• /
• 2013

Energy constraint of wireless sensor networks makes energy saving and prolonging the network lifetime become the most important goals of routing protocols. In this paper, we propose an Energy Efficient Chain-based Routing Protocol (EECRP) for wireless sensor networks to minimize energy consumption and transmission delay. EECRP organizes sensor nodes into a set of horizontal chains and a vertical chain. Chain heads are elected based on the residual energy of nodes and distance from the header of upper level. In each horizontal chain, sensor nodes transmit their data to their own chain head based on chain routing mechanism. EECRP also adopts a chain-based data transmission mechanism for sending data packets from the chain heads to the base station. The simulation results show that EECRP outperforms LEACH, PEGASIS and ECCP in terms of network lifetime, energy consumption, number of data messages received at the base station, transmission delay and especially energy${\times}$delay metric.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• pp.203-206
• /
• 2004

Recently home network has been developed in the field of Information Technology. And there are many protocols for smart home, such as Lonworks, Echonet, KNX, LnCP etc. However, the performance evaluation has not been nearly known between the protocols. Hence, this paper evaluates the performance of KNX by Konnex Association and LnCP(Living network Control Protocol) by LG Electronics. We developed simulation model using flowchart of KNX and LnCP and simulation scenario through analysis of message to be generated in the home network. Furthermore, we evaluate simulation performance, such as mean transmission delay, maximum transmission delay, and collision rate of both protocols.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 1999년도 춘계학술대회 논문집
• /
• pp.21-25
• /
• 1999

In order to remove minority carries of the base region at changing signal in conventional bipolar logic circuit, we made transistor which is composed of NPN transistor shortened buried layer under the Base region, PNP transistor which is merged in base, epi layer and substrate. Also the Ring-Oscillator for measuring transmission time-delay per gate was designed as well. In the result, we get amplitude of logic voltage of 200mV, the minimum of transmission delay-time of 211nS, and the minimum of transmission delay-time per gate of 7.26ns in AC characteristic output of Ring-Oscillator connected Gate.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 추계학술발표대회
• /
• pp.665-667
• /
• 2011

최근에 에너지 효율적이며 신뢰성 있는 데이터 전송을 보장하기 위한 많은 라우팅 기법의 연구가 진행되고 있다. 하지만 현재까지 무선센서네트워크에서의 표준 라우팅 기법이 없는 상황에서 신뢰성을 제공하기 위한 새로운 라우팅 기법을 제안하는 것은 실용적이지 않으며 비효율적이다. 본 논문에서는 신뢰성 있는 데이터 전송을 범용적으로 보장하기 위해서 기존의 라우팅 기법의 신뢰성 및 확장성을 제공하는 모듈기법인 DRDT(Delay-based Reliable Data Transmission)를 향상시킨 ADRDT(Advenced Delay-based Reliable Data Transmission) 기법을 제안한다. ADRDT는 수신노드가 불안정한 링크상태로 인해 데이터 수신을 실패하는 경우 데이터를 오버히어링한 헬퍼노드(helper node)의 협력적인 재전송을 통해 신뢰성을 제공한다. 헬퍼노드는 수신노드의 이웃노드가 데이터를 오버히어링할 때 딜레이를 이용한 분산적 방법을 통해 동적으로 선정되며, 수신노드와의 링크상태를 고려하기 때문에 효과적으로 재전송 횟수를 감소시킨다. 제안 기법은 기존 기법과 비교해 전송 비용을 약 16.5% 감소시킨다.