• Title/Summary/Keyword: Multi-hop Routing Protocol

Search Result 180, Processing Time 0.021 seconds

Load-Aware Channel Switching Algorithm for Multi-Channel Multi-Hop Wireless Network (멀티 채널 멀티 홉 무선 네트워크에서 부하 인지 채널 변경 기술)

  • Kang, Min-Su;Lee, Young-Suk;Kang, Nam-Hi;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.110-118
    • /
    • 2007
  • In multi-hop wireless network, multi-channel makes it possible to enhance network performance because it reduces channel interferences md contentions. Recently several schemes have been proposed in the literatures to use multi-channel. Especially, MCR(Multi channel routing protocol), which utilize hybrid interface assignment, is a prominent routing protocol. MCR uses simple way to change channel but efficiently reduce channel interferences. In this paper, we propose a load-aware channel selection algorithm called LCS that enhances the channel switching algerian used in MCR protocol. In LCS, channel of a node is assigned based on collected information about queue length of neighbors. Moreover this paper evaluates the performance of in by using simulation test and testbed demonstration. Test results show that the MCR with LCS outperforms the naive MCR.

Performance Evaluation of the new AODV Routing Protocol with Cross-Layer Design Approach (교차 계층 설계 기법을 사용한 새로운 AODV 라우팅 프로토콜 설계 및 성능평가)

  • Jang, Jaeshin;Wie, Sunghong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.6
    • /
    • pp.768-777
    • /
    • 2020
  • In this paper, we describe recent research results on AODV routing protocol, which is widely deployed at mobile ad hoc networks, and AODV related routing protocols with multi-path routing schemes. We suggest the critical problems which minimum hop routing schemes have, such as AODV routing protocol, and then, propose a new C-AODV routing protocol with two routing metrics: the primary metric is the hop count, the secondary metric is the sum of link delay times. We implemented C-AODV protocol by modifying AODV at the NS-3, and thus, elaborate on how we change the original AODV source code of NS-3 in order to implement the C-AODV scheme. We show numerical comparison of C-AODV scheme with the original AODV scheme and then, discuss how much the C-AODV enhances routing performance over AODV protocol. In conclusion, we present future research items.

A novel routing protocol for cognitive radio networks with cooperation process

  • Kim, Sunwoo;Pyeon, Dohoo;Jang, Ingook;Yoon, Hyunsoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3860-3875
    • /
    • 2014
  • Cognitive radio networks (CRNs) are composed of mobile users who can use multiple spectrum bands for communication. CRNs allow unlicensed users (called cognitive users) to efficiently utilize unused licensed spectrums without interfering with communications of licensed users (called primary users). The main goals of CRNs are to mitigate spectrum saturation and to improve spectrum utilization. This paper introduces state-of-the-art routing protocols for CRNs and addresses some limitations of these protocols. To resolve the limitations, we suggest a new research direction for routing protocols in CRNs. We implement our protocol to compare with the existing routing protocols for multi-hop CRNs. Our protocol shows good performance compared to the existing routing protocols in terms of network performance and PU protection.

The Comparison of Performance Hierarchical Routing Protocols in Wide Area Sensor Field

  • Park, SeaYoung;Jung, KyeDong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • v.5 no.1
    • /
    • pp.8-15
    • /
    • 2016
  • Studies have been made for the wireless sensor network protocols by a number of researchers to date. In particular, the studies as to the hierarchical protocol LEACH algorithm was concentrated. Various studies have been derived for the performance of the protocol is based on the LEACH protocol have been made. Improved algorithms have been proposed continuously. On the other hand, The performance comparison and evaluation of the improved algorithm is insufficient. Therefore, we compared the performance for the ML-LEACH (Multi Hop-Layered) and DL-LEACH (Dual Hop-Layered) been derived mainly LEACH. scalability, energy consumption, CH elected, network lifetime were selected as a Performance evaluation items.

