• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.406-418
• /
• 2015

Cognitive radio networks (CRNs) have emerged as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows a secondary network comprising of secondary users (SUs) to coexist with a primary network comprising of licensed primary users (PUs) subject to the condition that SUs do not cause any interference to the primary network. Since it is necessary for SUs to avoid any interference to the primary network, PU activity precludes attempts of SUs to access the licensed spectrum and forces frequent channel switching for SUs. This dynamic nature of CRNs, coupled with the possibility that an SU may not share a common channel with all its neighbors, makes the task of multicast routing especially challenging. In this work, we have proposed a novel multipath on-demand multicast routing protocol for CRNs. The approach of multipath routing, although commonly used in unicast routing, has not been explored for multicasting earlier. Motivated by the fact that CRNs have highly dynamic conditions, whose parameters are often unknown, the multicast routing problem is modeled in the reinforcement learning based framework of learning automata. Simulation results demonstrate that the approach of multipath multicasting is feasible, with our proposed protocol showing a superior performance to a baseline state-of-the-art CRN multicasting protocol.

• Journal of the Korea Society for Simulation
• /
• v.12 no.3
• /
• pp.55-68
• /
• 2003

As mobile IP has been suggested only to support mobility of mobile station(MS) by which it dose nothing but guarantee MS's new connection to the network, it is for nothing in Quality of Service(QoS) after handoff of MS. QoS is very important factor in mobile IP network to provide multimedia applications and real-time services in mobile environment, and it is closely related to handoff delay Therefore as a main issue in mobile IP research area, handoff delay problem is actively studied to guarantee and promote QoS. In this paper, in order to resolve such a problem, we suggest Simple Network Management Network(SNMP) information-based routing that adds keyword management method to information-based routing in active network, and then propose QoS controlled handoff by SNMP information-based routing. After setting up routing convergence time, modeling of suggested method and existing handoff method is followed in order to evaluate the simulations that are carried out with NS-2. The result of simulation show the improvement of handoff delay, and consequently it turns off the QoS has been improved considerably.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.327-336
• /
• 2009

Geographic routing has been considered as an attractive approach in wireless sensor networks, since it routes data packets by using location information rather than global topology information. In geographic routing schemes, packets are usually sent along the boundary of a hole by face routing to detour the hole. As result, all data flows which need to detour the hole are concentrated on the boundary of the hole. This hole detour scheme results in much more energy consumption for nodes at the hole boundary, and the energy exhaustion of hole boundary nodes enlarges the holes. This is referred to as a hole diffusion problem. The perimeter mode may also lead to data collisions on the hole boundary nodes if multiple data flows need to bypass a hole simultaneously. In this paper, we propose a hole modeling and detour scheme for geographic routing in wire-less sensor networks. Our hole modeling and detour scheme can efficiently prevent hole diffusion, avoid the local minimum problem faced by geographic routing protocols, and reduce data collisions on the hole boundary nodes. Simulation results show that the proposed scheme is superior to the other protocols in terms of control overhead, average delivery delay and energy consumption.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.441-446
• /
• 2006

In recent years, WDM networks have received much attention as the Internet backbone networks because of the explosive growth of the Internet IP-based traffic. The Optical Burst Switching (OBS) has been proposed as an effective optical switching technology in the WDM networks. The OBS has the advantages in 1) the high usage rate of the bandwidth, and 2) no necessity of optical buffer. However, the OBS has the burst-contention problem in the networks. The deflection routing is proposed as one of means to solve this problem. In this paper, we propose a new routing method to minimize burst loss in the deflection routing based networks. In addition, we propose a QoS control method using a new routing algorithm. Finally, we show the variety of the proposed methods by computer simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.1992-2008
• /
• 2018

Mobile opportunistic network is a kind of ad hoc networks, which implements the multi-hop routing communication with the help of contact opportunity brought about by the mobility of the nodes. It always uses opportunistic data transmission mode based on store-carry-forward to solve intermittent connect problem of link. Although many routing schemes have been proposed, most of them adopt the greedy transmission mode to pursue a higher delivery efficient, which result in unfairness extremely among nodes. While, this issue has not been paid enough attention up to now. In this paper, we analyzed the main factors that reflect fairness among nodes, modeled routing selection as a multiple attribute decision making problem, and proposed our Fairness-aware Routing Strategy, named FARS. To evaluate the performance of our FARS, extensive simulations and analysis have been done based on a real-life dataset and a synthetic dataset, respectively. The results show that, compared with other existing protocols, our FARS can greatly improve the fairness of the nodes when ensuring the overall delivery performance of the network.

• Journal of Korean Society for Quality Management
• /
• v.20 no.1
• /
• pp.136-146
• /
• 1992

Most of scheduling papers on FMS have been considered that the fabrication process, the machining process and the assembly process etc. are independent and the releasing, routing, dependent, batching, loading problem are treated separetely. In this paper, we discuss that the integrated scheduling problem which can be solved for efficient use. We combine two systems that each process system which in order to produce a product is treated dependently, the releasing and the routing problem are combined one system and we present the efficient flexible manufacturing system as including the alternate process.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.236-246
• /
• 2008

We consider the Inventory Routing problem(IRP) for the vending machine operating system. An artificial immune system(AIS) is introduced to solve the IRP. The IPR is an rolling wave planning. The previous solution of IRP is one of good initial solution of current IRP. We introduce an Artificial Immune system with memory cell (AISM) which store previous solution in memory cell and use an initial solution for current problem. Experiment results shows that AISM reduced calculations time in relatively less demand uncertainty.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.177-186
• /
• 2019

In wireless sensor networks, the transmission success ratio would be decreased when the scale of the WSNs increased. To defeat this problem, we propose a multipath routing based on opportunistic routing for improving end-to-end reliability in large-scale wireless sensor networks. The proposed scheme exploits the advantages of existing opportunistic routing and achieves high end-to-end success ratio by branching like a multipath routing through local decision without information of the whole network. As a result of the simulation result, the proposed scheme shows a similar or higher end-to-end transmission success ratio and less energy consumption rather than the existing scheme.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.733-745
• /
• 2022

In software-defined wireless networking (SDWN), the optimal routing technique is one of the effective solutions to improve its performance. This routing technique is done by many different methods, with the most common using integer linear programming problem (ILP), building optimal routing metrics. These methods often only focus on one routing objective, such as minimizing the packet blocking probability, minimizing end-to-end delay (EED), and maximizing network throughput. It is difficult to consider multiple objectives concurrently in a routing algorithm. In this paper, we investigate the application of machine learning to control routing in the SDWN. An intelligent routing algorithm is then proposed based on the machine learning to improve the network performance. The proposed algorithm can optimize multiple routing objectives. Our idea is to combine supervised learning (SL) and reinforcement learning (RL) methods to discover new routes. The SL is used to predict the performance metrics of the links, including EED quality of transmission (QoT), and packet blocking probability (PBP). The routing is done by the RL method. We use the Q-value in the fundamental equation of the RL to store the PBP, which is used for the aim of route selection. Concurrently, the learning rate coefficient is flexibly changed to determine the constraints of routing during learning. These constraints include QoT and EED. Our performance evaluations based on OMNeT++ have shown that the proposed algorithm has significantly improved the network performance in terms of the QoT, EED, packet delivery ratio, and network throughput compared with other well-known routing algorithms.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.411-419
• /
• 2017

The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.