Deakin University
Browse

File(s) under permanent embargo

Market-based sensor relocation by robot team inwireless sensor networks

Version 2 2024-06-17, 13:54
Version 1 2015-05-11, 15:56
journal contribution
posted on 2024-06-17, 13:54 authored by H Li, A Barnawi, I Stojmenovic, C Wang
Randomly scattered sensors may cause sensing holes and redundant sensors. In carrier-based sensor relocation, mobile robots (with limited capacity to carry sensors) pick up additional or redundant sensors and relocate them at sensing holes. In the only known localized algorithm, robots randomly traverse field and act based on identified pair of spare sensor and coverage hole. We propose a Market-based Sensor Relocation (MSR) algorithm, which optimizes sensor deployment location, and introduces bidding and coordinating among neighboring robots. Sensors along the boundary of each hole elect one of them as the representative, which bids to neighboring robots for hole filling service. Each robot randomly explores by applying Least Recently Visited policy. It chooses the best bid according to Cost over Progress ratio and fetches a spare sensor nearby to cover the corresponding sensing hole. Robots within communication range share their tasks to search for better possible solutions. Simulation shows that MSR outperforms the existing competing algorithm G-R3S2 significantly on total robot traversed path and energy, and time to cover holes, slightly on number of sensors needed to cover the hole and number of sensor messages for bidding and deployment location sharing.

History

Journal

Ad-Hoc and sensor wireless networks

Volume

22

Pagination

259-280

Location

Philadelphia, Pa.

ISSN

1551-9899

eISSN

1552-0633

Language

eng

Publication classification

C Journal article, C1.1 Refereed article in a scholarly journal

Copyright notice

2014, Old City Publishing

Issue

3-4

Publisher

Old City Publishing