• Title/Summary/Keyword: hop distance

Search Result 184, Processing Time 0.03 seconds

Multi-Path DSDV Routing Protocol using Bypass Information in Wireless Mesh Network (무선메쉬 네트워크에서 우회정보를 이용한 다중경로 DSDV 라우팅기법)

  • Lee, Do-Yup;Kim, Jung-Gyu
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.5 no.3
    • /
    • pp.157-167
    • /
    • 2010
  • One of the most famous proactive routing protocols, DSDV (Destination -Sequenced Distance-Vector), is based on the minimum hop count. This paper suggests BIMP(Bypass Information Multi-Path) DSDV routing protocol that this protocol could route reliably as it can take the information of the bypass for the solution of the problem on EHMP DSDV. In this paper, the protocol checks throughput, packet delivery delay, packet delivery ratio, number of management messages, packet transmit finish time, etc on the traffic compared to DSDV, HMP DSDV, and EHMP DSDV protocols.

Efficient Routing Protocol to Select a High-Performance Route in Wireless Mesh Networks

  • Youn, Joo-Sang
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.2
    • /
    • pp.185-192
    • /
    • 2009
  • In wireless mesh networks multi-rate technology environment, a mesh node can dynamically modify the data transmission rate on a particular link, in response to link distance, or more accurately, the perceived SNR ratio between neighbor nodes. In such networks, existing route selection schemes use a link quality metric. Thus, these schemes may easily result in the network being overloaded. In this paper, a new route metric is proposed; it considers both per-hop service delay and link quality at mesh nodes. In addition, the Load-Aware AODV (LA-AODV) protocol using the proposed metric is presented. The performance evaluation is performed by simulation using the OPNET simulator. It is demonstrated that the LA-AODV protocol outperforms the existing routing protocols using other existing route metrics in multi-rate WMN environment.

A Multi-Chain Based Hierarchical Topology Control Algorithm for Wireless Sensor Networks

  • Tang, Hong;Wang, Hui-Zhu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3468-3495
    • /
    • 2015
  • In this paper, we present a multi-chain based hierarchical topology control algorithm (MCHTC) for wireless sensor networks. In this algorithm, the topology control process using static clustering is divided into sensing layer that is composed by sensor nodes and multi-hop data forwarding layer that is composed by leader nodes. The communication cost and residual energy of nodes are considered to organize nodes into a chain in each cluster, and leader nodes form a tree topology. Leader nodes are elected based on the residual energy and distance between themselves and the base station. Analysis and simulation results show that MCHTC outperforms LEACH, PEGASIS and IEEPB in terms of network lifetime, energy consumption and network energy balance.

A Self-Healing Routing Technique for Mobile Ad Hoc Networks (이동 애드 혹 네트워크를 위한 자가치유 라우팅기법에 관한 연구)

  • Park, Seong-Ho;Yoon, Won-Sik
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.167-168
    • /
    • 2006
  • Mobile Ad Hoc Networks (MANETs) has the characteristics such as dynamic network topology, constrained power capacity, constrained wireless bandwidth and quality, etc. For MANETs AODV (Ad-Hoc On-Demand Distance Vector) routing protocol has been proposed. However AODV routing protocol has some inefficiency related to re-routing path establishment corresponding to node's failure. In this paper, we propose a Self-Healing Routing Technique for MANETs that uses the one-hop nodes from the failed node to set up the routing path efficiently. We also include simulation results to show the performance of our method.

  • PDF

A Single Mobile Target Tracking in Voronoi-based Clustered Wireless Sensor Network

  • Chen, Jiehui;Salim, Mariam B.;Matsumoto, Mitsuji
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.17-28
    • /
    • 2011
  • Despite the fact that the deployment of sensor networks and target tracking could both be managed by taking full advantage of Voronoi diagrams, very little few have been made in this regard. In this paper, we designed an optimized barrier coverage and an energy-efficient clustering algorithm for forming Vonoroi-based Wireless Sensor Networks(WSN) in which we proposed a mobile target tracking scheme (CTT&MAV) that takes full advantage of Voronoi-diagram boundary to improve detectability. Simulations verified that CTT&MAV outperforms random walk, random waypoint, random direction and Gauss-Markov in terms of both the average hop distance that the mobile target moved before being detected and lower sensor death rate. Moreover, we demonstrate that our results are robust as realistic sensing models and also validate our observations through extensive simulations.

