Auctions and iMesh based task assignment in wireless sensor and actuator networks

Mezei, Ivan; Lukić, Milan; Malbaša, Veljko

doi:10.1016/j.comcom.2012.11.003

Cited by 25 publications

(13 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The next round starts with decision making process, where each robot is responsible for handling events reported to it, and negotiates with other robots about the task assignment. Our event reporting scheme replaces quorum based search (used in [3]) with iMesh structure [21], and also adds an auction in robot network in a similar way as in [23] to further improve the selection. We use two different means of communication in order to achieve our goal; namely, lowpower (low-range) communication for sensor-sensor or sensor-robot transmissions, and higher-power (higher-range) communication for robot-robot transmissions.…”

Section: Distributed Dispatch (Mad and Mar)mentioning

confidence: 99%

Robot Coordination for Energy-Balanced Matching and Sequence Dispatch of Robots to Events

Lukić

Barnawi

2015

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

Given a set of events and a set of robots, the dispatch problem is to allocate one robot for each event to visit it. In a single round, each robot may be allowed to visit only one event (matching dispatch), or several events in a sequence (sequence dispatch). In a distributed setting, each event is discovered by a sensor and reported to a robot. Here, we present novel algorithms aimed at overcoming the shortcomings of several existing solutions. We propose pairwise distance based matching algorithm (PDM) to eliminate long edges by pairwise exchanges between matching pairs. Our sequence dispatch algorithm (SQD) iteratively finds the closest event-robot pair, includes the event in dispatch schedule of the selected robot and updates its position accordingly. When event-robot distances are multiplied by robot resistance (inverse of the remaining energy), the corresponding energy-balanced variants are obtained. We also present generalizations which handle multiple visits and timing constraints. Our localized algorithm MAD is based on information mesh infrastructure and local auctions within the robot network for obtaining the optimal dispatch schedule for each robot. The simulations conducted confirm the advantages of our algorithms over other existing solutions in terms of average robot-event distance and lifetime.

show abstract

Section: Distributed Dispatch (Mad and Mar)mentioning

confidence: 99%

Robot Coordination for Energy-Balanced Matching and Sequence Dispatch of Robots to Events

Lukić

Barnawi

2015

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Auction-based [104] Behavior-based [105] Event prediction [106] that the network maintained the required transfer rate (19 Kbps for the proposed application) throughout the network's lifetime. This setup is similar to that which was used in [90].…”

Section: Path Planningmentioning

confidence: 99%

“…Auction-based task allocation is studied in [104] by using auctions to improve the recent information mesh (iMesh) based distance sensitive service discovery approach. The idea was to improve on iMesh's ability to find the closest service 95% of the time.…”

Section: Task Allocationmentioning

confidence: 99%

The integration of mobile (tele) robotics and wireless sensor networks: A survey

Wichmann

Okkalıoğlu

Korkmaz

2014

Computer Communications

View full text Add to dashboard Cite

“…The most popular approach in the literature involves random deployment of the actors that remain static and move only when a target is reported [10][11][12]. In [13] the deployment of actors was managed by using an algorithm, which generates a connected pseudo-random unit graphs. The aim of this algorithm is to distribute the actors uniformly in the monitored area, while maintaining their connectivity.…”

Section: Control Of Actors' Mobilitymentioning

confidence: 99%

Self-Organizing Mobility Control in Wireless Sensor and Actor Networks Based on Virtual Electrostatic Interactions

Płaczek

Bernaś

2016

Wireless Pers Commun

View full text Add to dashboard Cite

This paper introduces a new mobility control method for surveillance applications of wireless sensor and actor networks. The proposed method is based on virtual electrostatic forces which act on actors to coordinate their movements. The definition of virtual forces is inspired by Coulomb's law from physics. Each actor calculates the virtual forces independently based on known locations of its neighbours and predetermined borders of the monitored area. The virtual forces generate movements of actors. This approach enables effective deployment of actors at the initial stage as well as adaptation of actors' placement to variable conditions during execution of the surveillance task without the need of any central controller. Effectiveness of the introduced method was experimentally evaluated in a simulation environment. The experimental results demonstrate that the proposed method enables more effective organization of the actors' mobility than state-of-the-art approaches.

show abstract

Auctions and iMesh based task assignment in wireless sensor and actuator networks

Cited by 25 publications

References 25 publications

Robot Coordination for Energy-Balanced Matching and Sequence Dispatch of Robots to Events

Robot Coordination for Energy-Balanced Matching and Sequence Dispatch of Robots to Events

The integration of mobile (tele) robotics and wireless sensor networks: A survey

Self-Organizing Mobility Control in Wireless Sensor and Actor Networks Based on Virtual Electrostatic Interactions

Contact Info

Product

Resources

About