A Mobile Opportunistic Routing Algorithm Based on Mobility Classification

The advancement of novel technologies has positioned mobile wireless networks as the central focus of computer technology research. The selection process for the subsequent relay node in message forwarding holds paramount importance and is deemed critical. Drawing inspiration from Social Mobility theory, this paper presents a pioneering node classification model that categorizes all nodes into three distinct types. Furthermore, we introduce the concept of Active Entropy, where the numerical value of Active Entropy serves as a metric for message forwarding. Consequently, the routing algorithm transforms into a limited set of strategies between nodes belonging to different types. This routing algorithm offers numerous advantages including enhanced delivery rate, reduced network overhead ratio and decreased transmission delay. We evaluate and compare the performance of our proposed algorithm with that of DFDL algorithm and Prophet algorithm on the ONE simulation platform. Experimental results demonstrate that our proposed algorithm achieves a delivery rate at least 15% higher compared to the other two algorithms while also reducing overhead ratio.