| Abstract: |
Service discovery in mobile ad hoc networks is challenging because of the absence of any central intelligence in the network. Traditional solutions as used in the Internet are hence not well
suited for mobile ad hoc networks. In this paper, we present a novel decentralized service discovery mechanism for ad hoc networks. The basic idea is to distribute information about available
services to the network neighborhood. We achieve this by using the analogy of an electrostatic field: A service is modeled by a (positive) point charge, and service request packets are seen as
(negative) test charges which are attracted by the service instances. In our approach, we map the physical model to a mobile ad hoc network in a way where each network element calculates a
potential value and routes service requests towards the neighbor with the highest potential, hence towards a service instance. Our approach allows for differentiation of service instances based
on their capacity. We define the required protocols and methods which we implemented in a network simulator. Using extensive simulations, we evaluate the performance and robustness of the
mechanisms. The results indicate good performance and converg ence even in highly mobile environments. We believe that this technique can and should be further exploited, e.g., as a routing
protocol in mobile networks. |
