中継謝金受取意思額に基づくアドホックネットワークルーチング方式

摘要

In ad hoc networks, there is a concept of reward given to relay nodes to compensate for their loss of power. When implemented as a service, each node could be allowed to express its own willingness to receive reward, which could be used to discriminate nodes participating in an ad hoc network. If the total willingness to receive reward of relay nodes along the route is less than the charge, the connection will be successful. This paper proposes two routing algorithms to select the route by minimizing the total willingness to receive reward. One algorithm minimizes only the total willingness to receive reward, and another algorithm minimizes both the total willingness to receive reward and the hop count. The relation between the charge and the connection success probability, and that between the charge and the benefit of relay nodes are shown.%アドホックネットワークにおいて，参加意欲向上のために中継者に謝金を支払うサービスが考えられている．中継謝金の受取意思額は，中継者ごとに異なる値をもつと考えられ，ネットワーク内には高い受取意思額を示すユーザもあれば低い受取意思額を示すユーザも存在すると予想される．経路上の受取意思額の総和と通信料金を比較し，前者が後者よりも小さければ通信が成立する．本稿では，経路候補の中から受取意思額の総和が最小となる経路を選択する方式と，経路候補の中からホップ数が最小となる経路を選択し，その中で受取意思額の総和が最小となる経路を選択する方式を提案している．これらの方式に関して，通信料金と通信成功率の関係を明らかにし，通信料金と中継者が受け取る利益について考察している．