GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
An architecture for a secure service discovery service
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The design and implementation of an intentional naming system
Proceedings of the seventeenth ACM symposium on Operating systems principles
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
MSWiM '02 Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Routing using potentials: a dynamic traffic-aware routing algorithm
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Service discovery in MANET via biased random walks
Proceedings of the 1st international conference on Autonomic computing and communication systems
Cluster-based service discovery for heterogeneous wireless sensor networks
International Journal of Parallel, Emergent and Distributed Systems - Advances in Wireless Networks
Density-based anycast: a robust routing strategy for wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
A self-adaptive placement protocol for mobile directories in MANETs
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
A graph coloring based service discovery in ad hoc networks
Proceedings of the 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing
Multi agent Community to support information processing in Wireless Sensor Network applications
International Journal of Intelligent Information and Database Systems
Optimization of service discovery in wireless sensor networks
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
CATT: potential based routing with content caching for ICN
Proceedings of the second edition of the ICN workshop on Information-centric networking
A parameter-based service discovery protocol for mobile ad-hoc networks
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
A novel cache aware routing scheme for Information-Centric Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
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 modelled 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 convergence even in highly mobile environments. We believe that this technique can and should be further exploited, e.g., as a routing protocol in mobile ad hoc networks.