• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.9
• /
• pp.795-802
• /
• 2002

We present a new dynamic routing scheme for multiple autonomous guided vehicles (AGVs) systems. There have been so many results concerned with scheduling and routing of multiple AGV systems; however, most of them are only applicable to systems with a small number of AGVs under a low degree of concurrency. With an increased number of AGVs in recent applications, these AGV systems are faced with another problem that has never been occurred in a system with a small number AGVs. This is the stop propagation problem. That is, if a leading AGV stops then all the following AGVs must stop to avoid any collision. In order to resolve this problem, we propose a nonstop preferential detour (NPD) algorithm which is a new dynamic routing scheme employing an election algorithm. For real time computation, we introduce two stage control scheme and propose a new path searching scheme, k-via shortest path scheme for an efficient dynamic routing algorithm. Finally, the proposed new dynamic routing scheme is illustrated by an example.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.1
• /
• pp.15-22
• /
• 2014

Delay-Tolerant Network employs message forwarding based on a Store, Carry and Forward method to conquer no guarantee of continue connectivity. For this reason, a lot of DTN routing scheme have been proposed recently. message forwarding is an important research issue in delay-tolerant network and In this paper, we propose a efficiency DTN routing scheme using node's social relation and expanded Ego-network betweenness centrality. Our simulation results show that it is more efficient to message delivery cost than Epidemic routing, Friendship routing while it has a little performance degradation of message delivery ratio.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1121-1128
• /
• 2008

Ad-Hoc network is consisted with the device of wireless communication. Therefore, the organization of network is dynamic and the changing communication channel is essential. According this, the study of secure routing route and certification technique has to be needed. In we research, we suggest not only the secure routing scheme in Ad-Hoc circumstance but also the method that user can be serviced the type of network which is connected Ad-Hoc network and wireless lam. In case of the routing form of Ad-Hoc Network, although in preexist study, when the device of organization withdraws, routing is needed, in we research, we suggest the detour route that is used hop frequency. We can offer the service of ubiquitous that the certification of secure user and the creation of routing route in Ad-Hoc network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1790-1806
• /
• 2015

Utility-based routing is a special type of routing approach using a composite utility metric when making routing decisions in ad hoc and sensor networks. Previous studies on the utility-based routing all use fixed retry limit and a very simple distance related energy model, which makes the utility maximization less efficient and the implementation separated from practice. In this paper, we refine the basic utility model by capturing the correlation of the transmit power, the retry limit, the link reliability and the energy cost. A routing algorithm based on the refined utility model with adaptive transmit power and retry limit allocation is proposed. With this algorithm, packets with different priorities will automatically receive utility-optimal delivery. The design of this algorithm is based on the observation that for a given benefit, there exists a utility-maximum route with optimal transmit power and retry limit allocated to intermediate forwarding nodes. Delivery along the utility-optimal route makes a good balance between the energy cost and the reliability according to the value of the packets. Both centralized algorithm and distributed implementations are discussed. Simulations prove the satisfying performance of the proposed algorithm.

• Journal of IKEEE
• /
• v.24 no.1
• /
• pp.326-332
• /
• 2020

This paper presents the design of a routing metric for energy-efficient and low-delay path selection and a new routing protocol utilizing the metric in duty-cycyled wireless sensor networks. The new routing metric based on duty cycle, EDW, can reduce the energy and delay of transmission paths, which represents total waiting time from source to destination due to duty cycle. Therefore, in this paper, we propose a new multipath routing protocol based on cross-layer information utilizing the new routing metric, and simulation results show that the proposed protocol shows better performance of end-to-end delay and energy consumption.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.657-658
• /
• 2015

In an wireless sensor network, energy efficient routing protocol is important for multi-hop transmission because senor nodes are powered by battery. In multi-hop transmission, specifice nodes are used and the battery power becomes low, it induce the asymetric remaining power among the nodes and makes the network lifetime reduced. In this paper, we propose a power-aware routing protocol which determines the routing path considering the remaining power of the nodes. Simulation results shows that the proposed routing scheme minimize the transmission delay and increase the network lifetime.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.259-267
• /
• 2016

In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.461-472
• /
• 2006

In this paper, we propose a novel on-demand multicasting algorithm, 'Durable Distance Vector Multicasting(DDVM),' for Mobile Ad hoc Network(MANET). DDVM has a more efficient routing-control complexity than Link State Routing(LSR) and with the smaller complexity, DDVM provides a high delivery ratio for MANET with high mobility by adapting to dynamic topological changes. This is achieved by adding 'combined path durability' statistic into the routing-control information of Distance Vector Routing(DVR). The routing-path duration statistic is computed in a fully distributed manlier at each node in the network based on only local information from neighbour nodes. We show by simulation studies the effectiveness of DDVM compared with On-demand Multicast Routing Protocol(ODMRP).

• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.139-148
• /
• 2022

Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.

• 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.