A Study Of Community-based Routing Algorithms For Opportunistic Networks

Opportunities Networks are a kind of wireless ad hoc networks that relies on the communication chances created by the interaction between nodes.Its applications cover the field of vehicle data communication,the wild animals and plants monitoring,disaster emergency communication,military,and so on.Since the nodes in the Opportunities Networks are composed of the mobile devices having a close relationship with people or carried by people,so nodes movement has a certain degree of human characteristics.In addition,the community relationships between the people can be reflected in nodes relationships in Opportunistic Networks,so the Community-Based Opportunity Networks come into being.Community-based Opportunities Networks can effectively improve the message delivery ratio by utilizing community relationships between nodes.Firstly,a research background and summary about Opportunistic Networks is introduced.After that,the standard of the community division and some classical algorithms in community-based Opportunity Networks is presented.Secondly,to solve the problems existing in the present community-based Opportunity Networks routing,including that the meeting times can't reflect the ability to deliver data accurately caused by invalid meeting on account of shorter meeting time between nodes so that it's impossible to communicate,redundant control packets existing before the exchange process of data,an Efficient Routing Algorithms based on Interest-Community for Opportunistic Networks,ERAICON,is proposed.ERAICON algorithms make improvements in two aspects.The first one is to remove the situation that shorter meeting time between nodes so that it's impossible to communicate when statistics the meetingtimes.The other one is to design improved exchange mechanism before the exchange process of data.With the new mechanisms above,ICERAON can improve the network performance.Thirdly,in the present BEEINFO algorithms,the environment information(including community density and social connectivity)collected by mobile node is redundant and the message management in the cache is unreasonable.To address the problems above,this thesisproposes an Efficient Cache Management Algorithms based on Interest-Community for Opportunity Networks,ECMAON.By improving statistical information content collected by mobile nodes,optimizing the node cache management mechanism,ECMAON can improve the overall network performance.Finally,the main work of this paper is summarized,and the future work of the community-based routing algorithm for Opportunity Networks is discussed.