Research On Energy Constraint Routing In Mobile Social Networks

With the popularity of mobile devices and the rapid development of the Internet,people are increasingly relying on mobile devices to communicate with people.Mobile social networks is a kind of network formed by people carrying various mobile devices.It is a combination of mobile networks and social networks.Nodes in the network have both the mobility of mobile networks and the social feature of social networks.Traditional TCP/IP based protocols require stable end-to-end paths at the same time.However,in some sparsely distributed networks,there are no stable end-to-end connections due to intermittent connectivity.In MSNs,data transmit in a special way,namely “Store-Carry-Forward”.The problem of network segmentation can be well overcome with this routing mechanism,thereby broadening the use of wireless networks.Therefore,research on the routing strategy of mobile social networks has received extensive attention and research.In the "storage-carry-forward" routing mechanism,the node stores the message on the current node first.In the subsequent move,it needs to find a more suitable node to forward the message.This mechanism will be constrained by many factors(law of movement,social relations of nodes,etc.),so this kind of routing mechanism still faces many challenges.At present,most researches focus on improving the delivery ratio of message transmission and reducing the average transmission delay.However,since the battery provides most of the mobile node's energy,the depletion of energy will affect the network connectivity.Therefore,this paper studies the energy constraint routing under the mobile social network.Firstly,we study the several traditional routing algorithms and analyze the deficiency of each algorithm in terms of energy constraints.This paper proposes an energy constraint routing algorithm based on extended centrality.The centrality reflects the strength of a node's social capabilities.We use the centrality of the encounters and the centrality of their neighbor nodes as the factor for routing strategy.In the actual situation,the energy of the node is subject to certain restrictions.In order to avoid the rapid exhaustion of the energy of accessing more nodes,we combine the energy level of the node with the extended centrality,and calculate the value of the utility function of the node.The message will always be forwarded to nodes with high utility function values.Simulation based on the real world shows that our proposed strategies could extend the system's lifetime and achieve a higher delivery ratio of message transmission.Then,further research on energy constraint routing was conduct.The concept of the remaining effective energy of the node is proposed.Since the forwarding message needs to consume energy,the node will ensure that the messages in the cache queue forward as much as possible.The decrease of node energy will cause the selfish behavior of the node.This paper studies the selfish behavior of the node.When the information arrives at the node,the node may not forward information due to selfish behavior,which greatly affects the transmission performance.Selfish behavior has a close relationship with the social attributes of nodes.This paper proposes an energy constraint routing algorithm based on cache queue.According to the social similarity between nodes,the nodes are classified,and we introduce a virus propagation model to analyze the message delivery process.The algorithm can effectively reduce the average transmission delay and prolong the system lifetime.Finally,the two energy constraint routing schemes proposed in this paper are simulated and verified.The delivery ratio of transmission,average transmission delay,routing overhead ratio,first node extinction time and system survival time are compared with other classic routes.Finally,the two energy constraint routing schemes ECECR and CQECR proposed in this paper are verified by simulation.The transmission success rate,the average transmission delay,the routing overhead ratio,the first node extinction time,the system lifetime are compared with other classic routes.By comparison,the results show that our algorithm outperforms other algorithms in information transmission performance.