• 제목/요약/키워드: routing metrics

검색결과 86건 처리시간 0.031초

A Routing Metric to Improve Route Stability in Mobile Wireless Sensor Networks

  • XU, Yi-Han;WU, Yin;SONG, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.2245-2266
    • /
    • 2016
  • The hop count routing metric is widely used in routing protocols of Wireless Sensor Networks (WSNs) due to its simplicity and effectiveness. With a lower hop count route, fewer transmissions are required to send a packet from the source to the destination. This can improve the throughput of a network because fewer transmissions results in less channel contention and interference. Despite this, the hop count routing metric may not be ideal for mobile scenarios where the topology of a network changes constantly and rapidly. In this paper, we propose to increase route stability in mobile WSNs by discovering paths that are more stable during route discoveries using routing metrics. Two routing metrics were proposed, the true beauty of these routing metrics lies in the fact that they can even be used even without specialized hardware such as GPS and other sensors. We implemented the proposed routing metrics in the AODV routing protocol and found that they are highly effective and outperform other stability-based routing metrics and the hop count routing metric.

Understanding Channel-diversity Oriented Routing Metrics for Multicast in Wireless Mesh Networks

  • Gao, Hui;Nam, Ji-seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 한국정보처리학회 2013년도 춘계학술발표대회
    • /
    • pp.418-420
    • /
    • 2013
  • Issues on design of routing scheme and routing metric for multicast in multi-channel multi-radio (MCMR) wireless mesh networks (WMNs) are discussed. Emphasis is placed on channel-diversity oriented routing metrics. From case study the conclusion to be drawn is that the key for design of channel-diversity oriented routing metrics is how to construct an optimization function to quantify interdependence between channel assignment and multicast routing throughput.

Performance Comparison Between Routing Protocols Based on the Correlation Analysis of Performance Metrics for AODV Routing Protocol (AODV 라우팅 프로토콜의 성능 매트릭들 간의 상관관계 분석에 기반한 라우팅 프로토콜들 간의 성능 비교)

  • Lee, Yun-Kyung;Kim, Ju-Gyun
    • Journal of Information Technology Services
    • /
    • 제12권4호
    • /
    • pp.349-367
    • /
    • 2013
  • In MANET, the AODV routing protocol with on-demand method has a problem in large control packet overhead. In order to improve this, we first need a comprehensive analysis of correlation between performance metrics and factors affecting the performance of AODV. Selected parameters based on this analysis make it enable to be a more accurate and fair performance analysis, as well as to reduce the time and effort when constructing a scenario for performance analysis. In this paper, various scenarios are configured to apply AODV by varying the values of factors affecting the performance with network simulator QualNet 5.0, and then the results are analysed using performance metrics proposed by IETF MANET working group. This paper also founds a correlation between performance metrics and factors affecting the performance for AODV routing protocol, choosing the values of factors that represent many of the most maximum and minimum values of each performance metrics, and proposes optimal simulation parameters for a more accurate performance evaluation of routing protocols with minimal scenario in experiments. Next, performance comparison of AODV, DSR and DYMO routing protocols based on the proposed simulation parameters is shown which provides a comparative analysis on the performance of on-demand routing protocols. Results of this paper could be very useful for the researcher or service provider who wants to find nice simulation environment or select a proper routing protocol.

On Routing Protocol and Metric for Multiradio Multichannel WMNs: Survey and Design Considerations (Multiradio Multichannel WMNs의 라우팅 프로토콜 및 메트릭: 연구 및 설계 고려 사항)

  • Gao, Hui;Lee, Hyung-Ok;Nam, Ji-Seung
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 한국컴퓨터정보학회 2012년도 제45차 동계학술발표논문집 20권1호
    • /
    • pp.105-108
    • /
    • 2012
  • Wireless mesh networks are considered a promising solution to last mile broadband. The unique characteristics of WMN impose unique requirements on designing routing protocols and metrics for WMN. However, existing routing schemes that are designed for single-channel multi-hop wireless networks may lead to inefficient routing paths in multichannel. This paper focuses on the routing problem for multi-radio multichannel WMNs. We list the challenges in designing routing algorithms for multi-radio multichannel WMNs. Then we examine the requirements and considerations for designing routing metrics according to the characteristics of multi-radio multichannel WMNs. Finally we survey and investigate the existing routing metrics in terms of their ability to satisfy these requirements.

  • PDF

