Ad hoc networks (Computer networks)--Programming

This thesis describes a resource discovery technique in mobile ad hoc networks.
Resource discovery is technique to search data in among the mobile nodes in the network.
The highly dynamic nature of the infrastructure-less ad hoc networks poses new
challenges in resource discovery, thus there is a need to for an optimized resource
discovery technique. Efficient resource discovery algorithm discovers the resources in a
mobile ad-hoc network in an optimized way. As there is no pre-established infrastructure
in the network, every node takes its decision in forwarding resources and every node
dynamically ranks these resources before disseminating them in the network. Ranking of
the resources spreads the data which is of high priority at that instance of time. Ranking
avoids the spreads the unwanted or low priority data which will utilize the bandwidth
unnecessarily. The efficient resource discovery algorithm also keeps a check that
redundant information is not spread in the network with the available bandwidth and the
bandwidth is utilized in an optimized manner. We then introduce brokers in the algorithm
for a better performance. We present a technique to maintain a constant number of
brokers in the network. Our simulations show that, in a network with high density, the
efficient resource discovery algorithm gives a better performance than the flooding and
rank based broadcast algorithms.