• Title/Summary/Keyword: Multi-routing protocol

Search Result 301, Processing Time 0.03 seconds

Analysis for Ad Hoc Routing Protocol based-on Dynamic Source Routing (Dynamic Source Routing 기반의 Ad Hoc Routing Protocol 분석)

  • 이광재;김탁근;김동일;최삼길
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.121-124
    • /
    • 2001
  • Dynamic Source Route(DSR) protocol is a simple and efficient routing protocol designed specially for use of the multi-hop Ad Hoc Network. DSR allows the network to be completely self-organized and self-configured without the need for any existing infrastructure or administration. DSR protocol consists of the two mechanisms of Router discovery and Router Maintenance, works entirely On-demand in all aspects. In this paper, we will present the performance of DSR protocol on the multi-hop wireless Ad Hoc Networks, illustrate it with simulation, and then analysis the algorism of DSR.

  • PDF

Design and Performance Analysis of Multi-hop Routing Protocol for WiMedia (WiMedia를 위한 멀티홉 라우팅 프로토콜 개발 및 성능분석)

  • Jung, Jin-Uk;Lee, Seung-Jin;Jin, Kyo-Hong;Hwang, Min-Tae;Jeon, Young-Ae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1406-1415
    • /
    • 2012
  • Though WiMedia supports the higher data rates than other WPAN technologies, a WiMedia device cannot reach other devices which are apart from it more than 10 meter; the limited transmission range of the WiMedia protocol. In this paper, we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that is located out of transmission range. The proposed routing protocol is a hybrid routing protocol, which is the mixed protocol of table-driven and on-demand routing algorithm. In the proposed protocol, a route for a device within 2-hop is established by using the table-driven routing algorithm and a route for the device beyond 2-hop is established by using the on-demand routing algorithm. We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV. The simulation results show that the proposed protocol's performance is better than AODV and DSDV in terms of the throughput and delay.

A Multi-path Dynamic Source Routing Protocol for Mobile Ad-Hoc Networks (이동 애드 혹 네트워크를 위한 다중경로 동적 소스 라우팅 프로토콜)

  • Lim Hwa-Jung;Tscha Yeong-hwan
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.111-120
    • /
    • 2005
  • A mobile ad-hoc network is an autonomous system of mobile nodes which are free to move around randomly and organize themselves arbitrarily, hence a routing protocol that handles the dynamic network topology changes is required for the network. In this paper we present a multi -Path on-demand routing protocol called R-DSR (Robust Dynamic Source Routing), an extension to the existing IETF protocol DSR. The proposed protocol has it that every pair of 2-hop away nodes on the single route is additionally connected via an alternative node. Throughout mathematical analysis we show the proposed protocol reveals higher message delivery rate than that of the Das's multi-path protocol, currently known as one of the most typical approaches related to DSR.

A Cost-Aware Multi-path DSDV Routing Protocol in Wireless Mesh Networks (무선 메쉬 네트워크에서 비용 인지 다중 경로 DSDV 라우팅 프로토콜)

  • Lee, Seong-Woong;Chung, Yun-Won
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.289-296
    • /
    • 2008
  • In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.

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.01a
    • /
    • 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

The Performance Comparison of the Unicast Routing Protocol and the Broadcast Routing Protocol in the Small-sized Ad hoc Network (소규모 애드혹 네트워크에서의 유니캐스트와 브로드캐스트 라우팅 프로토콜의 성능비교)

  • Kim, Dong-Hee;Park, Jun-Hee;Moon, Kyeong-Deok;Lim, Kyung-Shik
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.685-690
    • /
    • 2006
  • This paper compares the performance of the unicast routing protocol and the broadcast routing protocol in a small-sized wireless multi-hop network, such as home network. Normally, ad-hoc routing protocols are designed for general wireless multi-hop networks, not being said to be optimized for the small-sized ad hoc network. This paper compares some unicast routing protocols and optimal broadcast routing protocol, and shows the result. The result of the simulation says the broadcast routing protocol shows better performance than the ad-hoc routing protocols in the small-sired wireless multi-hop network. Especially, the result shows that the broadcast protocol has higher packet delivery ratio and lower packet latency than unicast routing protocols

Interference Aware Multipath Routing in Multi-rate Wireless Sensor Networks

  • Lee, Kang Gun;Park, Hyung Kun
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.8
    • /
    • pp.909-914
    • /
    • 2015
  • In wireless sensor networks, sensor nodes have a short transmission range and data is transferred from source to destination node using the multi-hop transmission. Sensor nodes are powered by battery and the link qualities are different, and the routing protocol in the wireless sensor network is one of the important technical issues. Multipath routing was proposed to reduce the data congestion and increase data throughput. In the multipath routing, however, each path can be interfered by the other path, and it can aggravate network performance. In this paper, we propose the multipath routing scheme for multi-rate wireless sensor networks. The multipath routing selects transmission paths to minimize transmission delay and path interference.

CAMR: Congestion-Aware Multi-Path Routing Protocol for Wireless Mesh Networks

  • Jang, Seowoo;Kang, Seok-Gu;Yoon, Sung-Guk
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.411-419
    • /
    • 2017
  • The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.

An efficient signaling protocol for point-to-point multi-connection call in B-ISDN (B-ISDN에서 점 대 점 다중연결 호를 위한 효율적인 신호프로토콜)

  • 배상재;조현철;주언경
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.12
    • /
    • pp.1-9
    • /
    • 1997
  • The signaling protocol for B-ISDN should support variety of services including point-to-pont single-connection call, point-to-point multi-connection call and point-to-multipoint connection call. an efficient signaling protocol for point-to-point multi-connection call based on ITU-T Recommendation Q.298X is presented in this paper. Sequential establishment of madatory and optional connections and common routing scheme for synchronization, along with separation of information elements for establishement of multi-connection call are included in the proposed signaling protocol. Limited network resources can be used more efficiently by proposed sequential establishement of mandartory and optional connection for point-to-point multi-connection call which can provide multimedia services. And common routing can be provided effectively by proposed common routing scheme for connectios requiring synchronization like as video-phone and video-conference.

  • PDF

QLGR: A Q-learning-based Geographic FANET Routing Algorithm Based on Multi-agent Reinforcement Learning

  • Qiu, Xiulin;Xie, Yongsheng;Wang, Yinyin;Ye, Lei;Yang, Yuwang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.4244-4274
    • /
    • 2021
  • The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.