A Reconfiguration Technique of Logical Topology in a Ship Backbone Network (선박 백본 네트워크의 논리 토폴로지 재구성 기법)

  • Tak, Sung-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.5
    • /
    • pp.922-931
    • /
    • 2012
  • This paper studies a series of logical topology reconfiguration processes corresponding to a series of traffic demand changes in a ship backbone network. The proposed reconfiguration technique is to minimize costly changes of traffic forwarding paths and minimize the average hop distance of traffic forwarding paths in terms of ship backbone network performance simultaneously. Performance evaluation is conducted to illustrate the efficiency of the proposed reconfiguration technique. It shows that the proposed reconfiguration technique yields efficient performance in the entire series of reconfiguration processes.

An efficient Step-parents Node selection Technique in MANET (MANET에서 에너지 효율적인 양부 노드의 선택 방법)

  • Lee, Jong-Seung;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.855-857
    • /
    • 2011
  • In this paper, we proposed EEAR(Efficient Energy Alternative Routing). This is a method of selecting a backup node for path routing management. When some node disconnection on the path routing, using pre-selected backup node provides immediately recover the path recovery. When selecting a Step-Parents node on the path management, the node' s energy level and distance information are cared in context-awareness. This not only increased the system' s capacity cost effectively, but also reduce transmission power entire nodes consume energy. As a result, each node could efficiently management and improves the life time for mobile host and extends system coverage.

  • PDF

Deep Reinforcement Learning-based Distributed Routing Algorithm for Minimizing End-to-end Delay in MANET (MANET에서 종단간 통신지연 최소화를 위한 심층 강화학습 기반 분산 라우팅 알고리즘)

  • Choi, Yeong-Jun;Seo, Ju-Sung;Hong, Jun-Pyo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.9
    • /
    • pp.1267-1270
    • /
    • 2021
  • In this paper, we propose a distributed routing algorithm for mobile ad hoc networks (MANET) where mobile devices can be utilized as relays for communication between remote source-destination nodes. The objective of the proposed algorithm is to minimize the end-to-end communication delay caused by transmission failure with deep channel fading. In each hop, the node needs to select the next relaying node by considering a tradeoff relationship between the link stability and forward link distance. Based on such feature, we formulate the problem with partially observable Markov decision process (MDP) and apply deep reinforcement learning to derive effective routing strategy for the formulated MDP. Simulation results show that the proposed algorithm outperforms other baseline schemes in terms of the average end-to-end delay.

Urgency-Aware Adaptive Routing Protocol for Energy-Harvesting Wireless Sensor Networks

  • Kang, Min-Seung;Park, Hyung-Kun
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.3
    • /
    • pp.25-33
    • /
    • 2021
  • Energy-harvesting wireless sensor networks(EH-WSNs) can collect energy from the environment and overcome the technical limitations of existing power. Since the transmission distance in a wireless sensor network is limited, the data are delivered to the destination node through multi-hop routing. In EH-WSNs, the routing protocol should consider the power situations of nodes, which is determined by the remaining power and energy-harvesting rate. In addition, in applications such as environmental monitoring, when there are urgent data, the routing protocol should be able to transmit it stably and quickly. This paper proposes an adaptive routing protocol that satisfies different requirements of normal and urgent data. To extend network lifetime, the proposed routing protocol reduces power imbalance for normal data and also minimizes transmission latency by controlling the transmission power for urgent data. Simulation results show that the proposed adaptive routing can improve network lifetime by mitigating the power imbalance and greatly reduce the transmission delay of urgent data.

해양통신에서 uplink coverage 확장을 위한 relay 송수신 기법연구

  • 이경제;김동구
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2022.06a
    • /
    • pp.77-78
    • /
    • 2022
  • Currently, communication at sea is more difficult than communication at inland due to the movement of route signs by waves. This paper conducts research on relay transmission and reception techniques to extend coverage in uplink situations. The uplink maritime communication environment between inland base stations and buoys located a certain distance inland was viewed as two hops, and a beam generated according to the number of antennas was selected and a performance analysis was conducted considering the movement of buoys measured by sensors.

  • PDF