Research On Efficient Energy-Saving Algorithm In Opportunistic Mobile Networks

Opportunistic network is a kind of ad hoc network which relies on the movement of nodes to create meeting opportunities and transmit messages.It has a very broad application prospect.However,the nodes in the network are usually composed of portable devices,and the energy they carry is limited.These devices may be deployed in complicated and even dangerous environments,and are not easily recharged.This makes people begin to pay attention to the energy-efficient routing algorithm for opportunistic network.In opportunistic network,many researchers reduce the power consumption of nodes by periodically sleeping strategies,or design forwarding strategies based on the attributes of nodes to improve the efficiency of message forwarding,so as to achieve the effect of energy saving.In this paper,the principle and existing problems of several typical opportunistic network energy-saving routing algorithms are described in detail at first.Secondly,aiming at the performance problems such as the increase of the message delay and the decrease of thedelivery success ratio due to the unreasonable sleeping period and forwarding strategy in sleeping scheduling algorithm for opportunistic network,an energy-saving algorithm based low duty cycle sleeping and validity forwarding is proposed.The algorithm,given the tolerable message delay and delivery success rate,uses the derivation to find a reasonable sleep duty cycle.On this basis,for each node to set a validity represents the probability that the current node meets the destination node.By sending messages to high validity nodes,messages can be quickly aggregated to the destination node.Then,aiming at the problem that the existing Bubble Rap algorithm only focuses on the social attributes of nodes in the transmission of messages and causes the resources of high centrality nodes to be rapidly depleted,an energy-efficient routing algorithm based on node attributes is proposed.When selecting the relay nodes,the algorithm takes into account the social attributes of the nodes and the dynamic changes of the nodes' energy and buffer space,averaging the consumption of energy and buffer of nodes with higher centrality.Finally,theoretical analysis and simulation verify that the performance of the above two routing algorithms in terms of message delay,delivery success ratio and node survival ratio are significantly improved compared with the original algorithm.In addition,both algorithms have good energy-saving effect,which can effectively extend the life cycle of the entire network.