Font Size: a A A

Seed-based Data Dissemination In Campus MSNets

Posted on:2018-04-06Degree:MasterType:Thesis
Country:ChinaCandidate:Y TangFull Text:PDF
GTID:2348330515972130Subject:Computational Mathematics
Abstract/Summary:PDF Full Text Request
Delay Tolerant Networks(DTNs)is a new type of network system known for its intermittently connectivity,and mobile social networks(MSNets)is an important application of DTNs.In MSNets,the packet is propagated through the intermittently connectivity which is established when two human-carried wireless-enabled devices are within communication range of each other.With the popularity of smart device,MSNets will cover more and more people.The information play an irreplaceable role today,and how to collect useful information effectively is one of the modern talents and skills.Therefore,the data forwarding algorithm is one of the key problems in MSNets.First,this thesis investigates the development of mobile social networks,the basic characteristics of mobile social networks' users,several common types of mobile social networks and several typical data forwarding algorithms.Then,the paper introduces the preliminary knowledge of Markov chain,Markov decision process prediction method and the application of Markov chain.In the end,in order to use the intermittently connectivity to disseminate the packet,a seed-based data dissemination(SDD)algorithm is proposed in campus MSNets.Its main idea is to choose a seed node for each community to spread the data packet.In intra-community,the seed node of current community duplicates the packet to the interested encountering nodes and chooses the future unique seed node for each next community.Moreover,in order to increase the probability of packet propagation in inter-community,the packet carrier or seed node duplicates the packet to the interested nodes and chooses seed node for the next community in the common places of a layer during the break.We proceed to model a Markov decision process(MDP)to analyze the process of data dissemination.Lastly,the simulation results show that,compared with the epidemic algorithm,the publish/subscribe system and social groups based routing,SDD algorithm could reduce network overhead significantly,and near to the maximum delivery ratio obtained by the epidemic algorithm.The simulation results also verify our analysis.
Keywords/Search Tags:Data dissemination, MSNets, Markov decision process(MDP), student schedule, network overhead
PDF Full Text Request
Related items