| Summary: | 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.
|
|---|