Knowledge of node mobility in opportunistic wireless networks (MANET) was a key factor to ensure that intermediate nodes act accordingly to achieve end-to-end communication in a continuously changing peer-to-peer network topology. Movement across a communication range of other nodes changes not only its close node relationship with other nodes, but also changes all routes based on those relationships. Efficient routing protocols make opportunistic networks more reliable. This paper will discuss some of the most used proactive and reactive routing protocols in opportunistic networks. We analyse and compare routing protocols including Adhoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), Optimized Link State Routing (OLSR) and Destination Sequenced Distance Vector (DSDV) and identify parameters relevant to three group mobility models of mobile phone users identified at NUST campus in an early study. The main objective is to understand optimal routing schemes for practical opportunistic networks that may occur at a high education institution campus when students sharing information are moving around between lecture rooms. We found that the performance varies widely across different network sizes; and results from one scenario cannot be applied to another scenario. Simulation work shows that AODV performs better in a network with number of nodes with both reference point group mobility model (RPGMM) and Gauss-Markov mobility model (GMMM), which suit NUST campus’s setting with its big student population.

Keywords: Node, ad-hoc, opportunistic, peer-to-peer, group mobility, routing, optimize, vector.