| One of the difficulties in achieving pervasive deployment of mobile ad hoc network routing protocols is their strong assumption regarding node connectivity. Many realistic networking scenarios fail to meet this assumption, as nodes often form wireless clusters that are only intermittently connected with each other. In this work, I introduce Oriole, a routing protocol for mobile communications in intermittently connected networks. My design of Oriole explores node location information (for instance, through GPS) and realistic node mobility for achieving efficient packet delivery. I evaluate the protocol in terms of packet delivery latency, network overhead, and memory requirements at each node, using realistic simulations of the Rice University campus topography. I show that packet delivery latency of Oriole is comparable to that of Epidemic Routing and an omniscient routing protocol, with Oriole imposing an order of magnitude (over 30 times) less per-node network and memory overhead than Epidemic Routing. |
