Abstract
This thesis proposes a new protocol for providing a location based massaging framework in wireless ad-hoc networks. In such a scheme, the destination for a message would be the set of all hosts which lie in a particular geographic domain defined by a set of geographic so-ordinates. Some of the scenarios where the scheme could be used include sending flood warning messages to people along the balks of a river, communicating to a group near a landmine in a search operation and so on, where the objective is to send the message to all hosts in the geographic domain irrespective of who or how many of them exist. The proposed protocol comprises two basic components. A routing mechanism to provide routes from the designated sender of messages to all other hosts in the ad-hoc network and a multicast protocol which uses this basic routing capability to efficiently send messages to all the hosts in the geographic domain. The thesis studies the results obtained from simulation runs of the protocol with respect to the accuracy and efficiency. The accuracy metric gives an indication of the number of hosts that receive the message as opposed to the number of hosts that ideally should have. The efficiency metric gives an indication of the average number of messages received by each host for every multicast message sent. The protocol discussed in the thesis assumes that all the hosts in the network have complete knowledge of the existence of all the registered geographic multicast domains. The results are compared with another protocol where the hosts do not have that information.
Gopalakrishnan, Dhilip (1998). Geographic multicasting in wireless ad-hoc networks. Master's thesis, Texas A&M University. Available electronically from
https : / /hdl .handle .net /1969 .1 /ETD -TAMU -1998 -THESIS -G668.