基于Merkle哈希树的机会社会网络节点协作转发机制

Opportunity Social Network Node Cooperation Forwarding Mechanism Based on Merkle Hash Tree

机会社会网络中的节点自私或节点非协作行为常常导致消息传输效率降低.针对这一问题,本文提出了基于Merkle哈希树的节点协作转发机制.首先根据节点的移动特性建立节点相遇位置预测模型;其次构建Merkle哈希树并对自私节点进行检测和删除,更新整个Merkle哈希树;最后结合所提出的模型及相遇距离大小选择合适的转发节点,保证了消息的协作转发.实验表明,本文提出的方法能够精确地检测网络中的自私节点,并能够保证消息的高效传输.此外在消息投递率及传输时延方面优于典型的传统Epidemic、DirectDelivery算法.

The selfishness of node or the non-cooperation of node in an opportunistic social network often leads to a decrease in the efficiency of message transmission.To solve this problem,this paper proposes a node cooperative forwarding mechanism based on Merkle hash tree.Firstly,the node encountering position prediction model is established according to the moving characteristics of the nodes.Secondly,the Merkle hash tree is constructed which can detect and delete selfish nodes.In addition,the updating the entire Merkle hash tree method is proposed.Finally,the appropriate forwarding node is selected according to the encounter distance which can ensure the collaborative forwarding of messages.The experiment results show that the proposed algorithm can accurately detect selfish nodes in the network and ensure the transmission of messages efficiently.Additionally,it is superior to the traditional Epidemic and DirectDelivery algorithms in terms of message delivery rate and transmission delay.