• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.923-930
• /
• 2007

This paper presents MAPER, a media-aware power efficient routing algorithm over mobile ad hoc networks. Generally, multimedia services need various quality of service over the network according to their characteristics and applications. But it is not easy to guarantee quality of service over mobile ad hoc networks since the resources are very limited and time-varying. Furthermore only a limited power is available at mobile nodes, which makes the problem more challenging. Now, we propose an effective routing algorithm over mobile ad hoc networks that provides the stable end-to-end quality of service with the minimum total power consumption. Finally, experimental results are provided to show the performance of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2534-2553
• /
• 2018

Source routing is the routing scheme that arranges the whole path from source to target at the origin node that may suit the requirements from the upper layer applications' perspective. The centralized control in SDN (Software-Defined Networking) networks enables the awareness of the global topology at the controller. Therefore, augmented source routing schemes can be designed to achieve various purposes. This paper proposes a source routing scheme that conducts the top-K QoS-aware paths discovery in SDN. First, the novel non-invasive QoS over LLDP scheme is designed to collect QoS information based on LLDP in a piggyback fashion. Then, variations of the KSP (K Shortest Paths) algorithm are derived to find the unconstrained/constrained top-K ranked paths with regard to individual/overall path costs, reflecting the Quality of Service. The experiment results show that the proposed scheme can efficiently collect the QoS information and find the top-K paths. Also, the performance of our scheme is applicable in QoS-sensitive application scenarios compared with previous works.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.1-14
• /
• 2006

Multi-constraint QoS routing has been seen as crucial network property in the next generation optical Internet based on DWDM Networks. This paper proposes a new QoS routing algorithm based on flooding method, called bounded flooding routing (BFR) algorithm which can meet multi-constraint QoS requirements. Primarily, the BFR algorithm tries to reduce network overhead by accomplishing bounded-flooding to meet QoS requirements, and improve blocking probability and wavelength utilization. Also, as one effort to improve routing performance, we introduce a new concept, ripple count, which does not need any link-state information and computational process. For extensive analysis and simulation study, as a critical concern, in DWDM-based networks we deploy limited wavelength conversion capability within DWDM nodes. And the simulation results demonstrate that the BFR algorithm is superior to other predominant routing algorithms (both original flooding method and source-directed methods) in terms of blocking probability, wavelength channels required and overhead.

• Smart Media Journal
• /
• v.11 no.5
• /
• pp.82-90
• /
• 2022

Along with the growing popularity of 5G technology, providing flexible and personalized network services suitable for requirements of customers has also become a lucrative venture and business key for network service providers. Therefore, dynamic network provisioning is needed to help network service providers. Moreover, increasing user demand for network services meets specific requirements of users, including location, usage duration, and QoS. In this paper, a routing algorithm, which makes routing decisions using Reinforcement Learning (RL) based on the information about link stability, is proposed and called Link Stability aware Reinforcement Learning (LSRL) routing. To evaluate this algorithm, several mininet-based experiments with various network settings were conducted. As a result, it was observed that the proposed method accepts more requests through the evaluation than the past link annotated shorted path algorithm and it was demonstrated that the proposed approach is an appealing solution for dynamic network provisioning routing.

• International Journal of Computer Science & Network Security
• /
• v.23 no.8
• /
• pp.121-136
• /
• 2023

Wireless Sensor Networks (WSNs) have many potential applications and unique challenges. Some problems of WSNs are: severe resources' constraints, low reliability and fault tolerant, low throughput, low scalability, low Quality of Service (QoS) and insecure operational environments. One significant solution against mentioned problems is hierarchical and clustering-based multipath routing. But, existent algorithms have many weaknesses such as: high overhead, security vulnerabilities, address-centric, low-scalability, permanent usage of optimal paths and severe resources' consumption. As a result, this paper is proposed an energy-aware, congestion-aware, location-based, data-centric, scalable, hierarchical and clustering-based multipath routing algorithm based on Numerical Taxonomy technique for homogenous WSNs. Finally, performance of the proposed algorithm has been compared with performance of LEACH routing algorithm; results of simulations and statistical-mathematical analysis are showing the proposed algorithm has been improved in terms of parameters like balanced resources' consumption such as energy and bandwidth, throughput, reliability and fault tolerant, accuracy, QoS such as average rate of packet delivery and WSNs' lifetime.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.459-465
• /
• 2014

Recently, multimedia data transmission becomes important issues in the wireless sensor network. For the multimedia data transmission in wireless sensor network, QoS (Quality of service) is an important factor to determine the system performance. AODV algorithm is one of the widely used algorithm for wireless ad-hoc environment. In AODV, the destination node selects the route with the smallest hop count. Since AODV only considers the hop count, the selected route could have low channel condition, and degrade QoS. In this paper, we propose a modified AODV algorithm that considers the successful transmission rate of each link. The proposed algorithm regards the number of retransmission which can be obtained from the successful transmission rate as the hop count, and applies the modified hop count to AODV. The advantage of the proposed algorithm is that the modified AODV can support QoS without significant change of the conventional algorithm.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.76-87
• /
• 2014

Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and is predicted to increase remarkably in the near future. For this reason, this paper studies energy saving strategies assuring the network-level QoS. In the strategies, the energy consumption of NIC(network interface card) on both endpoint of links decreases by selecting links and making them sleep when the total traffic volume of the IP network is lower than a threshold. In this paper, we propose a heuristic routing algorithm based on so-called delegating/delegated routers, and evaluate its characteristics using computer simulation considering network-level QoS. The selection of sleep links is determined in terms of the number of traffic paths (called min_used path) or the amount of traffics(called min_used traffic) through those kinks. To our experiment, the min_used traffic method shows a little better energy saving but the increased path length compared to the min_used path method. Those two methods have better energy saving characteristics than the random method. This paper confirms that the delegating/delegated router-based routing algorithm results in energy saving effects and sustains network-level QoS in IP networks.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.534-544
• /
• 2009

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.