The development of wireless sensor and actuator network is leading to high complexity networks and subsequently, new challenges in task assignment for effective sensor–actuator coordination. This article proposes an adaptive auction protocol for task assignment in multi-hop wireless actuator networks, considering a scenario where all actuators are immobile and each of them can obtain the target information from sensors. Unlike existing methods that neglect the adaptive auction area required by dynamic networks, the proposed method uses an adaptive factor k o (reflects the adaptive auction area) that is deduced based on the relation between network characteristics and protocol performance. Simulation results show that the adaptive protocol can dynamically change the auction area during the network operation. In addition, comparison with existing methods, such as simple auction protocol, 1 hop simple auction aggregation protocol, and 1 hop simple auction aggregation protocol greedy extension, shows that the adaptive auction protocol can choose the optimal solution at a low communication cost with a high probability, irrespective of the changes in the network.

中文翻译：

---

无线传感器和执行器网络中任务分配的自适应拍卖协议

无线传感器和执行器网络的发展导致了网络的高度复杂性，随后为有效的传感器-执行器协调任务分配带来了新的挑战。本文提出了一种自适应拍卖协议，用于多跳无线执行器网络中的任务分配，考虑到所有执行器都固定不动并且每个执行器都可以从传感器获取目标信息的场景。与忽略动态网络所需的自适应拍卖区域的现有方法不同，所提出的方法使用基于网络特性和协议性能之间的关系推导出的自适应因子ko（反映自适应拍卖区域）。仿真结果表明，自适应协议可以在网络运行过程中动态改变拍卖区域。此外，