Many network systems based on a DTN (Delay/Disruption Tolerant Networking) have been proposed to gather disaster information at a disaster affected area. It is well known that there are various kinds of information that should be collected after disasters. Among these, the vital information and the information generated in a dangerous area must be collected quickly than the other information. In the previous works, we have proposed the transmission order management method based on a message priority (RANK method). However, this method induces an unfair state in terms of the information freshness among senders due to both of a sender position and a node density. In order to deal with the issue, in this paper, we propose a new priority based relay method, named FDR (Fair Data Relay) which considers fairness among message generators. In this method, we consider not only an importance and freshness of information but also past transfer histories. We clarify that the FDR method improves fairness among senders by performance evaluations. The results of performance evaluations confirm that the FDR method reduces approx.28% in AoI (Age of Information) and approx.0.15 in Fairness Index than the previously proposed RANK method.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A New Priority Based Relay Method Considering Fairness Among Message Generators

  • Fuka Isayama,
  • Tetsuya Shigeyasu

摘要

Many network systems based on a DTN (Delay/Disruption Tolerant Networking) have been proposed to gather disaster information at a disaster affected area. It is well known that there are various kinds of information that should be collected after disasters. Among these, the vital information and the information generated in a dangerous area must be collected quickly than the other information. In the previous works, we have proposed the transmission order management method based on a message priority (RANK method). However, this method induces an unfair state in terms of the information freshness among senders due to both of a sender position and a node density. In order to deal with the issue, in this paper, we propose a new priority based relay method, named FDR (Fair Data Relay) which considers fairness among message generators. In this method, we consider not only an importance and freshness of information but also past transfer histories. We clarify that the FDR method improves fairness among senders by performance evaluations. The results of performance evaluations confirm that the FDR method reduces approx.28% in AoI (Age of Information) and approx.0.15 in Fairness Index than the previously proposed RANK method.