zoukankan      html  css  js  c++  java
  • FRESH algorithm for efficient route discovery in MANET

    FRESH:FResher Encounter Search

    Principle:

    Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source node searches for any intermediate node that encountered the destination more recently than did the source node itself. The intermediate node then searches for a node that encountered the destination yet more recently, and the procedure iterates until the destination is reached.

    The performance of such a scheme will depend on the nodes’ mobility processes.

    Introduction:

    On-demand routing overhead can be broken down into two components: route discovery and route maintenance

    (the route discovery represents up to 90% of the total routing overhead of AODV).

    In this paper, the authors proposed an algorithm called FRESH to improves the performance of route discovery over omnidirectional approaches(by exploiting the history of last encounters between nodes).

    Motivation: the history of last encounters between nodes contains valuable, but noisy information about the current network topology.

    image

    Packets descend along the age gradient.(thus far, I’m still confused)

    FResher Encounter Search:

    The encounter age of two nodes n and m is the time elapsed since the most recent encounter of n and m.

    TLE(i,d) denotes the age of the most recent encounter between nodes i and d.

    Algorithm Formulation:

    The pseudo code below runs at every node in the network.

    image

    del.icio.us Tags: DTN,Contact,Encounter
  • 相关阅读:
    darknet实时识别无法显示在窗口解决
    C# 获取当前打开的文件夹2
    C# 如何调试安装包
    C# 自定义文件格式并即时刷新注册表 非关闭explorer
    C# 获取当前打开的文件夹
    SQL Server里面导出SQL脚本(表数据的insert语句)
    windows平台安装redis服务
    C# 默认参数/可选参数需要注意
    webstrom使用
    office密匙
  • 原文地址:https://www.cnblogs.com/jcleung/p/2012950.html
Copyright © 2011-2022 走看看