Parasitic routing : using social network analysis for routing in disconnecting delay-tolerant MANETs
Citation:Elizabeth M. Daly, 'Parasitic routing : using social network analysis for routing in disconnecting delay-tolerant MANETs', [thesis], Trinity College (Dublin, Ireland). School of Computer Science & Statistics, 2007, pp 186
Daly TCD THESIS 8240 Parasitic routing.pdf (PDF) 98.83Mb
Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. As a consequence, a full end-to-end path between nodes may not exist at any given point in time. However, an end-to-end connectivity graph that is time-varying may exist to forward messages. The disconnected nature and the lack of end-to-end connectivity between nodes means that the communication must be delay- tolerant. In order to support message delivery in such disconnected delay-tolerant MANETs (DDTMs), each node acts a router, forwarding messages to other nodes. Messages are buffered using a store-and-forward mechanism where the data is physically carried through the time- varying network graph.
Author: Daly, Elizabeth M.
Publisher:Trinity College (Dublin, Ireland). School of Computer Science & Statistics
Note:TARA (Trinity’s Access to Research Archive) has a robust takedown policy. Please contact us if you have any concerns: email@example.com
Type of material:thesis
Availability:Full text available