Towards an Understanding of Last Encounter Routing in Ad Hoc Networks
Efstratios Ioannidis · TSpace (University of Toronto) · 2004
A wireless ad hoc network is a collection of nodes that communicate with each other in the absence of a supporting infrastructure. Approximate information protocols are routing protocols that utilize approximate, inaccurate information on nodes in order to make routing decisions. An example of such a protocol is the Last Encounter Routing (LER) protocol. We propose a network model under which we prove fundamental properties of the LER protocol and make progress towards a rigorous analysis of its behaviour.