• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2658-2681
• /
• 2023

In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.69-77
• /
• 2006

Geocasting is a form of communication that transmits messages to all nodes within a given geographical region(i.e., the geocasting region). Most of conventional onery aware protocols were based on shortest-hop routing that is, they minimized the cost in terms of the distance and total transmission energy not considering both the residual energy at each node and the link error ratio when selecting the routes for communication. In this paper we propose a MLRG(Maximum Lifetime Reliable Geocast) protocol for energy-efficient and reliable geocasting in Ad-hoc networks. The proposed MLRG, a position-based and routing-based geocasting algorithm, maximizes the network lifetime using newly defined cost function and selecting the energy balanced routes on the basis of each node's residual energy, and provides a reliable communication considering the link error ratio.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.4
• /
• pp.243-253
• /
• 2010

Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

• Journal of Advanced Marine Engineering and Technology
• /
• v.32 no.5
• /
• pp.775-784
• /
• 2008

It is not easy to access very high speed Internet services at sea due to some technical and economical problems. In order to realize the very high speed Internet services at sea like on land, new communication network models based on MANET should be adopted. In this paper, a new MANET model at sea is provided, which considered the ocean environments, and the characteristics and movement of vessels. On the basis of the fact that most vessels navigate on the predetermined courses, which are the shortest paths between source and destination ports in most cases, a type of location oriented routing protocol is proposed in this paper. The Hybrid Course-Based Routing Protocol(HCBR) makes use of the static information such as courses and positions of ports to proactively find the shortest paths not only among ports but also the cross points of courses. HCBR also makes use of the locational information of vessels obtained via GPS and AIS systems to reactively discover the shortest route by which data packets are delivered between them. We have simulated the comparison of the performance of HCBR with those of LAR scheme 1 and scheme2, the most typical protocols using geographical information. The simulation results show that HCBR guarantees the route discovery even without using any control packet. They also show that HCBR is more reliable(40%) and is able to obtain more optimal routes(10%) than LAR scheme1 and scheme2 protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1541-1548
• /
• 2012

This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.504-527
• /
• 2015

Underwater wireless sensor networks (UWSNs) are similar to the terrestrial sensor networks. Nevertheless, there are different characteristics among them such as low battery power, limited bandwidth and high variable propagation delay. One of the common major problems in UWSNs is determining an efficient and reliable routing between the source node and the destination node. Therefore, researchers tend to design efficient protocols with consideration of the different characteristics of underwater communication. Furthermore, many routing protocols have been proposed and these protocols may be classified as location-based and location-free routing protocols. Pressure-based routing protocols are a subcategory of the location-free routing protocols. This paper focuses on reviewing the pressure-based routing protocols that may further be classified into non-void avoidance protocols and void avoidance protocols. Moreover, non-void avoidance protocols have been classified into single factor based and multi factor based routing protocols. Finally, this paper provides a comparison between these protocols based on their features, performance and simulation parameters and the paper concludes with some future works on which further study can be conducted.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1665-1671
• /
• 2007

Mobile Ad hoc Networks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad-hoc networks. In this study, we proposed an enhanced routing protocol based on AODV by monitoring variation of receiving signal strength. New metric function that consists of node mobility and hops of path is used for routing decision. From extensive experiments by using NS-2, The performance of the proposed routing scheme has been imp개ved by comparison to AODV protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.4
• /
• pp.43-50
• /
• 2010

Vehicle-to-Vehicle (V2V) is a special type of vehicle ad-hoc network (VANET), and known as a solution to provide communication among vehicles and reduce vehicle accidents. Geographical routing protocols as Greedy Perimeter Sateless Routing (GPSR) are very suitable for the V2V communication due to special characters of highway and device for vehicles. However, the GPSR has problem that appears local maximum by some stale neighbor nodes in the greedy mode of the GPSR. It can lose transmission data in recovery mode, even if the problem is can be solved by the recovery mode of the GPSR. We therefore propose a Greedy Perimeter Reliable Routing (GPRR), can provide more reliable data transmission, to resolve the GPSR problem in the V2V environment. Simulation results using ns-2 shown that the GPRR reveals much better performance than the GPSR by remarkably reducing the local maximum rate in the greedy mode.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.50-67
• /
• 2015

The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.