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
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
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
Optimized algorithms for multi-agent routing
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Pervasive and Mobile Computing
Auctions and iMesh based task assignment in wireless sensor and actuator networks
Computer Communications
| Hi-index | 0.00 |
Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting best robot, response time, and cost of performing the task. Existing solutions are either centralized, neglecting communication cost, assuming complete graph, or based on flooding with individual responses to robot decision maker (simple auction protocol), ignoring communication cost and response time bound. This article proposes auction aggregation protocols for task assignment in multi-hop wireless robot networks. Robot collector leads an auction and initiates response tree construction by transmitting search message. Each robot, after receiving the message, makes decision on whether to retransmit search message, based on the estimated response cost of its robots up to k -hops away. Robots wait to receive the bids from its children in the search tree, aggregates responses by selecting the best bid, and forward it back toward the robot collector (auctioning robot). When distance is used as sole cost metrics, traversal aggregation algorithm (RFT --- routing toward the event with traversal of face containing the event) can be applied and is an optimal solution. Advantage of our auction aggregation over simple auction protocol is shown by simulation results.