Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Double rulings for information brokerage in sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
Mesh-based sensor relocation for coverage maintenance in mobile sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
A clique base node scheduling method for wireless sensor networks
Journal of Network and Computer Applications
Composition and deployment of e-Health services over Wireless Sensor Networks
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We propose a lightweight solution algorithm, iMesh, which uses no global computation and generates constant per node storage load. In iMesh, service providers construct a localized planar structure, information mesh, using the existing blocking rule enhanced with a newly proposed expansion rule. The information mesh possesses good proximity property and serves as service directory. Service consumers conduct a lookup process restricted within their home mesh cells to discover nearby services. We first analytically study its properties over a grid network model. Then we evaluate its performance in randomized network scenarios by extensive simulation. Simulation results indicate that iMesh guarantees nearby (closest) service selection with very high probability 99% (resp., 97%) at considerably low message cost.