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

To mitigate the performance degradation caused by performance anomaly, a number of channel assignment algorithms have been proposed for multi-rate wireless mesh networks. However, network conditions have not been fully considered for routing process in these algorithms. In this paper, a joint scheme called Multi-rate Dijkstra's Shortest path - Rate Separated (MDSRS) is proposed, combining routing metrics and channel assignment algorithm. In MDSRS, the routing metric are determined through the synthesized deliberations of link costs and rate matches; then the rate separated channel assignment is operated based on the determined routing metric. In this way, the competitions between high and low rate links are avoided, and performance anomaly problem is settled, and the network capacity is efficiently improved. Theoretical analysis and NS-3 simulation results indicate that, the proposed MDSRS can significantly improve the network throughput, and decrease the average end-to-end delay as well as packet loss probability. Performance improvements could be achieved even in the heavy load network conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1054-1060
• /
• 2013

This paper proposes a vehicle ad-hoc network (VANET) routing algorithm to reduce the probability of routing path discontinuity in urban intersections. In urban intersections, the vehicles may frequently change their moving directions. It can cause the disconnection of routing path and the increase of a packet transmission delay. In order to resolve this problem, the proposed routing algorithm exploits the information of moving directions in urban intersections. In this way, the proposed algorithm can reduce the probability of the local maximum which causes the increase of the number of routing hops and packet transmission delay. Simulation results show that the proposed algorithm can reduce the local maximum probability by 10% and increase the successful packet transmission ratio by 5% compared to the conventional VANET routing algorithms.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.2
• /
• pp.104-112
• /
• 2006

ZigBee is the emerging industrial standard for ad hoc networks based on IEEE 802.15.4. It is used for low data rate and low power wireless network applications. Expected applications of ZigBee include wireless sensor networks for remote monitoring, home control, and industrial automation. Since one of the most important design goals of ZigBee is to reduce the installation and running costs, the ZigBee stack is embedded in the cheap and small micro-controller unit. The hierarchical routing algorithm is used for ZigBee end devices which have very limited resources. Using the block addressing scheme, end devices can send data to the destination without a routing table. However, hierarchical routing has the problem that the packets follow the tree hierarchy to the destination even if the destination is located nearby. In this paper, we propose a scheme to improve the hierarchical routing algorithm in ZigBee networks by employing the neighbor table that is originally used together with the routing table. We suggest selecting the neighbor node that has the minimum remaining hops to the destination as the next hop node. Simulation result shows that the proposed scheme saves more than 30% of the hop counts compared with the original hierarchical routing.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.19 no.2
• /
• pp.107-114
• /
• 2024

Mobile ad hoc networks represent self-configuring networks of mobile devices that communicate without relying on a fixed infrastructure. However, traditional routing protocols in such networks encounter challenges in selecting efficient and reliable routes due to dynamic nature of these networks caused by unpredictable mobility of nodes. This often results in a failure to meet the low-delay and low-energy consumption requirements crucial for such networks. In order to overcome such challenges, our paper introduces a novel multi-objective and adaptive routing scheme based on the Q-learning reinforcement learning algorithm. The proposed routing scheme dynamically adjusts itself based on measured network states, such as traffic congestion and mobility. The proposed approach utilizes Q-learning to select routes in a decentralized manner, considering factors like energy consumption, load balancing, and the selection of stable links. We present a formulation of the multi-objective optimization problem and discuss adaptive adjustments of the Q-learning parameters to handle the dynamic nature of the network. To speed up the learning process, our scheme incorporates informative shaped rewards, providing additional guidance to the learning agents for better solutions. Implemented on the widely-used AODV routing protocol, our proposed approaches demonstrate better performance in terms of energy efficiency and improved message delivery delay, even in highly dynamic network environments, when compared to the traditional AODV. These findings show the potential of leveraging reinforcement learning for efficient routing in ad hoc networks, making the way for future advancements in the field of mobile ad hoc networking.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1061-1064
• /
• 1998

This paper proposes a new topology-based partition method for reconfigurable FPGA systems whose components nd the number of interconnections are predetermined. Here, the partition problem must also consider nets that pass through components such as FPGAs and routing devices to route 100%. We formulate it as a quadratic boolean programming problem suggest a paritition method for it. Experimental results show 100% routing, and up to 15% improvement in the maximum number of I/O pins.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.1
• /
• pp.101-114
• /
• 1996

This study suggests an accelerated genetic algorithm for the vehicle routing problem (AGAVRP). This algorithm treats both the single-visit and the multiple-visit models. AGAVRP is accelerated by the OR techniques at the various stages of the algorithm. In order to improve the convergence of AGAVRP, a robust set of parameters is determined by the experimental design approach. The relative performance of AGAVRP is comparable to the other known algorithms. The advantage of the proposed algorithm is flexibility and better convergence.

• Journal of the Korea Safety Management & Science
• /
• v.10 no.3
• /
• pp.217-225
• /
• 2008

The inventory routing problem (IRP) is an important area of Supply Chain Management. The objective function of IRP is the sum of transportation cost and inventory cost. We propose an Artificial Immune System(AIS) to solve the IRP. AIS is one of natural computing algorithm. An hyper mutation and an vaccine operator are introduced in our research. Computation results show that the hyper mutation is useful to improve the solution quality and the vaccine is useful to reduce the calculation time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.263-269
• /
• 1996

The cost and customer service level of a logistics system depend primarily on the system design of the physical supply system and physical distribution system. The study presents the mathematical model and a huristic solution method of a combined location - vehicle routing problem(LVRP). In LVRP the objective is to determine the number and location of the distribution centers, the allocation of customers to distribution centers, and the vehicle delivery routes, so as to minimize the logistics total cost and satisfy the customer.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.63-69
• /
• 2006

To generate a multicast routing tree guaranteeing the quality of service (QoS), we consider the hop constrained Steiner tree problem and propose a new mathematical formulation for it, which contains fewer constraints than a known formulation. An efficient procedure is also proposed to solve the problem. Preliminary tests show that the procedure reduces the computing time significantly.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.2
• /
• pp.13-26
• /
• 1986

This paper considers the routing problem in session-based communication network, particularly where the pattern of message transmission is characterized by non-bifurcated traffic flows. Due to the discreteness property of its solution space, the problem is formulated as normalized mlticommodity network flows with integer restrictions and an effective penalty system is suggested to solve it. To show its effectiveness, a simple example and a preliminary computational experience are provided. Finally, numerous application areas of the algorithm are suggested.