• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.4
• /
• pp.155-162
• /
• 2013

Routing protocol in ad hoc mobile networking has been an active research area in recent years. However, the environments of ad hoc network tend to have vulnerable points from attacks, because ad hoc mobile network is a kind of wireless network without centralized authentication or fixed network infrastructure such as base stations. Also, existing routing protocols that are effective in a wired network become inapplicable in ad hoc mobile networks. To address these issues, several secure routing protocols have been proposed: SAODV and SRPTES. Even though our protocols are intensified security of networks than existing protocols, they can not deal fluidly with frequent changing of wireless environment. Moreover, demerits in energy efficiency are detected because they concentrated only safety routing. In this paper, we propose an energy efficient secure routing protocol for various ad hoc mobile environment. First of all, we provide that the nodes distribute security information to reliable nodes for secure routing. The nodes constitute tree-structured with around nodes for token escrow, this action will protect invasion of malicious node through hiding security information. Next, we propose multi-path routing based security level for protection from dropping attack of malicious node, then networks will prevent data from unexpected packet loss. As a result, this algorithm enhances packet delivery ratio in network environment which has some malicious nodes, and a life time of entire network is extended through consuming energy evenly.

• International journal of advanced smart convergence
• /
• v.13 no.2
• /
• pp.16-24
• /
• 2024

With an increase in the relevance of next-generation integrated networking environments, the need to effectively utilize advanced networking techniques also increases. Specifically, integrating Software-Defined Networking (SDN) with Multi-access Edge Computing (MEC) is critical for enhancing network flexibility and addressing challenges such as security vulnerabilities and complex network management. SDN enhances operational flexibility by separating the control and data planes, introducing management complexities. This paper proposes a reinforcement learning-based network path optimization strategy within SDN environments to maximize performance, minimize latency, and optimize resource usage in MEC settings. The proposed Enhanced Proximal Policy Optimization (PPO)-based scheme effectively selects optimal routing paths in dynamic conditions, reducing average delay times to about 60 ms and lowering energy consumption. As the proposed method outperforms conventional schemes, it poses significant practical applications.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.6
• /
• pp.770-778
• /
• 2012

In this paper, we propose a multi-path construction scheme to improve the survivability of a multicast session in military hybrid networks. A military hybrid network consists of a static backbone network and multiple mobile stub networks where some nodes are frequently susceptible to be disconnected due to link failure and node mobility. To improve the survivability of multicast sessions, we propose a construction scheme of ${\kappa}$ redundant multi-paths to each receiver. In order to take account of different characteristics of static and mobile networks, we propose quite different multi-path setup approaches for the backbone and stub networks, respectively, and combine them at the boundary point called gateway. We prove that our proposed scheme ensures that each receiver of a multicast session has ${\kappa}$ redundant paths to the common source. Through simulations, we evaluate the performance of the proposed schemes from three aspects : network survivability, recovery cost, and end-to-end delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.224-236
• /
• 2003

MANET(Mobile Ad hoc networks) is a mobile, multi-hop, and wireless network which is bandwidth constrained, energy constrained, resource constrained, autonomous, and self operating systems with dynamic topology. These constraints make the routing between communicating nodes in ad hoc networks difficult. In this paper we survey several routing protocol for mobile ad hoc networks. Especially, we focus on Zone Routing Protocol, hybrid routing framework suitable for a wide of mobile ad hoc networks and analyze performance of ZRP. In the case of ZRP protocol, it is essential that the use of optimal zone radius for efficient use. Otherwise it was proved through an simulation that performance of whole network is rapidly decrease with greatly increasing overhead of ZRP traffic that need for transmission of packet by IARP or IERP traffic. Also we suggest the process of finding QoS path that use in-band signal for QoS routing in ad hoc network. This method guarantees route that make real time multimedia service for QoS enabled path.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.75-79
• /
• 2010

Wireless sensor networks (WSN) are widely used in many applications. WSN acquires the data of surrounding environments with sensors attached to each node. It is important to design sensor networks that can communicate energy-efficiently as well as to get sensor readings with high accuracy. In this paper, we propose a novel routing scheme that assures high accuracy and significantly reduces data transmission costs in WSN with faults. First, we organize a number of network topologies randomly for routing sensor readings to the base station. Because every sensor node is connected each other with a single path, redundant transmissions are not incurred. It can reduce unnecessary transmissions and guarantee final sensor readings with high accuracy. To show the superiority of our scheme, we compare it with an existing multi-path routing scheme. In the result, our scheme has similar accuracy as the existing scheme and reduces unnecessary data transmissions by about 70% over the existing technique.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.36-36
• /
• 2004

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2346-2361
• /
• 2017

A major challenge in cloud infrastructure is the efficient allocation of virtual network elements on top of substrate network elements. Path algebra is a mathematical framework which allows the validation and convergence analysis of the mono-constraint or multi-constraint routing problems independently of the network topology or size. The present study proposes a new heuristic approach based on mathematical framework "paths algebra" to map virtual nodes and links to substrate nodes and paths in cloud. In this approach, we define a measure criterion to rank the substrate nodes, and map the virtual nodes to substrate nodes according to their ranks by using a greedy algorithm. In addition, considering multi-constraint routing in virtual link mapping stage, the used paths algebra framework allows a more flexible and extendable embedding. Obtained results of simulations show appropriate improvement in acceptance ratio of virtual networks and cost incurred by the infrastructure networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.24-34
• /
• 1994

In most computer networks, each node needs to have correct routing information for finding shortest paths to forward data packets. In a distributed environment, however, it is very difficult to keep consistent routing information throughout the whole network at all times. The presence of out-dated routing information can cause loop-forming which in turn causes the significant degradation of network performance. In this paper, a new class of routing algorithm for loop detection and resolution is discussed. The proposed algorithm is based on the distributed Bellman-Ford algorithm which is popularly adopted for routing in computer network. The proposed algorithm detects and resolves all kinds( two-node and multi-node) of loop in a distributed environment within finite time while maintaining the simplicity of the distributed Bellman-Ford algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1708-1734
• /
• 2022

In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.196-206
• /
• 2004

In the Next Generation Internet(NGI) backbone network, a Dense Wavelength Division Multiplexing (DWDM) technology has been more and more highlighted to cover the increasing subscribers and bandwidth requirement. For such a DWDM network, Routine and Wavelength Assignment (RWA) is the essential problem to establish the optimal path and assign a wavelength efficiently to the selected path in resource utilization. However, the existing RWA algorithms do not consider the congestion in the network so that the performance of then is so limited. To solve this problem, in this paper, we introduce a new RWA algorithm, called Multi Wavelength-Minimum Interference path Routing (MW-MIPR) that establishes a routing path to minimize the interference for many potential future connection setup request. And then, we also propose a wavelength-routed QoS routing scheme based on differentiated QoS classes with applying MW-MIPR algorithm. Simulation results are also given to prove the efficiency of the proposed algorithms.