DL-LEACH: Hierarchical Dual-Hop Routing Protocol for Wireless Sensor Network (DL-LEACH : 무선 센서 네트워크를 위한 계층형 멀티 홉 라우팅 프로토콜)

  • Lee, Chang-Hee;Lee, Jong-Yong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.139-145
    • /
    • 2015
  • This paper proposes to increase the node energy effienciecy, which rapidly drops during the transmission of LEACH (Low Energy Adaptive Clustering Hierachy), using the method of DL-LEACH (Dual-hop Layered LEACH). By introducing dual-hop method in the data transmission, the proposed single-hop method for short-range transmission and multi-hop transmission method between the cluster heads for remote transmission was introduce. By introducing a partial multi-hop method in the data transmission, a single-hop method for short range transmission method between the cluster heads for remote transmission was introduces. In the proposed DL-LEACH, the energy consumption of cluster head for remote transmission reduces and increases the energy efficiency of sensor node by reducing the transmission distance and simplifying the transmission routine for short-range transmission. As compared the general LEACH, it was adapted to a wider sensor field.

Communication Protocol to Support Mobile Sinks by Multi-hop Clusters in Wireless Sensor Networks (무선 센서 네트워크에서 멀티-홉 클러스터를 통한 이동 싱크 지원 통신 프로토콜)

  • Oh, Seung-Min;Jung, Ju-Hyun;Lee, Jeong-Cheol;Park, Ho-Sung;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3A
    • /
    • pp.287-295
    • /
    • 2010
  • In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

A study on the Robust and Systolic Topology for the Resilient Dynamic Multicasting Routing Protocol

  • Lee, Kang-Whan;Kim, Sung-Uk
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.3
    • /
    • pp.255-260
    • /
    • 2008
  • In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

Pathless Multihop Packet Forwarding Protocol for Inter-vehicular Communication (차량간 통신을 위한 비경로형 멀티 홉 패킷 포워딩 프로토콜)

  • Lee, Woo-Sin;Lee, Hyuk-Joon
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.328-339
    • /
    • 2007
  • Conventional topology-based routing protocols are not suitable for inter-vehicular communication, where frequent route updates are necessary due to continuous and abrupt changes in network topology Position-based routing protocols are widely accepted to better serve their purpose in such a scenario as they do not require path discovery or maintenance. However they have to deal with the overhead of the location service and inaccurate position information. This paper proposes the MMFP (Multi-hop MAC Forwarding Protocol) for inter-vehicle communication that relies on reachability information collected from received packets in making a forwarding decision without path discovery. The MMFP is designed as an extension to the IEEE 802.11 MAC layer to ensure accuracy in its time-critical operations. This paper also presents some simulation results that demonstrate the superior performance of the MMFP over AODV in a realistic inter-vehicular communication.

An Energy Efficient Routing Algorithm based on Center of Local Clustering in Wireless Sensor Networks (무선센서 네트워크에서의 지역-중앙 클러스터 라우팅 방법)

  • He, Jin Ming;Rhee, Chung-Sei
    • Convergence Security Journal
    • /
    • v.14 no.2
    • /
    • pp.43-50
    • /
    • 2014
  • Recently, lot of researches for the multi-level protocol have been done to balance the sensor node energy consumption of WSN and improve the node efficiency to extend the life of the entire network. Especially in multi-hop protocol, a variety of models have been proposed to improve energy efficiency and apply it to WSN protocol. In this paper, we analyze LEACH algorithm and propose new method based on center of local clustering routing algorithm in wireless sensor networks. We also perform NS-2 simulation to show the performance of our model.

An Efficient Reactive Routing Protocol based on the Multi-rate Aware MAC for Mobile Ad Hoc Networks (이동 애드 혹 망에서 다중 전송속도를 갖는 MAC 기반의 효율적인 반응형 라우팅 프로토콜)

  • Lee, Jae-Hwoon;Lim, Yu-Jin;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.45-50
    • /
    • 2008
  • Mobile ad hoc networks (MANETs) allow mobile nodes to communicate among themselves via wireless multiple hops without the help of the wired infrastructure. Therefore, in the MANET, a route setup mechanism that makes nodes not within each other's transmission range communicate is required and, for this, the Ad-hoc On-demand Distance Vector (AODV) was proposed as one of the reactive routing protocols well suited for the characteristics of the MANET. AODV uses the hop count as the routing metric and, as a result, a node selects the farthest neighbor node as its next hop on a route, which results in a problem of deteriorating the overall network throughput because of selecting a relatively low data rate route. In this paper, we propose an efficient reactive routing protocol based on the multi-rate aware MAC. Through the simulations, we analyze the performance of our proposed mechanism and, from the simulation results, we show that our proposed mechanism outperforms the existing mechanism.