• Electronics and Telecommunications Trends
• /
• v.32 no.4
• /
• pp.67-77
• /
• 2017

최근 이슈가 되고 있는 자율주행차(Autonomous vehicle 또는 Self-driving car)를 실현하기 위해서는, 다양한 환경에서도 차량에 대한 끊김 없는 연결을 제공하는 커넥티드카(Connected car) 기술이 필수적이다. 현재 커넥티드카를 구현하기 위한 차량 네트워크(Vehicular network) 기술은 교통시스템 인프라 기반의 단일홉(Single-hop) 무선통신 기술이 주를 이루고 있다. 이러한 단일홉 통신은 커버리지가 교통시스템 인프라가 구축된 지역으로 제한된다. 따라서 차량 네트워크가 현재보다 더욱 넓은 지역을 커버하기 위해서는 차량 자체가 이동형 라우터 역할을 수행하여 차량 간의 전달을 통해 정보를 원거리로 전달할 수 있는 다중홉(Multi-hop) 통신 도입이 필요하다. 다중홉 차량 네트워크는 차량의 높은 동적 특성으로 인해 다수의 도전적인 기술적 이슈들을 가진다. 본고에서는 이러한 기술 이슈 중 차량 네트워크의 높은 이동성으로 발생할 수 있는 종단 노드 간 비연결성을 해결할 수 있는 기술인 지연감내형 차량 네트워킹(Delay-tolerant vehicular networking) 기술에 대한 주요 연구 동향을 살펴보고자 한다. 이를 위해 먼저 지연감내형 차량 네트워킹의 기술적 배경 및 주요 관련 기술들을 분석하고 이를 기반으로 향후 연구개발이 필요한 기술 이슈들을 정리한다.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.618-629
• /
• 2017

Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the "multi-hop forwarding" are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.111-112
• /
• 2015

본 논문에서는 Delay Tolerant Networks(DTNs)에서 Markov chain으로 노드의 속성 정보 변화율을 분석하여 노드의 이동 경로를 예측하는 알고리즘을 제안한다. 기존 DTN에서 예측기반 라우팅 기법은 노드가 미리 정해진 스케줄에 따라 이동한다. 이러한 네트워크에서는 스케줄을 예측할 수 없는 환경에서 노드의 신뢰성이 낮아진다. 본 논문에서는 일정 구간의 노드의 속성 정보의 시간에 따른 변화율을 Markov chain을 이용하여 노드의 이동 경로를 예측하는 알고리즘을 제안한다. 제안하는 알고리즘은 노드의 속성 정보 중 노드의 속도와 방향성을 근사한 후, 변화율을 분석하고 이로부터 Markov chain을 이용하여 확률전이 매트릭스를 생성하여 노드의 이동 경로를 예측하는 알고리즘이다. 주어진 모의실험 환경에서 노드의 이동 경로 예측을 통해 중계 노드를 선정하여 라우팅 함으로써 네트워크 오버헤드와 전송 지연 시간이 감소함을 보여주고 있다.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.133-144
• /
• 2015

In this paper, we introduce a system and a set of algorithms for disseminating popular content to a large group of wireless clients spread over a wide area. This area is partitioned into multiple cells and there is a base station in each cell which is able to broadcast to the clients within its radio coverage. Dissemination of information in the proposed system is hybrid in nature: Each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Then the clients cooperate by exchanging packets to obtain their desired messages while they are moving arbitrarily over the area. In this paper, fundamental trade-offs between the average information delivery completion time at the clients and different parameters of the system such as bandwidth usage by the base stations, average energy consumption by the clients and the popularity of the spread information are studied. Moreover different heuristic algorithms are proposed to control and maintain a balance over these trade-offs. Also, the more complicated case of multiple sessions where each client is interested in an arbitrary subset of sessions is considered and two variants of the basic dissemination algorithm are proposed. The performance of all the proposed algorithms is evaluated via extensive numerical experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.371-388
• /
• 2014

Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.38-43
• /
• 2008

