Opportunistic networking-forwarding messages in a disconnected mobile ad hoc network via any encountered nodes offers a new mechanism for exploiting the mobile devices that many users already carry. However, forwarding messages in such a network is trapped by many particular challenges, and some protocols have contributed to solve them partly. In this paper, we propose a Context-Aware Adaptive opportunistic Routing algorithm(CAAR). The algorithm firstly predicts the approximate location and orientation of the destination node by using its movement key positions and historical communication records, and then calculates the best neighbor for the next hop by using location and velocity of neighbors. In the unpredictable cases, forwarding messages will be delivered to the more capable forwarding nodes or wait for another transmission while the capable node does not exist in the neighborhood. The proposed algorithm takes the movement pattern into consideration and can adapt different network topologies and movements. The experiment results show that the proposed routing algorithm outperforms the epidemic forwarding(EF) and the prophet forwarding(PF) in packet delivery ratio while ensuring low bandwidth overhead. Opportunistic networking-forwarding messages in a disconnected mobile ad hoc network via a new mechanism for exploiting the mobile devices that many users already carry. However, forwarding messages in such a network is trapped by many particular challenges, and some protocols have contributed to solve these partly. In this paper, we propose a Context-Aware Adaptive opportunistic Routing algorithm (CAAR). The algorithm first predicts the approximate location and orientation of the destination node by using its movement key positions and historical communication records, and then calculates the best neighbor for the next hop by using location and velocity of neighbors. In the unpredictable cases, forwarding messages will be delivered to more capable forwarding nodes or wait for another transmission while the capable node does not exist in the neighborhood. algorithm takes the movement pattern into consideration and can adapt different networ The experiment results show that the proposed routing algorithm outperforms the epidemic forwarding (EF) and the prophet forwarding (PF) in packet delivery ratio while ensuring low bandwidth overhead.