• 제목/요약/키워드: Routing metric

검색결과 112건 처리시간 0.023초

HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks

  • Gan, Shunyi;Zhou, Jipeng;Wei, Kaimin
    • Journal of Information Processing Systems
    • /
    • 제13권3호
    • /
    • pp.618-629
    • /
    • 2017
  • Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the "multi-hop forwarding" are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio.

Dynamic Adjustment Strategy of n-Epidemic Routing Protocol for Opportunistic Networks: A Learning Automata Approach

  • Zhang, Feng;Wang, Xiaoming;Zhang, Lichen;Li, Peng;Wang, Liang;Yu, Wangyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권4호
    • /
    • pp.2020-2037
    • /
    • 2017
  • In order to improve the energy efficiency of n-Epidemic routing protocol in opportunistic networks, in which a stable end-to-end forwarding path usually does not exist, a novel adjustment strategy for parameter n is proposed using learning atuomata principle. First, nodes dynamically update the average energy level of current environment while moving around. Second, nodes with lower energy level relative to their neighbors take larger n avoiding energy consumption during message replications and vice versa. Third, nodes will only replicate messages to their neighbors when the number of neighbors reaches or exceeds the threshold n. Thus the number of message transmissions is reduced and energy is conserved accordingly. The simulation results show that, n-Epidemic routing protocol with the proposed adjustment method can efficiently reduce and balance energy consumption. Furthermore, the key metric of delivery ratio is improved compared with the original n-Epidemic routing protocol. Obviously the proposed scheme prolongs the network life time because of the equilibrium of energy consumption among nodes.

OQMCAR: An enhanced network coding-aware routing algorithm based on queue state and local topology

  • Lu, Cunbo;Xiao, Song;Miao, Yinbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권8호
    • /
    • pp.2875-2893
    • /
    • 2015
  • Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

A Network Coding-Aware Routing Mechanism for Time-Sensitive Data Delivery in Multi-Hop Wireless Networks

  • Jeong, Minho;Ahn, Sanghyun
    • Journal of Information Processing Systems
    • /
    • 제13권6호
    • /
    • pp.1544-1553
    • /
    • 2017
  • The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

Ad-Hoc Behavior in Opportunistic Radio

  • Mumtaz, Shahid;Marques, Paulo;Gameiro, Atilio;Rodriguez, Jonathan
    • Journal of Communications and Networks
    • /
    • 제11권2호
    • /
    • pp.187-195
    • /
    • 2009
  • The application of mathematical analysis to the study of wireless ad hoc networks has met with limited success due to the complexity of mobility, traffic models and the dynamic topology. A scenario based universal mobile telecommunications system (UMTS) time division duplex (TDD) opportunistic cellular system with an ad hoc behaviour that operates over UMTS frequency division duplex (FDD) licensed cellular network is considered. In this paper, we present a new routing metric which overall improves system performance in terms of interference and routing which operate in an ad hoc network in an opportunistic manner. Therefore we develop a simulation tool that addresses the goal of analysis and assessment of UMTS TDD opportunistic radio system with ad hoc behavior in coexistence with a UMTS FDD primary cellular networks.

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

  • 고휘;이형옥;남지승
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 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

Power-aware Ad hoc On-Demand Distance Vector Routing for prolonging network lifetime of MANETs

  • 황춘송;;이영희
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2002년도 추계학술발표논문집 (중)
    • /
    • pp.1317-1320
    • /
    • 2002
  • We present in this paper a new version of AODV that incorporates with "Minimizing Maximum node cost" by formulating that metric as a cost function of residual energy of nodes. An additional parameter is added to the cost function to consider the routing performance along with power-efficiency. The motivation of adding that new parameter is originated from the trace off between power-saving behaviors and routing performance.

  • PDF

