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
A Market Protocol for Decentralized Task Allocation
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Energy-balanced task allocation for collaborative processing in wireless sensor networks
Mobile Networks and Applications
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Communication and Coordination in Wireless Sensor and Actor Networks
IEEE Transactions on Mobile Computing
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
Pervasive and Mobile Computing
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
Auction Aggregation Protocols for Wireless Robot-Robot Coordination
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Multi-portal association based dispatching and a virtual-queue method in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.24 |
In this article, auctions are used to improve the recent information mesh (iMesh) based distance sensitive service discovery in the wireless sensor and actuator networks (WSANs), thus improving overall energy efficiency and lifetime of the network. An event that needs a single actuator response is sensed by one of the sensors, which then performs the search for the closest actuator to respond by means of the iMesh cross-lookup. The basic iMesh protocol is reported to have 95% efficiency in finding the closest service. We confirmed that result, and improved the efficiency by using the localized auction aggregation protocol (k-SAAP). The actuator found by the iMesh lookup starts the auction to find if there is a closer actuator among the actuator neighbors up to k-hops away. In our simulations, we consider scenarios where the sensors are placed in a rectangular grid, while the actuators form a connected network, or have a random distribution. Simulation results show that introducing auctions gained average efficiency improvement of 4.3% compared to the basic iMesh, which brings us to 99.3% closest service hit rate. In other words, the closest service miss rate was reduced from 5% to about 0.7%, which is significant 86% reduction.