Download now Free registration required
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destination. In this paper, the authors present LAROD, a geographical routing protocol for intermittently connected networks. Combining beacon less geographical routing with store-carry-forward LAROD greedily searches for the shortest way to the destination and when no progress is possible packets are temporarily stored until node mobility has created a new path. In the paper, they have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead.
- Format: PDF
- Size: 104.7 KB