An energy recovery routing algorithm for opportunistic networks based on connection stability and node encounter type

Abstract

Routing algorithms have been the focus of research on opportunistic networks to effectively deal with the connectivity problem of intermittent communication in opportunistic networks. Due to the frequent forwarding of messages by active nodes in the opportunistic networks leading to excessive energy consumption, opportunistic networks suffer from communication susceptibility to interruption and unstable network connectivity. In order to solve this problem, this paper proposes an opportunistic network routing algorithm (ST-ProPhet) based on connection stability and energy recovery, which takes into account the node’s historical average connection duration, encounter probability, and the node’s energy consumption. Firstly, a node encounter probability prediction model fusing the average connection duration is developed. Secondly, the base station is introduced and the node wireless energy recovery strategy is designed. Finally, the ST-ProPhet algorithm proposes a message forwarding strategy based on node encounter types on the basis of the encounter probability prediction model and energy recovery model. Simulation experiments show that the ST-ProPhet algorithm has an overall reduction of 5066.27mAh over the ProPhet algorithm in terms of average message energy consumption.