In this paper, adaptive channel borrowing approach fuzzy neural networks for load balancing (ACB-FNN) is presented to maximized the number of served calls and the depending on asymmetries traffic load problem. In a wireless network, the call's arrival rate, the call duration and the communication overhead between the base station and the mobile switch center are vague and uncertain. A new load balancing algorithm with cell involved negotiation is also presented in this paper. The ACB-FNN exhibits better learning abilities, optimization abilities, robustness, and fault-tolerant capability thus yielding better performance compared with other algorithms. It aims to efficiently satisfy their diverse quality-of-service (QoS) requirements. The results show that our algorithm has lower blocking rate, lower dropping rate, less update overhead, and shorter channel acquisition delay than previous methods.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.1
• /
• pp.33-39
• /
• 2007

LonWorks over IP (LonWorks/IP) virtual device network (VDN) is an integrated form of LonWorks device network and IP data network. LonWorks/IP VDN can offer ubiquitous access to the information on the factory floor and make it possible for the predictive and preventive maintenance on the factory floor. Timely response is inevitable for predictive and preventive maintenance on the factory floor under the real-time distributed control. The network induced uncertain time delay deteriorates the performance and stability of the real-time distributed control system on LonWorks/IP virtual device network. Therefore, in order to guarantee the stability and to improve the performance of the networked distributed control system the time-varying uncertain time delay needs to be compensated for. In this paper, under the real-time distributed control on LonWorks/IP VDN with uncertain time delay, a control scheme based on disturbance observer and ZPETC(Zero Phase Error Tracking Controller) phase lag compensator is proposed and tested through computer simulation. The result of the proposed control is compared with that of internal model controller (IMC) based on Smith predictor and disturbance observer. It is shown that the proposed control scheme is disturbance and noise tolerant and can significantly improve the stability and the tracking performance of the periodic reference. Therefore, the proposed control scheme is well suited for the distributed servo control for predictive maintenance on LonWorks/IP-based virtual device network with time-varying delay.

• Journal of information and communication convergence engineering
• /
• v.16 no.1
• /
• pp.31-37
• /
• 2018

In this work, we propose an analytic framework for evaluating the quality of service and dimensioning the link capacity in the gateway router of a smart farm with a greenhouse eco-management system. Specifically, we focus on the gateway router of an IoT network that provides an access service for smart farms. We design the link capacity of a gateway router that is used for the remote management of the greenhouse eco-management system to accommodate both time-critical and delay-tolerant traffic in a greenhouse LAN. For this purpose, we first investigate the ecosystem for smart farm, and we define the specification and requirements of the greenhouse eco-management system. Second, we propose a system model for the link capacity of a gateway that is required to guarantee the delay performance of time-critical applications in the greenhouse LAN. Finally, the validity of the proposed system is demonstrated through a series of numerical experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1890-1910
• /
• 2013

Routing overlay offers an ideal methodology to improve the end-to-end communication performance by deriving a backup path for any node pair. This paper focuses on a challenging issue of selecting a proper backup path to bypass the failures on the default path with high probability for any node pair. For existing backup path selection approaches, our trace-driven evaluation results demonstrate that the backup and default paths for any node pair overlap with high probability and hence usually fail simultaneously. Consequently, such approaches fail to derive a robust backup path that can take over in the presence of failure on the default path. In this paper, we propose a three-phase RBPS approach to identify a proper and robust backup path. It utilizes the traceroute probing approach to obtain the fine-grained topology information, and systematically employs the grid quorum system and the Bloom filter to reduce the resulting communication overhead. Two criteria, delay and fault-tolerant ability on average, of the backup path are proposed to evaluate the performance of our RBPS approach. Extensive trace-driven evaluations show that the fault-tolerant ability of the backup path can be improved by about 60%, while the delay gain ratio concentrated at 14% after replacing existing approaches with ours. Consequently, our approach can derive a more robust and available backup path for any node pair than existing approaches. This is more important than finding a backup path with the lowest delay compared to the default path for any node pair.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.861-868
• /
• 2023

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x_(a,b)→ax²+bx² = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X_(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.