• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 춘계학술대회
• /
• pp.94-96
• /
• 2021

기존 네트워크 아키텍처의 한계를 극복하기 위해 등장한 소프트웨어 정의 네트워킹(SDN)은 중앙 컨트롤러를 통해 라우팅 관리를 보다 간단하고 효율적으로 만든다. SR(Segment Routing)은 소스 라우팅을 수행하는 유연하고 확장가능한 방법으로 패킷 헤더에 정렬 된 세그먼트 목록을 통해 네트워크의 정보 경로를 정의한다. SDN을 사용하는 환경에서 각 라우터의 성능은 거의 동일하지만 라우팅 알고리즘에 따라 자주 활용되는 경로에 패킷이 집중되는 경향이 있다. 해당 경로에 있는 라우터는 고장의 빈도가 비교적 높고 병목현상이 발생할 가능성이 높다. 본 논문에서는 SR이 있는 SDN에서 네트워크 내 자원인 라우터가 패킷을 균등하게 처리하여 관리자 입장에서 유휴 라우터가 없이 네트워크 내의 자원을 활용함과 동시에 라우터의 관리를 수월하게 하는 라우팅 알고리즘을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권2호
• /
• pp.649-663
• /
• 2012

We propose a percolation based M2M networking architecture and its data transmission method. The proposed network architecture can be server-free and router-free, which allows us to operate routing efficiently with percolations based on six degrees of separation theory in small world network modeling. The data transmission can be divided into two phases: routing and data transmission phases. In the routing phase, probe packets will be transmitted and forwarded in the network thus multiple paths are selected and performed based on the constriction of the maximum hop number. In the second phase, the information will be encoded, say, with the fountain codes, and transmitted using the paths generated in the first phase. In such a way, an efficient routing and data transmission mechanism can be built, which allow us to construct a low-cost, flexible and ubiquitous network. Such a networking architecture and data transmission can be used in many M2M communications, such as the stub network of internet of things, and deep space networking, and so on.

• International journal of advanced smart convergence
• /
• 제8권4호
• /
• pp.169-178
• /
• 2019

Due to the characteristics of an ad hoc network without a control center, self-organization, and flexible topology, the trust evaluation of the nodes in the network is extremely difficult. Based on the analysis of ad hoc networks and the blockchain technology, a blockchain-based node-level trust evaluation model is proposed. The concepts of the node trust degree of the HASH list on the blockchain and the perfect reward and punishment mechanism are adopted to construct the node trust evaluation model of the ad hoc network. According to the needs of different applications the network security level can be dynamically adjusted through changes in the trust threshold. The simulation experiments demonstrate that ad-hoc on-demand distance vector(AODV) Routing protocol based on this model of multicast-AODV(MAODV) routing protocol shows a significant improvement in security compared with the traditional AODV and on-demand multipath distance vector(AOMDV) routing protocols.

• International Journal of Internet, Broadcasting and Communication
• /
• 제12권3호
• /
• pp.46-55
• /
• 2020

Ad Hoc network is a special wireless network, mainly because the nodes are no control center, the topology is flexible, and the networking could be established quickly, which results the transmission stability is lower than other types of networks. In order to guarantee the transmission of data packets in the network effectively, an improved Queue Ad Hoc On-demand Distance Vector Routing protocol (Q-AODV) for node detection by using blockchain technology is proposed. In the route search process. Firstly, according to the node's daily communication record the cluster is formed by the source node using the smart contract and gradually extends to the path detection. Then the best optional path nodes are chained in the form of Merkle tree. Finally, the best path is chosen on the blockchain. Simulation experiments show that the stability of Q-AODV protocol is higher than the AODV protocol or the Dynamic Source Routing (DSR) protocol.

• 산업경영시스템학회지
• /
• 제22권53호
• /
• pp.37-44
• /
• 1999

The problem to be studied here is the minimization of the total travel distance and the number of vehicles used for delivering goods to customers. Vehicle routes must also satisfy a variety of constraints such as fixed vehicle capacity, allowed operating time. Genetic algorithm to solve the VRPTW with heterogeneous fleet is presented. The chromosome of the proposed GA in this study has the 3-dimension. We propose GA that has the cubic-chromosome for VRPTW with heterogeneous fleet. The newly suggested ‘Cubic-GA (or 3-D GA)’ in this paper means the 2-D GA with GLS(Genetic Local Search) algorithms and is quite flexible. To evaluate the performance of the algorithm, we apply it to the Solomon's VRPTW instances. It produces a set of good routes and the reasonable number of vehicles.

