A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
A Survey of Service Discovery Protocols in Multihop Mobile Ad Hoc Networks
IEEE Pervasive Computing
Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks
IEEE Transactions on Computers
Double rulings for information brokerage in sensor networks
IEEE/ACM Transactions on Networking (TON)
Wireless Sensor and Actuator Networks: Algorithms and Protocols for Scalable Coordination and Data Communication
Distance-Sensitive information brokerage in sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Service discovery for mobile Ad Hoc networks: a survey of issues and techniques
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
We investigated performance of localized distance-sensitive service discovery algorithm iMesh, which generates information structure in static network, to store the information about nearby actors (service providers). In a network with grid structure, this is achieved by advertising service provider positions in four geographical directions. The propagation of information about remote service providers is restricted by a blocking rule, to reduce the message overhead and provide distance sensitivity. A node requiring service (service consumer) conducts lookup process to obtain information about nearby service providers from the iMesh structure. We modified iMesh to enable its use in dense networks with topologies other than grid by introducing iMesh areas instead of iMesh edges. Our simulations compare performance of modified iMesh with another localized service discovery scheme (quorum) in dense networks with random topologies. We show that iMesh finds the nearest service provider in 95% of cases. It significantly decreases the message overhead compared to quorum, without compromising quality of service discovery.