• 제목/요약/키워드: Message Forwarding Strategy

검색결과 4건 처리시간 0.143초

A Diversified Message Type Forwarding Strategy Based on Reinforcement Learning in VANET

  • Xu, Guoai;Liu, Boya;Xu, Guosheng;Zuo, Peiliang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권9호
    • /
    • pp.3104-3123
    • /
    • 2022
  • The development of Vehicular Ad hoc Network (VANET) has greatly improved the efficiency and safety of social transportation, and the routing strategy for VANET has also received high attention from both academia and industry. However, studies on dynamic matching of routing policies with the message types of VANET are in short supply, which affects the operational efficiency and security of VANET to a certain extent. This paper studies the message types in VANET and fully considers the urgency and reliability requirements of message forwarding under various types. Based on the diversified types of messages to be transmitted, and taking the diversified message forwarding strategies suitable for VANET scenarios as behavioral candidates, an adaptive routing method for the VANET message types based on reinforcement learning (RL) is proposed. The key parameters of the method, such as state, action and reward, are reasonably designed. Simulation and analysis show that the proposed method could converge quickly, and the comprehensive performance of the proposed method is obviously better than the comparison methods in terms of timeliness and reliability.

Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network

  • Ayub, Qaisar;Mohd Zahid, M. Soperi;Abdullah, Abdul Hanan;Rashid, Sulma
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권3호
    • /
    • pp.649-657
    • /
    • 2013
  • DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.

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.

계층적 이동 Ipv6환경에서 지연갱신전략을 이용한 위치등록 비용 감소 (Cost Reduction of Location Registration Using the LiEy UBdate Strategy in Hierarchical Mobile IPv6)

  • 이명규;황종선
    • 한국정보과학회논문지:정보통신
    • /
    • 제32권3호
    • /
    • pp.370-381
    • /
    • 2005
  • 이동 IP는 인터넷에서 호스트의 이동성을 제공하기 위한 효율적이고 확장성 있는 기법이다 이동 IP를 이용하여, 이동노드는 If주소의 변경없이 인터넷에서 이동할 수 있다. 하지만, 이동 IP는 위치등록을 위한 높은 통신비용을 요구한다. 이러한 통신비용을 감소시키기 위하여 이동 사용자들의 통신패턴을 조사해본 결과, 이동 사용자들이 실제 통신하는 시간이 많지 않다는 사실에 주목하게 되었다. 실제, 이동노드가 통신하지 않는 유휴상태에서 이동중인 이동노드는 위치등록을 위한 바인딩 갱신 메시지를 흠 에이전트에게 보낼 필요가 없다. 이러한 관점에 의해서, 본 논문에서는 계충적 이동 IPv6 환경에서 포워딩 포인터를 사용하여 통신 비용을 최소화하는 갱신지연전략을 제안한다. 제안 기법은 이동중인 이동노드가 통신하지 않는 동안 발생하는 불필요한 바인딩 갱신 메시지를 제거함으로써 통신비용을 칙소화함에 있다. 제안기법에서 바인딩 갱신 메세지는 이동노드가 통신하는 무휴상태에서만 전송된다. 이동노드가 유휴상태일 경우, 바인딩 갱신 메세지는 포워딩 포인터를 이용하여 무휴상태가 될 때까지 지연된다. 따라서, 이동노드가 유휴상태인 경우 불필요한 바인딩 갱신 메시지를 제거함으로써 위치등록 비용을 감소시킬 수 있다. 또한, 이동노드가 유휴상태일때 핑퐁효과로부터 발생되는 불필요한 위치등록 비용을 감소시킬 수 있다. 이산 분석 모델을 이용하여 분석한 결과는 제안 기법을 이용하여 위치 둥록 비용을 감소시킬 수 있음을 보여준다.