• International Journal of Computer Science & Network Security
• /
• 제21권3호
• /
• pp.1-10
• /
• 2021

In recent decades, the heterogeneous and dynamic behavior of Internet traffic has placed new demands on the adaptive resource allocation of the optical network infrastructure. However, the advent of multifiber elastic optical networks has led to a higher degree of spectrum fragmentation than conventional flexible grid networks due to the dynamic and random establishment and removal of optical connections. In this paper, we propose heuristic routing and dynamic slot allocation algorithms to minimize spectrum fragmentation and reduce the probability of blocking future connection requests by considering the power consumption in elastic multifiber elastic optical networks.

• International Journal of Computer Science & Network Security
• /
• 제24권5호
• /
• pp.181-190
• /
• 2024

FANET (Flying ad-hoc network) is a self-adjusting wireless network that enables easy to deploy flying nodes, inexpensive, flexible such as UAV in the absence of fixed network infrastructure they communicate amoung themselves. Past few decades FANET is only the emerging networks with it's huge range of next-generation applications.FANET is a sub-set of MANET's(Mobile Ad-hoc Network) and UAV networks are known as FANET.Routing enables the flying nodes to establish routes to radio access infrastructure specifically FANET and among themselves coordinate and collaborate.This paper presents a review on existing proposed communication architecture and routing protocols for FANETS.In addition open issues and challenges are summarized in tabular form with proposed solution.Our goal is to provide a general idea to the researchers about different topics to be addressed in future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권8호
• /
• pp.2188-2208
• /
• 2023

Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.

• 한국게임학회 논문지
• /
• 제4권4호
• /
• pp.3-9
• /
• 2004

인터넷의 확장과 고속망에도 불구하고 MMORPG와 같이 대용량 멀티미디어 서비스의 요구수준은 통신 기반구조 이상을 요구하기도 한다. 본 논문에서는 MMORPG 트래픽에 대응하여 멀티캐스트 프로토콜인 CBT를 분석하고, 코어라우터의 병목현상 발생시 Anycast로의 전환을 제안하였다. 시뮬레이션 모델에서는 멀티캐스트 그룹 수와 멤버 수를 설정하고 Anycast 라우팅의 종단간 게임팻킷 지연시간을 측정하였으며 CBT 및 PIM-DM 비교하였다. 결과적으로, 128바이트, 512바이트, 1K 바이트의 게임 패킷에 대하여 Anycast 라우팅은 각각 PIM-DM 대비 8.7%, 25.5%, 34.0%와 CBT 대비 38.6%, 51.8%, 56.6%의 평균지연시간 개선을 보였다. CBT/Anycast 전략은 MMORPG트래픽의 지연특성 개선으로 안정적인 서비스가 가능하다.

• 한국인터넷방송통신학회논문지
• /
• 제19권2호
• /
• pp.91-96
• /
• 2019

일반적인 무선 센서 네트워크는 연결이 안정적이지 않고 외부 간섭에 민감하며 토폴로지가 유동적이므로 상황에 맞는 효율적인 전송 경로 설정이 중요하다. IETF (Internet Engineering Task Force)의 RPL(IPv6 Routing Protocol for Low-power Lossy Networks) 표준 라우팅 프로토콜은 다양한 환경 변화에 유연하게 대응하기 어려우며 네트워크 토폴로지의 불균형으로 인한 패킷 손실 문제가 상존한다. 다중경로로 여러 부모 노드를 통해 패킷을 전송할 경우 이러한 문제를 부분적으로 해결할 수 있지만 경우에 따라 필요 이상의 timeslot 할당으로 지연시간 증가를 초래할 수 있다. 본 논문에서는 상황에 따라 적절하게 다중경로를 사용하는 적응형 다중경로 RPL 알고리즘을 제안하고, 시뮬레이션을 통해 이의 효율성이 기존 RPL이나 다중경로 RPL에 비해 높음을 보였다.