Studying Route Optimality in Multi-Hop Wireless Mesh Networks (다중 홉 무선 메쉬 네트워크에서 최적 경로에 관한 연구)

  • Kim, Seong-Kwan;Lee, Ok-Hwan;Lee, Sung-Ju;Choi, Sung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제34권1B호
    • /
    • pp.16-23
    • /
    • 2009
  • This paper investigates how many optimal routes can be established in terms of a given wireless mesh routing metric. Although many of routing metrics have been devised to precisely derive the wireless link quality in mesh, most (if not all) metrics have not been evaluated their optimality along with routing protocols. We consider stateof-the-art routing metrics and a widely accepted routing protocol in order to observe the optimality of established routes varying the number of source nodes. Also, we propose a unidirectional routing to deal with possible link asymmetry feature in wireless links. Through comparative simulation evaluations, we show that the portion of optimally established routes becomes less as the network traffic load increases, regardless of employed metrics, network topologies, and routing protocols.

IRSML: An intelligent routing algorithm based on machine learning in software defined wireless networking

  • Duong, Thuy-Van T.;Binh, Le Huu
    • ETRI Journal
    • /
    • 제44권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.

A Study on Multicast Routing Metric for Wireless Mesh Network (WMN의 멀티캐스트 라우팅 메트릭에 대한 연구)

  • Gao, Hui;Lee, Hyung-Ok;Nam, Ji-Seung
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 한국컴퓨터정보학회 2012년도 제45차 동계학술발표논문집 20권1호
    • /
    • pp.101-103
    • /
    • 2012
  • This paper gives an introduction to multicast in wireless mesh networks. The factors to be addressed when designing a multicast protocol for wireless mesh network are presented. Emphases are paid on selection of multicast routing metrics in wireless mesh networks. Also details of adapting these metrics to gain high-throughput multicast in wireless mesh network are described in the paper.

  • PDF

Clustering Routing Algorithms In Wireless Sensor Networks: An Overview

  • Liu, Xuxun;Shi, Jinglun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권7호
    • /
    • pp.1735-1755
    • /
    • 2012
  • Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions.

A Competition-based Algorithm for Routing Discovery and Repair in Large-scale VANET

  • Wu, Cheng;Wang, Lujie;Wang, Yiming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권12호
    • /
    • pp.5729-5744
    • /
    • 2017
  • Vehicular Ad Hoc Networks (VANET) in the large-scale road section usually have typical characteristics of large number of vehicles and unevenly distribution over geographic spaces. These two inherent characteristics lead to the unsatisfactory performance of VANETs. This poor performance is mainly due to fragile communication link and low dissemination efficiency. We propose a novel routing mechanism to address the issue in the paper, which includes a competition-based routing discovery with priority metrics and a local routing repair strategy. In the routing discovery stage, the algorithm uses adaptive scheme to select a stable route by the priorities of routing metrics, which are the length of each hop, as well as the residual lifetime of each link. Comparisons of different ratios over link length and link stability further show outstanding improvements. In the routing repair process, upstream and downstream nodes also compete for the right to establish repair process and to remain as a member of the active route after repair. Our simulation results confirm the improved performance of the proposed algorithm.

Analysis of MANET's Routing Protocols, Security Attacks and Detection Techniques- A Review

  • Amina Yaqoob;Alma Shamas;Jawwad Ibrahim
    • International Journal of Computer Science & Network Security
    • /
    • 제24권6호
    • /
    • pp.23-32
    • /
    • 2024
  • Mobile Ad hoc Network is a network of multiple wireless nodes which communicate and exchange information together without any fixed and centralized infrastructure. The core objective for the development of MANET is to provide movability, portability and extensibility. Due to infrastructure less network topology of the network changes frequently this causes many challenges for designing routing algorithms. Many routing protocols for MANET have been suggested for last few years and research is still going on. In this paper we review three main routing protocols namely Proactive, Reactive and Hybrid, performance comparison of Proactive such as DSDV, Reactive as AODV, DSR, TORA and Hybrid as ZRP in different network scenarios including dynamic network size, changing number of nodes, changing movability of nodes, in high movability and denser network and low movability and low traffic. This paper analyzes these scenarios on the performance evaluation metrics e.g. Throughput, Packet Delivery Ratio (PDR), Normalized Routing Load(NRL) and End To-End delay(ETE).This paper also reviews various network layer security attacks challenge by routing protocols, detection mechanism proposes to detect these attacks and compare performance of these attacks on evaluation metrics such as Routing Overhead, Transmission Delay and packet drop rates.