Minimum LQI 기반의 On-demand 센서 네트워크 라우팅 프로토콜 (Minimum LQI based On-demand Routing Protocol for Sensor Networks)

  • 이완직;이원열;허석렬
    • 한국산학기술학회논문지
    • /
    • 제10권11호
    • /
    • pp.3218-3226
    • /
    • 2009
  • 지금까지 다수의 센서 네트워크를 위한 on-demand 라우팅 프로토콜들이 제안되었다. 하지만 제안된 센서 네트워크용 on-demand 라우팅 프로토콜들은 대부분 hop count를 라우팅 메트릭으로 사용하기 때문에 상대적으로 열악한 무선 환경과 신뢰성을 요구하는 센서 응용에는 적합하지 않다. 본 논문에서는 이러한 환경에 적합한 minimum LQI(Link Quality Indicator) 기반의 on-demand 센서 네트워크 라우팅 프로토콜을 제안하였다. 또한 제안한 라우팅 프로토콜을 TinyOS 상에서 구현하였고, 멀티 홉 테스트 환경에서 hop count 기반의 라우팅 프로토콜과 성능을 비교, 측정하였다. 실험 결과, 제안된 라우팅 프로토콜이 열악한 무선 환경에서 더 나은 데이터 전송 성공률을 보임을 확인할 수 있었다.

무선 메쉬 네트워크 환경에서 효율적인 다중 홉 전달 기법 (An Effective Multi-hop Relay Algorithm in Wireless Mesh Network)

  • 김영안;박철현;홍충선
    • 한국통신학회논문지
    • /
    • 제31권10B호
    • /
    • pp.872-882
    • /
    • 2006
  • 무선 메쉬 네트워크(Wireless Mesh Network) 기술은 유선과 비슷한 전송속도를 갖은 무선 통신 기술을 이용해서 문선 백본망으로 사용하는 기술을 의미하며, 토폴로지는 메쉬 형태를 갖는다. 이러한 형태는 Ad-hoc네트워크와 유사란 점을 가지고 있지만, 운용목적과 내부동작에서 다르기 때문에 경로 설정 방법과 경로를 설정하기 위한 메트릭이 요구된다. 본 논문에서는 데이터를 전달하기 위한 루프가 없는 효율적인 다중 흡 전달을 위한 다중 경로생성 방법과 Hop-by-hop 라우팅기법을 기반으로 경로설정을 하고 물리적인 링크의 성능과 다중 홉 전달을 위한 메트릭(ETR : Expected Transmission Rate)을 제안한다.

다수 라디오와 채널을 갖는 무선통신망에서 채널경쟁을 고려한 라우팅 (Routing considering Channel Contention in Wireless Communication Networks with Multiple Radios and Multiple Channels)

  • 고성원;강민수;강남희;김영한
    • 대한전자공학회논문지TC
    • /
    • 제44권5호
    • /
    • pp.7-15
    • /
    • 2007
  • 무선통신망에서 단일 라디오와 채널의 사용은 무선 노드의 반이중 전송 및 경로의 내부간섭으로 통신망의 처리율 및 단대단 지연 특성을 저하시킨다. 또한, 채널경쟁기반의 무선통신망에서 임의노드 주변에 동일 채널을 경쟁하는 노드가 많으면 경쟁으로 인한 대역폭 감소와 전송 충돌로 인한 지연이 발생하여 통신망의 성능을 저하시킨다. 본 논문에서는 다수 라디오와 채널을 사용하여 무선노드의 전이중전송이 가능하게 하고 경로내부간섭을 배제할 수 있도록 라디오와 채널의 기능을 설정하고 큐잉이론의 해석모델을 이용하여 무선구간의 채널 경쟁 및 충돌을 반영한 무선구간 메트릭 ccf 및 ccf와 함께 채널변경지연, 경로내부간섭을 반영한 경로설정 메트릭 MCCR을 제안한다. MCCR과 MCR을 시뮬레이션을 사용하여 비교하였으며 MCCR을 사용하여 설정한 경로가 MCR보다 통신망 성능을 향상시키는 결과를 얻었다.