• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2450-2460
• /
• 2015

Recently, as interest in IoT (Internet of Things) increase, research and standardization of a new protocol which reflects the characteristics of IoT has progressed. Among them, RPL(IPv6 for Low-Power Lossy Network) is a standardized routing protocol for IoT. RPL utilizes DIO (DODAG Information Object) messages which is flooded from the sink node to the whole network for path establish and maintenance. However, in large scale networks, not only a long time is required to propagate the DIO message to the whole networks but also a bottleneck effect around the sink node is occurred. Multi-sink based approaches which take advantage of reducing routing overhead and bottleneck effect are widely used to solve these problems. In this paper, we define 'unnecessary path update problems' that may arise when applying the RPL protocol to the multi sink based IoT networks and propose two methods namely Routing Metric based Path Update Decision method and Immediate Successor based Path Update Decision method for selective routing update.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2805-2826
• /
• 2021

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

• Smart Structures and Systems
• /
• v.21 no.2
• /
• pp.225-234
• /
• 2018

E-Health allows you to supersede the central patient wireless healthcare system. Wireless Body Sensor Network (WBSN) is the first phase of the e-Health system. In this paper, we aim to understand e-Health architecture and configuration, and attempt to minimize energy consumption and latency in transmission routing protocols during restrictive latency in data delivery of WBSN phase. The goal is to concentrate on polling protocol to improve and optimize the routing time interval and schedule communication to reduce energy utilization. In this research, two types of network models routing protocols are proposed - elemental and clustering. The elemental model improves efficiency by using a polling protocol, and the clustering model is the extension of the elemental model that Destruct Supervised Decision Tree (DSDT) algorithm has been proposed to solve the time interval conflict transmission. The simulation study verifies that the proposed models deliver better performance than the existing BSN protocol for WBSN.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.1
• /
• pp.14-19
• /
• 2009

In Mobile Ad-hoc Network, link failure and packet loss may occur frequently due to its nature of mobility and limited battery life. In this paper, an enhanced robust routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance is presented. If the node movement is detected, the routing agent switches local path to its neighbor node. Simulation results show that the performance of the proposed routing scheme is superior to previous AODV protocol.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.8-20
• /
• 2019

The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

• International Journal of Computer Science & Network Security
• /
• v.23 no.11
• /
• pp.149-161
• /
• 2023

Internet of Things (IoT) is a relatively new concept that has gained immense popularity in a short period of time due to its wide applicability in making human life more convenient and automated. As an illustration: the development of smart homes, smart cities, etc. However, it is also accompanied by a substantial number of risks and flaws. IoT makes use of low-powered devices, so secure, less time-consuming and energy-intensive transmission (routing) of messages due to the limited availability of energy is one of the many and most significant concerns for IoT developers. The following paper presents a trust-based routing scenario for the Internet of Things (IoT) that exploits the past transmission record from the cupcarbon simulator's log files. Artificial Neural Network is used to quantify knowledge of trust, calculate the value of trust, and share this information with other network devices. As a human behavioural pattern, trust provides a superior method for making routing decisions. If there is a tie in the trust values and no other path is available, the remaining battery power is used to break the tie and make a forwarding decision; this is also seen as a more efficient use of the available resources. The proposed algorithm is observed to have superior energy consumption and routing decisions compared to conventional routing algorithms, and it improves the communication pattern.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.384-393
• /
• 2015

This paper proposes an insect behavior-inspired routing algorithm for large-scale wireless mesh networks. The proposed algorithm is adapted from the behavior of an insect called Bombyx mori, a male silkmoth. Its unique behavior is its flying technique to find the source of pheromones. The algorithm consists of two steps: the shortest-path algorithm and the zigzag-path algorithm. First, the shortest-path algorithm is employed to transmit data. After half of the total hops, the zigzag-path algorithm, which is based on the movement of the male B. mori, is applied. In order to adapt the biological behavior to large-scale wireless mesh networks, we use a mesh topology for implementing the algorithm. Simulation results show that the total energy used and the decision time for routing of the proposed algorithm are improved under certain conditions.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.6
• /
• pp.302-310
• /
• 2002

This paper presents an application of a improved branch exchange (IBE) algorithm with a tie branch power (TBP) flow equation to solve the Optimal Routing problem for operation of a radial Power system including power distribution system. The main objective of the Optimal Routing problem usually is to minimize the network real power loss and to improve the voltage profile in the network. The new BE algorithm adopts newly designed methods which are composed by decision method of maximum loss reduction and new index of loss exchange in loop network Thus, the proposed algorithm in this paper can search the optimal topological structures of distribution feeders by changing the open/closed states of the sectionalizing and tie switches. The proposed algorithm has been evaluated with the practical IEEE 32, 69 bus test systems and KEPCO 148 bus test system to show favorable performance gained.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.9
• /
• pp.1267-1270
• /
• 2021

In this paper, we propose a distributed routing algorithm for mobile ad hoc networks (MANET) where mobile devices can be utilized as relays for communication between remote source-destination nodes. The objective of the proposed algorithm is to minimize the end-to-end communication delay caused by transmission failure with deep channel fading. In each hop, the node needs to select the next relaying node by considering a tradeoff relationship between the link stability and forward link distance. Based on such feature, we formulate the problem with partially observable Markov decision process (MDP) and apply deep reinforcement learning to derive effective routing strategy for the formulated MDP. Simulation results show that the proposed algorithm outperforms other baseline schemes in terms of the average end-to-end delay.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1338-1341
• /
• 2004

In this paper, we have proposed a new approach of routing and wavelength assignment algorithms, called Possible Available Wavelength (PAW) algorithm. The weight of a link is used as the main factor for routing decision in PAW algorithm. The weight of a link is defined as a function of hop count and available wavelengths. This function includes a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the greatest number of link weight by using Dijkstra's shortest path algorithm. This means that the selected lightpath will has the least hop count and the greatest number of possible available wavelengths. The impact of proposed link weight computing function on the blocking probability and link utilization is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed PAW algorithm can achieve the better performance in terms of the blocking probability and link utilization.