Abstract

Opportunistic networking and geographic routing both represent fields of research in the area of Mobile Ad-Hoc Networking that seek to create dynamic, hop-by-hop, localised paths from source to destination thus enabling connectivity where no end-to-end path may be possible. Where they differ is in their approach to the problem of providing connectivity in a rapidly changing network; while geographic routing makes decisions based on physical locations, opportunistic networking seeks to take advantage of node mobility and select nodes that will physically carry the message closer to the destination and reduce the overall hop count. In spite of their differences, the similarity of the two approaches presents the opportunity of combining aspects from both paradigms to create hybrid protocols. Greedy geographic routing represents a simplistic form of geographic routing where routing decisions are made based purely on which neighbour is closest to the destination and represents a potentially useful base for developing hybrid opportunistic-geographic protocols due to its simplicity. This paper attempts to analyse the relationship between mobility and delay in greedy routing for use in designing future QoS-aware hybrid opportunistic-geographic protocols.