| 摘要: |
| 提出一种基于信任机制的机会网络安全路由决策方法TOR，该方法在节点中引入信任向量的数据结构，记录节点携带消息能力的信任度.采用层状硬币模型和数字签名机制，在消息传递过程中将节点签名的转发证据动态捆绑到消息包上，依靠消息携带方式实现证据链的采集.周期性地将具有签名和时间戳的信任向量表通过洪泛方式反馈到网络中，在每个节点，迭代形成一个由多维行向量集组成的只读可信路由表TRT，作为选择下一跳节点和副本分割策略的决策依据.在节点相遇时，选择信任度比自身大的作为下一跳转发节点，消息沿着信任梯度递增的方向传递.实验结果表明：与现有路由算法相比，TOR算法能够有效抑制恶意节点和自私节点的破坏行为，且具有较高的消息传递成功率和较低的消息转发平均时延，对缓存空间和计算能力要求较低. |
| 关键词: 机会网络 信任机制 可信路由表 信任度 消息副本 |
| DOI：10.13328/j.cnki.jos.005273 |
| 分类号: |
| 基金项目:国家自然科学基金（61300193，61272125，61601107）；河北省自然科学基金（F2015501105，F2017203307，F2015501122）；中央高校基本科研业务费专项基金（N120323012） |
|
| Trust-Based Security Routing Decision Method for Opportunistic Networks |
|
LI Feng1, SI Ya-Li2,3, CHEN Zhen3, LU Ning1, SHEN Li-Min3
|
|
1.Computer and Communication Engineering College, Northeastern University at Qinhuangdao, Qinhuangdao 066004, China;2.LiRen College, Yanshan University, Qinhuangdao 066004, China;3.Information Science and Engineering College, Yanshan University, Qinhuangdao 066004, China
|
| Abstract: |
| This paper proposes a security opportunistic routing decision method based on trust mechanism (TOR). In this scheme, every node locally maintains a trust vector to record trust degree of other nodes, which indicates their ability of carry and forward messages. Using layered coin model and digital signature mechanism, the forwarding evidences of relay node signature are bound dynamically on message packet during the relay process, and the message carries evidence chain to the destination node. The node broadcasts periodically the trust vector with signature and time-stamp to network by flooding. Through multi-iteration, the read-only trust routing table (TRT) with multidimensional row vectors is built on every node, which will become the key-player of selecting the next-hop relay node and dividing copy number. The node with greater trust degree is taken as the next-hop relay node. Therefore, the message can be delivered to the destination along the direction of trust gradient increment. Simulation results show that compared with existing algorithms, TOR algorithm can resist the network destruction behavior of malicious nodes and selfish nodes with higher probability of delivery and lower average delivery delay, and it only needs very small buffer and computing ability of node. |
| Key words: opportunistic networks trust mechanism trust degree message copy |
