Font Size: a A A

Research On Message Forwarding Mechanism Under Opportunistic Social Networks

Posted on:2020-03-26Degree:MasterType:Thesis
Country:ChinaCandidate:K XuFull Text:PDF
GTID:2428330572495790Subject:Engineering
Abstract/Summary:PDF Full Text Request
Opportunistic Social Networks are sparse wireless networks,and it does not have a direct link from the source node to the destination node.The Opportunistic Social Networks establishes a suitable temporary communication link for exchange data to achieve efficient transmission of messages.In the Opportunistic Social Networks,individual users are paying more and more attention to their own user experience.In addition,the selfish behavior of node users can lead to poor network performance,if it cannot be improved,it will directly lead to the ultimate embarrassment of network services.Therefore,this article focuses on solving the above problems.The main research contents are as follows:In the Opportunistic Social Networks,in view of the problem of delivery success ratio between nodes,this paper proposes an Opportunistic Social Networks Fairness-based Routing(FR)algorithm.The algorithm first gives the definition of the social relationship between the two nodes,and introduces the priority of the message to reasonably limit the number of initial copies of the message generated by the node.In the data forwarding strategies,the FR routing algorithm adopts a data forwarding strategies within the community and between communities.In view of the problem of an unfair traffic load distribution between nodes,this paper proposes a Predictive And Fairness-based Routing(PFR)algorithm.The main idea of the algorithm is to reasonably limit the number of forwarded message copies of nodes with large social values.The simulation results of the two algorithms show that the FR routing algorithm greatly improves the unfairness of delivery success ratio between nodes,and the PFR routing algorithm greatly improves the unfairtraffic load distribution between nodes.In view of the problem of selfish node behavior in message forwarding,a game theory based Game Theory-based Routing(GTR)algorithm is proposed.The main idea of this algorithm is that after each game,the selfish node will rationally choose the strategy of the next game according to its own income.Finally most selfish nodes will choose the consent strategy to maximize their own profits,then the selfish behavior of nodes in the network will decrease.The simulation results verify that the GTR routing algorithm has achieved significant improvements in node selfish behavior.
Keywords/Search Tags:Opportunistic Social Networks, traffic load distribution, node fairness, selfish behavior, Play Game theory
PDF Full Text Request
Related items