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

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 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.

• 한국IT서비스학회지
• /
• 제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.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 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.

• 한국통신학회논문지
• /
• 제34권1B호
• /
• pp.16-23
• /
• 2009

이 논문은 멀티 홉 무선 메쉬 네트워크에서 제공하는 라우팅 프로토콜이 적용된 라우팅 metric에 따라 최적의 경로를 얼마나 잘 찾는가에 관한 논문이다. 최근에 제시된 라우팅 metric은 Link Quality (LQ)를 정확히 나타내도록 설계되어있지만, 많은 metric들은 그것을 기반으로 찾은 경로들이 얼마나 많은 비율로 최적의 경로를 찾을 수 있는지에 대해서 검증하지 않았다. 우리는 최근에 잘 디자인된 라우팅 metric들과 가장 많이 사용되는 라우팅 프로토콜의 다양한 조합을 고려하였다. 그리고 각각의 라우팅에서 찾은 경로의 최적 정도를 살펴보았습니다. 또한 무선 링크의 비대칭성을 반영한 metric을 위해서 단 방향성을 가지는 라우팅 프로토콜을 제안한다. 시뮬레이션을 통해서 만들어진 최적 경로의 비율이 살펴본 모든 라우팅 metric 및 프로토콜 그리고 네트워크 구조에 대해서 네트웍 트래픽 양에 따라 감소하는 현상을 알 수 있다.

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

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 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.

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

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

• International Journal of Computer Science & Network Security
• /
• 제22권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.